Results 1 - 10 of 3,178

I-TCP: Indirect TCP for mobile hosts

by Ajay Bakre, B. R. Badrinath , 1995
"... Abstract — IP-based solutions to accommodate mobile hosts within existing internetworks do not address the distinctive features of wireless mobile computing. IP-based transport protocols thus suffer from poor performance when a mobile host communicates with a host on the fixed network. This is cause ..."
Abstract - Cited by 614 (7 self) - Add to MetaCart
. This is caused by frequent disruptions in network layer connectivity due to — i) mobility and ii) unreliable nature of the wireless link. We describe the design and implementation of I-TCP, which is an indirect transport layer protocol for mobile hosts. I-TCP utilizes the resources of Mobility Support Routers

Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic

by Lixia Zhang, Scott Shenker, David D. Clark - In Proceedings of ACM SIGCOMM , 1991
"... We use simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation. We investigate the simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link. This work is an extension of ..."
Abstract - Cited by 383 (6 self) - Add to MetaCart
We use simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation. We investigate the simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link. This work is an extension

TCP and Explicit Congestion Notification

by Sally Floyd - In: ACM Computer Communication Review, V. 24 N , 1994
"... This paper discusses the use of Explicit Congestion Notification (ECN) mechanisms in the TCP/IP protocol. The first part proposes new guidelines for TCP’s response to ECN mechanisms (e.g., Source Quench packets, ECN fields in packet headers). Next, using simulations, we explore the benefits and draw ..."
Abstract - Cited by 636 (13 self) - Add to MetaCart
granularity of the TCP clock. The paper also discusses some implementation issues concerning specific ECN mechanisms in TCP/IP networks.

TCP Vegas: New techniques for congestion detection and avoidance

by Lawrence S. Brakmo, Sean W. O’malley, Larry L. Peterson - In SIGCOMM , 1994
"... Vegas is a new implementation of TCP that achieves between 40 and 70 % better throughput, with one-fifth to onehalf the losses, as compared to the implementation of TCP in the Reno distributionof BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents th ..."
Abstract - Cited by 600 (3 self) - Add to MetaCart
Vegas is a new implementation of TCP that achieves between 40 and 70 % better throughput, with one-fifth to onehalf the losses, as compared to the implementation of TCP in the Reno distributionof BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents

The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm

by Matthew Mathis, Jeffrey Semke, Jamshid Mahdavi, Teunis Ott , 1997
"... In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and alw ..."
Abstract - Cited by 652 (18 self) - Add to MetaCart
and always has sufficient receiver window and sender data. The model predicts the Congestion Avoidance performance of nearly all TCP implementations under restricted conditions and of TCP with SelectiveAcknowledgements over a much wider range of Internet conditions. We verify

TCP Vegas: End to End Congestion Avoidance on a Global Internet

by Lawrence S. Brakmo, Larry L. Peterson , 2006
"... Vegas is an implementation of TCP that achieves between 37 and 71 % better throughput on the Internet, with one-fifth to one-half the losses, as compared to the implementation of TCP in the Reno distribution of BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, ..."
Abstract - Cited by 522 (5 self) - Add to MetaCart
Vegas is an implementation of TCP that achieves between 37 and 71 % better throughput on the Internet, with one-fifth to one-half the losses, as compared to the implementation of TCP in the Reno distribution of BSD Unix. This paper motivates and describes the three key techniques employed by Vegas

Improving TCP/IP performance over wireless networks

by Hari Balakrishnan, Srinivasan Seshan, Elan Amir, Randy H. Katz - IN PROCEEDINGS, 1ST ACM CONF. ON MOBILE COMPUTING AND NETWORKING , 1995
"... TCP is a reliable transport protocol tuned to perform well in traditional networks made up of links with low bit-error rates. Networks with higher bit-error rates, such as those with wireless links and mobile hosts, violate many of the assumptions made by TCP, causing degraded end-to-end performance ..."
Abstract - Cited by 433 (18 self) - Add to MetaCart
-to-end performance. In tbis paper, we describe the design and implementation of a simple protocol, called the snoop protocol, that improves TCP performance in wireless networks. The protocol modifies network-layer software mainly at a base station and preserves end-to-end TCP semantics. The main idea of the protocol

Vogels, U-Net: a user-level network interface for parallel and distributed computing, in:

by Anindya Basu , Vineet Buch , Werner Vogels , Thorsten Von Eicken - Proceedings of the 15th ACM Symposium on Operating System Principles, ACM, , 1995
"... Abstract The U-Net communication architecture provides processes with a virtual view of a network device to enable user-level access to high-speed communication devices. The architecture, implemented on standard workstations using off-the-shelf ATM communication hardware, removes the kernel from th ..."
Abstract - Cited by 597 (17 self) - Add to MetaCart
, as well as novel abstractions like Active Message can be implemented efficiently. A U-Net prototype on an 8-node ATM cluster of standard workstations achieves 15Mbytes/s TCP bandwidth with 1Kbyte buffers and demonstrates performance equivalent to Meiko CS-2 and TMC CM-5 supercomputers on a set of Split

Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web

by David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy - IN PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC , 1997
"... We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and ..."
Abstract - Cited by 699 (10 self) - Add to MetaCart
, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. lNTRODucTION I N high
Results 1 - 10 of 3,178