An \Omega(\sqrt{\,\log\log n}\,) Lower Bound for Routing in Optical Networks

DOI10.1137/S0097539794272569MaRDI QIDQ4210085zbMATH OpenFDO

Authors Leslie Ann Goldberg, Mark Jerrum, Philip MacKenzie

Publication date 20 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmsparallel algorithmsroutingoptical networks

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Distributed algorithms (68W15)

Recommendations

• An approximation for minimum multicast route in optical networks with nonsplitting nodes
• scientific article; zbMATH DE number 1303789
• scientific article; zbMATH DE number 1421019
• Near optimal design of wavelength routed optical networks
• A note on optical routing on trees
• Approximable 1-turn routing problems in all-optical mesh networks
• On asymptotically optimal routing in large wireless networks and geometrical optics analogy
• scientific article; zbMATH DE number 1256772
• Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
• scientific article; zbMATH DE number 1034100

Cited in

(3)

• Thinning protocols for routing \(h\)-relations over shared media
• Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
• Scheduling parallel communication: The \(h\)-relation problem

This page was built for publication: An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210085)