Theory of linear and integer programming
Theory of linear and integer programming
Computer capacity planning: theory and practice
Computer capacity planning: theory and practice
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Serving DNS Using a Peer-to-Peer Lookup Service
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
An important problem in any structured Peer-to-Peer (P2P) overlay is what routes are available between peers. Understanding the structure of routes helps to solve challenging problems related to routing performance, security, and scalability. In this paper, we propose a theoretical approach for describing routes. It is based on a recent result in the linear Diophantine analysis and introduces a novel Diophantine model of P2P routes. Such a route aggregates several P2P paths that packets follow. A commutative context-free grammar describes the forwarding behavior of P2P nodes. Derivations in the grammar correspond to P2P routes. Initial and final strings of a derivation define packet sources and destinations, respectively. Based on that we construct a linear Diophantine equation system, where any solution counts forwarding actions in a route representing certain integral properties. Therefore, P2P paths and their composition into routes are described by a linear Diophantine systems; its solutions (basis) define a structure of P2P paths.