News – PeerfactSim.KOM – Community Edition

17. June 2016 – New version released: PeerfactSim.KOM – Community Edition – 2016.06.17

posted Jun 17, 2016, 5:24 PM by Andreas Disterhöft

Today the team at the University of Düsseldorf and the University of Paderborn published a new version of PeerfactSim.KOM, which comes with a huge number of bug fixes, features and extensions. Stay tuned for the whole change log!

===========================================================
2016-06-17 PeerfactSim.KOM – Community Edition – ver. 20160617
===========================================================

This version of PeerfactSim.KOM is based on PeerfactSim.KOM v4.0 – Fork UPB (2013-01-31).

For questions regarding this fork, please visit http://www.peerfact.com or write us an email: <peerfact@cs.uni-duesseldorf.de>

This current version comes with following extensions:

Part 1: New

======================================

Application layer – Monitoring:
– New SkyEye.KOM implementation with a few addons like MaliciousSkyEye and GossipSkyEye.
— Vanilla SkyEye: monitoring of deterministic functions (sinus, dirac, ziczac, rectangle) or gathered metrics by the local node (hops, response times etc.) using a tree structure. Aggregating bottom top the tree and disseminating the global view top bottom.
— Malicious SkyEye: SkyEye extension to handle malicious nodes.
— Gossip SkyEye: Enhancing the robustness of the SkyEye tree by using gossip connections.
— Check out the configurations under config/scenarios/monitoring/SkyEye*.xml, GossipSkyEye*.xml and MaliciousSkyEye*.xml
– New Push-sum implementation available: Push-Sum Implementation: like SkyEye it can monitor deterministic functions or gathered metrics by the local node but instead of using a structure (e.g. a tree) this approach is gossip-based, meaning each node selects a random neighbor to exchange its current view of the network. This approach is epoch based and approximates to the value at the beginning of an epoch after several rounds. Check out the configuration files under config/scenarios/monitoring/Gossip*

Churn layer – new churn generator:

– Used to generate churn events by using a specified model. This churn generator gives the opportunity to perform operations before going on- or offline. For this just use the ChurnListener in org.peerfact.api.common. The churn generator needs the start and stop time. For a config example refer to config/includes/churn/Graceful*Churn.xml files.

Service layer – replication:

– Ideal replication service uses a global defined DHT thus simulating an ideal replication service where, regardless of the churn level, the data is always available.

Overlay layer:

– New Kademlia implementation. Check out the configuration file config/scenarios/overlay/dht/kademlia2/kademlia2.xml.

– Education package: This package comprises two simple protocol implementations to ease first steps with the simulator. It contains a simple implementation of Chord and a simple P2P overlay in which nodes communicate with a node located in the center of the overlay. Configurations are given by config/education/star.xml and config/education/educhord.xml

New Layers:

– Social: The social layer is used to import/generate real-life social relationships into peerfact. Different models exist to do so. Currently the user can choose between different models. 1) social.dunbar allows either to load a file describing the social topology or to generate graphs according to the Barabasi-Albert model or the Small World Theorem. Models in social.dunbar generate graphs according to the Dunbar modesl, in which (ego-) nodes have a limited number of friends. 2) Models in social.graphstream use the GraphStream lib to build graphs. 3) Models in social.oracle provide a list of friendly nodes for each host, similar to the global oracle. Configs can be found in config/scenarios/tests/socialLayer/. An example application using the social layer is located in test/impl/application/social/.

– Geo: The geo layer is used to map locations (coordinates) to hosts. Locations are not necessarily bound to fixed coordinates. Moreover, hosts are able to move and change their positions. The dummy module is a simple (proof-of-concept) implementation of the geo layer. The modular package of the geo layer allows a modular configuration of the geo layer, similar to the modular netlayer. Example configurations are located in config/scenarios/tests/movementTests/. An example application using the geo layer can be found in test/impl/application/movementTestApplication/.

Part 2: Improvements

======================================

– Bug fixes in Pastry
– Bug fixes in Chord
– Batch Runner:
— rps flag for running plot scripts after the simulation. By default the flag is not set, so the plot scripts will not be run.
— ccs flag for not simulating but only concatenate data and create plot scripts. By default this flag is not set.

