Optimum scheduling and memory management in input queued switches with finite buffer space

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 1373-1383

  Sarkar, Saswati ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; CONSTRAINT THEORY; HEURISTIC METHODS; QUEUEING NETWORKS; TELECOMMUNICATION NETWORKS; OPTIMAL SYSTEMS; OPTIMIZATION; PACKET LOSS; PROJECT MANAGEMENT;

MEMORY OVERFLOW; ARRIVAL RATES; CLOSED FORM; FINITE BUFFER; FRAMEWORK AND ALGORITHMS; INFINITE BUFFER; INPUT BUFFERS; INPUT QUEUED SWITCH; MEMORY CONSTRAINTS; MEMORY MANAGEMENT; OPTIMAL STRATEGIES; SCHEDULING PROBLEM;

WIRELESS TELECOMMUNICATION SYSTEMS; COMPUTER VISION;

EID: 0043016295     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infcom.2003.1208973     Document Type: Conference Paper

References (17)

1. M. Arpaci and J. Copeland. Buffer-management of shared memory atm switches. IEEE Communications Surveys, 2000.
2. I. Cidon, L. Georgiadis, R. Guerin, and A. Khamisy. Optimal buffer sharing. IEEE Journal on Selected Areas in Communications, 13(7), 1995.
3. H. Gabow and O. Kariv. Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal of Computing, 11(1), February 1992.
4. M. Hall Jr. Combinatorial Theory. John Wiley and Sons, 1998.
5. F. Kamoun and L. Kleinrock. Analysis of shared storage in a computer network node environment under general traffic conditions. IEEE Transactions on Communications, 28(7), July 1980.
6. M. Karol, M. Hluchyj, and S. Morgan. Input versus output queueing on a space-division switch. IEEE Transactions on Communications, 35, December 1987.
7. N. Mckeown, A. Mekkittikul, V. Anantharam, and J. Walrand. Achieving 100% throughput in an input queued switch. IEEE Transactions on Communications, 47(8), 1999.
8. A. Mekkittikul and N. Mckeown. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. Proceedings of INFOCOM'1998, April 1998.
9. N. Ni and L. Bhuyan. Fair scheduling and buffer management in internet routers. Proceedings of INFOCOM, NY, June 2002.
10. M. Putterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, 1998.
11. S. Ross. Introduction to Stochastic Dynamic Programming. Academic Press, 1998.
12. R. Roy and S. Panwar. Optimal space priority policies for shared memory atm systems. Proceedings of Allerton Conference on Communication, Control, and Computing, October 1997.
13. S. Sarkar. A scheme for jointly optimum scheduling and memory management with application to switches and wireless networks. Technical Report: Available at http://www.seas.upenn.edu/̃swati/publication.htm, 2002.
14. L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switchs. Proceedings of INFOCOM'1998, April 1998.
15. L. Tassiulas and A. Ephremidis. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12), 1992.
16. T. Weller and B. Hajek. Scheduling nonuniform traffic in a packet switching system with small propagation delay. Proceedings of INFOCOM'1994, 1994.
17. M. Yoo, C. Qiao, and S. Dixit. Qos performance of optical burst switching in ip-over-wdm networks. IEEE Journal on Selected Areas in Communications, 18(10), October 2000.