Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
The auction algorithm for the transportation problem
Annals of Operations Research
Data networks (2nd ed.)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
rStream: resilient peer-to-peer streaming with rateless codes
Proceedings of the 13th annual ACM international conference on Multimedia
A peer-to-peer architecture for media streaming
IEEE Journal on Selected Areas in Communications
Journal of Parallel and Distributed Computing
Proceedings of the international workshop on Workshop on mobile video
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
IEEE Transactions on Parallel and Distributed Systems
Optimized union of non-disjoint distributed data sets
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A location aware P2P voice communication protocol for networked virtual environments
Proceedings of the 16th ACM Symposium on Virtual Reality Software and Technology
Distribllted throughput maximization in P2P VoD applications
IEEE Transactions on Multimedia - Special section on communities and media computing
Optimal resource allocation for video communication over distributed systems
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
An overview of network coding for multimedia streaming
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Layered peer to peer streaming using hidden Markov models
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Modeling and optimization of survivable P2P multicasting
Computer Communications
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
On modelling of fair throughput allocation in overlay multicast networks
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Peer selection in p2p service overlays using geographical location criteria
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part II
Hi-index | 0.00 |
Due to the limitation of peer upload capacities and high bandwidth demand of multimedia applications, optimal peer selection to construct high-quality streaming topology represents a major challenge in peer-to-peer streaming. In this paper, we propose a fully distributed algorithm to achieve optimal peer selection and streaming rate allocation, which minimizes end-to-end latencies in the streaming sessions. We design this efficient distributed algorithm based on the solution to a linear optimization model, which optimizes towards a latency-related objective to decide the best streaming rates among peers. Combining this optimal peer selection algorithm with our coding scheme based on rateless codes, we obtain a complete, fully decentralized minimum-delay peer-to-peer streaming scheme. Our scheme is resilient to network dynamics that is characteristic in peer-to-peer networks. The validity and effectiveness of our approach are demonstrated in extensive simulations.