SONET/SDH ring assignment with capacity constraints

Authors:
Olivier Goldschmidt;Alexandre Laugier;Eli V. Olinick
Affiliations:
OPNET Technologies, Inc., 2006 Delaware Street, Berkeley, CA;Corporate Network Design Department, Network Architecture and Traffic Division, Centre National d'Etudes des Télécommunications/DSE/ISE Sophia, France;Department of Engineering Management, Information, and Systems, Southern Methodist University, P.O. Box 750123 Dallas, TX
Venue:
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Year:
2003

Citing 6
Cited 9

Clustering for the design of SONET rings in interoffice telecommunications

Management Science
The Ring Loading Problem

SIAM Journal on Discrete Mathematics
Scalable WDM access network architecture based on photonic slot routing

IEEE/ACM Transactions on Networking (TON)
Between Min Cut and Graph Bisection

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms

Operations Research
Exact solution of the SONET Ring Loading Problem

Operations Research Letters

Comparing Metaheuristic Algorithms for Sonet Network Design Problems

Journal of Heuristics
A ring-mesh topology design problem for optical transport networks

Journal of Heuristics
A traffic grooming problem considering hub location for synchronous optical network-wavelength division multiplexing networks

Computers and Industrial Engineering
Solving ring loading problems using bio-inspired algorithms

Journal of Network and Computer Applications
Improved formulations for the ring spur assignment problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems

Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Partition inequalities for capacitated survivable network design based on directed p-cycles

Discrete Optimization
On the solution of a graph partitioning problem under capacity constraints

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Optimal placement of reconfigurable optical add/drop multiplexers with packing, blocking, and signal loss

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of interconnecting a set of customer sites using bidirectional SONET rings of equal capacity. Each site is assigned to exactly one ring and a special ring, called the federal ring, interconnects the other rings together. The objective is to minimize the total cost of the network subject to a ring capacity limit where the capacity of a ring is determined by the total bandwidth required between sites assigned to the same ring plus the total bandwidth request between these sites and sites assigned to other rings.We present exact, integer-programming based solution techniques and fast heuristic algorithms for this problem. We compare the results from applying the heuristic algorithms with those produced by the exact methods for real-world as well as randomly generated problem instances. We show that two of the heuristics find solutions that cost at most twice that of an optimal solution. Empirical evidence indicates that in practice the algorithms perform much better than their theoretical bound and often find optimal solutions.