• DocumentCode
    1607596
  • Title

    PeerfactSim.KOM: A P2P system simulator — Experiences and lessons learned

  • Author

    Graffi, Kalman

  • Author_Institution
    Theor. of Distrib. Syst., Univ. of Paderborn, Paderborn, Germany
  • fYear
    2011
  • Firstpage
    154
  • Lastpage
    155
  • Abstract
    Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM [1] is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project "QuaP2P", which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project "On-the-fly Computing" aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV.
  • Keywords
    Java; benchmark testing; peer-to-peer computing; service-oriented architecture; Java; P2P system simulator; PeerfactSim.KOM; QuaP2P; benchmarking; large scale networks; large-scale distributed systems; multilayered p2p systems; on-the-fly computing; p2p-based service oriented architectures; peer-to-peer systems; protocols; Benchmark testing; Economic indicators; Java; Monitoring; Peer to peer computing; Protocols; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Peer-to-Peer Computing (P2P), 2011 IEEE International Conference on
  • Conference_Location
    Kyoto
  • ISSN
    2161-3559
  • Print_ISBN
    978-1-4577-0150-4
  • Electronic_ISBN
    2161-3559
  • Type

    conf

  • DOI
    10.1109/P2P.2011.6038673
  • Filename
    6038673