A Heuristic Wavelength Assignment Algorithm for Multihop WDM Networks with Wavelength Routing and Wavelength Re-Use

IEEE/ACM Transactions on Networking

Volumn 3, Issue 3, 1995, Pages 281-288

  Acampora, Anthony S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; DATA COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; FIBER OPTIC NETWORKS; FREQUENCY DIVISION MULTIPLEXING; HEURISTIC METHODS; OPTICAL LINKS; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC;

HEURISTIC WAVELENGTH ASSIGNMENT ALGORITHM; MULTIHOP LIGHTWAVE NETWORKS; WAVELENGTH REUSE; WAVELENGTH ROUTING;

OPTICAL COMMUNICATION;

EID: 0029325376     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.392387     Document Type: Article

References (15)

1. A. S. Acampora, “A multichannel multihop local lightwave network, “IEEE Globecom ' ‘87, May 1987.
2. B. Mukheijee “WDM-based local lightwave networks: Part II: Multihop IEEE Network Mag., vol. 6, pp. 20-32, July 1992.
3. R. Ramaswami “Multi-wavelength lightwave networks, “IEEE Commun. Mag., vol. 31, pp. 78-88, 1993.
4. C. A. Brackett and A. S. Acampora et al., “A scalable multiwavelength multihop optical network: A proposal for research on all-optical networks, “IEEE J. Lightwave Technol., vol. 11, May/June 1993.
5. J. lightwave networks, “P. Labourdette and A. S. Acampora, “Logically rearrangeable multi- IEEE Trans. Commun., vol. 39, Aug. 1991.
6. I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: A novel approach to high bandwidth optical wan-s, “IEEE Trans. Commun., vol. 40, July 1992.
7. A. Ganz and G. Karni, “Lightnets: Topologies for high-speed optical networks, “IEEE/OSA J. Lightwave Technol., vol. 11, no. 5/6, pp. 951-961, 1993.
8. B. Mukherjee, S. Ramamurthy, D. Baneijee, and A. Mukherjee, “Some principles for designing a wide-area optical networks, “in IEEE INFOCOM ’94, 1994.
9. F. P. Kelly, “Blocking probabilities in large circuit-switched networks, “Adv. Appl. Prob., vol. 18, pp. 473-505, 1986.
10. “Loss network, “Annals of Appl. Prob., vol. 1, no. 3, pp. 319-378, 1990.
11. A. Girard, Routing and Dimensioning in Circuit-Switched Networks. MA.: Addison-Wesley, 1990.
12. K. W. Cheung “Acoustooptic tunable filters in wdm networks: System issues and network applications, “IEEE J. Select. Areas Commun., vol. 8, pp. 1015-1025, 1990.
13. A. Aho, J. Hopcrof, and J. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
14. M. Pollack “The kth best route through a network, “Oper. Res., vol. 9, no. 4, pp. 578-579, 1961.
15. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, “On the self-similar nature of ethenet traffic, “in Proc. ACM Sigcomm ’93, San Francisco, pp. 183-193, 1993.