Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Peer to Peer: Collaboration and Sharing over the Internet
Peer to Peer: Collaboration and Sharing over the Internet
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Optimal peer selection for minimum-delay peer-to-peer streaming with rateless codes
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
Multimedia Multicast on Internet
Multimedia Multicast on Internet
Overlay Networks with Linear Capacity Constraints
IEEE Transactions on Parallel and Distributed Systems
An optimal discrete rate allocation for overlay video multicasting
Computer Communications
Optimal rate allocation in overlay content distribution
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Will IPTV ride the peer-to-peer stream? [Peer-to-Peer Multimedia Streaming]
IEEE Communications Magazine
Multicast routing and bandwidth dimensioning in overlay networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Overlay-based multicast has been proposed as an efficient solution to ensure multicast communication in the Internet. This paper focuses on modelling of various aspects of fairness in overlay multicast networks aimed at throughput maximization. Two distinct linear programs are proposed. The first formulation employs conceptual flows and provides optimal data rate allocation, whereas the second, relaxed version is derived from fractional Steiner trees. In addition, performance of two optimization tools (CPLEX and GUROBI) is compared in relation of time and result quality meanings. The paper reports that the fractional trees-based formulation provides better time efficiency while its solutions' quality might reach maximum obtainable data rates.