Improved Bounds for All Optical Routing

@inproceedings{Aumann1995ImprovedBF,
  title={Improved Bounds for All Optical Routing},
  author={Yonatan Aumann and Yuval Rabani},
  booktitle={SODA},
  year={1995}
}
We consider the ploying all optica P roblem of routing in networks emrouting technology. In these networks, messages travel in optical form and switchin is f! erformed directly on the optical signal. By using %. iferent uravelengths, several messages may use the same edge concurrently, Howeve!, messages assigned the same wavelength must use disjoznt paths, or else be routed at separate rounds. No bufferin at, intermediate nodes is available. Thus, routing in ing wavelengths, paths, and time… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 77 extracted citations

Permutation Routing in All-Optical Product Networks

IPPS/SPDP Workshops • 1999
View 10 Excerpts
Highly Influenced

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Efficient Approximation and Online Algorithms • 2006
View 5 Excerpts
Highly Influenced

Wavelength Routing in All-optical Tree Networks: A Survey

Computers and Artificial Intelligence • 2001
View 7 Excerpts
Highly Influenced

Efficient Delay Routing

Theor. Comput. Sci. • 1998
View 9 Excerpts
Highly Influenced

Integer Programming and Combinatorial Optimization

Lecture Notes in Computer Science • 1998
View 10 Excerpts
Highly Influenced

Approximation Algorithms for Disjoint Paths ProblemsbyJon

Michael KleinbergS
1996
View 20 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…