V. Cerf and R. Kahn, "A protocol for packet network interconnection," IEEE Trans. Commun. Technol., vol. COM-22, no. 5, May 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....measurements using a Linux TCPW implementation are also reported in this paper, providing further evidence of the gains achievable via TCPW. 1. Introduction The Transmission Control Protocol (TCP) protocol provides end to end reliable connection oriented service over heterogeneous networks [24]. TCP congestion control was introduced later, after a network collapse due to congestion was experienced in 1986. The congestion control mechanism described in the cornerstone paper [1] which is known as the Tahoe version of TCP congestion control algorithm, introduces two basic mechanisms: ....

V. C. Cerf and 1L E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactions on Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....and Fairness, Wireless Networks. 1. Introduction The Transmission Control Protocol (TCP) which has evolved over time into a number of versions, from TCP Tahoe to the currently widely used TCP NewReno, provides end to end, reliable, congestion controlled connections over the Internet [CK74]. Introduced by Jacobson, the congestion control method devised in TCP Tahoe includes two phases: Slow Start and Congestion Avoidance [Jaco88] In TCP NewReno, recovery from sporadic packet losses is enhanced by Fast Retransmission and Fast Recovery [Jaco90] When three duplicate acknowledgments ....

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactionsion Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....measurements using a Linux TCPW implementation are also reported, providing further evidence of the gains achievable via TCPW. I. INTRODUCTION AND RELATED WORK The Transmission Control Protocol (TCP) protocol provides end to end, reliable, congestion controlled connections over the Internet [1][2] The congestion control method includes two phases: slow start and congestion avoidance [3] Enhanced recovery from sporadic errors is provided by Fast Retransmission and Fast recovery [3] 4] Nowadays, TCP is called upon to provide reliable and efficient data transfer over communication paths ....

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactions on Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....errors are taken into consideration. The analytic model accuracy is confirmed by comparing to simulation results. The results match very well for the range of parameter values of interest. I. INTRODUCTION TCP provides end to end, reliable, congestion controlled connections over the Internet [1]. The congestion control method includes two phases: slow start and congestion avoidance [2] Nowadays, TCP is called upon to provide reliable and efficient data transfer over communication paths with ever increasing bandwidth delay product, and over a variety of link technologies including wired ....

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactions on Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....In our experiments, we found that CRB provides a better compromise between efficiency and friendliness, and the means to manage such a tradeoff. 1. Introduction The Transmission Control Protocol (TCP) protocol provides end to end, reliable, congestion controlled connections over the Internet [CK74]. The congestion control method used originally in TCP Tahoe included two phases: slow start and congestion avoidance [Jaco88] In TCP Reno, recovery from sporadic packet losses is enhanced by Fast Retransmission and Fast Recovery [Jaco90] When three duplicate acknowledgments are received at a ....

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactionsion Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....OSI can provide a useful conceptual model, few real world networks follow it closely due to its complexity. The TCP IP reference model was developed for the US Department of Defense to allow multiple networks to interconnect and to perform reliably even when large portions of a network was damaged [Cerf74]. It assumes the presence of the physical and data link layers, then adds its own internet, transport and application layers. These map very closely to the OSI network, transport and application layers. The TCP IP application layer subsumes the small amount of functionality present in the OSI ....

V. Cerf and R. Kahn. A Protocol for Packet Network Interconnection. IEEE Transactions on Communications, 22, 637-648, May 1974.

....measurements using a Linux TCPW implementation are also reported, providing further evidence of the gains achievable via TCPW. I. INTRODUCTION AND RELATED WORK The Transmission Control Protocol (TCP) protocol provides end to end, reliable, congestion controlled connections over the Internet [1][2] The congestion control method includes two phases: slow start and congestion avoidance [3] Enhanced recovery from sporadic errors is provided by Fast Retransmission and Fast recovery [4] Nowadays, TCP is called upon to provide reliable and efficient data transfer over communication paths ....

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactions on Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

