Abstract
Utilizing optical technologies for the design of packet switches and routers offers several advantages in terms of scalability, high bandwidth, power consumption, and cost. However, the configuration delays of optical crossbars are much longer than that of the electronic counterpart, which makes the conventional slot-by-slot scheduling methods no longer the feasible solution. Therefore, some tradeoff must be found between the empty time slots and configuration overhead. This paper classifies such scheduling problems into preemptive and non-preemptive scenarios, each has its own advantages and disadvantages. Although non-preemptive scheduling is inherently not good at achieving the above-mentioned tradeoff, it is shown, however, that the proposed maximum weight matching (MWM) based greedy algorithm is guaranteed to achieve an approximation 2 for arbitrary configuration delay, and with a relatively low time complexity O(N 2). For preemptive scheduling, a novel 2-approximation heuristic is presented. Each time in finding a switch configuration, the 2-approximation heuristic guarantees the covering cost of the remaining traffic matrix to have 2-approximation. Simulation results demonstrate that 2-approximation heuristic (1) performs close to the optimal scheduling, and (2) outperforms ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.
Similar content being viewed by others
References
Li X, Hamd M. On scheduling optical packet switches with reconfiguration delay. IEEE J Selected Areas in Commun, 2003, 21(7): 1156–1164
Yu J Z, Chen S W, Xia J S. Research progresses of SOI optical waveguide devices and integrated optical switch matrix. Sci China Ser F-Inf Sci, 2005, 48(2): 234–246
Towles B, Dally W J. Guaranteed scheduling for switches with configuration overhead. IEEE Trans Commun, 2003, 11(5): 835–847
Neukermans A, Ramaswami R. MEMS technology for optical net-working applications. IEEE Commun Mag, 2001, 39(6): 62–69
Fouquet J E, Venkatesh S, Troll M, et al. A compact, scalable cross-connect switch using total internal reflection due to thermally-generated bubbles. Proc Lasers and Electro-Optics Society Annual Meeting, 1998 (LEOS’98), Orlando, FL, Dec. 1998, 169–170
Tang Y, Rao M, Li L. A novel model on dynamic resource allocation in optical networks, Sci China Ser F-Inf Sci, 2005, 48(1): 15–27
Yeung K L. Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems. IEEE Trans Commun, 2001, 49(2): 351–359
Gopal I S, Wong C K. Minimizing the number of switching in an SS/TDMA system. IEEE Trans Commun, 1985, 33(6): 497–501
Lto Y, Urano Y, Muratani T, et al. Analysis of a switch matrix for SS/TDMA system. IEEE Trans Commun, 1977, 25(3): 411–419
Hoffman A J, Wielandt H W. The variation of the spectrum of a normal matrix. Duke Math J, 1953, 20(3): 37–39
Johnson D M, Dulmage A L, Mendelsohn N S. On an algorithm of G.Birkhoff concerning doubly stochastic matrices. Canad Math Bull, 1960, 3(9): 237–242
Chu T S. Rain induced cross-polarization at centimeter and millimeter wavelength. Bell Sys Tech J, 1974, 53(10): 1557–1579
Kesselman A, Kogan K. Non-preemptive scheduling of optical switches. Global Telecommunications Conference. GLOBECOM’ 04. IEEE Texas Dallas, 2004, 3(29): 1840–1844
Drake D E, Hougrady S. A simple approximation algorithm for the weighted matching problem. Information Processing Letters, 2003, 85(4): 211–213
Crescenzi P, Deng X, Papadimitriou C. On approximating a scheduling problem. J Combinatorial Optimization, 2001, 5(1): 287–297
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Z., Cheng, F., Luo, J. et al. Preemptive and non-preemptive scheduling of optical switches with configuration delay. SCI CHINA SER F 49, 653–664 (2006). https://doi.org/10.1007/s11432-006-2023-5
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11432-006-2023-5