Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Multiwavelength Optical Networks with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Sequence of Bounds for the Problem of Minimizing Electronic Routing in Wavelength Routed Optical Rings
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal virtual topologies for one-to-many communication in WDM paths and rings
IEEE/ACM Transactions on Networking (TON)
Virtual topologies for multicasting with multiple originators in WDM networks
IEEE/ACM Transactions on Networking (TON)
Competitive analysis of online traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
Hardness and approximation of traffic grooming
Theoretical Computer Science
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. We present a new framework consisting of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path, and adopting the locally optimal topology within each set. Our approach can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions.