Thumbnail
Access Restriction
Subscribed

Author Aggarwal, Alok ♦ Bar-Noy, Amotz ♦ Coppersmith, Don ♦ Ramaswami, Rajiv ♦ Schieber, Baruch ♦ Sudan, Madhu
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Optical networks ♦ Routing ♦ Wavelength assignment
Abstract This paper studies the problem of dedicating routes to connections in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper considers optical networks with and without switches, and different types of routing in these networks. It presents optimal or near-optimal constructions of optical networks in these cases and algorithms for routing connections, specifically permutation routing for the networks constructed here.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-11-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 6
Page Count 29
Starting Page 973
Ending Page 1001


Open content in new tab

   Open content in new tab
Source: ACM Digital Library