Abstract
The flow control algorithms currently used in the Internet have been tailored to share bandwidth between users on the basis of the physical characteristics of the network links they use rather than the characteristics of their applications. This can result in a perception of poor quality of service by some users even when adequate bandwidth is potentially available, and is the motivation for seeking to provide differentiated services. In this paper, stimulated by current discussion on Web mice and elephants, we explore service differentiation between persistent and short-lived flows, and between file transfers of different sizes. In particular, we seek to achieve this using decentralized algorithms that can be implemented by end-systems without requiring the support of a complex network architecture. The algorithms we propose correspond to a form of weighted processor sharing and can be tailored to approximate the shortest remaining processing time service discipline.
Chapter PDF
Similar content being viewed by others
Keywords
References
N. Bansal and M. Harchol-Balter, “Analysis of SRPT scheduling: investigating unfairness”, Proc. ACM Sigmetrics, 2001.
C. Barakat and E. Altman, “Performance of Short TCP Transfers”, Proc. Networking, Paris, 2000.
Y. Bhumralkar, J. Lung and P. Varaiya, “Network Adaptive TCP Slow Start”, 2000. http://www.path.berkeley.edu/~varaiya/papers_ps.dir/jeng.pdf
T. Bonald and L. Massoulié “Impact of fairness on Internet performance”, Proc. ACM Sigmetrics, 2001.
D. D. Clark and W. Fang, “Explicit Allocation of Best-Effort Packet Delivery Service”, IEEE/ACM Trans. Networking, 6(4): 362–373, 1998.
M. E. Crovella and A. Bestavros, “Self-similarity in World Wide Web traffic: Evidence and possible causes”, IEEE/ACM Trans. Networking, 5(6): 835–846, 1997.
G. de Veciana, “Enhancing Both Network and User Performance Metrics for Networks Supporting Best Effort Traffic”, Thirty-Ninth Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Illinois, 2001.
S. Deb, A. Ganesh and P. Key, “Resource allocation with persistent and transient flows”, Microsoft Research Technical Report, 2001. http://research.microsoft.com/scripts/pubs/view.asp?TR_ID=MSR-TR-2001-114
R. J. Gibbens and F. P. Kelly, “Resource pricing and the evolution of congestion control”, Automatica, 35: 1969–1985, 1999.
L. Guo and I. Matta, “The war between mice and elephants”, Technical Report, Boston University, BU-CS-2001-0005, 2001.
T. Hammann and J. Walrand “A new fair algorithm for ECN-capable TCP”, Proc. Infocom, 2000.
M. Harchol-Balter, M. Crovella and S. Park, “The case for SRPT scheduling in Web servers”, Technical Report, MIT-LCS-TR-767, 1998.
F. P. Kelly, Reversibility and Stochastic Networks, John Wiley and Sons, New York, 1979.
F. P. Kelly, A. Maulloo and D. Tan, “Rate control in communication networks: shadow prices, proportional fairness and stability”, J. Oper. Res. Soc., 49: 237–252, 1998.
P. Key and L. Massoulié “User policies in a network implementing congestion pricing”, Workshop on Internet Service Quality Economics (ISQE), 1999.
R. J. La and V. Anantharam, “Charge-sensitive TCP and rate control in the Internet”, Proc. Infocom, 2000.
S. H. Low and D.E. Lapsley, “Optimization flow control — I: Basic algorithm and convergence”, IEEE/ACM Transactions on Networking, 7: 861–875, 1999.
J. Mo and J. Walrand, “Fair end-to-end window-based congestion control”, IEEE/ACM Trans. Networking, 8(5): 556–567, 2000.
S. Yilmaz and I. Matta, “On class based isolation of UDP, short lived and long lived flows”, Proc. Ninth Intl. Symp. Modeling, Analysis And Simulation of Computer And Telecommunication Systems, Cincinnati, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deb, S., Ganesh, A., Key, P. (2002). Resource Allocation with Persistent and Transient Flows. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_36
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive