Stevens, W.: TCP Illustrated, Volume 1: The Protocols. Addison-Wesley, New York, NY (2001)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....algorithm [20] In our experiments, we used fixed length packets which allow for a constant MTU, set to 576 bytes. The RTT estimation is performed by keeping a recent average value. Following TCP s RTT smoothing strategy, we implemented an exponential filter with a constant 0. 9 smoothing factor [21]. This filter is fed with RTT measures conducted by a very simple and robust (stateless) request reply protocol, which takes place as a background process. This protocol sends RTT requests carrying the host s local time periodically, and delivers a new RTT measure upon reception of the RTT reply ....

W.R. Stevens. TCP/IP Illustrated, Volume 1 - The Protocols. Addison-Wesley Professional Computing Series, 1994.

....more complex state awareness may perform sequence number and acknowledgement checks. Stateless protocols, like UDP, are more difficult to monitor but multiple indicators could be correlated to trigger a single alarm. Fig. 1. Illustration of TCP handshake and initial sequence numbers derived from [14]. State awareness of data direction makes a squealing attack more difficult (see Figure 2) If the attack signature were a TCP packet with SYN ACK flags set and a specified source port, the IDS would expect to see this packet on the inside sensor followed by same packet on the outside sensor ....

Stevens, W.R. TCP Illustrated, Volume 1: The Protocols. Addison-Wesley (1994)

....documentation about RSVP is in the RSVP functional specification, i.e. the RFC 2205 [BZB 97] 48 This project will require a good knowledge of TCP IP protocols. All the information needed about IP protocols can be found in RFCs or in the TCP IP Illustrated volume 1 written by W. R. Stevens [Ste94] A good knowledge of C is also required, and a basic knowledge of C can be useful. The Diploma Comparative Programming Languages course will be helpful. Finally, a basic knowledge of ATM will be a plus ( Gor95, HHS94, Cla96] Timetable and Milestones Week 1 2: 24 November 7 December ....

W. Richard Stevens. TCP/IP Illustrated, Volume 1 - The Protocols. Addison-Wesley, 1994.

....the amount of Internet resources (i.e. the bandwidth) that an end to end video application should utilize for its multimedia contents. TCP traffic is dominant in today s Internet applications such as FTP, HTTP and TELNET. The congestion control mechanism of TCP (transmission control protocol) [7], motivated by intelligent end to end fair sharing of a dummy network core, has contributed to the robustness of the current Internet for more than two decades. However, TCP is not effective enough for realtime applications because its window based congestion control does not provide instant rate ....

W.R. Stevens, TCP/IP Illustrated, Volume 1 - The Protocols. Addison-Wesley, 1994.

.... as an alternative approach, in which the end user adjusts the transmission rate based on the observed link status (e.g. packet loss and delay delay jitter) Basically, this end to end rate adaptation mechanism plays the same role as congestion control of TCP (transmission control protocol) [6]. Currently, TCP traffics are dominant in today s Internet applications. FTP, HTTP and TELNET are all examples of TCP based traffics. The congestion control mechanism of TCP has been developed more than two decades, and plays a critical role in the robustness of current Internet. Thus, the ....

W.R. Stevens, TCP/IP Illustrated, Volume 1 - The Protocols. Addison-Wesley, 1994.

....by opening a socket. Messages are exchanged by writing to or reading from the socket. Stream sockets deliver messages reliably and in order, but they do not preserve message boundaries. TCP uses checksums, sequence numbers, and acknowledgments to guarantee that messages are not lost or damaged [19, 20]. Conceptually, each byte of a message is assigned a sequence number. When TCP wants to transmit a message, it adds the sequence number of the first byte and the size of the message. Then, it saves a copy of the message in a send queue and starts a timer. The message is removed from the queue as ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley, 1994.

....IP provides a connectionless datagram service that provides enough header information for packets to be routed to their destinations. TCP makes reliable ordered communication of streams of data such as files possible by implementing a duplex protocol, based around sliding windows, on top of IP [3]. A number of intertwined algorithms determine the rate at which TCP puts new data into the network, and how losses are detected and handled. In particular, a TCP sender maintains a congestion window variable that determines how large the size of its sliding window of unacknowledged data given to ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley, 1994.

....of its operation make this utility popular in TCP IP networks. Traceroute operates by 33 sending UDP datagrams to the destination node with the destination port number selected to be of a large value ( 30000) making it highly improbable that an application at the destination is using that port [38]. The utility begins operation by sending a UDP datagram towards the destination with a TTL set to 1. The first router to receive the datagram, decrements the TTL to 0, subsequently discards it and then sends back an ICMP time exceeded message to the source. The source node thus identifies the ....

W. Richard Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, 1994.