17. October 2013 – New version released: PeerfactSim.KOM – Community Edition – 2013.10.17

posted Oct 22, 2013, 3:16 PM by Kalman Graffi

Today the team at University of Paderborn and the University of Düsseldorf published a new version of PeerfactSim.KOM, which comes with lots of nice features and extensions.

===========================================================
2013-10-17 PeerfactSim.KOM – Community Edition – ver. 20131017
===========================================================

This version of PeerfactSim.KOM is based on PeerfactSim.KOM v4.0 – Fork UPB (2013-01-31).

For questions regarding this fork, please visit http://www.peerfact.org or write us an email: <info@peerfact.org>

This current version comes with following extensions:

Part 1: New

======================================

Batch Runner:

– allows to define a set of protocols, configurations and number of seeds in advance

– coordinates the execution of all setups

– creates statistics (gnuplot scripts and graphs) on all individual simulation runs, on simulation runs with a single configuration (but different seeds) and comparatively on various protocols / configurations.

Modified Pastry added:

– uses buckets in the routing table

– supports switchable iterative/parallel routing

Partitioned network churn model:

– allows to define churn for geographical regions (states)

– within the partitioned regions, communication is still possible

– see as example config/Isolation.xml

Part 2: Improvements

======================================

General:

– changes in the gnuplot scripts

– new analyzers to support the batch runner

31. January 2013 – Code base moved to Google Code: PeerfactSim.KOM – Community Edition – 2013.01.31

posted Jan 31, 2013, 12:42 AM by Kalman Graffi [ updated Jan 31, 2013, 12:43 AM ]

Today the team at University of Paderborn and University of Düsseldorf moved the code to Google Code:

http://code.google.com/p/peerfactsimkom-community/

You can now download the newest version of PeerfactSim.KOM – Community Edition under this link:

https://peerfactsimkom-community.googlecode.com/archive/master.zip

For questions regarding this fork, please visit peerfact.com or visit the Forum: http://peerfact.com/forum-4//

08. October 2012 – New version released: PeerfactSim.KOM – Community Edition – 2012.10.08

posted Oct 9, 2012, 2:34 AM by Kalman Graffi [ updated Oct 19, 2012, 4:40 AM ]

Today the team at University of Paderborn published a new version of PeerfactSim.KOM, which comes with lots of nice features and extensions.

===========================================================
2012-10-08 PeerfactSim.KOM – Community Edition – ver. 20121008
===========================================================

This version of PeerfactSim.KOM is based on PeerfactSim.KOM v4.0 – Fork UPB (2012-07-26).

For questions regarding this fork, please visit http://www.peerfact.org or write us an email: <info@peerfact.org>

This current version comes with following extensions:

Part 1: New

======================================

Analyzers:

– an analyzer for all unstructured overlays integrated

– a statistic metric for all important statistical values

Project structure:

– simplified and cleaned

– removed obsolete code and configurations

Part 2: Improvements

======================================

Overlays:

– Gia and Gnutella06 are working correctly and integrated in FileSharing application

– all unstructured overlays are now running with sample configuration files

General:

– include supplementary network coordinate files in project

– many warnings are fixed

– lots of renames and deletes

– not maintained code is marked

26. July 2012 – New version released: PeerfactSim.KOM – UPB – 2012.07.26

posted Jul 30, 2012, 4:46 AM by Kalman Graffi [ updated Jul 30, 2012, 4:48 AM ]

24. May 2012 – New version released: PeerfactSim.KOM – UPB – 2012.05.24

posted Apr 26, 2012, 3:08 AM by Kalman Graffi [ updated May 29, 2012, 5:24 AM ]

