HYDRA: A PEER-TO-PEER ARCHITECTURE FOR MASSIVELY-MULTIPLAYER ONLINE GAMES

 

Home
Overview
Status
People
Tankie
Publications
Related Work
Funding
Contact

Peer-to-Peer Architectures for Games

  1. Ashwin Bharambe, Jeffrey Pang, and Srinivasan Seshan. Colyseus: A distributed architecture for multiplayer games. In Proceedings of the ACM/USENIX Third Symposium on Networked Systems Design and Implementation (NSDI 2006), 2006.

  2. Ashwin Bharambe, Mukesh Agrawal, and Srinivasan Seshan. Mercury: Supporting scalable multi-attribute range queries. In Proceedings of SIGCOMM 2004, August 2004.

  3. Bjorn Knutsson, Honghui Lu, Wei Xu, and Bryan Hopkins. Peer-to-peer support for massively multiplayer games. In Proceedings of IEEE INFOCOM’04, March 2004

  4. Marios Assiotis and Velin Tzanov. A distributed architecture for MMORPG. In Proceedings of the 5th Workshop on Network and System Support for Games (NetGames 2006), October 2006.

  5. Thorsten Hampel, Thomas Bopp, and Robert Hinn. A peer-to-peer architecture for massive multiplayer online games. In Proceedings of the 5th Workshop on Network and System Support for Games (NetGames 2006), October 2006.

 

Networked Game Architectures

  1. Caltagirone, S., Keys, M., Schlief, B., and Willshire, M. J. 2002. Architecture for a massively multiplayer online role playing game engine. Journal of Computing Sciences in Colleges. 18, 2 (Dec. 2002), 105-116.

  2. Stefan Fiedler, Michael Wallner, and Michael Weber. A communication architecture for massive multiplayer games. In Proceedings of the 1st Workshop on Network and System Support For Games (Bruanschweig, Germany, April 16 - 17, 2002). NetGames '02. ACM Press, New York, NY, 14-22.

  3. Takuji Iimura, Hiroaki Hazeyama, and Youki Kadobayashi. Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games. In Proceedings of 3rd Workshop on Network and System Support For Games (NetGames ’04), August 2004.

  4. Abdennour El Rhalibi AND Madjid Merabti. Agents-based modeling for a peer-to-peer MMOG architecture. Computers in Entertainment, 3(2):3, 2005.

 

Related Problems/Solutions

  1. Ashwin Bharambe, Venkat Padmanabhan, and Srinivasan Seshan: Supporting Spectators in Online Multiplayer Games,  In Proceedings of HOTNETS-III, San Diego, November 2004

  2. E. Cronin, B. Filstrup, A. R. Kurc, and S. Jamin, "An Efficient Synchronization Mechanism for Mirrored Game Architectures," In Proceedings of the First Workshop on Network and System Support for Games (NetGames 2002), April 2002.

  3. Stefano Ferretti and Marco Roccetti. Fast delivery of game events with an optimistic synchronization mechanism in massive multiplayer online games. In Proceedings of ACE ’05, pages 405–412, New York, NY, USA, 2005. ACM Press.

  4. Anthony Peiqun Yu and Son T. Vuong. MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games. In Proceedings of NOSSDAV 2005, pages 99–104, June 2005.

  5. Shinya Yamamoto, Yoshihiro Murata, Keiichi Yasumoto and Minoru Ito. A distributed event delivery method with load balancing for MMORPG. In Proceedings of NetGames ’05, pages 1–8, October 2005.

 

