Peer-to-Peer protocols and overlay networks
CLOSER: Efficient management of network resources in peer-to-peer overlays
Analysis and measurements run over some Internet Service Provider (ISP) networks show that a significant amount of the traffic over the Internet is produced by peer-to-peer applications. These are historically user-driven applications that operate without the support of ISPs and, thus, without any knowledge about the underlying network topology. This could be very inefficient for both users, which experience low-rate transfers, and ISPs, which have to deal with link congestion due to these large amounts of traffic.
This project aims at studying and validating novel approaches for ISPs to effectively control peer-to-peer overlays topology, in order to improve both resource utilization and quality of service perceived by users.
Funded by Telecom Italia Labs
Policies and algorithms for a distributed relay service architecture
The evolutionary trend of the next generation fixed/mobile communication system is towards IP-based networks. A system of this type has to deal with the heterogeneity of end-systems that are present in the network. In particular, private IP address based nodes behind Network Address Translators (NATs), public IPv4 nodes, and IPv6 nodes have to be able to communicate and interwork. Several techniques to enable direct communications have been proposed, but in lots of cases a relay node that acts as intermediary is required. This service is usually offered by a centralized server, with consequent issues concerning the scalability and the robustness of the solution.
This research work aims at studying a distributed relay service architecture where all nodes with proper characteristics are joined in a peer-to-peer overlay network and can offer such service. In particular, the purpose of the work is to define proper topologies, policies, and algorithms which can effectively enable a distributed relay service. These include the overlay architecture, the look-up technique, and the relay choice.