NETBLT: a high throughput transport protocol
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Online computation and competitive analysis
Online computation and competitive analysis
Feedback-Free Multicast Prefix Protocols
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
A Modular Analysis of Network Transmission Protocols
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Maximizing throughput of reliable bulk network transmissions
Maximizing throughput of reliable bulk network transmissions
| Hi-index | 0.89 |
Transmission protocols like TCP are usually divided into a time scheduling and a data selection policy. We consider on-line algorithms of data selection policies for any time scheduling policy and any routing behavior in a network. For the model introduced by Adler et al. [Proc. 5th Israel Symp. on Theory of Computing Systems, 1997, pp. 64-72], we improve both the lower and the upper bound on the competitive ratio making them asymptotically tight. Furthermore, we present a lower bound that depends on the size of the buffers that are available both to the sender and to the receiver. We obtain a constant lower bound for the competitive ratio for constant buffer size.