Cheating in Networked Games

  1. Nathaniel E. Baughman Brian Neil Levine. Cheat-proof playout for centralized and distributed online games. In Proceedings of  INFOCOM 2001,  2001.

  2. Margaret DeLap, Bjorn Knutsson, Honghui Lu, Oleg Sokolsky, Usa Sammapun, Insup Lee and Christos Tsarouchis. Is runtime verification applicable to cheat detection? In Proceedings of the NetGames ’04, August 2004.

  3. Patric Kabus, Wesley Terpstra, Mariano Cilia, Alejandro Buchmann. Addressing Cheating in Distributed Massively Multiplayer Online Games. Proceedings of the International Workshop on NetGames (NetGames'05), NY, October 2005

 

 

Distributed Hash Tables (DHTs)

  1. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, Proceedings of ACM SIGCOMM 2001, San Deigo, CA,  pp. 149-160, August 2001.

  2. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker. A Scalable Content-Addressable Network. Proceedings of ACM SIGCOMM 2001, San Deigo, CA, August 2001.

  3. Ben Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, April 2001

  4. Antony Rowstron and Peter Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November, 2001.

  5. Dahlia Malkhi, Moni Naor, David Ratajczak, “Viceroy: A scalable and dynamic emulation of the butterfly,” in Proceedings of 21st ACM Conf. on Principles of Distributed Computing (PODC’02), July 2002.

  6. Petar Maymounkov and David Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS ’02), March 2002.

  7. M. Frans Kaashoek, and David Karger.  Koorde: A simple degree-optimal hash table. In Proceedings of the 2nd IPTPS,  February 2003.

  8. Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), February 2003.

  9. Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan, “Symphony: Distributed hashing in a small world,” in Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, March 2003.

  10. Alper Tugay Mızrak, Yuchung Cheng, Vineet Kumar, and Stefan Savage, Structured superpeers: Leveraging heterogeneity to provide constant-time lookup, in Proceedings of the 4th IEEE Workshop on Internet Applications, June 2003.

  11. Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris and M. Frans Kaashoek. Comparing the performance of distributed hash tables under churn. Proceedings of the 3rd International Workshop on Peer-to-peer systems (IPTPS'04), February 2004

  12. Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M. Frans Kaashoek and Robert Morris. Designing a DHT for low latency and high throughput. Proceedings of the 1st Symposium on Networked System Design and Implementation (NSDI'04), March 2004

  13. Krishna Gummadi, Ramakrishna Gummadi, Steve Gribble, Sylvia Ratnasamy, Scott Shenker, and Ion Stoica, “The impact of DHT routing geometry on resilience and proximity,” in Proceedings of the 2003 ACM SIGCOMM Conference, August 2003, pp. 381–394.

  14. Anjali Gupta, Barbara Liskov, and Rodrigo Rodrigues. Efficient routing for peer-to-peer overlays. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), March 2004, pp. 113–126.

  15. Ben Leong, Barbara Liskov, and Erik D. Demaine, "EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management", Proceedings of the 12th International Conference on Networks 2004 (ICON 2004), Singapore, November 2004.

  16. Ben Leong and Ji Li "Achieving One-Hop DHT Lookup and Strong Stabilization by Passing Tokens", Proceedings of the 12th International Conference on Networks 2004 (ICON 2004), Singapore, November 2004.

  17. Jinyang Li, Jeremy Stribling, Robert Morris, M. Frans Kaashoek and Thomer M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th IEEE Infocom, March 2005

  18. Jinyang Li, Jeremy Stribling, Robert Morris and M. Frans Kaashoek. Bandwidth-efficient management of DHT routing tables. In Proceedings of the 2nd Symposium on Networked System Design and Implementation (NSDI'05), May 2005
     

Peer-to-Peer

  1. Miguel Castro, Peter Druschel, Anne-Marie Kermarrec  and Antony Rowstron, SCRIBE: A large-scale and decentralised application-level multicast infrastructure, IEEE Journal on Selected Areas in Communications (JSAC) (Special issue on Network Support for Multicast Communications). 2002.

  2. Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, and Scott Shenker. Making Gnutella-like P2P Systems Scalable. Proceedings of ACM SIGCOMM 2003. August 2003. Karlsruhe, Germany.

  3. Miguel Castro, Michael B. Jones, Anne-Marie Kermarrec, Anthony Rowstron, Marvin Theimer, Helen Wang and Alec Wolman, An Evaluation of Scalable Application-level Multicast Built Using Peer-to-peer overlays, Infocom 2003, San Francisco, CA, April, 2003.

  4. M. Castro, P. Druschel, A-M. Kermarrec, A. Nandi, A. Rowstron and A. Singh, SplitStream: High-bandwidth multicast in a cooperative environment, SOSP'03,Lake Bolton, New York, October, 2003

  5. Ashwin Bharambe, Sanjay Rao, Venkat Padmanabhan, Srinivasan Seshan, and Hui Zhang: The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols, 4th International Workshop on P2P Systems (IPTPS) 2005, Ithaca, February 2005.

 

Networking

  1. David Clark and David Tennenhouse, Architecture Considerations for a New Generation of Protocols, Proceedings of ACM SIGCOM '90, Sept. 90, pp.201-208

  2. B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An Integrated Experimental Environment for Distributed Systems and Networks. In Proc. of the 5th Symposium on Operating Systems Design and Implementation (SOSP), Boston, MA, December 2002.

 

$Date: 2008/01/01 06:35:12 $