-------- Original-Nachricht -------- Betreff: [computational.science] CFP#1: Journal of Computer Communications: Special Issue on Foundations of P2P Computing Datum: Fri, 30 Jun 2006 09:36:13 -0400 Von: Editorial Help editor@cs.kent.edu Organisation: "OptimaNumerics" An: Computational Science Mailing List computational.science@lists.optimanumerics.com
*Apology if you have received multiple copies.
*******************************************************************
Call for Papers – Special Issue on
Foundations of Peer-to-Peer Computing:
Elsevier Journal of Computer Communications • Submission Deadline: October 7, 2006 Website: http://www.cs.kent.edu/~editor/jcompcomm06-p2p/ Guest Editors: Javed I. Khan & Adam Wierzbicki
________________________________________ Peer-to-peer computing has quite conspicuously emerged as one of the most innovation rich areas in computer networking. P2P has emerged out of user community but it is increasingly finding its base on rich foundation of computing.
Various aspects of peer-to-peer systems are now being modeled, formalized, and even engineered based on distributed hashing, complex search models, self-organization, complex networking, and graph theories.
The objective of this special issue of the Journal of Computer & Communication is to highlight recent innovative research results which will strengthen the formal foundation of this area. ________________________________________ The special issue invites papers from diverse P2P community ranging from practitioners, system builders, networking researchers, computing engineers, as well as social scientists. Authors from these divergent communities are encouraged to submit high-quality and original works. The review process of this special issue will be respectful to the difference in the scientific methodologies used by the communities. Topics of particular interest include but are not limited to the following:
P2P systems, practice & performance • Case study architectures • Performance analysis of existing systems • Distributed hashing, routing, advanced & special search • Self-organization neighborhood optimization • Fault tolerance, stability, churning • Privacy and security
P2P overlay networks • Publish/subscribe & event routing overlays • Multicast optimization • Multimedia and streaming overlays
Social engineering • Reputation and trust functions. • Social engineering • Virtual communities on P2P: socials study • Study of P2P virtual networks
Applications • File sharing, distributed storage/caching, backup storage. • News feed • P2P games, online auction. • Multimedia streaming, distribution. • Anonymous systems ________________________________________
IMPORTANT DATES • Submission: October 7, 2006 • Acceptance decision: January 6, 2007 • Final paper due: March 6, 2007 • Publication date: Spring 2007 ________________________________________
SUBMISSION GUIDELINES
Authors are request to submit the manuscript electronically by using online manuscript submission. The manuscript should be original, previously unpublished and should not be under concurrent submission elsewhere. To submit your manuscript please logon at http://authors.elsevier.com/journal/comcom. Then select article type “SI: Foundation of Peer-to-Peer Computing”, and follow the instructions. For any query about the special issue feel free to contact the guest editor at:
Prof. Javed I. Khan javed@kent.edu Department of Computer Science Kent State University 233 MSB, Kent, OH-44242
Prof. Adam Wierzbicki adamw@pjwstk.edu.pl Polish-Japanese Institute of Information Technology Ul. Koszykowa 86 02-008 Warsaw, Poland
********************************************************************************************
--------------------------------------------------------------------- To unsubscribe, e-mail: computational.science-unsubscribe@lists.optimanumerics.com For additional commands, e-mail: computational.science-help@lists.optimanumerics.com
Computational Science mailing list hosting is provided by OptimaNumerics (http://www.OptimaNumerics.com) ---------------------------------------------------------------------