Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Multimedia Multicast on Internet
Multimedia Multicast on Internet
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Watching television over an IP network
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Review: Comparative study of broadcast and multicast in 3GPP and 3GPP2 networks
Computer Communications
On Maximizing IP Multicast Throughput in Multi-Source Applications
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
A multi-tree construction algorithm for multi-channel live media delivery on overlay service network
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A Fair Load Sharing Scheme for Multi-source Multimedia Overlay Application Layer Multicast
CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Optimal Swarming for Massive Content Distribution
IEEE Transactions on Parallel and Distributed Systems
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Content distribution over IP: developments and challenges
Network performance engineering
Efficient Online WiFi Delivery of Layered-Coding Media Using Inter-layer Network Coding
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
A novel fountain code-based mobile IPTV multicast system architecture over WiMAX network
Journal of Visual Communication and Image Representation
Layered Multicast With Inter-Layer Network Coding for Multimedia Streaming
IEEE Transactions on Multimedia
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Multicast Broadcast Services Support in OFDMA-Based WiMAX Systems [Advances in Mobile Multimedia]
IEEE Communications Magazine
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks
IEEE Transactions on Circuits and Systems for Video Technology
-Channel Multiple Description Coding With Two-Rate Coding and Staggered Quantization
IEEE Transactions on Circuits and Systems for Video Technology
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Optimal Layered Video IPTV Multicast Streaming Over Mobile WiMAX Systems
IEEE Transactions on Multimedia
The Journal of Supercomputing
Hi-index | 0.00 |
We investigate the problem of maximizing multicast throughput under a fairness constraint. Multiple server nodes wish to communicate to their intended set of client nodes over a shared network infrastructure. Our goal is to devise distributed algorithms to construct multicast sessions, one for each server node, such that (a) the network infrastructure is optimally utilized and (b) the network resources are fairly distributed between multicast sessions, i.e., no individual session claims more than a prescribed share of the network bandwidth resources. We are particularly interested in multi-tree multicast strategies in which every multicast session may contain many multicast trees. We show how the use of multiple trees increases network throughput and the load distribution in the network. We propose a class of round-robin algorithms that are based on successive selection of multicast trees for each multicast session, in a loosely cooperative, yet distributed fashion. Our best algorithm, the Cooperative Shortest Path Tree Packing (CSPTP) algorithm, performs well in a variety of scenarios, ranging from very sparse to dense applications. Through extensive simulations on random networks, we compare the performance of our algorithms with those commonly used in IP-multicast as well as theoretical upper bounds derived from network coding formulations. We show that the CSPTP can improve the throughput, and often achieves about 90% of the theoretical upper bound.