A course in computational algebraic number theory
A course in computational algebraic number theory
Comprehensive view of a live network coding P2P system
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Foundations and Trends® in Networking
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Network coding tomography for network failures
INFOCOM'10 Proceedings of the 29th conference on Information communications
Orthogonal feedback scheme for network coding
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic idea of such systems is that peers randomly combine and exchange linear combinations of the source packets. A header appended to each packet specifies the linear combination that the packet carries. In this paper we show that the linear combinations a node receives from its neighbors reveal structural information about the network. We propose algorithms to utilize this observation for topology management to avoid bottlenecks and clustering in network-coded P2P systems. Our approach is decentralized, inherently adapts to the network topology, and reduces substantially the number of topology rewirings that are necessary to maintain a well connected overlay; moreover, it is integrated in the normal content distribution. This work demonstrates another advantage of using network coding and complements previous work that showed network coding achieves high network-resource utilization.