On performance bounds for the integration of elastic and adaptive streaming flows

ABSTRACT

We consider a network model where bandwidth is fairly shared by a dynamic number of elastic and adaptive streaming flows. Elastic flows correspond to data transfers while adaptive streaming flows correspond to audio/video applications with variable rate codecs. In particular, the former are characterized by a fixed size (in bits) while the latter are characterized by a fixed duration. This flow-level model turns out to be intractable in general. In this paper, we give performance bounds for both elastic and streaming traffic by means of sample-path arguments. These bounds present the practical interest of being insensitive to traffic characteristics like the distributions of elastic flow size and streaming flow duration.

REFERENCES

• 1: N. Argiriou, L. Georgiadis, Channel Sharing by Rate-Adaptive Streaming Applications, in: Proc. of IEEE Infocom, 2002.
• 2: Deepak Bansal , Hari Balakrishnan , Sally Floyd , Scott Shenker, Dynamic behavior of slowly-responsive congestion control algorithms, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.263-274, August 2001, San Diego, California, United States
• 3: S. Ben Fred , T. Bonald , A. Proutiere , G. Régnié , J. W. Roberts, Statistical bandwidth sharing: a study of congestion at flow level, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.111-122, August 2001, San Diego, California, United States
• 4: Thomas Bonald , Laurent Massoulié, Impact of fairness on Internet performance, Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.82-91, June 2001, Cambridge, Massachusetts, United States
• 5: T. Bonald , A. Proutière, Insensitivity in processor-sharing networks, Performance Evaluation, v.49 n.1-4, p.193-209, September 2002 [doi>10.1016/S0166-5316(02)00110-4]
• 6: T. Bonald , A. Proutière, Insensitive Bandwidth Sharing in Data Networks, Queueing Systems: Theory and Applications, v.44 n.1, p.69-100, May 2003 [doi>10.1023/A:1024094807532]
• 7: T. Bonald , A. Proutière, On Stochastic Bounds for Monotonic Processor Sharing Networks, Queueing Systems: Theory and Applications, v.47 n.1-2, p.81-106, May-June 2004 [doi>10.1023/B:QUES.0000032802.41986.c6]
• 8: T. Bonald , J. W. Roberts, Congestion at flow level and the impact of user behaviour, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.42 n.4, p.521-536, 15 July 2003 [doi>10.1016/S1389-1286(03)00200-7]
• 9: T. Bonald , A. Proutière, On performance bounds for balanced fairness, Performance Evaluation, v.55 n.1-2, p.25-50, January 2004 [doi>10.1016/S0166-5316(03)00100-7]
• 10: F. Delcoigne , A. Proutière , G. Régnié, Modeling integration of streaming and data traffic, Performance Evaluation, v.55 n.3-4, p.185-209, February 2004 [doi>10.1016/S0166-5316(03)00115-9]
• 11: Rushabh Doshi , Pei Cao, Streaming Traffic Fairness Over Low Bandwidth WAN Links, Proceedings of the The Third IEEE Workshop on Internet Applications, p.30, June 23-24, 2003
• 12: Sally Floyd , Kevin Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Transactions on Networking (TON), v.7 n.4, p.458-472, Aug. 1999 [doi>10.1109/90.793002]
• 13: F. Guillemin, P. Robert and B. Zwart, Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks, in: Proc. of IEEE Infocom, 2003.
• 14: J. Heinanen, F. Baker, W. Weiss and J. Wroclawski, Assured Forwarding PHB, IETF RFC 2597, 1999.
• 15: V. Jacobson, K. Nichols and K. Poduri, An Expedited Forwarding PHB, IETF RFC 2598, 1999.
• 16: F. Kelly, R. Williams, Fluid model for a network operating under a fair bandwidth-sharing policy, to appear in Annals of Applied Probability, 2003.
• 17: P. Key, L. Massoulié, A. Bain and F. Kelly, A network flow model for mixtures of file transfers and streaming traffic, in: Proc. of ITC 18, 2003.
• 18: A.A. Kherani and A. Kumar, Stochastic Models for Throughput Analysis of Randomly Arriving Elastic Flows in the Internet, in: Proc. of IEEE Infocom, 2002.
• 19: L. Massoulié and J.W. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecommunication Systems 15 (2000) 185--201.
• 20: R. Núñez-Queija, Sojourn times in a processor sharing queue with service interruptions, Queueing Systems: Theory and Applications, v.34 n.1-4, p.351-386, 2000 [doi>10.1023/A:1019173523289]
• 21: R.F. Serfozo, Introduction to Stochastic Networks, Springer Verlag, 1999.
• 22: V. Timonen, Simulation studies on performance of balanced fairness, Research Report 6/2003, Helsinki University of Technology, Networking Laboratory, 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Queueing theory

General Terms:
Performance

Keywords:
adaptive streaming traffic, elastic traffic, flow-level analysis, insensitive bounds, multi-service network