The use of hop-limits to provide survivable ATM group communications

Authors:
William Yurcik;David Tipper;Deepankar Medhi
Affiliations:
Illinois State University, Dept. of Applied Computer Science, Normal, IL;University of Pittsburgh, Dept. Info. Sci. & Telecommunications, Pittsburgh, PA;University of Missouri - Kansas City, Dept. of Computer Networking, Kansas City, MO
Venue:
COMM '00 Proceedings of NGC 2000 on Networked group communication
Year:
2000

Citing 11
Cited 0

The hop-limit approach for spare-capacity assignment in survivable networks

IEEE/ACM Transactions on Networking (TON)
Models for network design, servicing and monitoring of ATM networks based on the virtual path concept

Computer Networks and ISDN Systems
Combinatorial design of congestion-free networks

IEEE/ACM Transactions on Networking (TON)
Multicommodity flow models, failure propagation, and reliable loss network design

IEEE/ACM Transactions on Networking (TON)
Fiber Network Service Survivability

Fiber Network Service Survivability
ATM Network Resource Management

ATM Network Resource Management
SEAM: Scalable and Efficient ATM Multicast

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Providing ATM Multipoint Survivability Via Disjoint VC Mesh Backup Groups

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Reliable concurrent multicast from bursty sources

IEEE Journal on Selected Areas in Communications
SMART: a many-to-many multicast protocol for ATM

IEEE Journal on Selected Areas in Communications
Service-specific control architectures for ATM

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that has evolved from solving point-to-point routing problems but has not been fully developed for group communications. A hop-limit: (1) limits the number of routes considered such that the routing problems of higher order complexity can be solved and (2) limits the length of any individual route to meet specific Quality of Service guarantees (such as delay). This paper focuses on the former. We compare the feasibility and cost of providing survivability using working multipoint routes with disjoint dedicated backup multipoint routes, where the multipoint routes are setup using either Self-Healing Rings, Shared Multicast Trees, or VC Meshes. We found that hop-limit constraints allowed us to exactly solve NP-complete routing problem on real networks.