Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Slicing and Scheduling with Service Guarantees in Multi-Hop Wireless Networks (2404.08637v3)

Published 12 Apr 2024 in cs.NI

Abstract: We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline requirements is largely influenced by the scheduling policy. We characterize the feasible throughput/deadline region for a flow under a fixed route and set of slices, and find throughput- and deadline-optimal policies for a solitary flow. We formulate the feasibility problem for multiple flows in a general topology, and show its equivalence to finding a bounded-cost cycle on an exponentially large graph, which is unsolvable in polynomial time by the best-known algorithm. Using a novel concept called delay deficit, we develop a sufficient condition for meeting deadlines as a function of inter-scheduling times, and show that regular schedules are optimal for satisfying this condition. Motivated by this, we design a polynomial-time algorithm that returns an (almost) regular schedule, optimized to meet service guarantees for all flows.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. T-mobile launches first-ever 5g network slicing beta for developers. Accessed: 03-21-2024. [Online]. Available: https://www.t-mobile.com/news/network/t-mobile-launches-first-ever-5g-network-slicing-beta-for-developers
  2. Quality of service (qos) in 5g networks. Accessed: 03-21-2024. [Online]. Available: https://5ghub.us/quality-of-service-qos-in-5g-networks/
  3. L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” in 29th IEEE Conference on Decision and Control.   IEEE, 1990, pp. 2130–2132.
  4. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, “Impact of interference on multi-hop wireless network performance,” in Proceedings of the 9th annual international conference on Mobile computing and networking, 2003, pp. 66–80.
  5. B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 910–917, Sep. 1988.
  6. M. Kodialam and T. Nandagopal, “Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem,” in Proceedings of the 9th annual international conference on Mobile computing and networking, 2003, pp. 42–54.
  7. R. L. Cruz, “A calculus for network delay. i. network elements in isolation,” IEEE Transactions on information theory, vol. 37, no. 1, pp. 114–131, 1991.
  8. ——, “A calculus for network delay. ii. network analysis,” IEEE Transactions on information theory, vol. 37, no. 1, pp. 132–141, 1991.
  9. M. Fidler, “An end-to-end probabilistic network calculus with moment generating functions,” in 200614th IEEE International Workshop on Quality of Service.   IEEE, 2006, pp. 261–270.
  10. A. Burchard, J. Liebeherr, and S. D. Patek, “A min-plus calculus for end-to-end statistical service guarantees,” IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4105–4114, 2006.
  11. C. Li, A. Burchard, and J. Liebeherr, “A network calculus with effective bandwidth,” IEEE/ACM Transactions on Networking, vol. 15, no. 6, pp. 1442–1453, 2007.
  12. H. Al-Zubaidy, J. Liebeherr, and A. Burchard, “A (min,×\times×) network calculus for multi-hop fading channels,” in 2013 Proceedings IEEE INFOCOM.   IEEE, 2013, pp. 1833–1841.
  13. I.-H. Hou and P. Kumar, “Utility-optimal scheduling in time-varying wireless networks with delay constraints,” in Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing, 2010, pp. 31–40.
  14. I.-H. Hou, “Scheduling heterogeneous real-time traffic over fading wireless channels,” IEEE/ACM Transactions on Networking, vol. 22, no. 5, pp. 1631–1644, 2013.
  15. R. Li and A. Eryilmaz, “Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multihop networks,” IEEE/ACM Transactions on Networking, vol. 20, no. 5, pp. 1649–1662, 2012.
  16. X. Liu, W. Wang, and L. Ying, “Spatial–temporal routing for supporting end-to-end hard deadlines in multi-hop networks,” Performance Evaluation, vol. 135, p. 102007, 2019.
  17. R. Singh and P. Kumar, “Throughput optimal decentralized scheduling of multihop networks with end-to-end deadline constraints: Unreliable links,” IEEE Transactions on Automatic Control, vol. 64, no. 1, pp. 127–142, 2018.
  18. ——, “Adaptive csma for decentralized scheduling of multi-hop networks with end-to-end deadline constraints,” IEEE/ACM Transactions on Networking, vol. 29, no. 3, pp. 1224–1237, 2021.
  19. P. Djukic and S. Valaee, “Quality-of-service provisioning for multi-service tdma mesh networks,” in Managing Traffic Performance in Converged Networks: 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007. Proceedings.   Springer, 2007, pp. 841–852.
  20. ——, “Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks,” IEEE/ACM Transactions on Networking, vol. 17, no. 3, pp. 870–883, Jun. 2009.
  21. S. Chilukuri and A. Sahoo, “Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks,” in Proceedings of the 16th International Conference on Distributed Computing and Networking.   Goa India: ACM, Jan. 2015, pp. 1–10.
  22. P. Cappanera, L. Lenzini, A. Lori, G. Stea, and G. Vaglini, “Link scheduling with end-to-end delay constraints in Wireless Mesh Networks,” in 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops.   Kos, Greece: IEEE, Jun. 2009, pp. 1–9.
  23. ——, “Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks,” Computer Communications, vol. 34, no. 8, pp. 922–934, Jun. 2011.
  24. ——, “Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks,” Computer Networks, vol. 57, no. 11, pp. 2301–2312, Aug. 2013.
  25. G. P. McCormick, “Computability of global solutions to factorable nonconvex programs: Part i—convex underestimating problems,” Mathematical programming, vol. 10, no. 1, pp. 147–175, 1976.
  26. P. Serafini and W. Ukovich, “A mathematical model for periodic scheduling problems,” SIAM Journal on Discrete Mathematics, vol. 2, no. 4, pp. 550–581, 1989.
  27. W. Dauscha, H. D. Modrow, and A. Neumann, “On cyclic sequence types for constructing cyclic schedules,” Zeitschrift für Operations Research, vol. 29, no. 1, pp. 1–30, Mar. 1985.
  28. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir, “On Chromatic Sums and Distributed Resource Allocation,” Information and Computation, vol. 140, no. 2, pp. 183–202, Feb. 1998.
  29. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, R. Salman, and H. Shachnai, “Sum multicoloring of graphs,” Journal of Algorithms, vol. 37, no. 2, pp. 422–450, 2000.
  30. L. Epstein, M. M. Halldórsson, A. Levin, and H. Shachnai, “Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs,” Algorithmica, vol. 55, no. 4, pp. 643–665, Dec. 2009.
  31. C. Li, Q. Liu, S. Li, Y. Chen, Y. T. Hou, and W. Lou, “On Scheduling with AoI Violation Tolerance,” in IEEE INFOCOM 2021 - IEEE Conference on Computer Communications.   Vancouver, BC, Canada: IEEE, May 2021, pp. 1–9.
  32. A. Bar-Noy, R. Motwani, and J. Naor, “The greedy algorithm is optimal for on-line edge coloring,” Information Processing Letters, vol. 44, no. 5, pp. 251–253, Dec. 1992.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now