Orbweb—A Network Substrate for Peer-to-Peer Desktop Grid Computing Based on Open Standards

While Desktop Grid Computing has become a promising alternative to classical Grids for certain kinds of applications, it has not yet reached the same level of standardization. In this article, we present Orbweb, a network substrate for Peer-to-Peer Desktop Grid Computing based on the open industrial-strength eXtensible Messaging and Presence Protocol (XMPP). We discuss, how XMPP can be leveraged to tackle domain-specific challenges, including high scalability, support for volatility, NAT/Firewall traversal, and protocol efficiency. Where XMPP fails to meet these requirements, we contribute pertinent extensions. In particular, we boost the scalability of XMPP by taking load of the XMPP servers through dynamically negotiated direct Peer-to-Peer communication channels between XMPP peers. We pave the way for scalable group membership management by substituting the existing XMPP Multi-User Chat protocol for one that does not suffer from limitations imposed by an »everyone knows everyone« visibility model and allows for deploying custom virtual topologies that best match the interaction patterns of a given application. As efficient multicasting is an essential prerequisite for many distributed algorithms, we adapt the well-known Bimodal Multicast protocol to work in a highly volatile Peer-to-Peer Desktop Grid Computing environment. Finally, we show how to improve the protocol efficiency of XMPP by leveraging a standardized binary encoding of the XML Information Set for XMPP packet transmission. To substantiate the applicability of our approach and the effectiveness of our extensions, we describe how some important higher-level services used in Peer-to-Peer Desktop Grid Computing can be implemented on top of Orbweb and provide a detailed experimental analysis with up to 10K nodes.

[1]  Wolfgang Blochinger,et al.  A Network Substrate for Peer-to-Peer Grid Computing beyond Embarrassingly Parallel Applications , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

[2]  Wolfgang Blochinger,et al.  Aspect-Oriented Parallel Discrete Optimization on the Cohesion Desktop Grid Platform , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[3]  Philip J. Hatcher,et al.  Performance evaluation of JXTA communication layers , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[4]  David R. Cheriton,et al.  Understanding the limitations of causally and totally ordered communication , 1994, SOSP '93.

[5]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[6]  Francisco Vilar Brasileiro,et al.  A Case for Event-Driven Distributed Objects , 2006, OTM Conferences.

[7]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[8]  Simin Nadjm-Tehrani,et al.  Scale-up and performance studies of three agent platforms , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[9]  Ian Stokes-Rees,et al.  DIRAC: a scalable lightweight architecture for high throughput computing , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[10]  Greg Ruetsch,et al.  Framework for Peer-to-Peer Distributed Computing in a Heterogeneous, Decentralized Environment , 2002, GRID.

[11]  Praveen Yalagandula,et al.  A scalable distributed information management system , 2004, SIGCOMM 2004.

[12]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[13]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[14]  I. Wang.  P2PS (Peer-to-Peer Simpli ed) , 2005 .

[15]  Scott Shenker,et al.  Range Queries over DHTs , 2003 .

[16]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[17]  Wolfgang Küchlin,et al.  ZetaSAT - Boolean SATisfiability solving on Desktop Grids , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[18]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.

[19]  Kenneth P. Birman,et al.  Throughput Stability of Reliable Multicast Protocols , 2000, ADVIS.

[20]  Henri E. Bal,et al.  Efficient load balancing for wide-area divide-and-conquer applications , 2001, PPoPP '01.

[21]  Bill Yeager,et al.  Project JXTA 2.0 Super-Peer Virtual Network , 2003 .

[22]  W. H. J. Feijen,et al.  Derivation of a termination detection algorithm for distributed computations , 1986 .

[23]  P. Oscar Boykin,et al.  A Symphony Conducted by Brunet , 2007, ArXiv.

[24]  Wolfgang Blochinger,et al.  An Integrated Approach for Managing Peer-to-Peer Desktop Grid Systems , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[25]  Andrew A. Chien,et al.  Entropia: architecture and performance of an enterprise desktop grid system , 2003, J. Parallel Distributed Comput..

[26]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[27]  Wolfgang Blochinger,et al.  COHESION - A microkernel based Desktop Grid platform for irregular task-parallel applications , 2008, Future Gener. Comput. Syst..

[28]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..

[29]  Ulrich Norbisrath,et al.  Friend-to-Friend Computing - Instant Messaging Based Spontaneous Desktop Grid , 2008, 2008 Third International Conference on Internet and Web Applications and Services.

[30]  Deborah Estrin,et al.  Error recovery in scalable reliable multicast , 1997 .

[31]  Matthew Thomas Lucas,et al.  Efficient data distribution in large-scale multicast networks , 1998 .

[32]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[33]  Cho-Li Wang,et al.  Solving irregularly structured problems based on distributed object model , 2003, Parallel Comput..

[34]  Karl Aberer,et al.  Range queries in trie-structured overlays , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[35]  Andrew A. Chien,et al.  Henri Casanova , 2022 .

[36]  Ralph Deters,et al.  The costs of using JXTA , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[37]  Michael Kaufmann,et al.  yFiles - Visualization and Automatic Layout of Graphs , 2001, Graph Drawing Software.

[38]  Robert D. Blumofe,et al.  Scheduling multithreaded computations by work stealing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[39]  James O. Coplien,et al.  Pattern languages of program design , 1995 .

[40]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[41]  Rico Piantoni,et al.  Implementing the Swiss Exchange trading system , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[42]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, SIGMETRICS '02.

[43]  Kazuyuki Shudo,et al.  P3: P2P-based middleware enabling transfer and aggregation of computational resources , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[44]  Gilles Fedak,et al.  On Resource Volatility in Enterprise Desktop Grids , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[45]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[46]  Peter Saint-Andre,et al.  End-to-End Signing and Object Encryption for the Extensible Messaging and Presence Protocol (XMPP) , 2004, RFC.

[47]  Wolfgang Blochinger,et al.  Capability-Aware Information Aggregation in Peer-to-Peer Grids , 2009, Journal of Grid Computing.

[48]  Gilles Fedak,et al.  The Computational and Storage Potential of Volunteer Computing , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[49]  Christopher G. Lasater,et al.  Design Patterns , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[50]  Choopan Rattanapoka.  P2P-MPI : A fault-tolerant Message Passing Interface Implementation for Grids , 2008 .

[51]  Mathieu Jan,et al.  Performance scalability of the JXTA P2P framework , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[52]  Nazareno Andrade,et al.  Labs of the World, Unite!!! , 2006, Journal of Grid Computing.

[53]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[54]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[55]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[56]  Michael Stonebraker,et al.  A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.