Using Finite State Machine at the Testing of Network Protocols
|
|
- Roland Turner
- 6 years ago
- Views:
Transcription
1 Australian Journal of Basic and Applied Sciences, 5(10): , 2011 ISSN Using Finite State Machine at the Testing of Network Protocols 1 Ashraf Abdel-Karim Helal Abu-Ein, 2 Hazem (Moh'd Said) Abdel Majid Hatamleh and 1 Ahmed A.M. Sharadqeh 1 Computer Engineering Department, University of Al-Balqa Applied, Faculty of Engineering Technology, Amman- Jordan. 2 Computer Department, University of Al-Balqa' Applied, Faculty of Ajloun, Ajloun- Jordan. Abstract: The choice of the finite state machine model use as an initial description of a tested network protocol is made in this article. The possibility of this model usage for the description of protocol operation errors is shown. The possible solution of an optimization problem and of a generated test sequence completeness support is proposed. INTRODUCTION Using new software and, mainly, changing the network protocol generation, such as IPv6, provokes a necessity to carry out the following sorts of the software testing: The conformity test for a compliance with the specification detects. The compatibility test for a software interconnection detects. There is enough information about the test generation conformity methods for protocols of new generation IPV6. Thus the main problem consists in necessity of check of new IPV6 protocols compatibility especially taking into account their new functionality such as mobility, safety and multicast. Considering it, we can present in a general way tasks which must be solved for it. 1) The comparative analysis of test generation methods of conformity and compatibility tests for an IPV6 protocols stack, on purpose to select the best among them. 2) The development of the strategy of automatic compatibility tests generation for a stack of IPv6 protocols considering new functionality, such as mobility, safety and multicast. 3) The analysis of possibility to apply the generated tests to existing protocol stacks and platforms, placing emphasis on new functionality. This approach should allow carrying out modeling of mobile network node migration to inspect tested implementations. Considering inevitable contradictions between a tester functions and a safety principles into IPv6 protocol implementation, it is necessary to come to the compromise to find the satisfactory solutions allowing a tester to test sequence for tested system generate, possessing properties of protocols safety support. The test of protocols which carry out multicast means of special algorithms application for a tests generation. It is a question of tests for such tools as a videoconferences or a network TV with multicast using. The study of such test algorithms for transmission and data flow reception also should become an object of research. The developed system architecture should have the characteristics allowing it to be as much as possible distributed and "friendly" to any implementation and to any operating system, to possess of a parallelism properties, etc. It is required to solve the task of formalizing of the network protocols (object of testing) representation. This article is devoted to the first stage, namely, to the analysis of possibility of application of finite state machines theory for formalizing of tested protocols. Network Model Based on the Theory of Finite State Machines: The most part of a network test researches is devoted to methods based on graph theory, namely, on the theory of finite state machines (FSM) (Fujiwara et al.,; Stevens, 1996). Below we will present the basic statements from FSM theory and we will explain its use for the protocol test problem. Thus automaton S is presented by following parameter set: a set of states of the automaton (A), a set of entry events (X), a set of output events (Y), a set of output functions (f) and a set of the automaton transitions (F). Often, it is set as well an initial status of the automaton (a 0 ). So, we have six parameters which present some automaton: Corresponding Author: Ashraf Abdel-Karim Helal Abu-Ein, Computer Engineering Department, University of Al-Balqa, Applied, Faculty of Engineering Technology, Amman- Jordan. dr_ashraf_abuain@yahoo.com Tel: , Fax:
2 S = {a 0, A, X, Y, f, F}. This model also can be presented in a graph form where: nods are a system states, arcs are transitions from one system state to another one, entry events provoke the automaton transitions, and output events appear during these transitions. Here we mean x i as entry words and y j as output words. In a figure 1 the operation of some network under protocol action is resulted. x 3 / y 1 a 0 x 1 / y 2 a 2 x 1 / y 1 x 2 / y 3 x 3 / y 3 x 1 / y 1 a 1 a 3 Fig. 1: Example of the finite state machine graph model. So, using the given description form of the network under action of some protocol, we can present structure and functioning of some network protocol. For example, in (Castanet, 1994) transition graph of TCPv4 protocol is given practically in the form of a finite state machine (Fig. 2 below). timeout send: RST SYN, RCVD recv:syn; send:syn,ack recv:rst send: <nothing> FIN_WAIT_1 FIN_WAIT_2 active close normal transitions for client normal transitions for server Fig. 2: TCPv4 network protocol specification. starting point CLOSED appl: passive open send: <nothing> LISTEN passive open recv: SYN send: SYN,ACK simultaneous open ESTABLISHED data transfer state simultaneous close CLOSING TIME_WAIT 2MSI, timeout appl: active open send: SYN appl: send data send: SYN recvl: SYN, ACK send: ACK SYN, SENT active open CLOSE_WAIT LAST_ACK passive close or timeout appl: state transitions taken when application issues operation recv: state transitions taken when segment received send: what is sent for this transition 957
3 Having presented the given protocol in a graph form, we will gain the classical Mealy finite state machine automaton graph (see bellow). For this purpose we will rename nods and arcs of the protocol presented in a figure 2 as follows. Under a nod a 1 is implied the CLOSED protocol state (Starting point); a 2 : LISTEN (Passive open); a 3 : SYN_RCVD; a 4 : SYN_SENT (Active open); a 5 : ESTABLISHED (Data transfer state); a 6 : CLOSE_WAIT (Passive close); a 7 : LAST_ACK (Passive close); a 8 : FIN_WAIT_1 (Active close); a 9 : CLOSING (Active close); a 10 : FIN_WAIT_2 (Active close). Last state TIME_WAIT corresponds to a state a 1 CLOSED (Starting point) and not marked as a new state. It means that after a final cycle the system transfers in an initial state that also corresponds to the Mealy automaton. In a similar way we will treat a protocol transitions from one state to another one. x 1 : SYN; x 2 : RST; x 3 : ACK; x 4 : FIN; x 5 : timeout; х6: appl. We will designate an output words as follows: y 1 : Passive Open; y 2 : Active Open; y 3 : SYN; y 4 : ACK; y 5 : Send Data; y 6 : FIN; y 7 : RST. An output word absence we will designate as (-). The following finite state machine graph is resulted in figure 3. a 1 a 2 a 3 a 4 x 4 /y 4 a 5 a 6 a 8 a 7 x 5 /y 7 x 6 /- x 6 / y 3 x 2 /- x 1/ y 3 y 4 x6 /y 3 x 1 /y 4 y 5 x 1 x 3 /y 4 x 6 /- x 4/ y 4 a 9 x3 x 4 /y 4 a 10 x 4 /y 4 a 1 Fig. 3: The Transition graph of transport protocol TCPv4. SDL Model Use: The final purpose of our approach is a test sequence generation for the specified network protocol (Schaff and Nemchenko, 2001). One of stages of this solution is representation of the initial description of the protocol functioning in the formal language comprehensible to data input in a computer. That is protocol representation as a finite state machine is the intermediate stage of protocol simulation. Our research shows, that one of the most comprehensible and perspective is the specialized language SDL (Specification and Description Language). This language is based on usage of the finite state machine model as it is shown in a figure 4, for example. This simulation language is presented in a literature completely enough. For example in (Grabowski, 1994; Baranov, 1997). That is why it is not a subject of this publication. 958
4 Models of Network Errors: Having assumed as a basis representation of network system behaviour on analogies to the theory of behaviour of finite state machines as it is made in (Baranov, 1997); we can class network system behaviour errors as follows: 1 Output errors: presents a case when some correct output word y j is substituted by another word y k. At the same time, transition from the previous state to another one is realized correctly. 2 Transition errors: corresponds to a case when instead of а m - а n, transition under an entry word x i with a corresponding output word у j, a transition in another state a s (not provided) under the influence of the same entry word x i is carried out. 3 State errors: occurs when a quantity of states specified and the quantity of real states and also its composition in some implementation of system differs from the protocol specification. 4. Model of the protocol implementation with a different type of errors above mentioned is shown at the figure x i / y j a m a n a m a n x k / y l x i / yi x k / y p x k / - a s a s a c а) Protocol specification model b) Protocol implementation model with a different error types Fig. 4: The graph model of some network protocol. Let some network system can be in one of three states а m, а n, a s according to the protocol specification (see fig. 4). The specification provides the transition from a state а m to a state а n. Also according to the specification an output word y j appears as a result of such transition provoked by an entry word x i. Let also a transition from state а m to state а s is carried out under entry word x i and the output word y j is thus worked out (fig. 4, b). We will note that in this case there is a transition error according to the classification resulted above. On the given model it is easy to see as well an output error on transition а n - а s (fig. 4, b). One more error type a state error, is shown also in a figure 4, b. We see here presence of a state а с which has been not provided by the specification of this protocol. It is obvious, that a presented automaton model above can be referred to an automaton of a Mealy type. It is possible to familiarize with Mealy and Moore automata theory more in detail in (Baranov. 1977) or in paper «Implementing Mealy and Moore Machines» on page Errors Coverage: At a graph usage as a finite state machine model for the network protocol description we face a typical problem of graph coverage. It is obvious, that the problem of errors coverage at usage of the graphic model can be reduced to the graph coverage problem. That is necessary to solve the problem to pass the graph for minimum possible number of steps. Thus all nods and all arcs of the graph should be passed at least once. The optimal test sequence with minimal quantity of test vectors will be as a result gained at sufficient entirety of test vectors coverage for the tested protocol. This problem is well enough lighted in the literature, for example [8] and is not a subject of the present article. It is easy to note, that the statement of graph coverage problem is not new and meets even in Euler's works. Conclusion: As is known, any problem of testing including testing of network protocols is a complex one and consists of subtasks set. And among them the problem of formalization of a testing object representation is the first. This research is devoted to justification of a finite state machine model choice and to adapt this model to needs of network protocol test algorithm. Possibility of the given model usage for the description of a various protocol functioning errors is besides shown. Also the solution paths of an optimization problem and support of 959
5 generated test sequence entirety are planned. Narrow frameworks of this publication have not allowed to go deep into consideration of a tests classification problem and the test sequences generation problem, as is a subject of the further researches in this domain. REFERENCES Baranov, S.I., Matrix Realization of Control Automata.- Proceedings of the Second International Symposium on Discrete Systems. Dresden, vol. 2. Castanet, R., Test de protocoles de communication. Réseaux de Communication et Techniques Formelles. Paris. Fujiwara, S., G.V. Bochmann, F. Khendek, M. Amalou, A. Ghedamsi, Test selection based on finite state models. Université de Montréal. Canada. Grabowski, J., SDL and MSC Based Test Case Generation An overall view pf the SAMsTaG method. IAM Petrenko, A., G.V. Bochmann, On Fault Coverage of Tests for Finite State Specifications. Montreal University. Canada. Schaff, A., V. Nemchenko, Test of the new generation internet protocols IPv6. / Radioélectronika i informatika. - Kharkiv, 1: SDL Specification and Description Language, CCITT SG XI, Recommendation Z.100. Stevens, W.R., TCP/IP Illustré. Les Protocoles. Vol. 1. International Thomson Publishing Company. 960
Sequencing and control
Computer Mathematics Week 11 Sequencing and control Finite State Machines College of Information Science and Engineering Ritsumeikan University last week sequential digital circuits stateful logic level-triggered
More informationNew York University Computer Science Department Courant Institute of Mathematical Sciences
New York University Computer Science Department Courant Institute of Mathematical Sciences Course Title: Data Communications & Networks Course Number: CSCI-GA.2662-001 Instructor: Jean-Claude Franchitti
More information3.5.6 TCP Connection Management
02-068 C03 pp4 6/14/02 2:14 PM Page 248 248 CHAPTER 3 Transport Layer of unacknowledged data less than the value of RcvWindow, host A is assured that it is not overflowing the receive buffer at host B.
More informationMobile Transport Layer Lesson 02 TCP Data Stream and Data Delivery
Mobile Transport Layer Lesson 02 TCP Data Stream and Data Delivery 1 TCP Data Stream Consists of bytes Delivered using a virtual connection between sockets Each socket has the port number and IP address
More informationConnections. Topics. Focus. Presentation Session. Application. Data Link. Transport. Physical. Network
Connections Focus How do we connect processes? This is the transport layer Topics Naming processes Connection setup / teardown Flow control Application Presentation Session Transport Network Data Link
More informationS 3 : the Small Scheme Stack A Scheme TCP/IP Stack Targeting Small Embedded Applications
S 3 : the Small Scheme Stack A Scheme TCP/IP Stack Targeting Small Embedded Applications Vincent St-Amour Université de Montréal Joint work with Lysiane Bouchard and Marc Feeley Scheme and Functional Programming
More informationCS419: Computer Networks. Lecture 10, Part 2: Apr 11, 2005 Transport: TCP mechanics (RFCs: 793, 1122, 1323, 2018, 2581)
: Computer Networks Lecture 10, Part 2: Apr 11, 2005 Transport: TCP mechanics (RFCs: 793, 1122, 1323, 2018, 2581) TCP as seen from above the socket The TCP socket interface consists of: Commands to start
More informationLecture 22: TCP & NAT. CSE 123: Computer Networks Alex C. Snoeren
Lecture 22: TCP & NAT CSE 123: Computer Networks Alex C. Snoeren Lecture 22 Overview TCP Connection Management TCP Slow Start Allow TCP to adjust to links of any speed Fast Retransmit & Recovery Avoid
More informationCSCI-1680 Transport Layer I Rodrigo Fonseca
CSCI-1680 Transport Layer I Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Today Transport Layer UDP TCP Intro Connection Establishment Transport Layer "#$ -##$
More informationCSCI-1680 Transport Layer I Rodrigo Fonseca
CSCI-1680 Transport Layer I Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Today Transport Layer UDP TCP Intro Connection Establishment From Lec 2: OSI Reference
More informationTransmission Control Protocol (TCP)
Transmission Control Protocol (TCP) Antonio Carzaniga Faculty of Informatics Università della Svizzera italiana November 10, 2017 Outline Introduction to TCP Sequence numbers and acknowledgment numbers
More informationComputer Network Programming. The Transport Layer. Dr. Sam Hsu Computer Science & Engineering Florida Atlantic University
Computer Network Programming The Transport Layer Dr. Sam Hsu Computer Science & Engineering Florida Atlantic University The Transport Layer The Big Picture Overview of TCP/IP protocols TCP Packet Exchanges
More informationLenuta Alboaie Computer Networks
Transport Level Lenuta Alboaie adria@info.uaic.ro 1 Content Transport Level Preliminary UDP (User Datagram Protocol) TCP (Transmission Control Protocol) TCP versus UDP 2 Transport Level Preliminary They
More informationTCP/IP Networking. Part 4: Network and Transport Layer Protocols
TCP/IP Networking Part 4: Network and Transport Layer Protocols Orientation Application Application protocol Application TCP TCP protocol TCP IP IP protocol IP IP protocol IP IP protocol IP Network Access
More informationSome slides courtesy David Wetherall. Communications Software. Lecture 4: Connections and Flow Control. CSE 123b. Spring 2003.
CSE 123b Communications Software Spring 2003 Lecture 4: Connections and Flow Control Stefan Savage Some slides courtesy David Wetherall Administrativa Computer accounts have been setup You can use the
More informationCSE 461 The Transport Layer
CSE 461 The Transport Layer The Transport Layer Focus How do we (reliably) connect processes? This is the transport layer Topics Naming end points UDP: unreliable transport TCP: reliable transport Connection
More informationLast Class. CSE 123b Communications Software. Today. Naming Processes/Services. Transmission Control Protocol (TCP) Picking Port Numbers.
CSE 123b Communications Software Spring 2002 Lecture 4: Connections and Flow Control Stefan Savage Last Class We talked about how to implement a reliable channel in the transport layer Approaches ARQ (Automatic
More informationUser Datagram Protocol
Topics Transport Layer TCP s three-way handshake TCP s connection termination sequence TCP s TIME_WAIT state TCP and UDP buffering by the socket layer 2 Introduction UDP is a simple, unreliable datagram
More informationCSE/EE 461 Lecture 14. Connections. Last Time. This Time. We began on the Transport layer. Focus How do we send information reliably?
CSE/EE 461 Lecture 14 Connections Last Time We began on the Transport layer Focus How do we send information reliably? Topics ARQ and sliding windows Application Presentation Session Transport Network
More informationTCP. - Transmission Control Protocol -
TCP - Transmission Control Protocol - 1 Functions of TCP Appropriate data transmission among nodes 1. Basic functions a. Error-free against bit-error b. Loss-free against packet loss by buffer overflow
More informationUpdates: 1213 November 1996 Category: Standards Track. SNMPv2 Management Information Base for the Transmission Control Protocol using SMIv2
Network Working Group K. McCloghrie, Editor Request for Comments: 2012 Cisco Systems Updates: 1213 November 1996 Category: Standards Track Status of this Memo SNMPv2 Management Information Base for the
More informationTCP: Transmission Control Protocol RFC 793,1122,1223. Prof. Lin Weiguo Copyleft 2009~2017, School of Computing, CUC
TCP: Transmission Control Protocol RFC 793,1122,1223 Prof. Lin Weiguo Copyleft 2009~2017, School of Computing, CUC Nov. 2017 TCP/IP Protocol Stack Application Layer FTP, Telnet, HTTP, Transport Layer TCP,
More informationTransport Layer Marcos Vieira
Transport Layer 2014 Marcos Vieira Transport Layer Transport protocols sit on top of network layer and provide Application-level multiplexing ( ports ) Error detection, reliability, etc. UDP User Datagram
More informationIntroduc)on to Computer Networks
Introduc)on to Computer Networks COSC 4377 Lecture 7 Spring 2012 February 8, 2012 Announcements HW3 due today Start working on HW4 HW5 posted In- class student presenta)ons No TA office hours this week
More informationApplications of Finite State Machines
15-453 Formal Languages, Automata, and Computation Applications of Finite State Machines Mihai Budiu Lecture 3 January 24, 2000 Formal languages and automata are probably the biggest success story of theoretical
More informationChapter 3 outline. 3.5 connection-oriented transport: TCP segment structure reliable data transfer flow control connection management
Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and demultiplexing 3.3 connectionless transport: UDP 3.4 principles of reliable data transfer 3.5 connection-oriented transport: TCP segment
More informationTCP (Part 2) Session 10 INST 346 Technologies, Infrastructure and Architecture
TCP (Part 2) Session 10 INST 346 Technologies, Infrastructure and Architecture Muddiest Points Reading pseudocode Reading finite state diagrams What parts of rdt are in TCP? Goals for Today Finish up TCP
More informationUART data s integrity UART frame control Agenda Power save management TCP maintenance settings Multiple AP roaming and dual mode Firmware update mode,
UART data s integrity UART frame control Agenda Power save management TCP maintenance settings Multiple AP roaming and dual mode Firmware update mode, MFG mode UART data s integrity UARTWi-Fi data conversion
More informationDetecting Denial of Service Intrusion Detection Aamir Islam Dept. of Computer Science, University of Central Punjab, Lahore, Pakistan.
Detecting Denial of Service Intrusion Detection Aamir Islam Dept. of Computer Science, University of Central Punjab, Lahore, Pakistan. aamir.islam@pcit.ucp.edu.pk Abstract Denial of Service (DoS) attack
More informationTCP. TCP: Overview. TCP Segment Structure. Maximum Segment Size (MSS) Computer Networks 10/19/2009. CSC 257/457 - Fall
TCP Kai Shen 10/19/2009 CSC 257/457 - Fall 2009 1 TCP: Overview connection-oriented: handshaking (exchange of control msgs) to initialize sender, receiver state before data exchange pipelined: multiple
More informationCh6 Protocol Testing. Outline. Outline. Protocol Conformance Testing. Introduction Concepts Fault models Related definitions General approach
Outline VI. Protocol Testing Introduction Concepts Fault models Related definitions General approach Methodologies based on FSM T-Method (Transition Tour method) D-Method d(distinguishing i sequences)
More informationTCP Review. Carey Williamson Department of Computer Science University of Calgary Winter 2018
TCP Review Carey Williamson Department of Computer Science University of Calgary Winter 2018 Credit: Much of this content came courtesy of Erich Nahum (IBM Research) The TCP Protocol Connection-oriented,
More informationCS 4390 Computer Networks. Pointers to Corresponding Section of Textbook
CS 4390 Computer Networks UT D application transport network data link physical Session 10 Transmission Control Protocol (TCP) An Overview Adapted from Computer Networking a Top-Down Approach 1996-2012
More informationIntroduction to Networking. Operating Systems In Depth XXVII 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.
Introduction to Networking Operating Systems In Depth XXVII 1 Copyright 2017 Thomas W. Doeppner. All rights reserved. Distributed File Systems Operating Systems In Depth XXVII 2 Copyright 2017 Thomas W.
More informationCSE 461 Module 11. Connections
CSE 461 Module 11 Connections This Time More on the Transport Layer Focus How do we connect processes? Topics Naming processes Connection setup / teardown Flow control Application Presentation Session
More informationOutline Computer Networking. Functionality Split. Transport Protocols
Outline 15-441 15 441 Computer Networking 15-641 Lecture 10: Transport Protocols Justine Sherry Peter Steenkiste Fall 2017 www.cs.cmu.edu/~prs/15 441 F17 Transport introduction TCP connection establishment
More informationComputer Networking Introduction
Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.10 Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and
More informationCSE 4/589 Midterm Review. Hengtong Zhang SUNY Buffalo 10/30/2018
CSE 4/589 Midterm Review Hengtong Zhang SUNY Buffalo 10/30/2018 Chapter 1 overview: what s the Internet? what s a protocol? network edge; hosts, access net, physical media network core: packet/circuit
More informationTCP-MIB DEFINITIONS ::= BEGIN
DEFINITIONS ::= BEGIN IMPORTS MODULE-IDENTITY, OBJECT-TYPE, Integer32, Gauge32, Counter32, IpAddress, mib-2 FROM SNMPv2-SMI MODULE-COMPLIANCE, OBJECT-GROUP FROM SNMPv2-CONF; tcpmib MODULE-IDENTITY LAST-UPDATED
More informationChapter 3 Transport Layer
Chapter 3 Transport Layer A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
More informationInternet Protocols Fall Outline
Internet Protocols Fall 2004 Lecture 12 TCP Andreas Terzis Outline TCP Connection Management Sliding Window ACK Strategy Nagle s algorithm Timeout estimation Flow Control CS 449/Fall 04 2 1 TCP Connection
More informationFirewall Conformance Testing
Firewall Conformance Testing Diana Senn dsenn@inf.ethz.ch http://www.infsec.inf.ethz.ch/people/dsenn Information Security ETH Zürich Switzerland 01.06.2005 joint work with David Basin & Germano Caronni
More informationCSC 401 Data and Computer Communications Networks
CSC 401 Data and Computer Communications Networks Transport Layer Connection Oriented Transport: TCP Sec 3.5 Prof. Lina Battestilli Fall 2017 Transport Layer Chapter 3 Outline 3.1 Transport-layer Services
More informationThe paper provides an inventory of various fault models used for speciæcationbased hardware and software testing. Various types of speciæcations are c
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography Alexandre Petrenko Centre de Recherche Informatique de Montreal ècrimè, 550 Sherbrooke West, Suite 100, Montreal, H3A
More informationChapter III: Transport Layer
Chapter III: Transport Layer UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross TCP: Overview RFCs: 793,1122,1323,
More informationOperating Systems and Networks. Network Lecture 8: Transport Layer. Where we are in the Course. Recall. Transport Layer Services.
Operating Systems and s Lecture 8: Transport Layer I was going to tell you a joke about UDP, but I wasn t sure if you were going to get it Adrian Perrig Security Group ETH Zürich 2 Where we are in the
More informationOperating Systems and Networks. Network Lecture 8: Transport Layer. Adrian Perrig Network Security Group ETH Zürich
Operating Systems and Networks Network Lecture 8: Transport Layer Adrian Perrig Network Security Group ETH Zürich I was going to tell you a joke about UDP, but I wasn t sure if you were going to get it
More informationUDP and TCP. Introduction. So far we have studied some data link layer protocols such as PPP which are responsible for getting data
ELEX 4550 : Wide Area Networks 2015 Winter Session UDP and TCP is lecture describes the two most common transport-layer protocols used by IP networks: the User Datagram Protocol (UDP) and the Transmission
More informationSequence Number. Acknowledgment Number. Checksum. Urgent Pointer plus Sequence Number indicates end of some URGENT data in the packet
TCP Urgent Source Port Destination Port Sequence Number Acknowledgment Number HdrLen Reserved UA P RS F Checksum Window Size Urgent Pointer Urgent Pointer plus Sequence Number indicates end of some URGENT
More informationLecture 13: Transportation layer
Lecture 13: Transportation layer Contents Goals of transportation layer UDP TCP Port vs. Socket QoS AE4B33OSS Lecture 12 / Page 2 Goals of transportation layer End-to-end communication Distinguish different
More informationEnd-to-End Protocols. End-to-End Protocols
End-to-End Protocols UDP (User Datagram Protocol) (Transport Control Protocol) Connection Establishment/Termination Sliding Window Revisit Flow Control Adaptive Retransmission End-to-End Protocols Limitations
More informationChapter 3 Transport Layer
Chapter 3 Transport Layer Part b Connection-Oriented Transport Transport Layer 3-1 Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and demultiplexing 3.3 connectionless transport: UDP 3.4
More informationIntegration of Functional and Timed Testing of Real-time and Concurrent Systems
Integration of Functional and Timed Testing of Real-time and Concurrent Systems Victor V. Kuliamin, Alexander K. Petrenko, Nick V. Pakoulin, Alexander S. Kossatchev, and Igor B. Bourdonov Institute for
More informationTCP Overview. Connection-oriented Byte-stream
TCP Overview Connection-oriented Byte-stream app writes bytes TCP sends segments app reads bytes Full duplex Flow control: keep sender from overrunning receiver Congestion control: keep sender from overrunning
More information10 minutes survey (anonymous)
10 minutes survey (anonymous) v Comments/Suggestions to my lecture/lab/ homework/exam v If you like this course, which part do you like? v If you don t like it, which part do you not like? Thanks! Transport
More informationChapter 3- parte B outline
Chapter 3- parte B outline 3.1 transport-layer services 3.2 multiplexing and demultiplexing 3.3 connectionless transport: UDP 3.4 principles of reliable data transfer 3.5 connection-oriented transport:
More informationHYBRID PETRI NET MODEL BASED DECISION SUPPORT SYSTEM. Janetta Culita, Simona Caramihai, Calin Munteanu
HYBRID PETRI NET MODEL BASED DECISION SUPPORT SYSTEM Janetta Culita, Simona Caramihai, Calin Munteanu Politehnica University of Bucharest Dept. of Automatic Control and Computer Science E-mail: jculita@yahoo.com,
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 9
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 9 1 Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and demultiplexing 3.3
More informationIntroduc)on to Computer Networks
Introduc)on to Computer Networks COSC 4377 Lecture 8 Spring 2012 February 13, 2012 Announcements HW4 due this week Start working on HW5 In- class student presenta)ons TA office hours this week TR 1030a
More informationCourse information IST NET1
Course information IST NET1 8 classes (x 2h) 1 lab ( x 4h) The slides are for me, you should take notes, read books, blogs and articles Written report for the lab, demonstrating your understanding of the
More informationMethod for security monitoring and special filtering traffic mode in info communication systems
Method for security monitoring and special filtering traffic mode in info communication systems Sherzod Rajaboyevich Gulomov Provide Information Security department Tashkent University of Information Technologies
More informationCSE/EE 461 Lecture 13 Connections and Fragmentation. TCP Connection Management
CSE/EE 461 Lecture 13 Connections and Fragmentation Tom Anderson tom@cs.washington.edu Peterson, Chapter 5.2 TCP Connection Management Setup assymetric 3-way handshake Transfer sliding window; data and
More informationCSE 461 Connections. David Wetherall
CSE 461 Connections David Wetherall djw@cs.washington.edu Connections Focus How do we (reliably) connect processes? This is the transport layer Topics Naming processes TCP / UDP Connection setup / teardown
More informationŁabiak G., Miczulski P. (IIE, UZ, Zielona Góra, Poland)
UML STATECHARTS AND PETRI NETS MODEL COMPARIS FOR SYSTEM LEVEL MODELLING Łabiak G., Miczulski P. (IIE, UZ, Zielona Góra, Poland) The system level modelling can be carried out with using some miscellaneous
More informationENGINEERING TCP/IP WITH LOGIC
ENGINEERING TCPIP WITH LOGIC Hannes Mehnert*, robur.io, @h4nnes based on work by Peter Sewell*, Michael Norrish^, Tom Ridge* earlier contributors are Steve Bishop*, Matthew Fairbairn*, Michael Smith*,
More informationAbstract. MEETA YADAV. Design of a Transport Layer Protocol for 4G Wireless Systems (Under the direction of Dr. Arne Nilsson).
Abstract MEETA YADAV. Design of a Transport Layer Protocol for 4G Wireless Systems (Under the direction of Dr. Arne Nilsson). Mobility computing is the network-access paradigm of the future. Future network
More informationIntroduction to Electronic Design Automation. Model of Computation. Model of Computation. Model of Computation
Introduction to Electronic Design Automation Model of Computation Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Spring 03 Model of Computation In system design,
More informationCSE/EE 461 Lecture 12 TCP. A brief Internet history...
CSE/EE 461 Lecture 12 TCP Tom Anderson tom@cs.washington.edu Peterson, Chapter 5.2, 6 A brief Internet history... 1991 WWW/HTTP 1969 ARPANET created 1972 TELNET RFC 318 1973 FTP RFC 454 1977 MAIL RFC 733
More informationThe Importance of Sliding Window Protocol Generalisation in a Communication Protocols Course
The Importance of Sliding Window Protocol Generalisation in a Communication Protocols Course Author: Drago Hercog, University of Ljubljana / Faculty of Electrical Engineering, Ljubljana, Slovenia, Drago.Hercog@fe.uni-lj.si
More informationEnd-to-End Protocols: UDP and TCP. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
End-to-End Protocols: UDP and TCP Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 11/14/2016 CSCI 445 Fall 2016 1 Acknowledgements Some pictures used
More informationTransport Layer (TCP/UDP)
Transport Layer (TCP/UDP) Where we are in the Course Moving on up to the Transport Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Three-Way Handshake (3) Suppose
More informationApplication of an Exact Transversal Hypergraph in Selection of SM-Components
Application of an Exact Transversal Hypergraph in Selection of SM-Components Łukasz Stefanowicz, Marian Adamski, and Remigiusz Wisniewski University of Zielona Góra, Institute of Computer Engineering and
More informationCSEP 561 Connections. David Wetherall
CSEP 561 Connections David Wetherall djw@cs.washington.edu Connections Focus How do we (reliably) connect processes? This is the transport layer Topics Naming processes Connection setup / teardown Sliding
More informationFault Management using Passive Testing formobileipv6networks
Fault Management using Passive Testing formobileipv6networks Raymond E. Miller Khaled A. Arisha Department of Computer Science Honeywell International Inc. University of Maryland, 7 Columbia Gateway Drive
More informationCS 43: Computer Networks. 18: Transmission Control Protocol October 12-29, 2018
CS 43: Computer Networks 18: Transmission Control Protocol October 12-29, 2018 Reading Quiz Lecture 18 - Slide 2 Midterm topics Abstraction, Layering, End-to-end design HTTP, DNS, Email, BT, etc. (app
More informationTesting Systems Specified as Partial Order Input/Output Automata
Testing Systems Specified as Partial Order Input/Output Automata Gregor v. Bochmann 1, Stefan Haar 2, Claude Jard 3, Guy-Vincent Jourdan 1 1 School of Information Technology and Engineering (SITE) University
More informationSDC - A Burroughs Company November 1985
Network Working Group Request for Comments: 964 Deepinder P. Sidhu Thomas P. Blumer SDC - A Burroughs Company November 1985 SOME PROBLEMS WITH THE SPECIFICATION OF THE MILITARY STANDARD TRANSMISSION CONTROL
More informationL41: Lab 4 - The TCP State Machine
L41: Lab 4 - The TCP State Machine Dr Robert N. M. Watson 29 January 2016 Dr Robert N. M. Watson L41: Lab 4 - The TCP State Machine 29 January 2016 1 / 10 L41: Lab 4 - The TCP State Machine The TCP state
More informationAutomata Construct with Genetic Algorithm
Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,
More informationSTUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY
STUDY OF THE DEVELOPMENT OF THE STRUCTURE OF THE NETWORK OF SOFIA SUBWAY ИЗСЛЕДВАНЕ НА РАЗВИТИЕТО НА СТРУКТУРАТА НА МЕТРОМРЕЖАТА НА СОФИЙСКИЯ МЕТОПОЛИТЕН Assoc. Prof. PhD Stoilova S., MSc. eng. Stoev V.,
More informationStream Control Transmission Protocol
Chapter 13 Stream Control Transmission Protocol Objectives Upon completion you will be able to: Be able to name and understand the services offered by SCTP Understand SCTP s flow and error control and
More informationThe Graph of Simplex Vertices
wwwccsenetorg/jmr Journal of Mathematics Research Vol 4, No ; February The Graph of Simplex Vertices M El-Ghoul Mathematics Department, Faculty of Science, Tanta University, Tanta, Egypt Tel: 4-684-8 E-mail:
More informationLecture 12: Transport Layer TCP again
Lecture 12: Transport Layer TCP again COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W.
More informationENEE 457: Computer Systems Security 11/07/16. Lecture 18 Computer Networking Basics
ENEE 457: Computer Systems Security 11/07/16 Lecture 18 Computer Networking Basics Charalampos (Babis) Papamanthou Department of Electrical and Computer Engineering University of Maryland, College Park
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 3: Discrete Dynamics,
More information28 Intelligent Protocol Analyzer with TCP Behavior Emulation for Interoperability Testing of TCP/IP Protocols
28 Intelligent Protocol Analyzer with TCP Behavior Emulation for Interoperability Testing of TCP/IP Protocols Toshihiko Kato, Tomohiko Ogishi, Akira ldoue and Kenji Suzuki KDD R&D Laboratories 2-1-15,
More informationLecture 2: Network Protocols and Layering
Lecture 2: Network Protocols and Layering Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE426: Communication Networks What is a Network Protocol? A protocol is the set of rules
More informationService and Protocol (I)
Modeling and Simulation of Service and Protocol (I) Service User 1 Service User 2 Service Provider 1 Service Provider 2 2 3. Finite State Machines 1 Service and Protocol (II) Peer entities on one layer
More informationCS 356: Computer Network Architectures. Lecture 17: End-to-end Protocols and Lab 3 Chapter 5.1, 5.2. Xiaowei Yang
CS 356: Computer Network Architectures Lecture 17: End-to-end Protocols and Lab 3 Chapter 5.1, 5.2 Xiaowei Yang xwy@cs.duke.edu Transport protocols Before: How to deliver packet from one host to another
More informationCSEP 561 Connections. David Wetherall
CSEP 561 Connections David Wetherall djw@cs.washington.edu Connections Focus How do we (reliably) connect processes? This is the transport layer Topics Naming processes TCP / UDP Connection setup / teardown
More informationReference Textbooks: " # " H7 R3 H8. Network 4 (point-to-point) Network 1 (Ethernet) H4 Network 3 (FDDI) n H1 TCP TCP ETH ETH
Referece Textbooks:! # $%%$& ' ) H1 H2 H3 Network 2 (Etheret) R1 Network 1 (Etheret) H7 R3 H8 Network 4 (poit-to-poit) R2 H4 Network 3 (FDDI) H1 H5 H6 H8 TCP R1 R2 R3 TCP IP IP IP IP IP ETH ETH FDDI FDDI
More informationLecture 11: IP routing, IP protocols
Lecture 11: IP routing, IP protocols Contents Routing principles Local datagram delivery ICMP Protocol UDP Protocol TCP/IP Protocol Assuring requirements for streaming TPC Building and terminating TCP
More information6. The Transport Layer and protocols
6. The Transport Layer and protocols 1 Dr.Z.Sun Outline Transport layer services Transmission Control Protocol Connection set-up and tear-down Ports and Well-know-ports Flow control and Congestion control
More informationINFORMATION-THEORETIC OUTLIER DETECTION FOR LARGE-SCALE CATEGORICAL DATA
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 4, April 2015,
More informationUNIT IV TRANSPORT LAYER
UNIT IV TRANSPORT LAYER UDP - SIMPLE DEMULTIPLEXER (UDP) The simplest transport protocol is one that extends the host-to-host delivery service of the underlying network into a process-to-process communication
More informationIntegration of Formal Methods and Testing for Model-Based Systems Engineering NII Shonan Meeting, Japan, Nov. 30 Dec. 4, 2014
Alexandre Petrenko Lead Researcher Computer Research Institute of Montreal CRIM, Canada Curiosity driven and industrial research: FranceTelecom, Siemens, Bombardier, SAP, CAE, Ericsson, GM Integration
More informationLOGICAL OPERATOR USAGE IN STRUCTURAL MODELLING
LOGICAL OPERATOR USAGE IN STRUCTURAL MODELLING Ieva Zeltmate (a) (a) Riga Technical University, Faculty of Computer Science and Information Technology Department of System Theory and Design ieva.zeltmate@gmail.com
More informationEnhanced Cellular Automata for Image Noise Removal
Enhanced Cellular Automata for Image Noise Removal Abdel latif Abu Dalhoum Ibraheem Al-Dhamari a.latif@ju.edu.jo ibr_ex@yahoo.com Department of Computer Science, King Abdulla II School for Information
More informationEvaluation of some test generation tools on a real protocol example
10 Evaluation of some test generation tools on a real protocol example Laurent Boullier1, Bryce Kelly2, Marc Phalippou 1, Anne Rouge~, Nick Webste~ BRITISH TELECOM LABORATORIES - FRANCE TELECOM CNET Abstract
More informationAn Embedded Software Testing Requirements Modeling Tool Describing Static and Dynamic Characteristics
International Symposium on Computers & Informatics (ISCI 2015) An Embedded Software Testing Requirements Modeling Tool Describing Static and Dynamic Characteristics Mingcheng Qu 1,2, Naigang Cui 2, Bingsong
More information