....points in its development. In (a) we see the TCP IP Internet stack at its birth when it consisted of a single network transport protocol (IP TCP) and a few of several applications: ftp (a simple file transfer utility) and telnet (a remote login protocol) We date this at 1974 when Cerf and Kahn [19] published their first TCP IP paper. Then, in (b) we see the next stage of evolution, the separating of IP and TCP into two layers (network and transport) and a new transport protocol (UDP) added for a different type of service to applications. This stage began with a hallway meeting in 1978 [20] ....

Cerf Vint, and Robert Kahn, A Protocol for Packet Network Interconnection, IEEE Transactions of Communications, 1974.

....for html (i.e. Web traffic) and to a somewhat lesser degree, this was seen for Napster like traffic within many networks a few years later. Several other key developments began to take place in the mid 1970s. The initial design specification for TCP published by Vint Cerf and Bob Kahn in 1974 [CerfK]. The NCP protocol which was being utilized at the time, tended to act like a device driver, whereas the future TCP (later TCP IP) would be much more like a communications protocol. As is discussed later, the evolution from ARPANET sNCP protocol to TCP (which in 1978 was split into TCP and IP) was ....

V. G. Cerf and R. E. Kahn, A protocol for packet network interconnection, IEEE Trans. Comm. Tech., vol. COM-22, pp. 627-641, May 1974.

....satisfies most host addressing needs on the Arpanet today. However, some hosts maintain neither a complete nor a current copy of the data base because of limited memory capacity and infrequent processing of updates. In addition, with the expansion of the Arpanet into the internet environment [3, 4], a strong need has arisen for new techniques to augment the distribution of name address information. One method currently being investigated is the dynamic distribution of host address information via a transaction based, inquiry response process called the Name Server [5, 6] To support ....

V. G. Cerf and R. E. Kahn, "A Protocol for Packet Network Interconnection," IEEE Transactions on Communication Technology, Vol. COM-22, pp. 637-641 (1974)._

....protocol a level 2 protocol. This protocol provides sequenced, duplicate suppressed, error free, flow controlled packet communication over arbitrarily interconnected communication networks and is similar in philosophy to the Pup Byte Stream Protocol [2] or the Arpa Transmission Control Protocol [3, 24]. This protocol is implemented as a transducer, which converts the device like Socket interface into a Pilot stream. Thus all data transmission via a network stream is invoked by means of the operations defined in the standard Stream interface. Network streams provide reliable communication, in ....

Cerf, V.G., and Kahn, R.E. A protocol for packet network interconnection. IEEE Trans. Commun. COM-22, 5 (May 1974), 637-- 641.

....services, current and likely future routing hardware features, and how a typical messaging layer bridges the two. 2.1 Communication Services Application programs expect messaging layers to provide a minimal set of communication services. Most messaging layers provide the following services [5, 24, 12]: Message Delivery Message Ordering Deadlock Overflow Safety Reliable Delivery First, the most basic communication service is message delivery. Second, messages between a particular sender and receiver should be delivered in order of transmission. There is some debate about ....

V. Cerf and R. Kahn. A protocol for packet network interconnection. IEEE Transactions on Communications, 1974.

....services, current and likely future routinghardware features, and how a typical messaging layer bridges the two. 2.1 Communication services Application programs typically expect a basic set of communication services from messaging layers. Most messaging layers provide the following services [3, 25, 11, 10]: 1. Message Delivery 2. Message Ordering 3. Deadlock Overflow Safety 4. Reliable Delivery First, the most basic service is data movement from the sender to the receiver. Second, messages between a particular sender and receiver should be delivered in order of transmission. Although not ....

V. Cerf and R. Kahn. A protocol for packet network interconnection. IEEE Transactions on Communications, 1974.

