An efficient and easily deployable QoS-based routing scheme for online Internet multicasting

Authors:
T. Alrabiah;T. F. Znati
Affiliations:
Quantitative Methods Department, King Saudi University, Riyadh, Saudi Arabia;Department of Computer Science, Telecommunications Program, University of Pittsburgh, Pittsburgh, PA 15260, USA
Venue:
Computer Communications
Year:
2001

Citing 10
Cited 3

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Multicast routing extensions for OSPF

Communications of the ACM
Minimising packet copies in multicast routing by exploiting geographic spread

ACM SIGCOMM Computer Communication Review
A Simulation Framework for the Analysis of Multicast Tree Algorithms

SS '97 Proceedings of the 30th Annual Simulation Symposium (SS '97)
Low-Cost, Bounded-Delay Multicast Routing for QoS-Based Networks

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process

Computers and Operations Research
Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process

Computers and Operations Research
An efficient algorithm for constructing delay bounded minimum cost multicast trees

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.24

Visualization

Abstract

With the advent of multimedia applications, the support of online multicasting with quality of service guarantees has gained considerable attention in the field of communication networks and distributed systems. Online multicasting requires the support of online join and leave operations. In this paper, a new Simple and Efficient Low-cost Delay-bounded Online Multicasting (SELDOM) heuristic is proposed. SELDOM is particularly tailored to networks in which group membership changes frequently. SELDOM supports two modes of operations: non-rearrangeable and rearrangeable. The scheme handles join requests dynamically by determining the least-cost path which satisfies the required delay-bounds to which the new group member is to be attached. To handle a leave request, the scheme seeks to limit the number of rearrangements required in order to reduce the disturbance such a request may cause to current group members. The worst case time complexity of SELDOM is O(n^2). An important research contribution of this work shows that if any non-rearrangeable multicast heuristic uses a path other than the least-delay path to add a node to the multicast tree, then the resulting multicast tree can have cycles or nodes with two incoming paths. A simulation-based comparison between non-rearrangeable and rearrangeable online multicast trees is also presented.