메뉴 건너뛰기




Volumn , Issue , 2005, Pages 87-92

Using N-trees for scalable event ordering in peer-to-peer games

Author keywords

Event ordering; Games; Multiplayer; N tree; Peer to peer

Indexed keywords

AYSMPTOTIC ANALYSIS; DISTRIBUTED ARCHITECTURE; MULTIPLAYER GAMES; PEER-TO-PEER GAMES;

EID: 29844436654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065983.1066005     Document Type: Conference Paper
Times cited : (36)

References (23)
  • 1
  • 2
    • 0035014942 scopus 로고    scopus 로고
    • Cheat-proof playout for centralized and distributed online games
    • N. E. Baughman and B. N. Levine. Cheat-proof playout for centralized and distributed online games. In IEEE Infocom, pages 104-113, 2001.
    • (2001) IEEE Infocom , pp. 104-113
    • Baughman, N.E.1    Levine, B.N.2
  • 3
    • 29844440262 scopus 로고    scopus 로고
    • Mercury: Supporting scalable multi-attribute range queries
    • August
    • A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. In ACM SIGCOMM, August 2004.
    • (2004) ACM SIGCOMM
    • Bharambe, A.R.1    Agrawal, M.2    Seshan, S.3
  • 6
    • 0034445565 scopus 로고    scopus 로고
    • A case for end system multicast
    • ACM Press
    • Y. Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In ACM SIGMETRICS, pages 1-12. ACM Press, 2000.
    • (2000) ACM SIGMETRICS , pp. 1-12
    • Chu, Y.1    Rao, S.G.2    Zhang, H.3
  • 7
    • 0023963509 scopus 로고
    • Synchronization, coherence, and event ordering in multiprocessors
    • M. Dubois, C. Scheurich, and F. A. Briggs. Synchronization, coherence, and event ordering in multiprocessors. Computer, 21(2):9-21, 1988.
    • (1988) Computer , vol.21 , Issue.2 , pp. 9-21
    • Dubois, M.1    Scheurich, C.2    Briggs, F.A.3
  • 9
    • 4544240978 scopus 로고    scopus 로고
    • Low latency and cheat-proof event ordering for peer-to-peer games
    • June
    • C. GauthierDickey, D. Zappala, V. Lo, and J. Marr. Low latency and cheat-proof event ordering for peer-to-peer games. In ACM NOSSDAV, June 2004.
    • (2004) ACM NOSSDAV
    • GauthierDickey, C.1    Zappala, D.2    Lo, V.3    Marr, J.4
  • 10
    • 84858529735 scopus 로고    scopus 로고
    • Gnutella. http://www.gnutella.com.
  • 12
    • 0003982874 scopus 로고    scopus 로고
    • On the cost of fault-tolerant consensus when there are no faults - A tutorial
    • MIT-LCS-TR-821. MIT, Massachusetts Institute of Technology, Cambridge, MA, May
    • I. Keidar and S. Rajsbaum, On the cost of fault-tolerant consensus when there are no faults - a tutorial. MIT-LCS-TR-821. Technical Report MIT-LCS-TR-821, MIT, Massachusetts Institute of Technology, Cambridge, MA, 02139, May 2001.
    • (2001) Technical Report , vol.MIT-LCS-TR-821 , pp. 02139
    • Keidar, I.1    Rajsbaum, S.2
  • 13
    • 8344250950 scopus 로고    scopus 로고
    • Peer-to-peer support for massively multiplayer games
    • March
    • B. Knutsson, H. Lu, W. Xu, and B. Hopkins. Peer-to-peer support for massively multiplayer games. In IEEE Infocom, March 2004.
    • (2004) IEEE Infocom
    • Knutsson, B.1    Lu, H.2    Xu, W.3    Hopkins, B.4
  • 14
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • ACM
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, 1978.
    • (1978) Commun. , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 15
    • 0032058184 scopus 로고    scopus 로고
    • The part-time parliament
    • May
    • L. Lamport. The part-time parliament. ACM Trans. on Comp, Syst., 16(2):133-169, May 1998.
    • (1998) ACM Trans. on Comp, Syst. , vol.16 , Issue.2 , pp. 133-169
    • Lamport, L.1
  • 19
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
    • Springer-Verlag
    • A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms, pages 329-350. Springer-Verlag, 2001.
    • (2001) IFIP/ACM International Conference on Distributed Systems Platforms , pp. 329-350
    • Rowstron, A.I.T.1    Druschel, P.2
  • 20
    • 0013086161 scopus 로고    scopus 로고
    • Aspects of networking in multiplayer computer games
    • April
    • J. Smed, T. Kaukoranta, and H. Hakonen. Aspects of networking in multiplayer computer games. In NetGames, April 2002.
    • (2002) NetGames
    • Smed, J.1    Kaukoranta, T.2    Hakonen, H.3
  • 21
    • 0034782005 scopus 로고    scopus 로고
    • Chord: A scalable peer-to-peer lookup service for internet applications
    • ACM Press
    • I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM, pages 149-160. ACM Press, 2001.
    • (2001) ACM SIGCOMM , pp. 149-160
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, M.F.4    Balakrishnan, H.5
  • 22
    • 0036343707 scopus 로고    scopus 로고
    • Host multicast: A framework for delivering multicast to end users
    • June
    • B. Zhang, S. Jamin, and L. Zhang. Host multicast: A framework for delivering multicast to end users. In IEEE Infocom, June 2002.
    • (2002) IEEE Infocom
    • Zhang, B.1    Jamin, S.2    Zhang, L.3
  • 23
    • 0003348154 scopus 로고    scopus 로고
    • Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination
    • June
    • S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In ACM NOSSDAV, June 2001.
    • (2001) ACM NOSSDAV
    • Zhuang, S.Q.1    Zhao, B.Y.2    Joseph, A.D.3    Katz, R.H.4    Kubiatowicz, J.D.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.