scispace - formally typeset
Proceedings ArticleDOI

Routing multipoint connections using virtual paths in an ATM network

Reads0
Chats0
TLDR
The point-to-multipoint routing problem is studied for an asynchronous transfer mode (ATM) network that uses virtual paths (VPs) and heuristics for finding a low cost multicast routing tree, based on the transshipment simplex algorithm, are developed.
Abstract
The point-to-multipoint routing problem is studied for an asynchronous transfer mode (ATM) network that uses virtual paths (VPs). ATM networks with asymmetric and symmetric VPs are considered, and the performance factors studied are bandwidth and establishment and switching costs. A VP with intermediate exit, where a node that performs VP switching can copy the switched packets for the local destination, is proposed and studied. Mathematical formulations of multicast routing problems are presented, and heuristics for finding a low cost multicast routing tree, based on the transshipment simplex algorithm, are developed. >

read more

Citations
More filters
Journal ArticleDOI

Multipoint communication: a survey of protocols, functions, and mechanisms

TL;DR: In this article, a survey of protocol functions and mechanisms for data transmission within a group, from multicast routing problems up to end-to-end multipoint transmission control is presented.
Journal ArticleDOI

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

TL;DR: A new algorithm is presented which creates redundant trees on arbitrary node- redundant or link-redundant networks 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.
Proceedings ArticleDOI

Degree-constrained multicasting in point-to-point networks

TL;DR: In this paper, the degree-constrained multicast tree problem is modeled as the Steiner problem in networks and several Steiner heuristics for the multicast trees are proposed.
Journal ArticleDOI

Resource management with virtual paths in ATM networks

TL;DR: The article surveys resource management using virtual paths in an ATM network with a focus on techniques which modify the VPC topology and capacity assignments in order to adapt to changing traffic conditions and possible network failures.
Proceedings ArticleDOI

Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

TL;DR: This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks and uses a near optimal Steiner tree heuristic algorithm called the KMB algorithm to measure the (in)efficiency of these algorithms.
References
More filters
Book

Linear Programming and Network Flows

TL;DR: This chapter discusses the complexity of the Simplex Algorithms and their applications in linear algebra, convex analysis, and Polyhedral Sets.
Journal ArticleDOI

Steiner tree problems

TL;DR: A survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations.
Journal ArticleDOI

Design of a broadcast packet switching network

TL;DR: In this article, an overview of a system designed to handle a heterogeneous and dynamically changing mix of applications is given, based on fiber-optic transmission systems and high-performance packet switching and can handle applications ranging from low speed data to voice to full-rate video.