....times are introduced. Section 5 proposes the two variations of the protocol of Section 4 based on a credit and a PAK NAK scheme respectively. 1 Some interesting algorithms that exploit the implicit information provided by ack messages to guarantee FIFO and reliable channels can be found in [7, 11, 22]. 2 Examples of transport layers that use ack messages for data transferring are, among others, TCP, OSI TP4, VTMP and Delta t [13] 2 Model of Distributed Computations 2.1 Distributed System A distributed system is a finite set P of n processes fP 1 ; P 2 ; P n g that communicate ....

....protocols to avoid loss of messages and to ensure FIFO deliveries V T i [j] 1 V T i [j] Gamma 1 V T i [j] message delivered message delayed 3 1 2 0 Figure 6: A causal window CW j i with CP j i = CO j i = 1 and k = 4. over asynchronous and unreliable communication systems (e.g. TCP) [11, 17, 23]. This technique induces a closed loop between sender and receiver which allows not to overload buffer spaces of the receiver and to avoid network congestion by controlling the transmission rate of the sender. So the interest of a causal window lies also in the fact that it could be used as a part ....

V.G. Cerf and R.E. Kahn, "A Protocol for Packet Network Interconnection", IEEE Trans. on Communications, vol. C22, no. 5, 1974.

....messages to different levels of memory hierarchy, the DImulticomputer can achieve both low latency response for short messages and high bandwidth transfers for long messages. Several systems use dynamic allocation of communication resources when their efficient utilization is at a premium [1]. Applying network based dynamic interconnection to low level interconnection has been discussed in the fine grain multicomputer community for some time. Seitz was the first to describe the dynamic interconnection idea in print and observe some of its advantages such as the higher signaling speed ....

V. Cerf and R. Kahn. A protocol for packet network interconnection. IEEE Transactions on Communications, 1974.

