Sciweavers

18 search results - page 1 / 4
» The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic...
Sort
View
LCN
1999
IEEE
13 years 9 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
ICC
2007
IEEE
140views Communications» more  ICC 2007»
13 years 11 months ago
Performance Analysis for Overlay Multicast on Tree and M-D Mesh Topologies
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...
Wanqing Tu
COMCOM
2000
96views more  COMCOM 2000»
13 years 5 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
IPPS
2002
IEEE
13 years 10 months ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
ICNP
2002
IEEE
13 years 10 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman