Performance evaluation of multipoint routing algorithms

Waxman, Bernard M.

doi:10.1109/infcom.1993.253268

Cited by 64 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the theoretical work in the existing literature has focussed on undirected versions of the problem, and algorithms achieving constant factors have been given by several authors [6,14]. Work has also been done on the performance of these undirected Steiner tree heuristics in the context of multicast routing [21]. The problem of multicast routing in directed networks and the directed Steiner tree problem has received considerable attention only recently [9, 19].…”

Section: Current State Of the Artmentioning

confidence: 99%

Online multicast routing with bandwidth guarantees

Kodialam¹,

Lakshman²,

Sengupta

2000

Proceedings of the 2000 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

View full text Add to dashboard Cite

This paper presents a new algorithm for on-line routing of bandwidth-guaranteed multicasts where routing requests arrive one-by-one without there being any a priori knowledge of future requests. A multicast routing request consists of a source s, a set of receivers R, and a bandwidth requirement b. This multicast routing problem arises in many contexts. Two applications of interest are routing of pointto-multipoint label-switched paths in Multi-Protocol Label Switched (MPLS) networks, and the provision of bandwidth guaranteed Virtual Private Network (VPN) services under the "hose" service model [17]. Off:line multicast routing algorithms cannot be used since they require a priori knowledge of all multicast requests that are to be routed. Instead, on-line algorithms that handle requests arriving one-by-one and that satisfy as many potential future demands as possible are needed. The newly developed algorithm is an on-line algorithm and is based on the idea that a newly routed multicast must follow a route that does not "interfere too much" with network paths that may be critical to satisfy future demands. We develop a multicast tree selection hettristic that is based on the idea of deferred loading of certain "critical" links. These critical links are identified by the algorithm as links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs. The presented algorithm uses link-state information and some auxilliary capacity information for multicast tree selection and is amenable to distributed implementation. Unlike previous algorithms, the proposed algorithm exploits any available knowledge of the network ingress-egress points of potential future demands even though the demands themselves are unknown and performs very well. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advant -age and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. .m [ I n f o r m a t i o n S y s t e m s ] : Miscellaneous; D.2 [Software]: Software Engineering; D.2.8 [ S o f t w a r e E n g i n e e r i n g ]

show abstract

Section: Current State Of the Artmentioning

confidence: 99%

Online multicast routing with bandwidth guarantees

Kodialam¹,

Lakshman²,

Sengupta

2000

Proceedings of the 2000 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

View full text Add to dashboard Cite

show abstract

“…This is a major subject in its own right and has been discussed in a number of papers [18,19]. For the kind of dynamically changing connections considered here, the only practical choices that have been identified are variations on a simple greedy algorithm that adds new endpoints using a shortest path from the endpoint to the connection, and deletes endpoints by pruning the branch needed only by the endpoint being dropped.…”

Section: Connectionmentioning

confidence: 99%

“…While the worst-case performance of these algorithms can be poor, simulations provide evidence that they should work well in practice [18,19].…”

Section: Connectionmentioning

confidence: 99%

Issues in distributed control for ATM networks

Turner

1995

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing - PODC '95

View full text Add to dashboard Cite

Asynchronous llansfer Mode (ATM) network technology is expected to become a central part of the emerging global information infrastructure. ATM networks introduce a number of feat urea that distinguish them from earlier technologies and introduce new issues in network control. This paper offers a framework for precisely defining and analyzing alternative approaches to the distributed controi of ATM networks and explores some of the key design issues through a series of examples, It is hoped that it will provide a useful foundation for researchers in networking and distributed computing interested in expJoring these issues further and developing more complete SOIUtions.

show abstract

“…Recent research efforts in the area of multicast routing (few of them have been conducted keeping in perspective the requirements of ATM networks) have followed the following broad approach: the underlying network is modeled as a graph (directed or undirected) with links as edges and switches as nodes; and each edge is assigned a "cost" (for instance the cost could be a measure of expected delay). The multicast routing problem is then reduced to finding a "tree" that spans the nodes that wish to participate in a given multicast connection that has minimal cost [1][4] [7][10] [11] [12]. The above problem is known in the literature as the Steiner tree problem (an NP-complete [9] problem) for which several heuristics have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Multicast Routing in ATM Networks

Cheung

Chu

Tsang

et al. 2000

Broadband Communications

View full text Add to dashboard Cite

In this paper, we study the problem of multicast routing in ATM based networks. We propose a dynamic multicast algorithm in ATM networks called Least Load Multicast Routing (LLMR) algorithm and the algorithm with statistical multiplexing is considered. A numerical example is presented to show the characteristics of LLMR. Moreover, we find that the connection blocking probabilities decrease with increasing destination size.

show abstract

Performance evaluation of multipoint routing algorithms

Cited by 64 publications

References 6 publications

Online multicast routing with bandwidth guarantees

Online multicast routing with bandwidth guarantees

Issues in distributed control for ATM networks

Multicast Routing in ATM Networks

Contact Info

Product

Resources

About