....transfer is a function provided, in some networks (e.g. Advanced Peer to Peer Networking built on SNA [DDKMRW90, Tan89] by the data link layer, this protocol is applicable to data link layer as well. Examples of algorithms that adopt acks to ensure FIFO and reliable channels can be found in [BSW69, Ste76, CK74, Tan89]. In Section 2 the general model of a distributed computation, the concept of causal relation among events, vector times and causal ordering on deliveries are introduced. Moreover, in Section 2.6, the concept of vector times window is introduced. Section 3 presents a causal broadcasting protocol ....

....acks. So the send condition SC 1 can be extented as follows: for any pair sequence of ct 1 broadcast messages m i ; m i ct sent by the same process P i we have: fully:ack(m i ) OE i broadcast(m i ct ) SC ct (m i ; m i ct ) The number ct is called the credit associated with the sender [CK74, Ray87, Tan89]. Credits reduce the number of synchronization in the send condition, but increase the width of the vector times window. Indeed as shown in Figure 8.a, upon the arrival of a message m sent by P j , there could be at most ct consecutive messages m 1 : m ct sent by P k that causally precede m ....

V.G. Cerf and R.E. Kahn. A protocol for packet network interconnection. IEEE Transaction on Communications, C22(5), 1974.

....it is limited to a single technology cellular telephony. Since its inception in the early 1970s, one of the most important guiding principles of the Internet has been to seek general purpose solutions that work for all network technologies, not special purpose hardware specific solutions [Cer74]. Similarly, mobility solutions that require widespread changes at layers above IP would be highly impractical. The challenge for supporting mobility at the IP layer is handling address changes. Even if the IP address of a mobile host s network interface changes when it moves from one network to ....

V.G. Cerf and R.E. Kahn. A Protocol for Packet Network Interconnection. IEEE Trans. on Communications, Vol 22, No. 5, May 1974, pp. 637648.

....that the latency due to packet processing is small compared to memory access latency. 8 Discussion and Related Work Dynamic allocation of communication resources is not a new idea. Several systems use dynamic allocation of communication resources when their efficient utilization is at a premium [6, 27]. Applying network based dynamic interconnection to low level interconnection has been discussed in the fine grain multicomputer community for some time. Seitz was the first to describe the dynamic interconnection idea in print and observe some of its advantages such as the higher signaling speed ....

Cerf, V., and Kahn, R. A protocol for packet network interconnection. IEEE Transactions on Communications, 1974.

....Networks, Packet size, Routing. I. INTRODUCTION The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet size limitations along the packet s route. The problem arose when network interconnection was first considered[1]. It was then realized that packets traversing an internetwork may have to undergo fragmentation if the packet size and the allowable packet sizes along the internetwork route do not match. With the recent advances of network interconnection [2] the problem becomes ever more prominent. Packet ....

V.G. Cerf and R.E. Kahn, "A Protocol for Packet Network Interconnection," IEEE Trans. on Communications COM-22(5) pp. 637-648 (May 1974).

No context found.

Cerf V., and R. Kahn, "A Protocol for Packet Network Interconnection", IEEE Trans. on Communications, Vol. COM-22, No. 5, pp. 637-648, May 1974.

....about interfacing to existing operating systems. So, armed with Kahn s architectural approach to communications and with Cerf s NCP experience, these two teamed up to spell out the details of what became the Transmission Control Protocol Internet Protocol (TCP IP) The original Cerf Kahn paper [1] on the Internet described a protocol, called TCP, providing all the Internet s transport and forwarding services. Kahn had intended that TCP would support a range of transport services from the totally reliable sequenced delivery of data (virtual circuit model) to a datagram service in which ....

Cerf, V.G., and Kahn, R.E. A protocol for packet network interconnection. IEEE Trans. Comm. Tech 5 (May 1974), 627--641.

....led to the development of Ethernet local area networks [METCALFE 76] The successful implementation of packet radio and packet satellite technology raised the question of interconnecting ARPANET with other types of packet nets. A possible solution to this problem was proposed by Cerf and Kahn [CERF 74] in the form of an internetwork protocol and a set of gateways to connect the different networks. This solution was further developed as part of a research program in internetting sponsored by DARPA and resulted in a collection of computer communications protocols based on the original ....

Cerf V., and R. Kahn, "A Protocol for Packet Network Interconnection", IEEE Trans. on Communications, Vol. COM-22, No. 5, pp. 637-648, May 1974.

No context found.

V. Cerf and R. Kahn, "A protocol for packet network interconnection," IEEE Trans. Commun. Technol., vol. COM-22, no. 5, May 1974.

No context found.

V. C. Cerf and R. E. Kahn, "A Protocol for Packet Network Interconnections", IEEE Transaction on Communications, Vol. COM-22, No. 5, May 1974.

No context found.

V. Cerf and R. Kahn. A Protocol for Packet Network Interconnection. IEEE trans. on commun. vol COMM-22, 1974.

No context found.

V. Cerf and L. Kahn. A Protocol for packet Network Interconnections. IEEE Transactions on Communications, (5), 1974.

No context found.

V. Cerf and R. Kahn, "A protocol for packet network interconnection," IEEE Transactions on Communications Technology, vol. COM-22, no. 5, pp. 627--641.

No context found.

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactionsion Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

No context found.

Cerf, V., and Kahn, R., "A Protocol for Packet Network Interconnection", IEEE Trans. Comm., May 1974.

No context found.

V. Cerf and L. Kahn. A Protocol for packet Network Interconnections. IEEE Transactions on Communications, (5), 1974.

No context found.

V. C. Cerf and R. E. Kahn, "A Protocol for packet Network Interconnections," IEEE Transactionsion Communications, vol. COM-22, no. 5, pp. 637-648, May 1974.

No context found.

CERF74 Cerf, V.G., and Kahn R., "A Protocol for Packet Network Interconnection", IEEE Transactions on Communications , Vol. COM-22, No. 5, pp. 637-648, May 1974.

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