scientific article; zbMATH DE number 1303573

zbMATH Open0942.68142MaRDI QIDQ4250199FDOQ4250199

Authors: Gordon Wilfong, Peter Winkler 

Publication date: 21 August 2000

Title of this publication is not available (Why is that?)

Recommendations

• Wavelength allocation on trees of rings
• Efficient wavelength routing on directed fiber trees
• scientific article; zbMATH DE number 2117156
• Wavelength conversion in optical networks

zbMATH Keywords

polynomial-time algorithmwavelength division multiplexing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (32)

• Optimal bandwidth utilization of all-optical ring with a converter of degree 4.
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Wavelength translation in WDM networks: optimization models and solution procedures
• Wavelength routing in optical networks of diameter two
• Title not available (Why is that?)
• The complexity of path coloring and call scheduling
• Strictly Nonblocking WDM Cross-connects
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Upgrading edge-disjoint paths in a ring
• Coloring all directed paths in a symmetric tree, with an application to optical networks
• Vertex disjoint routings of cycles over tori
• Routing to reduce the cost of wavelength conversion
• Path problems in generalized stars, complete graphs, and brick wall graphs
• Scheduling light-trails on WDM rings
• The price of atomic selfish ring routing
• Wavelength routing of uniform instances in all-optical rings
• An integer programming approach to routing in daisy networks
• Approximation algorithms for the ring loading problem with penalty cost
• Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem
• The permutation-path coloring problem on trees.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Online mixed ring covering problem with two nodes
• Minimizing maximum fiber requirement in optical networks
• Wavelength conversion in optical networks
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
• Sparse and limited wavelength conversion in all-optical tree networks
• Maximizing profits of routing in WDM networks
• Cutting-plane-based algorithms for two branch vertices related spanning tree problems
• Wavelength rerouting in optical networks, or the Venetian Routing problem
• Title not available (Why is that?)

This page was built for publication:

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