Interconnection of self-healing rings

Shi, J.J.; Fonseka, J.P.

doi:10.1109/icc.1996.535180

Cited by 8 publications

(9 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [14] the modified HRN problem was introduced and this was further developed in [15,16,17,18]. We use the same idea of a modified HRN problem in this paper, and the problem modification is described in greater detail in Section 3.…”

Section: Previous Workmentioning

confidence: 99%

“…We use the same idea of a modified HRN problem in this paper, and the problem modification is described in greater detail in Section 3. In the papers [14,15,16,17,18] both a heuristic and an enumerative scheme is described, but the number of possible networks grows exponentially, making the enumerative scheme useless except for small and trivial instances (less than 10 nodes). The heuristic on the other hand is able to handle large networks, but gives no guarantee regarding the quality of the solutions obtained.…”

Section: Previous Workmentioning

confidence: 99%

“…The number of nodes in the rings is bounded by the hop constraint (15). Subtour elimination constraints (16) ensure that a single ring is generated and finally integer solutions are ensured by the domain constraints (17). We solve the ring-generation problem by branch-and-cut as described in [19], where the subtour elimination constraints are generated as needed.…”

Section: The Ring-generation Problemmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical Ring Network Design Using Branch-and-Price

Thomadsen

Stidsen

2005

Telecommun Syst

View full text Add to dashboard Cite

Abstract. We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed link establishment costs and the link capacity costs into account.Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes.

show abstract

Section: Previous Workmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

Section: The Ring-generation Problemmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Ring Network Design Using Branch-and-Price

Thomadsen

Stidsen

2005

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…Topological requirements are important because they determine whether a mechanism may be used in existing networks and because they may impact significantly the cost of constructing new networks or extensions to existing networks. The building blocks of SDH/SONET networks are generally self-healing rings (SHR's) and diversity protection (DP) [69], [67], [50], [49], [58]. SHR's are UPSR's or BLSR's, while DP refers to physical redundancy, where a spare link (node) is assigned to one or several links (nodes) [75, pp.…”

Section: E Topological Requirementsmentioning

confidence: 99%

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

Médard

Finn²,

Barry³

et al. 1999

IEEE/ACM Trans. Networking

264

195

View full text Add to dashboard Cite

Abstract-We present a new algorithm which creates redundant trees on arbitrary node-redundant or link-redundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned recovery of communications with great flexibility in the topology design. Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network. In the case of failure of a communications link, our algorithm provides a superset of the previously known trees.

show abstract

“…In [6] and [15], a hierarchy of interconnected rings is proposed to design multi-ring SONET transport networks. In [16], SHRs with shared-line protection are considered to protect the offered traffic in a mesh network.…”

Section: Introductionmentioning

confidence: 99%

Optimal design of survivable mesh networks based on line switched WDM self-healing rings

Fumagalli

Cerutti

Tacca

2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Network survivability provided at the optical layer is a desirable feature in modern high-speed networks. For example, the wavelength division multiplexed (WDM) self-healing ring (or SHR/WDM) provides a simple and fast optically transparent protection mechanism against any single fault in the ring. Multiple self-healing rings may be deployed to design a survivable optical mesh network by superposing a set of rings on the arbitrary topology. However, the optimum design of such a network requires the joint solution of three subproblems: the ring cover of the arbitrary topology (the RC subproblem); the routing of the working lightpaths between end node pairs to carry the offered traffic demands (the WL subproblem); and the provisioning of the SHR/WDM spare wavelengths to protect every line that carries working lightpaths (the SW subproblem). The complexity of the problem is exacerbated when software and hardware requirements pose additional design constraints on the optimization process.The paper presents an approach to optimizing the design of a network with arbitrary topology protected by multiple SHRs/WDM. Three design constraints are taken into account, namely, the maximum number of rings acceptable on the same line, the maximum number of rings acceptable at the same node, and the maximum ring size. The first objective is to minimize the total wavelength mileage (working and protection) required in the given topology to carry a set of traffic demands. The exact definition of the problem is given based on an integer linear programming (ILP) formulation that takes into account the design subproblems and constraints and assumes ubiquitous wavelength conversion availability. To circumvent the computational complexity of the exact problem formulation, a suboptimal solution is proposed based on an efficient pruning of the solution space. By jointly solving the three design subproblems, it is numerically demonstrated that the proposed optimization technique yields up to 12% reduction of the total wavelength mileage when compared to solutions obtained by sequentially and independently solving the subproblems. The second objective is to reduce the number of wavelength converters required in the solution produced by the ILP formulation. Two approaches are proposed in this case that trade the required wavelength mileage for the number of wavelength converters.

show abstract

Interconnection of self-healing rings

Cited by 8 publications

References 6 publications

Hierarchical Ring Network Design Using Branch-and-Price

Hierarchical Ring Network Design Using Branch-and-Price

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

Optimal design of survivable mesh networks based on line switched WDM self-healing rings

Contact Info

Product

Resources

About