....bandwidth by transferring incomplete packets, EPD discards all cells of the newly arriving packet when the queue length at the switch buffer exceeds some threshold value. Following [6] we set the threshold at half the buffer size in simulation. For TCP, we have implemented 4. 3 Tahoe BSD release [9, 10]. We have also implemented the fast retransmit procedure [9] to discover the possible packet loss quickly. As suggested in [6] the clock granularity for measuring the round trip time is set to 0.1 ms to avoid the coarsegrained clock. Furthermore, the random traffic is added to the switch to avoid ....

....cells of the newly arriving packet when the queue length at the switch buffer exceeds some threshold value. Following [6] we set the threshold at half the buffer size in simulation. For TCP, we have implemented 4. 3 Tahoe BSD release [9, 10] We have also implemented the fast retransmit procedure [9] to discover the possible packet loss quickly. As suggested in [6] the clock granularity for measuring the round trip time is set to 0.1 ms to avoid the coarsegrained clock. Furthermore, the random traffic is added to the switch to avoid the traffic phase effect of TCP [6] The mean arrival rate ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Reading, Massachusetts: Addison-Wesley, 1994.

....more information on the services and specifications of the aforementioned wireless networks. 1.2 The case of TCP in the wireless environment We will not delve into the details of TCP [61] 5] in this report. The interested reader is referred to one of several excellent books on TCP, such as [72][87] We will however 0 500 1000 1500 2000 2000 2001 2002 2003 2004 Data rate (Kbps) GSM, CDMA, TDMA 9.6 14.4 cdma2000, GPRS 28.8 144 EDGE, UMTS 384 WCDMA, UMTS, cdma200 (Phase 2) 2 Mbps 4 discuss the parameters that affect the performance of TCP in a ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, 1994.

....diagram with Migrate transitions (adapted from [33, figure 18.12] in MIGRATE WAIT for over a specified period of time. We recommend using the 2MSL ( 31] specifies a Maximum Segment Lifetime (MSL) as 2 minutes, but common implementations also use values of 1 minute or 30 seconds for MSL [33]) period of time specified for the TIME WAIT state. Any segments received while in the MIGRATE WAIT state should be processed as in the ESTABLISHED state, except that no ACKs should be generated. The only way a connection is removed from the MIGRATE WAIT state is on the receipt of a Migrate SYN ....

STEVENS, W. R. TCP/IP Illustrated, Volume 1: The Protocols. Addison Wesley, Reading, Massachusetts, 1994.

....Internet uses a window based flow control mechanism in TCP, as the feedback based congestion control mechanism. As an example, a version of TCP mechanism called TCP Reno uses packet losses in the network as feedback information since packet losses implies congestion occurrence in the network [1, 2]. In short, the congestion control mechanism of TCP Reno first increases its window size, and as soon as it detects packet losses in the network, it reduces its window size. TCP Reno repeats this process indefinitely during the connection. Recently another version of TCP called TCP Vegas has been ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. New York: Addison-Wesley, 1994.

....model of a datagram traversing the Internet. Figure 1 illustrates an IP datagram moving in a store and forward environment from source to destination; it is routed on the basis of a destination address with an uncertain source address decrementing the datagram time to live (TTL) at every router hop[1]. The datagram is routed through major Internet and IP transit providers. There is a striking similarity between the transit of a datagram on the Internet and an airplane through airspace, between future network management and air traffic control (ATC) At a very high abstract level, the concepts ....

.... threat subtree USENIX ;login: future file: C WINDOWS Desktop USENIX ;login future.htm (7 of 9) 2 1 2001 1:03:44 AM] Three primary data flows (services) exist on the Internet: User Datagram Protocol (UDP) Transmission Control Protocol (TCP) and Internet Control Message Protocol (ICMP)[1]. Domain Name System (DNS) cache poisoning and UDP port flooding denial of service attacks are examples of two vulnerabilities exploited using UDP services. The ping of death and ICMP redirect bombs are examples of Internet attacks based on ICMP. TCP vulnerabilities include TCP sequence number and ....

Stevens, R. TCP/IP Illustrated, Volume 1: The Protocols. Reading, MA: Addison-Wesley, 1994.

....flow control mechanism in the TCP (Transmission Control Protocol) as the feedback based congestion control mechanism. For example, a version of the TCP mechanism called TCP Reno uses packet loss in the network as feedback information since packet loss implies congestion occurrence in the network [1, 2]. Until packet loss occurs in the network, TCP Reno gradually increases its window size. As the window size is over its available bandwidth, excess packets are queued at the buffer of the bottleneck router for some period. If the window size increases further, packets at the buffer of the router ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. New York: Addison-Wesley, 1994.

