Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Non-transitive connectivity and DHTs
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
Challenges, design and analysis of a large-scale p2p-vod system
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An analytical study of a structured overlay in the presence of dynamic membership
IEEE/ACM Transactions on Networking (TON)
Key-based consistency and availability in structured overlay networks
Proceedings of the 3rd international conference on Scalable information systems
NAT-resilient Gossip Peer Sampling
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
NATCracker: NAT Combinations Matter
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
| Hi-index | 0.00 |
Dealing with Network Address Translators (NATs) is a central probleminmany peer-to-peer applications on the Internet today.However, most analytical models of overlay networks assume the underlying network to be a complete graph, an assumption that might hold in evaluation environments such as Planet-Lab but turns out to be simplistic in practice. In this work we introduce an analytical network model where a fraction of the communication links are unavailable due to NATs. We investigate how the topology induced by the model affects the performance of ring based DHTs. We quantify two main performance issues induced by NATs namely large lookup inconsistencies and increased break-up probability, and suggest how theses issues can be addressed. The model is evaluated using discrete based simulation for a wide range of parameters.