Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
A Generic Concept for Large-Scale Multicast
IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
An Analysis of Internet Inter-Domain Topology and Route Stability
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The Ordered Core Based Tree Protocol
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
Multicast routing with end-to-end delay and delay variation constraints
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
Analysis of the performance of dynamic multicast routing algorithms
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol
Computer Communications
| Hi-index | 0.24 |
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 path length bounds for each receiver. The PLC algorithm can be implemented as a distributed algorithm, can tradeoff end-to-end delay and bandwidth consumption, and can be implemented for polynomial time execution. Analysis and simulation show that (a) the PLC algorithm generates multicast trees which consume less bandwidth than those generated by the SPT algorithm while guaranteeing the same shortest path length and (b) consume less bandwidth than trees generated by the Greedy algorithm with only a moderate increase in path length. The PLC algorithm is more flexible and has a lower cost than a combined SPT and Greedy algorithm.