Guaranteed scheduling for switches with configuration overhead

IEEE/ACM Transactions on Networking

Volumn 11, Issue 5, 2003, Pages 835-847

  Towles, Brian ^a   Dally, William J ^a  

^a Stanford University   (United States)

Author keywords

Optical switches; Packet switching

Indexed keywords

ALGORITHMS; BANDWIDTH; OPTICAL SWITCHES; PACKET SWITCHING; SCHEDULING;

SCHEDULING ALGORITHMS; SCHEDULING SWITCHES;

PACKET NETWORKS;

EID: 0242365694     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.818190     Document Type: Article

References (23)

1. A. Neukermans and R. Ramaswami, "MEMS technology for optical networking applications," IEEE Commun. Mag., vol. 39, pp. 62-69, Jan. 2001.
2. J. E. Fouquet et al., "A compact, scalable cross-connect switch using total internal reflection due to thermally-generated bubbles," in Proc. IEEE/LEOS Annu. Meeting, Orlando, FL, 1988, pp. 169-170.
3. L. Y. Lin, "Micromachined free-space matrix switches with submillisecond switching time for large-scale optical crossconnect," in OFC Tech. Dig., 1998, pp. 147-148.
4. O. B. Spahn et al., "GaAs-based microelectromechanical waveguide switch," in Proc. IEEE/LEOS Int. Conf. Optical MEMS, 2000, pp. 41-42.
5. A. J. Agranat, "Electroholographic wavelength selective crossconnect," in 1999 Dig. LEOS Summer Topical Meetings, pp. 61-62.
6. Y. Ito, Y. Urano, T. Muratani, and M. Yamaguchi, "Analysis of a switch matrix for an SS/TDMA system," Proc. IEEE, vol. 65, pp. 411-419, Mar. 1977.
7. T. Inukai, "An efficient SS/TDMA time slot assignment algorithm," IEEE Trans. Commun., vol. COM-27, pp. 1449-1455, Oct. 1979.
8. S. Gopal and C. K. Wong, "Minimizing the number of switchings in a SS/TDMA system," IEEE Trans. Commun., vol. COM-33, pp. 497-501, June 1985.
9. R. L. Graham, "Bounds on multiprocessing timing anomalies," SIAM J. Appl. Mathemat., vol. 17, no. 2, pp. 416-429, Mar. 1969.
10. D. B. Shmoys, C. Stein, and J. Wein, "Improved approximation algorithms for shop scheduling problems," SIAM J. Comput., vol. 23, pp. 617-632, 1994.
11. D. S. Hochbaum, Ed., Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS, 1997.
12. D. M. Johnson, A. L. Dulmage, and N. S. Mendelsohn, "On an algorithm of G. Birkhoff concerning doubly stochastic matrices," Canad. Math. Bull., vol. 3, pp. 237-242, 1960.
13. L. Lovász and M. D. Plummer, Matching Theory. Amsterdam, The Netherlands: Elsevier, 1986.
14. A. J. Hoffman and H. W. Wielandt, "The variation of the spectrum of a normal matrix," Duke Math. J., vol. 20, pp. 37-39, 1953.
15. R. Cole and J. Hopcroft, "On edge coloring bipartite graphs," SIAM J. Comput., vol. 11, pp. 540-546, 1982.
16. T. Gonzalez and S. Sahni, "Open shop scheduling to minimize finish time," J. ACM, vol. 23, pp. 665-679, 1976.
17. M. Chen and T.-S. Yum, "A conflict-free protocol for optical WDMA networks," in Proc. GLOBECOM, 1991, pp. 1276-1281.
18. A. Ganz and Y. Gao, "A time-wavelength assignment algorithm for a WDM star network," in Proc. IEEE INFOCOM, 1992, pp. 2144-2150.
19. G. R. Pieris and G. H. Sasaki, "Scheduling transmissions in WDM broadcast-and-select networks," IEEE/ACM Trans. Networking, vol. 2, pp. 105-110, Apr. 1994.
20. K. Kar, "Reduced complexity input buffered switches," in Proc. Hot Interconnects VIII, 2000, pp. 13-20.
21. E. Altman, Z. Liu, and R. Righter, "Scheduling of an input-queued switch to achieve maximal throughput," Probabil. Eng. Inform. Sci., vol. 14, pp. 327-334, 2000.
22. 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.
23. S. Sevastianov and G. Woeginger, "Makespan minimization in open shops: a polynomial time approximation scheme," Mathemat. Program., vol. 82, pp. 191-198, 1998.