Adaptive Interest Management via Push-Pull Algorithms

Interest management in large-scale distributed applications aims to reduce the amount of extraneous broadcast communication between nodes in the system with the aim of increasing responsiveness and scalability. We present a middleware-layer interest management framework based on pattern prediction to inform the oscillation of the system's protocol for the processing of state updates between two competing modes. This framework is transparent to the application itself. We discuss various algorithms for performing the prediction and experimentally evaluate the effectiveness of these algorithms against each other and a set of optimal and sub-optimal baselines

[1]  Douglas D. Wood.  Implementation of DDM in the MAK High Performance RTI , 2002 .

[2]  Aaron Harwood,et al.  Hashing Spatial Content over Peer-to-Peer Networks , 2003 .

[3]  Katherine L. Morse,et al.  Interest Management in Large-Scale Distributed Simulations , 1996 .

[4]  Steven J. Rak.  HLA/RTI Data Distribution Management in the Synthetic Theater of War , 1997 .

[5]  J. Mark Pullen,et al.  Limitations of Internet Protocol Suite for Distributed Simulation the Large Multicast Environment , 1999, RFC.

[6]  Michael Zyda,et al.  Exploiting reality with multicast groups: a network architecture for large-scale virtual environments , 1995, Proceedings Virtual Reality Annual International Symposium '95.

[7]  Georgios Theodoropoulos,et al.  An adaptive interest management scheme for distributed virtual environments , 2005, Workshop on Principles of Advanced and Distributed Simulation (PADS'05).

[8]  Azzedine Boukerche,et al.  Dynamic grid-based multicast group assignment in data distribution management , 2000, Proceedings Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT 2000).

[9]  Srinivasan Seshan,et al.  Colyseus: A Distributed Architecture for Online Multiplayer Games , 2006, NSDI.

[10]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[11]  Helen J. Wang,et al.  An evaluation of scalable application-level multicast built using peer-to-peer overlays , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Ran El-Yaniv,et al.  On Prediction Using Variable Order Markov Models , 2004, J. Artif. Intell. Res..

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

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

[15]  Bernard P. Zeigler,et al.  Theory of Modelling and Simulation , 1979, IEEE Transactions on Systems, Man and Cybernetics.

[16]  Jin Chen,et al.  Locality aware dynamic load management for massively multiplayer games , 2005, PPoPP.

[17]  Michael Zyda,et al.  Exploiting reality with multicast groups , 1995, IEEE Computer Graphics and Applications.

[18]  Dieter Schmalstieg,et al.  Scheduling for very large virtual environments and networked games using visibility and priorities , 2000, Proceedings Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT 2000).

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

[20]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[21]  Lubomir Bic,et al.  An adaptive, distributed algorithm for interest management , 2000 .