QoSMIC: quality of service sensitive multicast Internet protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
Distributed core multicast (DCM): a multicast routing protocol for many groups with few receivers
ACM SIGCOMM Computer Communication Review
Efficient Internet Multicast Routing Using Anycast Path Selection
Journal of Network and Systems Management
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
A New Method for Multimedia Multicast Routing in a Large Scale Network
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
New Center Location Algorithms for Shared Multicast Trees
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Core selection with end-to-end QoS support
Proceedings of the 2004 ACM symposium on Applied computing
Trade-offs on the location of the core node in a network
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive server selection for large scale interactive online games
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
A QoS multicast routing protocol for dynamic group topology
Information Sciences: an International Journal
Adaptive server selection for large scale interactive online games
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Networking issues in entertainment computing
QoS-constrained core selection for group communication
Computer Communications
Multicast tree allocation algorithms for Distributed Interactive Simulation
International Journal of High Performance Computing and Networking
Towards efficient event aggregation in a decentralized publish-subscribe system
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Core-selection algorithms in multicast routing - comparative and complexity analysis
Computer Communications
Adaptive server selection for large scale interactive online games
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the methodology for the evaluation of unconstrained multicast routing algorithms
ICT'09 Proceedings of the 16th international conference on Telecommunications
Genetic algorithm-based QoS multicast routing for uncertainty in network parameters
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Minicast: a multicast-anycast protocol for message delivery
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Linear multicasting in dynamic networks
Computer Communications
A case for tree migration and integrated tree maintenance in QoS multicasting
Computer Communications
RPIM-SM: extending PIM-SM for RP relocation
Computer Communications
Hi-index | 0.07 |
Recent multicast routing protocol proposals such as protocol independent multicast (PIM) and core-based trees (CBT) have been based on the notion of group-shared trees. Since construction of a minimal-cost tree spanning for all members of a group is difficult, they rely on center-based trees and distribute packets from all sources over a single shortest-path tree rooted at some center. PIM and CBT provisionally use administrative selection or simple heuristics for locating the center of a group but do not preclude the use of other methods that provide an ordered list of centers. Other previously proposed heuristics typically require knowledge of the complete network topology, a requirement which is not always practical for a distributed problem such as Internet routing. We investigate the problem of finding a good center in a distributed fashion, study various heuristics for automating center selection, and examine their applicability to real-world networks. We also propose several new algorithms which we feel to be more practical than existing methods. We present simulation results on hierarchical and nonhierarchical networks showing that of the methods potentially feasible in the Internet multicast backbone, ours offer the best results in terms of cost and delay, and they incur low overhead