The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Peer-to-peer support for massively multiplayer games
Abstract
We present an approach to support massively multiplayer games on peer-to-peer overlays. Our approach exploits the fact that players in MMGs display locality of interest, and therefore can form self-organizing groups based on their locations in the virtual world. To this end, we have designed scalable mechanisms to distribute the game state to the participating players and to maintain consistency in the face of node failures. The resulting system dynamically scales with the number of online players. It is more flexible and has a lower deployment cost than centralized games servers. We have implemented a simple game we call SimMud, and experimented with up to 4000 players to demonstrate the applicability of this approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Gilbert, S., & Lynch, N. (2002) · ACM SIGACT News · doi:10.1145/564585.564601 · Cited by 1,727
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
SETI@home: an experiment in public-resource computing
Anderson, D. P., Cobb, J., Korpela, E., Lebofsky, M., & Werthimer, D. (2002) · Communications of the ACM · doi:10.1145/581571.581573 · Cited by 1,302
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Iyer, S., Rowstron, A. I. T., & Druschel, P. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571861 · Cited by 363
An evaluation of scalable application-level multicast built using peer-to-peer overlays
Castro, M., Jones, M. B., Kermarrec, A.-M., Rowstron, A. I. T., Theimer, M. M., Wang, H., & Wolman, A. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208986 · Cited by 251
The Department of Defense High Level Architecture
Dahmann, J. S., Fujimoto, R. M., & Weatherly, R. M. (1997) · Proceedings of the 29th conference on Winter simulation - WSC '97 · doi:10.1145/268437.268465 · Cited by 233
An experimental estimation of latency sensitivity in multiplayer quake 3
Armitage, G. (2004) · The 11th IEEE International Conference on Networks, 2003. ICON2003. · doi:10.1109/icon.2003.1266180 · Cited by 208
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
Lynch, N., & Shvartsman, A. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36108-1_12 · Cited by 189
Modelling user behaviour in networked games
Henderson, T., & Bhatti, S. N. (2001) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/500141.500175 · Cited by 118
Specifying and using a partitionable group communication service
Fekete, A. D., Lynch, N., & Shvartsman, A. A. (2001) · ACM Transactions on Computer Systems · doi:10.1145/377769.377776 · Cited by 103
POST: A Secure, Resilient, Cooperative Messaging System
Mislove, A. E., Post, A., Reis, C., Willmann, P., Druschel, P., Wallach, D. S., Bonnaire, X., Sens, P., Busca, J.-M., & Arantes, L. (2003) · Cited by 64
Cited by
VON: a scalable peer-to-peer network for virtual environments
Hu, S.-Y., Chen, J.-F., & Chen, T.-H. (2006) · IEEE Network · doi:10.1109/mnet.2006.1668400 · Cited by 272
Metadata
- Authors
- Knutsson, B., Lu, H., Xu, W., & Hopkins, B.
- Venue
- IEEE INFOCOM 2004
- Publisher
- IEEE
- Published
- 2004-12-23
- Volume
- 1
- Pages
- 96-107
- OpenAlex
- W2164433993
- Cited by
- 501
- References
- 21
- FWCI
- 26.96
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.