Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Cost-Based Analysis of Hierarchical DHT Design
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Optimal Super-peer Selection for Large-scale P2P System
ICHIT '06 Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploiting KAD: possible uses and misuses
ACM SIGCOMM Computer Communication Review
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Routing Performance in a Hierarchical DHT-based Overlay Network
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
A detailed measurement of skype network traffic
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Hi-index | 0.00 |
Providing innovating multimedia services is a high priority for service providers. Due to the high traffic volume created by multimedia content, the use of decentralised services can lead to better solutions. Starting from the ongoing work of P2PSIP, we define a simple way to interconnect different domains using peer-to-peer networks. We define the needed signalling to provide connectivity between different domains based on P2PSIP. This fact allows an easier deployment of global decentralised multimedia services. We validate the proposed solution through an analytical and experimental study of the routing performance and routing state for two possible scenarios.