Cart (Loading....) | Create Account
Close category search window

Topological network design for SONET ring architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Luss, H. ; AT&T Bell Labs., Holmdel, NJ, USA ; Rosenwein, M.B. ; Wong, R.T.

Service restoration and survivability have become increasingly important in telecommunications network planning with the introduction of fiber-optic high-speed networks. Synchronous optical network (SONET) technology promotes the use of interconnected rings in designing reliable networks. We describe a heuristic approach for designing networks comprised of interconnected rings. Our approach is particularly attractive for relatively sparse networks in which the set of all cycles (constituting the potential rings) can be determined at a reasonable computational effort. Most networks fall into this category. Given a set of nodes, with demand among all possible node-pairs, and a set of available links that connect the nodes, the problem is to select an optimal subset of rings, utilizing only allowable links, such that each node is included in at least one ring and each ring is connected to at least one other ring at two or more nodes. Such a multiple ring network ensures instantaneous restoration of service in case of a single link or node failure. We first generate a large set of candidate rings and approximate the cost of each ring based on the nodes that are served by the ring and based on the demands. We then apply a set covering algorithm that selects a (minimum cost) subset of the candidate rings such that each node is included on at least one ring. Finally, we select a few additional rings in order to achieve the required connectivity among the rings. We present computational results for realistic-size (e.g., 500 nodes) telecommunication networks

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:28 ,  Issue: 6 )

Date of Publication:

Nov 1998

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.