The name

Eruption.S – Event-driven underlay-aware packet-based interactive overlay network simulator. Written in .NET.

  • Event-driven: each peer maintains a list of tasks to perform at specified moments.
  • Underlay-aware: the underlay network consists of ASes. ASes consist of routers and peers. Devices have interfaces. Interfaces have buffers and packet drop policies.
  • Packet-based: each message is divided into packets which traverse the underlay network.
  • Interactive: contains GUI. There is a possibility to watch the packets and statistics during the simulation.


  • Wojciech Krzysztofek (C, I)
  • Piotr Wydrych (C, I)
  • Rafał Stankiewicz (I)
  • Zbigniew Duliński (I)
  • Mirosław Kantor (I)
  • Piotr Chołda (I)
  • Bartosz Polaczyk (C)
  • Magdalena Kandyba (C)


Eruption.S main window

Source code and binaries

There is no public site with source code and binaries. However, it does not mean that we do not cooperate wit other researchers. The code or binaries can be made available upon request.


The simulator was used to prepare research results published in:

  • P. Wydrych and P. Chołda, “Will P2P users cooperate with ISPs? A word-of-mouth communication approach,” (presentation) in Proc. IEEE Int Communications (ICC) Conf, Ottawa, Canada, Jun. 2012. ©IEEE, available on IEEE Xplore.

    Researchers who address the problem of application-level traffic optimization often consider only the simplest comparison scenario: (a) the case before the option to cooperate and optimize the service is enabled, and (b) the case in which all clients try to optimize the traffic. In this paper, the situations that a user may not wish to cooperate or that a user does not perceive the optimization possibility to be valuable enough to cooperate are taken into account. An analytical model for estimating the popularity of the cooperate-to-optimize option is derived. A method for calculating the time-dependent value of the predicted popularity is presented. The model is verified by simulation experiments.

  • Z. Duliński, R. Stankiewicz, P. Wydrych, M. Kantor, and P. Chołda, “Cost-driven peer rating algorithm,” in Proc. IEEE Int Communications (ICC) Conf, Kyoto, Japan, Jun. 2011. ©IEEE, available on IEEE Xplore.

    The paper presents a concept of a rating algorithm aiming at overall peer-to-peer traffic reduction (and locality awareness) and decrease of load on costly links, thus diminishing operator’s costs. The rating algorithm is not only performed by a sole Oracle, as is typically proposed, but its operation is also supported by a similar entity located in other domains. Due to this concept, a usually omitted fact that the inter-domain routes are asymmetrical is properly dealt with. Simulations performed on a real topology show the usefulness of the presented approach.

  • Z. Duliński, M. Kantor, W. Krzysztofek, R. Stankiewicz, and P. Chołda, “Optimal Choice of Peers based on BGP Information,” in Proc. IEEE Int Communications (ICC) Conf, Cape Town, South Africa, May, 2010.