Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
SSJ: SSJ: a framework for stochastic simulation in Java
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Stochastic Graph Transformation Systems
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Attributed graph transformation with node type inheritance
Theoretical Computer Science
Incremental pattern matching in the viatra model transformation system
Proceedings of the third international workshop on Graph and model transformations
VoIP Handbook: Applications, Technologies, Reliability, and Security
VoIP Handbook: Applications, Technologies, Reliability, and Security
Stochastic simulation of graph transformation systems
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Simple deadlock-free dynamic network reconfiguration
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Stochastic analysis of graph transformation systems: a case study in P2P networks
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Incremental pattern matching for the efficient computation of transitive closure
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.01 |
P2P systems are characterised by large-scale distribution and high degree of architectural dynamics caused by their lack of central coordination. In such an environment, it is notoriously hard to guarantee a good quality of service. Simulation can help to validate network designs and protocols, but most existing simulation approaches cannot cope with unbounded dynamic change of network topology. We propose an approach to modelling and simulation of P2P systems based on graph transformations, a visual rule based formalism that has recently been supported by facilities for stochastic modelling and simulation. Focussing on P2P VoIP applications such as Skype, we model alternative solutions to the problem of selection of and connection to super nodes (i.e., the peers acting as servers in the network) and evaluate these through simulation.