A commercial application of survivable network design: ITP/INPLANS CCS Network Topology Analyzer
The ITP/INPLANS CCS Network Topology Analyzer is a Bellcore product which performs automated design of cost effective survivable CCS (Common Channel Signaling) networks, with survivability meaning that certain path-connectivity is preserved under limited failures of network elements. The algorithmic core of this product consists of suitable extensions of primal-dual approximation schemes for Steiner network problems. Even though most of the survivability problems arising in CCS networks are not strictly of the form for which the approximation algorithms with proven performance guarantees apply, we implemented modifications of these algorithms with success: In addition to duality-based performance guarantees that indicate, mathematically, discrepancy of no more than 20% from optimality for generic Steiner problems and no more than 40% for survivable CCS networks, our software passed all commercial benchmark tests, and our code was deployed with the August 94 release of the product. CCS networks fall in the general category of low bit-rate backbone networks. The main characteristic of survivability problems for these networks is that each edge, once present, can be assumed to carry arbitrarily many paths. For high bit-rate backbone networks, such as the widely used ATM and SONET, this is no longer the case. We discuss versions of network survivability with capacitated edges that appear to model survivability considerations in such networks.
- OSTI ID:
- 416810
- Report Number(s):
- CONF-960121-; TRN: 96:005887-0033
- Resource Relation:
- Conference: 7. annual ACM-SIAM symposium on discrete algorithms, Atlanta, GA (United States), 28-30 Jan 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms; PB: 596 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks
Improving Steiner trees of a network under multiple constraints