Today the team at University of Paderborn published a new version of PeerfactSim.KOM, which comes with lots of nice features and extensions.===========================================================
2012-05-24 PeerfactSim.KOM v4.0 – Fork UPB – ver. 20120524
===========================================================This version of PeerfactSim.KOM is based on PeerfactSim.KOM v4.0 – Fork UPB (2011-12-02).
Please note, this is a fork of PeerfactSim.KOM maintained at the University of Paderborn (see: http://www.peerfact.org).
For questions regarding this fork, please visit http://www.peerfact.org or write us an email: <info@peerfact.org>This current version comes with following extensions:Part 1: New
======================================
New application:
– A new FileSharing application which combines the functionality of the old ones
New overlays:
– EpiChord
– CaReChord (a churn-aware Re-Chord)
– MaliciousChord (Chord with malicious nodes in it)
Service:
– PAST is available as a replication service for dht
Monitoring:
– All Analyzers have default implementations now
– For each DefaultAnalyzer a corresponding gnuplot script is available
– Specific DHT and KBR analyzers
Configuration:
– A new (general) dht configuration file (dht.xml) with includes and parameters (which combines all functionality for DHT)Part 2: Improvements
======================================
Overlays:
– All DHT overlays implement KBR and DHT interfaces (with the exception of Kademlia)
– Napster and centralized are now named after their corresponding functions (CentralizedIndex and CentralizedStorage)
– Pastry is reworked and several bugs and issues are solved
General:
– Many warnings are fixed (more than 700)
– Package structure is optimized and simplified
– Helpful classes are now concentrated in an own package
– HashMaps and HashSets are now LinkedHashMaps and LinkedHashSets (which makes the simulator deterministic)
– Deletion of deprecated code

19. December 2011 – New version released: PeerfactSim.KOM – UPB – 2011.12.19

posted Dec 12, 2011, 9:09 AM by Kalman Graffi [ updated Dec 19, 2011, 2:43 AM ]

Today we published a new version of the fork of PeerfactSim.KOM which is maintained at the University of Paderborn.

The version PeerfactSim.KOM – UPB – 20111219 brings following new elements:

This current version comes with following extensions:

Part 1: New
======================================
New overlay:
– We implemented adaptive chord as new chord variant
Monitoring and benchmarking:
– a centralized DHT, a simple filesharing application and many new analyzers added (incl. many configurations for running simulations)

Part 2: Improvements
======================================
Chord Overlay Structure:
– rename of the default chord from “chord2″ to “chord”
Analyzer Output:
– The output files of all analyzer are created in a similar folder structure for an easier handling
Example configurations:
– all example configurations are refactored (new structure, new configurations, all errors fixed, new gnuplot scripts)
International support:
– all content is now in English (including all comments in the source code)

For questions regarding this fork, please visit our forum or write us an email.

24. October 2011 – New version released: PeerfactSim.KOM – UPB – 2011.10.24

posted Dec 12, 2011, 9:07 AM by Kalman Graffi [ updated Dec 12, 2011, 9:08 AM ]

Today we published a new version of the fork of PeerfactSim.KOM which is maintained at the University of Paderborn.

The version PeerfactSim.KOM – UPB – 20111024 brings following new elements:

Chord Overlay Structure
– In order to support various Chord variants, a Chord superclass has been created. Now the original Chord and the ReChord implementations are Sub-classes of it

For questions regarding this fork, please visit our forum or write us an email.

| Attachments: PeerfactSim.KOM__UPB__ver20111024.zip

19. August 2011 – New version released: PeerfactSim.KOM – UPB – 2011.08.19

posted Dec 12, 2011, 9:06 AM by Kalman Graffi

Today we published a new version of the fork of PeerfactSim.KOM which is maintained at the University of Paderborn.

The version PeerfactSim.KOM – UPB – 20110819 brings following new elements:

Part 1: New

New overlay:

We implemented Re-Chord based on “S. Kniesburges, A. Koutsopoulos and C. Scheideler. Re-Chord: A Self-stabilizing Chord Overlay Network. In 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011.”
This overlay is a self-stabilizing variant of Chord which is able to create a Chord ring out of every connected graph. Re-Chord uses virtual nodes instead of direct fingers and thus, various node types are used.

Part 2: Improvements

Graphical User Interface:

In order to support an international user community, we changed the language in the GUI from (partially) German to English.
We added a visualization for Re-Chord, both normal and virtual peers, marked and unmarked edges are shown.

Extended application:

We extended the application “filesharing2″ to support file sizes. Together with the network layer, a realistic transmission speed is derived and peers might get congested.

For questions regarding this fork, please visit our forum or write us an email.

| Attachments: PeerfactSim.KOM__UPB__ver20110819.zip

28. July 2011 – Tutorial to downloading and using PeerfactSim.KOM

posted Dec 12, 2011, 9:01 AM by Kalman Graffi [ updated Dec 12, 2011, 9:12 AM ]

A new tutorial has been uploaded to the Documentation section of the Website. It describes how to download PeerfactSim.KOM, install and compile it and how quick simulations can be performed. The tutorial is a good starting point for beginners with PeerfactSim.KOM.

11. July 2011 – Paper accepted at IEEE P2P 2011

posted Dec 12, 2011, 9:00 AM by Kalman Graffi

The paper “PeerfactSim.KOM: A P2P System Simulator – Experiences and Lessons Learned” has been accepted at the IEEE International Conference on Peer-to-Peer Computing (IEEE P2P ’11). The conference was held from 31. August to 2. September in Kyoto. The presentation of the paper covered a live demo and useful hints how to use the simulator.

11. May 2011 – New version of PeerfactSim.KOM

posted Dec 12, 2011, 8:56 AM by Kalman Graffi [ updated Dec 12, 2011, 8:59 AM ]

Finally, after more than two years, PeerfactSim.KOM 4.0 is now available. During this period of time, the simulator was mainly developed and improved within academic research. The new features comprise different aspects of the simulator, which will be briefly sketched in the following.

New implementations

On the Application Layer, the simulator consists of a simple filesharing application. In this application peers can store references to files and can search for/lookup these references, based on a chosen probability function.
The simulator consists now of a new layer, which is mainly based on the existing interfaces and skeletal implementations of the Overlay Layer. This new layer to which we refer as Service Layer addresses decentralized services that are implemented on top of the Overlay and offer services to the overlay or application. The implemented services in the simulator currently comprise two decentralized monitoring mechanisms (a tree-based and a gossip-based monitoring mechanism) and a management (SkyNet.KOM) mechanism.
For the Overlay Layer, we added a new class of P2P overlays to the simulator, called Information Dissemination overlays. This class comprises pSense and VON. Besides this class, a two-dimensional version of CAN was added to the class of DHT-overlays.
At the Network Layer, we designed the so-called Modular Network Layer, which allows for a modular construction of the Network Layer based on different strategies. These strategies consist of aspects, such as packet loss, packet sizing, latency, jitter and so on. Existing implementations of these strategies contain the concepts from the SimpleNetLayer- and GNPNetLayer-Model.
Utilities:
- The xml-files for the configuration of a simulation can now be configured by including other configuration files. This means that we can include other xml-files, which define e.g. the monitoring-part for a simulation, in new configuration files.
- Simulations that are run on systems with screens enable the live-monitoring of executed simulations through a separate monitoring window. In addition, the configuration-file for a simulation can be chosen through a GUI. Just use de.tud.kom.p2psim.GUIRunner. For headless systems use de.tud.kom.p2psim.SimulatorRunner.

Improved models:

Overlay Layer:
- Chord was modified to allow for a better performance in scenarios with churn, e.g., you can now specify how many predecessor and successors are stored per peer. In addition the analyzer de.tud.kom.p2psim.impl.overlay.dht.chord2.analyzer.ChordStructureAnalyzer allows to trace the structure of the ring during a simulation. Just add this analyzer to the monitoring-element within a configuration-file.
- The old version of Pastry was modified and now applies to the new simulator structure, which was already created during the last update (in the beginning of 2009) of the simulator.
- Gnutella 0.6 and GIA share now a common subset of implementing classes, as general concepts and components of these two unstructured overlays are similar.

Improved Performance

By a static assignemt of the different TransInfo-classes, memory consumption was considerably improved.
The Modular Network Layer uses its own relational database model, which improves the memory consumption and increases the simulation speed, when simulating underlay models that rely on measurements to calculate latency, message loss etc.

2. May 2010 – Accepted Paper about PeerfactSim.KOM

posted Dec 12, 2011, 8:54 AM by Kalman Graffi [ updated Dec 12, 2011, 8:55 AM ]

The paper “PeerfactSim.KOM: A Simulation Framework for Peer-to-Peer Systems”, which details the architecture and underlying concepts of PeerfactSim.KOM got accepted at the International Workshop on Modeling and Simulation of Peer-to-Peer Architectures and Systems (MOSPAS ’11). This workshop is part of the International Conference on High Performance Computing & Simulation (HPCS ’11), which takes place in July 4-8, 2011 in Istanbul, Turkey.