Peer-to-peer simulation frameworks: a survey
draft-irtf-p2prg-simulation-survey-00
Document | Type |
Expired Internet-Draft
(p2prg RG)
Expired & archived
|
|
---|---|---|---|
Authors | Vijay K. Gurbani , Anirban Basu , Matthias Wählisch , Mario Kolberg , Thomas C. Schmidt , Simon Fleming | ||
Last updated | 2011-06-28 | ||
RFC stream | Internet Research Task Force (IRTF) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | IRTF state | (None) | |
Consensus boilerplate | Unknown | ||
Document shepherd | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Peer-to-peer (p2p) protocols, like all distributed protocols, are complex, and therefore harder to debug and study in the wild. This is more true of existing p2p protocols, where changing the behaviour of the protocol --- however minor the change may be --- may result in unknown manifestations on the dynamics of the swarm using that protocol. In lieu of the unintended consequences of perturbing a live swarm, researchers have resorted to simulation frameworks. However, simulation results obtained from one simulator are often hard to reproduce when using another simulation framework. This document surveys existing simulator frameworks prevalent in simulating p2p protocols today in order to quantify any assumptions and characteristics inherent in the simulator. This, we hope, will aid future researchers in choosing the right simulation framework for their abstraction.
Authors
Vijay K. Gurbani
Anirban Basu
Matthias Wählisch
Mario Kolberg
Thomas C. Schmidt
Simon Fleming
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)