Extending the Birkhoff-von Neumann Switching Strategy for Multicast - On the use of Optical Splitting in Switches

IEEE Journal on Selected Areas in Communications

Volumn 25, Issue 6, 2007, Pages 36-50

  Deb, Supratim ^b   Médard, Muriel ^a  

^a Department of Electrical Engineering and Computer Science   (United Kingdom)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

fanout splitting; Multicast switching; rate region; stable set polytope

Indexed keywords

EID: 85008061039     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC-OCN.2007.026006     Document Type: Article

References (37)

1. J. Li, “Scheduling algorithms for high speed switches,” Ph.D. Dissertation, New Jersey Institute of Technology, May 2001 (available online: NJIT's electronic Theses & Dissertations).
2. G. Birkhoff, “Tres observaciones sobre el algebra lineal,” Univ. Nac. Tucuman Rev. Ser. A, vol. 5, pp. 147–151, 1946.
3. J. von Neumann, “A certain zero-sum two-person game equivalent to the optimal assignment problem,” Contrib. to the Theory of Games, vol. 2, pp. 5–12, Princeton University Press, Princeton, New Jersey, 1953.
4. N. McKeown, “The i-SLIP scheduling algorithm for input-queued switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, Apr. 1999.
5. N. McKeown, “A fast switched backplane for a gigabit switched router,” Business Commun. Review, vol. 27, no. 12, Dec. 1997.
6. N. McKeown, V. Anantharam, and J. Walrand, “Achieving 100% throughput in an input-queued switch,” in Proc. IEEE INFOCOM 1996, pp. 296–302.
7. K. Ross, N. Bambos, K. Kumaran, I. Saniee, and I. Widjaja, “Dynamic scheduling of optical data bursts in time-domain wavelength interleaved networks,” in Proc. IEEE Symposium on High Performance Interconnects, Aug. 2003.
8. K. Ross, N. Bambos, K. Kumaran, I. Saniee, and I. Widjaja, “Scheduling bursts in time-domain wavelength interleaved networks,” IEEE J. Sel. Areas Commun., Optical Communications and Networking Series, Nov. 2003.
9. C. S. Chang, W. J. Chen, and H. Y. Huang, “Birkhoff-von Neumann input buffered crossbar switches,” in Proc. IEEE INFOCOM 2000, pp. 1614–1623, Tel-Aviv, Israel, Mar. 2000.
10. 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 Proc. 7th IEEE International Workshop on QoS, pp. 79–86, London, 1999.
11. 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, pp. 1145–1147, July 2001.
12. A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated service networks: the single node case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344–357, June 1993.
13. A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated service networks: the multiple node case,” IEEE/ACM Trans. Networking, vol. 2, no. 2, pp. 137–150, Apr. 1994.
14. T. T. Lee, “Nonblocking copy networks for multicast packet switching,” IEEE J. Sel. Areas Commun., vol. 6, no. 9, pp. 1455–1467, Dec. 1988.
15. B. Prabhakar, N. McKeown, and R. Ahuja, “Multicast scheduling for input queued switches,” IEEE J. Sel. Areas Commun., vol. 15, no. 5, pp. 855–866, June 1997.
16. M. Andrews, S. Khanna, and K. Kumaran, “Integrated scheduling of unicast and multicast traffic in an input-queued switch,” in Proc. IEEE INFOCOM 1999, The Conference on Computer Communications, no. 1, pp. 1144–1151, Mar. 1999.
17. M. A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, “Multicast traffic in input-queued switches: optimal scheduling and maximum throughput,” IEEE/ACM Trans. Networking, vol. 11, no. 3, pp. 465-477, June 2003.
18. S. Gupta and A. Aziz. “Multicast scheduling for switches with multiple input-queues,” Hot Interconnects X, Stanford CA, Aug. 2002.
19. C. S. Chang, D. S. Lee, and Y. S. Jou, “Load balanced Birkhoff-von Neumann Switches,” in Proc. IEEE Workshop on High Performance Switching and Routing, 2001.
20. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, 2003.
21. M. Grotschel, L. Lovasz, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica 1, pp. 169–197, 1981.
22. M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, second edition. Springer-Verlag, 1993.
23. R. M. Karp, “Reducibility among combinatorial problems,” Complexity of Computer Computations. New York: Plenum Press, 1972.
24. L. G. Khachiyan, “A polynomial algorithm in linear programming,” Soviet Mathematics Doklady, vol. 20, pp. 191–194, 1979.
25. G. Aggarwal, R. Motwani, D. Shah, and A. Zhu, “Switch scheduling via randomized edge coloring,” in Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pp. 502, 2003.
26. H. J. Chao, C. H. Lam, and E. Oki, Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers. John Wiley & Sons Inc., 2001.
27. SIM: a fixed length packet simulator, available at http://klamath.stanford.edu/tools/SIM/
28. N. McKeown, “Optics inside routers,” in Proc. ECOC 2003, Rimini, Italy, vol. 2, pp. 168–171, 2003.
29. R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd Edition. San Francisco: Morgan Kaufmann Publishers, 2003.
30. N. Singhal and B. Mukherjee, “Architectures and algorithms for multicasting in optical WDM mesh networks using opaque and transparent optical cross-connects,” in Proc. IEEE OFC, Anaheim, CA, Mar. 2001.
31. A. Zsigri, A. Guitton, and M. Molnar, “Construction of light-trees for WDM multicasting under splitting capability constraints,” in Proc. 10th IEEE International Conference on Telecommunications, New York, pp. 171–175, 2003.
32. B. Mukherjee, Optical Communication Networks. New York: McGraw-Hill, 1997.
33. L. H. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, pp. 67–73, 1999.
34. M. Ali, “Optimization of splitting node placement in wavelength-routed optical networks,” IEEE J. Sel. Areas Commun., issue on network support for multicast communications, vol. 20, no. 8, pp. 1571–1579, Oct. 2002.
35. C. Caramanis, M. Rosenblum, M. X. Goemans, and V. Tarokh, “Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in Banyan networks,” in Proc. 38th Annual Conference on Information Sciences and Systems, Princeton, NJ, pp. 160–166, 2004.
36. L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1936–1948, 1992.
37. V. E. Alekseev and V. V. Lozin, “Independent sets of maximum weight in (p, q)-colorable graphs,” Discrete Mathematics, vol. 265, no. 1, pp. 351–356, 2003.