Improved Bounds for All Optical Routing

Yonatan Aumann, Yuval Rabani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

85 Scopus citations


We consider the problem of routing in networks employing all optical routing technology. In these networks, messages travel in optical form and switching is
performed directly on the optical signal. By using different wavelengths, several messages may use the same edge concurrently, However, messages assigned the same wavelength must use disjoint paths, or else be routed at separate rounds. No buffering at intermediate nodes is available. Thus, routing in this setting entails assigning wavelengths, paths, and time slots for the different messages.
Original languageEnglish
Title of host publicationSODA '95
Subtitle of host publicationProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
PublisherAssociation for Computing Machinery (ACM)
Number of pages10
ISBN (Electronic)0898713498
ISBN (Print)978-0-89871-349-7
StatePublished - 1995
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 22 Jan 199524 Jan 1995

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms


Conference6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
Country/TerritoryUnited States
CitySan Francisco

Bibliographical note

Funding Information:
T Laboratory for Computer Science, Cambridge, MA, 02138, aumannQtheory .lcs .mit edu. Supported by a Wolfson postdoctoral fellowship and DARPA contract N00014-92-J-1799. tWork done while at MIT Laboratory for Computer Science, supported by ARPA/Army contract DABT63-93-C-0038. Present address: Department of Computer Science, University Toronto, Toronto, Ontario lA4, rabaniQcs.toronto .edu.


  • Mathematics of computing
  • Theory of computation


Dive into the research topics of 'Improved Bounds for All Optical Routing'. Together they form a unique fingerprint.

Cite this