Non-preemptive scheduling of optical switches

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2004, Pages 1840-1844

  Kesselman, Alex ^a   Kogan, Kirill ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CISCO SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; PACKET NETWORKS; POLYNOMIALS; ROUTERS; SCHEDULING; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

ELECTRONIC SWITCHES; INPUT QUEUING (IQ); NON-PREEMPTIVE BIPARTITE SCHEDULING (NPBS); TIME SLOT ASSIGNMENT (TSA);

OPTICAL SWITCHES;

EID: 18144420727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. F. Afrati, T. Aslanidis, E. Bampis, and I. Milis, "Scheduling in Switching Networks with Set-up Delays," ALGOTEL'2002, Muze, France, May 2002.
2. P. Crescenzi, X. Deng, C. Papadimitriou, "On Approximating a Scheduling Problem," Journal of Combinatorial Optimization, Vol. 5, pp. 287-297, 2001.
3. S. Dolev and A. Kesselman, "Bounded Latency Scheduling Scheme for ATM Cells," Journal of Computer Networks, Vol. 32(3), pp 325-331, March 2000.
4. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity ow problems," SIAM J. Computing, Vol. 5, pp. 691-703, 1976.
5. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP Completeness," W. H. Freeman, San Francisco, 1979.
6. 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.
7. T. Inukai, "An Efficient SS/TDMA Time Slot Assignment Algorithm," IEEE Transactions on Communication, Vol. 27, pp. 1449-1455, 1979.
8. X. Li and M. Hamdi, "A-ADJUST Algorithm for Optical Switches with Reconfiguration Delay," in Proc. of International Conference on Communications (ICC'03), 2003.
9. M. Prais and C. C. Ribeiro, "Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment," INFORMS Journal on Computing, Vol. 12, pp. 164-176, 2000.
10. F. Rendl, "On the complexity of decomposing matrices arising in satellite communication," Operations Research Letters, Vol. 4, pp. 5-8, 1985.
11. C. C. Ribeiro, M. Minoux and M. C. Penna, "An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment," European Journal of Operational Research, Vol. 41, pp. 232-239, 1989.
12. B. Towles and W. J. Dally, "Guaranteed Scheduling for Switches with Configuration Overhead," in Proc. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM'02, pp. 342-351, June 2002.