The most congested cutset: Deriving a tight lower bound for the chromatic number in the RWA problem

IEEE Communications Letters

Volumn 8, Issue 7, 2004, Pages 473-475

  Sharafat, Ahmad R ^a   Ma'rouzi, Omid R ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FIBER OPTIC NETWORKS; GRAPH THEORY; NETWORK PROTOCOLS; RECURSIVE FUNCTIONS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

ALL-OPTICAL NETWORKS; CHROMATIC NUMBER; CUTSET CONGESTION; ROUTING PROTOCOLS; WAVELENGTH ASSIGNMENT;

CONGESTION CONTROL (COMMUNICATION);

EID: 3543013753     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2004.832765     Document Type: Article

References (12)

1. R. Pankaj, "Architectures for Linear Lightwave Networkds," Ph.D. dissertation, Dept. Elect. Eng. & Comp. Sci., MIT, Cambridge, 1992.
2. A. Aggarwal et al., "Efficient routing and scheduling algorithms for optical networks," J. Assoc. Comput. Mach., vol. 43, no. 6, pp. 973-1001, 1996.
3. J.-C. Bermond et al., "Efficient collective communication in optical networks," Theor. Comput Sci., vol. 233, no. 1-2, pp. 165-189, Feb. 2000.
4. R. M. Krishnaswami and K. N. Sivarajan, "Algorithms for routing and wavelength assignment based on solutions of LP-relaxations," IEEE Commun. Lett., vol. 5, pp. 435-437, Oct. 2001.
5. C. Qiao and X. Zhang, "An efficient and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Trans. Networking, vol. 8, pp. 608-617, Oct. 2000.
6. S. Baroni and P. Bayvel, "Wavelength requirements in arbitrarily connected wavelength-routed optical networks," J. Lightwave Technol., vol. 15, no. 2, pp. 242-251, Feb. 1997.
7. A. R. Sharafat and O. R. Ma'rouzi, "A novel and efficient algorithm for scanning all minimal cutsets of an undirected graph," Algorithmica, submitted for publication.
8. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: A novel approach to high bandwidth optical WANs," IEEE Trans. Comm., vol. 40, no. 7, pp. 1171-1182, July 1992.
9. R. A. Brualdi, Introductory Combinatorics, 3rd ed. Englewood Cliffs, NJ: Prentice-Hall, 1999, ch. 2.
10. S. Tsukiyama, I. Shirakawa, H. Ozaki, and H. Ariyoshi, "An algorithm to enumerate all minimal cutsets of a graph in linear time per cutset," J. Assoc. Comput. Mach., vol. 27, pp. 619-632, 1980.
11. D. R. Karger, "Minimum cuts in near-linear time," J. Assoc. Comput. Mach., vol. 47, pp. 46-76, 2000.
12. K. Lee, K. C. Kang, T. Lee, and S. Park, "An optimization approach to routing and wavelength assignment in WDM all-optical mesh networks without wavelength conversion," ETRI J., vol. 24, no. 2, pp. 131-141, Apr. 2002.