Sciweavers

54 search results - page 1 / 11
» A Tree Switching Protocol for Multicast State Reduction
Sort
View
ISCC
2000
IEEE
13 years 9 months ago
A Tree Switching Protocol for Multicast State Reduction
In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by s...
Filli Y. Y. Cheng, Rocky K. C. Chang
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
13 years 10 months ago
Reducing the Forwarding State Requirements of Point-to-Multipoint Trees Using MPLS Multicast
IP multicast was first proposed to improve the performance of applications that require group communications. Still, many years after its initial proposal, IP multicast is not wi...
George Apostolopoulos, Ioana Ciurea
CCGRID
2002
IEEE
13 years 10 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
SIGCOMM
1998
ACM
13 years 9 months ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj
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