....considers to be a safe operating point. Once this threshold is reached, congestion avoidance takes over and begins increasing the congestion window linearly in order to take advantage of changing network conditions. An example of this combined algorithm is shown in figure 1.2 below. Adapted from [15] and [16] cwnd (segments) round trip times 0 2 4 6 10 12 14 16 18 ssthresh 20 8 8 9 13 12 11 10 14 1 2 3 4 5 6 7 0 ssthresh timeout Figure 1.2: Slow Start and Congestion Avoidance 1.1 Congestion Control Avoidance 7 1.1.3 Fast Retransmit The congestion avoidance control ....

....(Section 1.1.4) ffl Window Scaling (Section 1.3.3) ffl PAWS (Section 1.3.5) ffl RTTM (Section 1.3.4) ffl Selective Acknowledgements (SACK) Section 1.2) 1. 6 Various Implementations of TCP Many of the TCP implementations used on the Internet today are derived from the BSD network releases [15]. Figure 1.3 below gives a timeline highlighting several TCP implementation releases. This section describes four specific implementations of TCP, namely Tahoe, Reno, Vegas, and New Reno. These four particular implementations have been chosen for various reasons. Tahoe has been chosen because it ....

R. W. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Reading: Addison Wesley, 1994.

....provide more information on the services and specifications of wireless networks in the Appendix. 1.2 The case of TCP in the wireless environment We will not delve into the details of TCP [50] 5] in this report. The interested reader is referred to one of several excellent books on TCP, such as [57][73] We will however discuss the parameters that affect the performance of TCP in a wired cum wireless environment. Limited bandwidth. As explained in Section 1.1 wireless wide area networks offer limited raw bit rates. For example, CDPD networks [1] offer a raw bit rate of 19.2 Kbps, which is ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, 1994.

....memory and Direct Memory Access (DMA) engines. This intelligent NI, is absent in conventional LANs. They are capable of providing significantly higher bandwidth (Gigabits sec) between network interfaces of interconnected nodes. They provide a degree of reliability in the Link Layer [24] itself (1 bit error in every 2 15 bits) The upper protocol layers of software can take special advantage of this reliability to achieve high bandwidths. Our attention to security will be focussed on the messaging library software built upon a Myrinet SAN. However, at this point we draw some ....

....in Figure 4. Figure 4(a) shows the software architecture and access paths for hardware resources with a typical performance driven messaging layer over a programmable network interface. Figure 4(b) shows the conventional network software architecture designed on lines of the OSI software model [24]. The bold arrows, which are common to both figures, show secure resource access paths. In figure 4(b) all accesses to kernel space memory and network hardware arise from the trusted OS or only from the lowest layer(s) of the network protocol stack. User programs can never bypass these trusted ....

Stevens, W. Richard. 1994. TCP/IP Illustrated, Volume 1: The Protocols. Menlo Park, CA: Addison-Wesley Publishing Company.

....flow control mechanism in the TCP (Transmission Control Protocol) as the feedback based congestion control mechanism. For example, a version of the TCP mechanism called TCP Reno uses packet loss in the network as feedback information since packet loss implies congestion occurrence in the network [1, 2]. Until packet loss occurs in the network, TCP Reno gradually increases its window size. As the window size is over its available bandwidth, excess packets are queued at the buffer of the bottleneck router for some period. If the window size increases further, packets at the buffer of the router ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. New York: Addison-Wesley, 1994.

.... updates a) Basic architecture. b) Routing components. Figure 1. Generic architecture of a router. Route Processing: This includes routing table construction and maintenance using routing protocols (such as RIP or OSPF) to learn about and create a view of the network s topology [5][6] 7] Updates to the routing table can also be done through management action where routes are added and deleted manually. Packet Forwarding: Typically, IP packet forwarding requires the following: IP Packet Validation: The router must check that the received packet is properly formed for ....

. W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Reading, MA: Addison-Wesley, 1994.

....control mechanism in its TCP (Transmission Control Protocol) as the feedback based congestion control mechanism. As an example, a version of TCP mechanism called TCP Reno uses packet losses in the network as feedback information since packet losses implies congestion occurrence in the network [1, 2]. Until packet loss occurs, TCP Reno gradually increases its window size that limits the number of in flight packets in the network. As the window size is over its available bandwidth, excess packets are queued at the buffer of intermediate routers for some period. If the window size increases ....

W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols. New York: Addison-Wesley, 1994.

No context found.

Stevens, W.: TCP Illustrated, Volume 1: The Protocols. Addison-Wesley, New York, NY (2001)

No context found.

Stevens, W.: TCP Illustrated, Volume 1: The Protocols. Addison-Wesley, New York, NY (2001)

No context found.

Stevens, W. R. 1994. TCP/IP Illustrated, Volume 1 - The Protocols, Addison-Wesley, Reading, MA.

No context found.

W. Richard Stevens; TCP/IP Illustrated, Volume 1: The Protocols (Addison-Wesley)

No context found.

W. R. Stevens. <<TCP/IP Illustrated, Volume 1: The Protocol>>;. Addison-Wesley Publishing Company 1994.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC