Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Asymptotic resource consumption in multicast reservation styles
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Sharing the “cost” of multicast trees: an axiomatic analysis
IEEE/ACM Transactions on Networking (TON)
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Pricing Multicasting in More Practical Network Models TITLE2:
Pricing Multicasting in More Practical Network Models TITLE2:
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
On the use of destination set grouping to improve fairness in multicast video distribution
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
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Hardness Results for Multicast Cost Sharing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Budget balanced mechanisms for the multicast pricing problem with rates
Proceedings of the 4th ACM conference on Electronic commerce
Hardness results for multicast cost sharing
Theoretical Computer Science
Pricing in publish/subscribe systems
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
| Hi-index | 0.00 |
The problem of designing efficient algorithms for sharing the cost of multicasting has recently seen considerable attention. In this paper, we examine the effect on the complexity of pricing when two practical considerations are incorporated into the network model. In particular, we study a model where the session is offered at a number of different rates of transmission, and where there is a cost for enabling multicasting at each node of the network. We consider two techniques that have been used in practice to provide multiple rates: using a layered transmission scheme (called the layered paradigm) and using different multicast groups for each possible rate (called the split session paradigm). We demonstrate that the difference between these two paradigms has a significant impact on the complexity of pricing multicasting.For the layered paradigm, we provide a distributed algorithm for computing pricing efficiently in terms of local computation and message complexity. For the split session paradigm, on the other hand, we demonstrate that this problem can be solved in polynomial time if the number of possible rates is fixed, but if the number of rates is part of the input, then the problem becomes NP-Hard even to approximate. We also examine the effect of delivering the transmissions for the various rates from different locations within the network. We show that in this case, the pricing problem becomes NP-Hard for the split session paradigm even for a fixed constant number of possible rates, but if layering is used, then it can be solved in polynomial time by formulating the problem as a totally unimodular integer program.