P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
GoalBit: the first free and open source peer-to-peer streaming network
Proceedings of the 5th International Latin American Networking Conference
An Enhanced P4P-Based Pastry Routing Algorithm for P2P Network
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
A trust model in P4P-integrated P2P networks based on domain management
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Joserlin: joint request and service scheduling for peer-to-peer non-linear media access
Proceedings of the 21st ACM international conference on Multimedia
| Hi-index | 0.02 |
The design of efficient protocols for mesh-based Peer-to-Peer (P2P) networks has many challenges, one of them is the bandwidth allocation. On one hand, users (called peers) demand high Quality of Experience and network traffic when they watch their streaming contents. On the other, Internet Service Providers (ISPs) support their business with the capacity of their international links. A recent strategy considered in order to meet both peers and ISPs requirements is the Proactive Provider Participation, shortly named P4P [10]. This approach allocates the maximum total traffic in the network, reducing at the same time the percentage use of the most congested links. This paper addresses the bilevel P4P problem. We introduce a polytime solution which achieves any given accuracy when only one content is delivered in the network In addition, we design a greedy randomized technique when multiple contents are shared. Finally, we apply our algorithm to a real peer-to-peer live video-streaming platform, when a single content is delivered. The results highly outperform current strategies.