Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Jayachandran, Praveen ^a   Andrews, Matthew ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY TOPOLOGY; BELL LABS; BURST PARAMETERS; CENTRALIZED SCHEDULERS; DELAY BOUND; EARLIEST DEADLINE FIRST; END TO END DELAY; END-TO-END DELAY BOUNDS; INJECTION RATES; OPTIMALITY; PACKET SCHEDULER; PATH LENGTH; SCHEDULABILITY; WEIGHTED FAIR QUEUING; WIRE LINE NETWORKS; WIRELESS LINK;

NETWORK PROTOCOLS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS;

WIRELESS NETWORKS;

EID: 77953307012     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462012     Document Type: Conference Paper

References (23)

1. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936-1948, December 1992.
2. M. Andrews, "Instability of FIFO in the permanent sessions model at arbitrarily small network loads," ACM Trans. Algorithms, vol. 5, no. 3, pp. 1-29, 2009.
3. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344-357, 1993.
4. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case," IEEE/ACM Transactions on Networking, vol. 2, no. 2, pp. 137-150, 1994.
5. L. Georgiadis, R. Guérin, and A. Parekh, "Optimal multiplexing on a single link: delay and buffer requirements," IEEE Transactions on Information Theory, vol. 43, no. 5, pp. 1518-1535, September 1997.
6. J. Liebeherr, D. Wrege, and D. Ferrari, "Exact admission control for networks with a bounded delay service," IEEE/ACM Transactions on Networking, vol. 4, no. 6, pp. 885-901, December 1996.
7. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan, "Efficient network QoS provisioning based on per node traffic shaping," in Proceedings of IEEE INFOCOM '96, 1996, pp. 102-110.
8. M. Andrews and L. Zhang, "Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule," in IEEE INFOCOM, vol. 1, March 1999, pp. 380-388.
9. S. Lu and P. Kumar, "Distributed scheduling based on due dates and buffer priorities," IEEE Transactions on Automatic Control, vol. 36, no. 12, pp. 1406-1416, Dec 1991.
10. P. Jayachandran and T. Abdelzaher, "A delay composition theorem for real-time pipelines," in Euromicro Conference on Real-Time Systems (ECRTS), July 2007, pp. 29-38.
11. P. Jayachandran and T. Abdelzaher, "End-to-end delay analysis of distributed systems with cycles in the task graph," in Euromicro Conference on Real-Time Systems (ECRTS), July 2009.
12. S. Jagabathula and D. Shah, "Optimal delay scheduling in networks with arbitrary constraints," in SIGMETRICS, 2008, pp. 395-406.
13. M. Grossglauser and D. Tse, "Mobility increases the capacity of adhoc wireless networks," IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 477-486, August 2002.
14. A. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," in INFOCOM, 2004.
15. C. Comaniciu and V. Poor, "On the capacity of mobile ad hoc networks with delay constraints," IEEE Transactions on Wireless Communications, vol. 5, no. 8, pp. 2061-2071, 2006.
16. M. J. Neely and E. Modiano, "Capacity and delay tradeoffs for ad-hoc mobile networks," IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1917-1937, June 2005.
17. C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "On service guarantees for input-buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann," in International Workshop on Quality of Service (IWQoS), June 1999, pp. 79-86.
18. H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, "NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs," Journal of Algorithms, vol. 26, no. 2, pp. 238-274, 1998.
19. A. Eryilmaz, A. Ozdaglar, D. Shah, and E. Modiano, "Distributed cross-layer algorithms for the optimal control of multi-hop wireless networks," submitted.
20. L. Tassiulas, "Linear complexity algorithms for maximum througput in radio networks and input queued switches," in INFOCOM, 1998, pp. 533-539.
21. P. Gupta, Y. Sankarasubramaniam, and A. Stolyar, "Random-access scheduling with service differentiation in wireless networks," in INFOCOM, 2005, pp. 1815-1825.
22. U. Akyol, M. Andrews, P. Gupta, J. Hobby, I. Saniee, and A. Stolyar, "Joint scheduling and congestion control in mobile ad-hoc networks," in INFOCOM, 2008, pp. 619-627.
23. A. Warrier, S. Janakiraman, S. Ha, and I. Rhee, "Diffq: Practical differential backlog congestion control for wireless networks," in INFOCOM, 2009.