skip to main content
10.1145/3209582.3209603acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

On the Delays in Time-Varying Networks: Does Larger Service-Rate Variance Imply Larger Delays?

Published:26 June 2018Publication History

ABSTRACT

In all networks, link or route capacities fluctuate for multiple reasons, e.g., fading and multi-path effects on wireless channels, interference and contending users on a shared medium, varying loads in WAN routers, impedance changes on power-line channels. These fluctuations severely impact packet delays. In this paper, we study delays in time-varying networks. Intuitively, we expect that for a given average service rate, an increased service rate variability yields larger delays. We find that this is not always the case. Using a queuing model that includes time-varying service rates, we show that for certain arrival rates, a queue with larger service rate variance offers smaller average delays than a queue with the same average service rate and lower service rate variance. We also verify these findings on a wireless testbed. We then study the conditions under which using simultaneously two independent paths helps in terms of delays, for example, in hybrid networks where the two paths use different physical layer technologies. We show that using two paths is not always better, in particular for low arrival rates. We also show that the optimal traffic splitting between the two paths depends on the arrival rate.

References

  1. https://multipath-tcp.org/pmwiki.php/Users/OpenWRT.Google ScholarGoogle Scholar
  2. https://wiki.openwrt.org/doc/networking/praxis.Google ScholarGoogle Scholar
  3. IEEE 1905.1-2013 Standard for Heterogeneous Technologies. 2013.Google ScholarGoogle Scholar
  4. IMT-Vision - Framework and overall objectives of the future development of IMT for 2020 and beyond. Recommendation ITU-R, 2015.Google ScholarGoogle Scholar
  5. I. J.-B. F. Adan and V. G. Kulkarni. Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times. Queueing Systems, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. O. T. Akgun, R. Righter, and R. Wolff. Multiple-server System with Flexible Arrivals. Advances in Applied Probability, 2011.Google ScholarGoogle Scholar
  7. C.-S. Chang, X. Chao, and M. Pinedo. A Note on Queues with Bernoulli Routing. In IEEE CDC, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  8. Y.-C. Chen, Y.-s. Lim, R.J. Gibbens, E. M. Nahum, R. Khalili, and D. Towsley. A Measurement-based Study of Multipath TCP Performance over Wireless Networks. In ACM IMC, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Y.-C. Chen and D. Towsley. On Bufferbloat and Delay Analysis of Multipath TCP in Wireless Networks. In IFIP Networking, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  10. A. B. Clarke. A Waiting Line Process of Markov Type. The Annals of Mathematical Statistics, 1956.Google ScholarGoogle ScholarCross RefCross Ref
  11. A. Frömmgen, T. Erbshäußer, Buchmann, T. Zimmermann, and K. Wehrle. ReMP TCP: Low Latency Multipath TCP. In IEEE ICC, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  12. K. Gardner, M. Harchol-Balter, A. Scheller-Wolf, M. Velednitsky, and S. Zbarsky. Redundancy-d: The Power of d Choices for Redundancy. Operations Research, 2017.Google ScholarGoogle Scholar
  13. V. Gupta, M. Harchol-Balter, A. Wolf, and U. Yechiali. Fundamental Characteristics of Queues with Fluctuating Load. In ACM Sigmetrics, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. F. A. Haight. Two Queues in Parallel. Biometrika, 1958.Google ScholarGoogle Scholar
  15. P. G. Harrison and H. Zatschler. Sojourn time distributions in modulated g-queues with batch processing. In IEEE QEST, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Heyman. On Ross's Conjectures about Queues with Non-stationary Poisson Arrivals. Journal of Applied Probability, 1982.Google ScholarGoogle Scholar
  17. E. Hyytiä. Optimal Routing of Fixed Size Jobs to Two Parallel Servers. INFOR: Information Systems and Operational Research, 2013.Google ScholarGoogle Scholar
  18. A. Izagirre and A. M. Makowski. Light traffic performance under the power of two load balancing strategy: The case of server heterogeneity. ACM Sigmetrics Performance Evaluation Review, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek. The Click Modular Router. ACM TOCS, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. F. Kurose and K. W. Ross. Computer Networking: A Top-down Approach. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Lambert, B. Van Houdt, and C. Blondia. Queues with Correlated Service and Inter-Arrival Times and Their Application to Optical Buffers. Stochastic Models, 2006.Google ScholarGoogle Scholar
  22. R. L. Larsen. Control of Multiple Exponential Servers with Application to Computer Systems. PhD thesis, University of Maryland, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. L. Liyanage and J. Shanthikumar. Second-order Properties of Single-stage Queueing Systems. Oxford Statistical Science Series, 1992.Google ScholarGoogle Scholar
  24. S. R. Mahabhashyam and N. Gautam. On Queues with Markov Modulated Service Rates. Queueing Systems, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. C. Mitchell, A. Paulson, and C. Beswick. The Effect of Correlated Exponential Service Times on Single Server Tandem Queues. Naval Research Logistics, 1977.Google ScholarGoogle ScholarCross RefCross Ref
  26. M. F. Neuts. The M/M/1 Queue with Randomly Varying Arrival and Service Rates. PhD thesis, Delaware University, 1977.Google ScholarGoogle Scholar
  27. C. Raiciu, C. Paasch, S. Barre, A. Ford, M. Honda, F. Duchene, O. Bonaventure, and M. Handley. How Hard Can It Be? Designing and Implementing a Deployable Multipath TCP. In USENIX NSDI, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. T. Rolski. Queues with Non-stationary Input Stream: Ross's Conjecture. Advances in Applied Probability, 1981.Google ScholarGoogle Scholar
  29. S. M. Ross. Average Delay in Queues with Non-stationary Poisson Arrivals. Journal of Applied Probability, 1978.Google ScholarGoogle Scholar
  30. C. Vlachou, S. Henri, and P. Thiran. Electri-Fi Your Data: Measuring and Combining PLC with WiFi. In ACM IMC, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. W. Winston. Optimality of the Shortest Line Discipline. Journal of Applied Probability, 1977.Google ScholarGoogle Scholar
  32. U. Yechiali and P. Naor. Queuing Problems with Heterogeneous Arrivals and Service. Operations Research, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. K. Yedugundla, S. Ferlin, T. Dreibholz, Ö. Alay, N. Kuhn, P. Hurtig, and A. Brunstrom. Is Multi-path Transport Suitable for Latency Sensitive Traffic? Computer Networks, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the Delays in Time-Varying Networks: Does Larger Service-Rate Variance Imply Larger Delays?

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          Mobihoc '18: Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing
          June 2018
          329 pages
          ISBN:9781450357708
          DOI:10.1145/3209582

          Copyright © 2018 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 June 2018

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          Overall Acceptance Rate296of1,843submissions,16%
        • Article Metrics

          • Downloads (Last 12 months)4
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader