Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Design and Evaluation of MiMaze, a Multi-Player Game on the Internet
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
End-Host Multicast Communication Using Switch-Trees Protocols
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Priority-based distribution trees for application-level multicast
NetGames '03 Proceedings of the 2nd workshop on Network and system support for games
Low latency and cheat-proof event ordering for peer-to-peer games
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The effects of loss and latency on user performance in unreal tournament 2003®
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games
Peer-to-peer communication across network address translators
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
IEEE Transactions on Information Theory
Research note: Source models of network game traffic
Computer Communications
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Cross-tree adjustment for spatialized audio streaming over networked virtual environments
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Live streaming performance of the Zattoo network
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Collaborative measurements of upload speeds in P2P systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
On next-generation telco-managed P2P TV architectures
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Live streaming with receiver-based peer-division multiplexing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Motivated by an application in distributed gaming, we define and study the latency-constrained total upload maximization problem. In this problem, a peer-to-peer overlay network is modeled as a complete graph and each node vi has an upload bandwidth capacity ci and a set of receivers R(i). Each sender-receiver pair (vi,vj), where vj ∈ R(i), is a request that should be satisfied, i.e., vi should send a data packet to each vj ∈ R(i). The goal is to find a set of at most n multicast-trees Ti of depth at most 2, such that each node can be part of multiple trees, all capacity constraints are met, and the number of satisfied requests is maximized. In this paper, we prove that the problem is NP-complete, and we present an algorithm with approximation ratio 1-2/√cmin, where cmin is the minimum upload capacity. Finally, we also study the impact of network coding on the quality and approximability of the solution.