Abstract
We represent a data network as a set of links shared by a dynamic number of competing flows. These flows are generated within sessions and correspond to the transfer of a random volume of data on a pre-defined network route. The evolution of the stochastic process describing the number of flows on all routes, which determines the performance of the data transfers, depends on how link capacity is allocated between competing flows. We use some key properties of Whittle queueing networks to characterize the class of allocations which are insensitive in the sense that the stationary distribution of this stochastic process does not depend on any traffic characteristics (session structure, data volume distribution) except the traffic intensity on each route. We show in particular that this insensitivity property does not hold in general for well-known allocations such as max-min fairness or proportional fairness. These results are ilustrated by several examples on a number of network topologies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Baccelli and P. Brémaud, Palm-Martingale Calculus and Stochastic Recurrences (Springer, Berlin, 1994).
S. Ben Fredj, T. Bonald, A. Proutière, G. Regnié and J.W. Roberts, Statistical bandwidth sharing: A study of congestion at flow level, in: Proc of ACM SIGCOMM 2001.
D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall, Englewood Cliffs, NJ, 1987).
S. Blake et al., An architecture for differentiated services, RFC 2475, IETF (1998).
T. Bonald and L. Massoulié, Impact of fairness on Internet performance, in: Proc. of ACM SIGMETRICS 2001.
T. Bonald and A. Proutière, Insensitivity in processor-sharing networks, in: Proc. of IFIP PERFORMANCE, 2002.
T. Bonald, A. Proutière, G. Régnié and J.W. Roberts, Insensitivity results in statistical bandwidth sharing, in: Proc. of 17th ITC, 2001.
M. Crovella and A. Bestravos, Self-similarity inWWWtraffic: Evidence and possible cause, in: Proc. of ACM SIGMETRICS, 1996.
G. De Veciana, T.J. Lee and T. Konstantopoulos, Stability and performance analysis of networks supporting services with rate control – Could the Internet be unstable, in: Proc. of IEEE INFOCOM, 1999.
A.K. Erlang, Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges, Elektroteknikeren 13 (1917).
G. Fayolle, A. de la Fortelle, J.-M. Lasgouttes, L. Massoulié and J.W. Roberts, Best-effort networks: Modeling and performance analysis via large networks asymptotics, in: Proc. of IEEE INFOCOM, 2001.
G. Fayolle, I. Mitrani and R. lasnogorodski, Sharing a processor among many classes, J. ACM 27 (1980) 519–532.
V. Jacobson, Congestion avoidance and control, in: Proc. of ACM SIGCOMM, 1988.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
F.P. Kelly, Mathematical modelling of the Internet, in: Mathematics Unlimited – 2001 and beyond, eds. B. Engquist and W. Schmid (Springer, Berlin, 2001) pp. 685–702.
F.P. Kelly, A. Maulloo and D. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, J. Oper. Res. Soc. 49 (1998).
S. Kunniyur and R. Srikant, End-to-end congestion control schemes: Utility functions, random losses and ECN marks, in: Proc. of IEEE INFOCOM, 2000.
R.J. La and V. Anantharam, Charge-sensitive TCP and rate control in the Internet, in: Proc. of IEEE INFOCOM, 2000.
L. Massoulié, Stability of distributed congestion control with heterogeneous feedback delays, IEEE Trans. Automat. Control 47(6) (2002) 895–902.
L. Massoulié and J.W. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecommunication Systems 15 (2000) 185–201.
L. Massoulié and J.W. Roberts, Bandwidth sharing: Objectives and algorithms, IEEE/ACM Trans. Networking 10(3) (2002) 320–328.
M. Miyazawa, R. Schassberger and V. Schmidt, On the structure of an insensitive generalized semi-Markov process with reallocation and with point-process input, Adv. in Appl. Probab. 27 (1995) 203–225.
J. Mo and J. Walrand, Fair end-to-end window-based congestion control, IEEE/ACMTrans. Networking 8(5) (2000) 556–567.
V. Paxson and S. Floyd, Difficulties in simulating the Internet, IEEE/ACM Trans. Networking 9(4) (2001) 392–403.
R.F. Serfozo, Introduction to Stochastic Networks (Springer, Berlin, 1999).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bonald, T., Proutière, A. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems 44, 69–100 (2003). https://doi.org/10.1023/A:1024094807532
Issue Date:
DOI: https://doi.org/10.1023/A:1024094807532