Skip to main content
Log in

A packet-switched network with On/Off sources and a fair bandwidth sharing policy: state space collapse and heavy-traffic

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We consider a flow-level model for packet-switched telecommunications networks handling elastic flows with concurrent occupancy of resources, in which digital objects are transferred at a rate determined by capacity allocation on each route. The capacity of each node is dynamically allocated to the routes passing by it through a weighted proportional fair sharing policy, and the arrival request for transfer on each route is generated by N heavy-tailed On/Off sources. Under heavy-traffic, we combine state space collapse (SSC) and an Invariance Principle to show that when \(N\rightarrow +\infty \) the conveniently scaled workload and flow count processes converge. SSC establishes a relationship between the corresponding limits by means of a deterministic operator. In Theorem 1 we prove that assuming the other hypotheses hold, SSC is not only sufficient for the convergence, but necessary. In Theorem 2 we prove that when \(r\rightarrow +\infty \), r being a scale parameter, the workload limit process converges to a reflected fractional Brownian motion on a polyhedral cone.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Billingsley, P. (1968). Convergence of probability measures. New York: Wiley.

    Google Scholar 

  2. Bonald, T., & Massoulié, L. (2001). Impact of fairness on internet performance. ACM Sigmatrics Performance Evaluation Review, 29, 82–91.

    Article  Google Scholar 

  3. Dai, J. G., & Williams, R. J. (1995). Existence and uniqueness of semimartingale reflecting Brownian motions in convex polytopes. Theory of Probability and Its Applications, 40(1), 3–53.

    Google Scholar 

  4. De Veciana, G., Lee, T. J., & Konstantopoulos, T. (2001). Stability and performance analysis of networks supporting elastic services. IEEE/ACM Transactions on Networking, 9, 2–14.

    Article  Google Scholar 

  5. Debicki, K., & Mandjes, M. (2004). Traffic with an fBm limit: Convergence of the stationary workload process. Queueing Systems, 46, 113–127.

    Article  Google Scholar 

  6. Delgado, R. (2007). A reflected fBm limit for fluid models with ON/OFF sources under heavy traffic. Stochastic Processes and Their Applications, 117, 188–201.

    Article  Google Scholar 

  7. Delgado, R. (2008). State space collapse for asymptotically critical multi-class fluid networks. Queueing Systems, 59, 157–184.

    Article  Google Scholar 

  8. Delgado, R. (2013). Heavy-traffic limit for a feed-forward fluid model with heterogeneous heavy-tailed On/Off sources. Queueing Systems, 74(1), 41–63.

    Article  Google Scholar 

  9. Dupuis, P., & Ishii, H. (1991). On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications. Stochastics, 35, 31–62.

    Google Scholar 

  10. Dupuis, P., & Ramanan, K. (1999). Convex duality and the Skorokhod problem I. Probability Theory and Related Fields, 115, 153–195.

    Article  Google Scholar 

  11. Dupuis, P., & Ramanan, K. (1999). Convex duality and the Skorokhod problem II. Probability Theory and Related Fields, 115, 197–236.

    Article  Google Scholar 

  12. Ethier, S. N., & Kurtz, T. G. (1986). Markov processes: Characterization and convergence. New York: Wiley.

    Book  Google Scholar 

  13. Jagannathan, K., Markakis, M., Modiano, E., & Tsitsiklis, J. N. (2012). Queue-length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic. IEEE/ACM Transactions on Networking, 20(4), 1096–1111.

    Article  Google Scholar 

  14. Kang, W. N., Kelly, F. P., Lee, N. H., & Williams, R. J. (2009). State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. The Annals of Applied Probability, 19(5), 1719–1780.

    Article  Google Scholar 

  15. Kang, W. N., & Williams, R. J. (2007). An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries. The Annals of Applied Probability, 17, 741–779.

    Article  Google Scholar 

  16. Kelly, F. P., & Williams, R. J. (2004). Fluid model for a network operating under a fair bandwidth-sharing policy. The Annals of Applied Probability, 14(3), 1055–1083.

  17. Konstantopoulos, T., & Lin, S. J. (1996). Fractional Brownian approximations of stochastic networks. Stochastic Networks, Stability and Rare Events, Lecture Notes in Statistics, 117, 257–274.

    Google Scholar 

  18. Markakis, M. G., Modiano, E., & Tsitsiklis, J. N. (2014). Max-weight sheduling in queueing networks with heavy-tailed traffic. IEEE/ACM Transactions on networking, 22(1), 257–270.

    Article  Google Scholar 

  19. Massoulié, L., & Roberts, J. (2000). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15, 185–201.

    Article  Google Scholar 

  20. Mo, J., & Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8, 556–567.

    Article  Google Scholar 

  21. Perry, O., & Whitt, W. (2013). A fluid limit for an overloaded X model via a stochastic averaging principle. Mathematics of Operations Research, 38(2), 294–349.

  22. Perry, O., & Whitt, W. (2014). Diffusion approximation for an overloaded X model via a stochastic averaging principle. Queueing System, 76, 347–401.

    Article  Google Scholar 

  23. Peterson, W. P. (1991). Diffusion approximations for networks of queues with multiple customers types. Mathematics of Operations Research, 16, 90–118.

    Article  Google Scholar 

  24. Reiman, M. I. (1984). Some diffusion approximations with state space collapse. In F. Baccelli & G. Fayolle (Eds.), Proceedings of the international seminar on modeling and performance evaluation methodology, Lecture notes in control and information sciences (pp. 209–240). New York: Springer.

    Google Scholar 

  25. Shah, D., & Wischik, D. (2012). Switched networks with maximum weight police: Fluid approximation and multiplicative state space collapse. The Annals of Applied Probability, 22(1), 70–127.

    Article  Google Scholar 

  26. Taqqu, M. S., Willinger, W., & Sherman, R. (1997). Proof of a fundamental result in self-similar traffic modeling. Computer Communication Review, 27, 5–23.

    Article  Google Scholar 

  27. Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37, 1936–1948.

    Article  Google Scholar 

  28. Whitt, W. (1971). Weak convergence theorems for priority queues: Preemptive resume discipline. Journal of Applied Probability, 8, 74–94.

    Article  Google Scholar 

  29. Whitt, W. (2002). Stochastic-process limits: An introduction to stochastic-process limits and their applications to queues. Springer series in operations research. New York: Springer.

    Google Scholar 

  30. Williams, R. J. (1998). Diffusion approximations for open multi-class queueing networks: Sufficient conditions involving state space collapse. Queueing Systems, 30, 27–88.

    Article  Google Scholar 

Download references

Acknowledgments

The author wishes to thank the anonymous referees for reading and helpful comments that resulted in an overall improvement of the readability of the paper. The research of the author is supported by the Ministerio de Economía y Competitividad (MEC) of Spain and ERDF (European Regional Development Found) “A way to build Europe” through project MTM2012-33937.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rosario Delgado.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Delgado, R. A packet-switched network with On/Off sources and a fair bandwidth sharing policy: state space collapse and heavy-traffic. Telecommun Syst 62, 461–479 (2016). https://doi.org/10.1007/s11235-015-0086-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-015-0086-6

Keywords

Mathematics Subject Classification

Navigation