Iterative scheduling algorithms

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 445-453

  Bayati, Mohsen ^a   Prabhakar, Balaji ^b   Shah, Devavrat ^c   Sharma, Mayank ^d  

^a Packard EE   (United States)

^b EE and Statistics   (United States)

^c Architecture Machine Group

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET PROTOCOLS; ITERATIVE DECODING; PACKET SWITCHING; ROUTERS;

HARDWARE IMPLEMENTATION; IMPLEMENTABLE ALGORITHMS; PACKET TRANSFER;

SCHEDULING ALGORITHMS;

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

References (34)

1. N. McKeown, "iSLIP: a scheduling algorithm for input-queued switches," IEEE Transaction on Networking, vol. 7, no. 2, pp. 188-201, 1999.
2. D. P. Bertsekas, "The auction algorithm: A distributed relaxation method for the assignment problem," Annals of Operations Research, vol. 14, 1988.
3. _, "Auction algorithms for network flow problems: A tutorial introduction," Computational Optimization and Applications, vol. 1, pp. 7-66, 1992.
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
5. J. Yedidia, W. Freeman, and Y. Weiss, "Generalized belief propagation," Mitsubishi Elect. Res. Lab., vol. TR-2000-26, 2000.
6. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," Submitted, available through csl.uiuc.edu/rsrikant, 2006.
7. X. Wu, R. Srikant, and J. R. Perkins, "Queue-length stability of maximal greedy schedules in wireless networks," in Workshop on Information Theory and Applications, UCSD, 2006.
8. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees through maximal scheduling in wireless networks," in 43rd Allerton conference on Comm. Control and computing, 2005.
9. X. Lin and N. B. Shroff, "Impact of imperfect scheduling in wireless networks," in IEEE INFOCOM, 2005.
10. M. Karol, M. Hluchyj, and S. Morgan, "Input versus output queueing on a space division packet switch," IEEE Transactions on Communications, vol. 35, no. 12, pp. 1347-1356, 1987.
11. Y. Tamir and H. Chi, "Symmetric crossbar arbiters for vlsi communication switches," IEEE Transaction on Parallel and Distributed Systems, vol. 4, no. 1, pp. 13-27, 1993.
12. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High speed switch scheduling for local area networks," ACM Transactions on Computer Systems, vol. 11, pp. 319-351, 1993.
13. M. Karol, K. Eng, and H. Obara, "Improving the performance of input-queued atm packet switch," in IEEE INFOCOM, 1992, pp. 110-115.
14. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proceedings of IEEE Infocom, 1996, pp. 296-302.
15. 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, pp. 1936-1948, 1992.
16. J. Dai and B. Prabhakar, "The throughput of switches with and without speed-up," in Proceedings of IEEE Infocom, 2000, pp. 556-564.
17. D. Shah, "Stable algorithms for input queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001. [Online]. Available: http://www.stanford.edu/~devavrat/ ilqf.ps
18. I. Keslassy and N. McKeown, "Analysis of scheduling algorithms that provide 100% throughput in input-queued switches," in Proceedings of Allerton Conference on Communication, Control and Computing, 2001.
19. D. Shah and M. Kopikare, "Delay bounds for the approximate Maximum Weight matching algorithm for input queued switches," in Proceedings of IEEE Infocom, 2002.
20. D. Shah and D. J. Wischik, "An optimal scheduling algorithm for input queued switch," in IEEE INFOCOM, 2006.
21. J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," Journal of ACM, vol. 18, pp. 264-284, 1972.
22. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in IEEE INFOCOM, vol. 2, 1998, pp. 533-539.
23. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE Journal on Selected Areas in Communications High-performance electronic switches/routers for high-speed internet, vol. 21, no. 4, pp. 546-559, 2003.
24. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in ACM SIGMETRICS/Performance, 2006.
25. R. G. Gallager, Low Density Parity Check Codes. Monograph, MIT Press, 1963.
26. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," vol. 47, pp. 599-618, 2001.
27. A. Braunstein, M. Mezard, and R. Zecchina, "Survey propagation: an algorithm for satisfiability," Random Structures and Algorithms, vol. 27, pp. 201-226, 2005.
28. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," Preliminary version appeared at IEEE ISIT 2005. Longer version Submitted and available at http://www.stanford. edu/~bayati/papers/mpmwm.ps, 2005.
29. _, "A simpler max-product maximum weight matching algorithm and the auction algorithm," in IEEE Int. Symp. Information Theory, 2006.
30. P. R. Kumar and S. P. Meyn, "Stability of queueing networks and scheduling policies," IEEE Transactions on Automatic Control, vol. 40, no. 2, pp. 251-260, 1995.
31. S. Asmussen, Applied Probability and Queues. New York: Wiley, 1987.
32. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993.
33. _, "Stability of markovian processes ii: Continuous time processes and sampled chains," Advances of Applied Probability, vol. 25, pp. 487-517, 1993.
34. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in EEE Int. Symp. Information Theory, 2005.