A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Inter-receiver fairness: a novel performance measure for multicast ABR sessions
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Graph theory and its applications
Graph theory and its applications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Measuring the effects of internet path faults on reactive routing
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
QoS-Assured Service Composition in Managed Service Overlay Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A routing underlay for overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient Multicast Flow Control using Multiple Multicast Groups
Efficient Multicast Flow Control using Multiple Multicast Groups
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
Dynamic overlay routing based on available bandwidth estimation: a simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
TOMA: a viable solution for large-scale multicast service support
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
IEEE Communications Magazine
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
QRON: QoS-aware routing in overlay networks
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Computers and Operations Research
Multi-channel live streaming in service overlay network
Multimedia Tools and Applications
An overlay multicast protocol for live streaming and delay-guaranteed interactive media
Journal of Network and Computer Applications
A Computational Model of Mitigating Disease Spread in Spatial Networks
International Journal of Artificial Life Research
Hi-index | 0.24 |
Overlay routing enhances the reliability and performance of IP networks since it can bypass network congestion and transient outages by forwarding traffic through one or more intermediate overlay nodes. In this paper, two algorithms for multicast applications in service overlay networks are presented. The first algorithm is tailored for source-specific applications such as live video, software and file distribution, replicated database, web site replication, and periodic data delivery; it builds a virtual source-rooted multicast tree to allow one member in the multicast group to send data to the other members. The second algorithm is tailored for group-shared applications such as videoconference, distributed games, file sharing, collaborative groupware, and replicated database; it constructs a virtual shared tree among group members. The objective of both algorithms is to achieve traffic balancing on the overlay network so as to avoid traffic congestion and fluctuation on the underlay network, which cause low performance. To address these problems, the algorithms actively probe the underlay network and compute virtual multicast trees by dynamically selecting the least loaded available paths on the overlay network. This way, network resources are optimally distributed and the number of multicast trees that can be setup is maximized. Both algorithms can offer service differentiation, i.e., provide QoS at application-layer without IP-layer support. The low computational complexity of the proposed algorithms leads to time and resource saving, as shown through extensive simulation experiments.