Low-jitter scheduling algorithms for deadline-aware packet switches

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2006, Pages

  Dua, Aditya ^a   Bambos, Nicholas ^a  

^a Stanford University   (United States)

Author keywords

Convex optimization; Deadlines; Dynamic programming; Input queued switches; Myopic policy; Scheduling

Indexed keywords

CONVEX OPTIMIZATION; DEADLINES; INPUT QUEUED (IQ) PACKET SWITCHES; MYOPIC SCHEDULING; TRAFFIC STREAMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; JITTER; OPTIMIZATION; SCHEDULING;

PACKET SWITCHING;

EID: 50949107918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.10     Document Type: Conference Paper

References (15)

1. N. McKeown, A. Mekkittikul, V. Anantharam and J. Walrand, "Achieving 100% throughput in an input-queued switch", IEEE Trans. Communications, vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
2. P. Giaccone, B. Prabhakar and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches", IEEE Journal on Sel. Areas in Commun., vol. 21, no. 4, pp. 546-559, May 2003.
3. I.R. Philip and J.W.S Liu, "SS/TDMA scheduling of real-time periodic messages", Intl. Conf. on Telecomm. Systems, pp. 244-251, Mar. 1996.
4. J. Giles and B. Hajek, "Scheduling multirate periodic traffic in a packet switch", CISS 1997, Baltimore, MD, Mar. 1997.
5. I.A. Rai and M. Alanyali, "Uniform weighted round robin scheduling algorithms for input queued switches", IEEE ICC 2001, pp. 2028-2032, Helsinki, Finland, Jun. 2001.
6. C.S. Chang, W.J. Chen and H.Y. Huang, "Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services", IEEE Trans. Commun., vol. 49, no. 7, pp. 1145-1147, Jul. 2001.
7. C.S. Chang, D.S. Lee and Y.S. Jou, "Load balanced Birkhoff-von Neumann switches: part I: one-stage buffering", Comp. Commun., vol. 25, no. 6, pp. 611-622, Apr. 2002.
8. I. Keslassy, M. Kodialam, T.V. Lakshman and D. Stiliadis, "On guaranteed smooth scheduling for input-queued switches", IEEE INFOCOM 2003, pp. 1384-1394, San Francisco, CA, Apr. 2003.
9. S. Li and N. Ansari, "Input-queued switching with QoS guarantees", IEEE INFOCOM 1999, pp. 1152-1159, New York, NY, Mar. 1999.
10. E.D. Jensen, C.D. Locke and H. Tokuda, "A time-driven scheduling model for real-time systems", IEEE Real-Time Systems Symposium, pp. 112-122, Dec. 1985.
11. nd Ed., Athena Scientific, 2000.
12. A. Dua and N. Bambos, "Deadline aware scheduling for input queued packet switches", Netlab Technical Report, SU-Netlab-2005-06/02, Engg. Library, Stanford University
13. nd Ed., Morgan Kaufmann, 1999.
14. K. Ross and N. Bambos, "Local search scheduling algorithms for maximum throughput in packet switches", IEEE INFOCOM 2004, pp. 1158-1169, Hong Kong, Mar. 2004.
15. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2003.