Efficient request scheduling algorithms for all-optical WDM networks with tunable ADMs

WSEAS Transactions on Communications

Volumn 5, Issue 5, 2006, Pages 840-847

  Xu, Yinlong ^a   Zhou, Wei ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Edge coloring; Request scheduling; Tunable ADM; WDM

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MULTIPLEXING EQUIPMENT; SCHEDULING; TIME DOMAIN ANALYSIS; WAVELENGTH DIVISION MULTIPLEXING;

BIPARTITE GRAPH; EDGE-COLORING PROBLEM; SCHEDULING ALGORITHMS; TUNABLE ADD/DROP MULTIPLEXER;

OPTICAL COMMUNICATION;

EID: 33744552629     PISSN: 11092742     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Deming Liu, Xiaolei Yang, Dexiu Huang, Tunable Filter Used in a WDM Add/ Drop Device, Second Joint Symposium on Opto. - & Microelectronic Devices and Circuits 2002.
2. Liwu Liu, Xiangyang Li, Peng-Jun Wan, and Ophir Frieder, Wavelength Assignment in WDM Rings to Minimize SONET ADMs, IEEE INFOCOM 2000.
3. Fengfeng Zhou, Guoliang Chen and Yinlong Xu, Minimizing ADMs on Directed Fiber Tree. J. Comput. Sci. & Technol. vol. 18, no.61, Nov. 2003, pp.725-73.
4. Luca Becchetti, Miriam Dilanni, Approximating Call Scheduling Makespan in All-Optical Networks, Proceedings of the 26th Int. Workshop on Graph-Theoretic Concepts in Computer Science,2000, pp. 13-22.
5. Luca Becchetti, Miriam DiIanni, Alberto Marchetti Spaccamela, Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings, Theoretical Computer Science, Vol. 287, Sep. 2002.
6. M. Azizoglu, R.A. Barry, A. Mokhtar, Impact of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic. IEEE Jnl. on Selected Areas in Communications, 14(5), Jun. 1996.
7. M.S. Borella, B. Mukherjee, Efficient scheduling of non-uniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies, IEEE Journal on Selected Areas in Communications, 14(5):923-934, Jun. 1996.
8. Gruia Calinescu, and Peng-Jun Wan, Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs, J. Of Combinatorial Optimization, Vol:6,Issue:5, 2002, p. 425-453.
9. Zeydy Ortiz, G.N. Rouskas, Harry G. Perros, Scheduling of multicast traffic in tunable-receiver WDM networks with non-negligible tuning latencies, ACM SIGCOMM 1997, pp. 301-310.
10. A. Bianco, G. Galante, E. Leonardi, F. Neri, A. Nucci, Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies, Computer Networks, 41(6): 727-742, Apr. 2003.
11. P.J. Wan, Liwu Liu, Ophir Frieder, Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks, Computer Communications, 26(7), May 2003.
12. Fengfeng Zhou, Yinlong Xu and Guoliang Chen, "Scheduling on All-Optical Symmetric Trees with Tunable ADMs"(In Chinese), Chinese Journal of Computer, 05(2005), pp.774-781.
13. R. Cole, J. Hopcroft, "On edge coloring bipartite graphs", SIAM J. Computing, 11(1982), pp.540-546.
14. I. Holyer, The NP-completeness of edge-coloring. SIAM J. Computing., 10(4):718-720, Nov. 1981.
15. T. Nishizek and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM J. Diser. Math., 3, 1990, pp.391-410.
16. H.W. Kuhn, The Hungarian method for assignment problem, Naval Research Logistics Quarterly 2, 1955.