CALL FOR PAPERS
Special session of Euromicro PDP 2013, Belfast, Northern Ireland, February 27 to March 1st, 2013
http://www.pdp2013.org
Submission Deadline (extended): August 27, 2012
The algorithms and methods of Peer-to-Peer (P2P) technology are often applied to networks and services with a high demand for scalability. The huge number of peers, the state space, as well as the interactions and relationships between peers and states often makes an analytical description intractable. Discrete event simulation is a tool which is able to incorporate all interactions and parameters and may reflect reality as accurately as possible. Large scale simulations, however, also require sufficient memory capacities and often exceed the available computational power: it might already be a problem just to keep the states of the peers in the main memory.
The 7th International Workshop on Modeling, Simulation, and
Optimization of Peer-to-peer environments (MSOP2P) aims at
bringing together researchers and practitioners from
academia, industry and government to advance the state of
the art in modeling, simulating and optimizing P2P
environments. The workshop also offers the opportunity to
discuss different techniques to make P2P simulations
scalable, to debate the advantages and disadvantages of a
simulation on packet level or on application level, and to
compare analytical models as well as emulations to results
gained by simulation. The general venue will be a good
occasion to share, to learn, and to discuss the latest
results in this field of research.
Topics
- Modeling of P2P systems
- Performance evaluation of P2P systems
- Simulation of P2P systems
- Traffic management for P2P computing systems
- Algorithms for computing and performance implications in P2P environments
- Analytical modeling of Peer-to-Peer systems
- Quantitative analysis of Peer-to-Peer infrastructure and overlay networks
- Emulation of P2P systems
- Protocols for resource management/discovery/reservation/scheduling
- Workload characterization for P2P systems
Important Dates
| Paper submission deadline (extended): | August 27, 2012 |
| Notification of acceptance: | October 15, 2012 |
| Camera ready papers due (firm): | November 15, 2012 |
| Conference: | February 27 to March 1st, 2013 |
Submission Details:
Papers can be submitted through the EasyChair conference submission system http://www.easychair.org/conferences/?conf=pdp2013 with an indication of the name of the Special Session MSOP2P.
Papers will undergo a double blind peer review process. Prospective authors should submit a full paper not exceeding 5000 words in length and including a 150-200 word abstract. To facilitate an anonymous reviewing process, the first page of the paper should contain only the title and abstract. Moreover, the names of the authors of the paper must not appear in citations in the reference section. All accepted papers will be included in the same volume, published by the Conference Publishing Services (CPS). The Final Paper Preparation and Submission Instructions will be published after the notification of acceptance.
Program Chair: Mark Jelasity, Hungarian Acad. Sci. and University of Szeged, HungaryOrganization: Julien Bourgeois, University of Franche-Comté, France and Etienne Rivière, University of Neuchâtel, Switzerland
Program Committee:
- Cosimo Anglano, Universita del Piemonte Orientale, Italy
- Julien Bourgeois, LIFC, University of Franche-Comte, France
- Jim Dowling, Swedish Institute of Computer Science, Sweden
- Alberto Montresor, University of Trento, Italy
- Rossano Gaeta, Universita di Torino, Italy
- Riccardo Lancellotti, University of Modena and Reggio Emilia, Italy
- Lu Liu, University of Leeds, United Kingdom
- Gerald Oster, LORIA, France
- Etienne Riviere, University of Neuchatel, Switzerland
- Matteo Sereno, Universita di Torino, Italy
- Tamas Vinko, TU Delft, The Netherlands
- Spyros Voulgaris, Vrije Universiteit, The Netherlands
- Naoki Wakamiya, Osaka University, Japan
Contact: jelasity@inf.u-szeged.hu,julien.bourgeois@univ-fcomte.fr and etienne.riviere@unine.ch
