A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
P2Cast: peer-to-peer patching scheme for VoD service
WWW '03 Proceedings of the 12th international conference on World Wide Web
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Making the breakout algorithm complete using systematic search
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The future success of application layer video multicast depends on the availability of video stream distribution methods that can scale in the number of stream senders and receivers. Previous work on the problem of application layer video streaming has not effectively addressed scalability in the number of receivers and senders. Therefore, new solutions that are amenable to analysis and can achieve scalable P2P video streaming are needed. In this work we propose the use of automated negotiation algorithms to construct video streaming trees at the application layer. We show that automated negotiation can effectively solve the problem of distributing a video stream to a large number of receivers.