메뉴 건너뛰기




Volumn , Issue , 2007, Pages 467-474

Efficient simulation of large-scale P2P networks: Compact data structures

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; SCALABILITY;

EID: 34547666539     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2007.41     Document Type: Conference Paper
Times cited : (6)

References (13)
  • 3
    • 34547671581 scopus 로고    scopus 로고
    • A. Brown and M. Kolberg. Tools for peer-to-peer network simulation. Internet-Draft Version 00, IETF, January 2006.
    • A. Brown and M. Kolberg. Tools for peer-to-peer network simulation. Internet-Draft Version 00, IETF, January 2006.
  • 4
    • 0024089177 scopus 로고
    • Calendar queues: A fast 0(1) priority queue implementation for the simulation event set problem
    • R. Brown. Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. Commun. ACM, 31(10):1220-1227, 1988.
    • (1988) Commun. ACM , vol.31 , Issue.10 , pp. 1220-1227
    • Brown, R.1
  • 5
    • 10444287344 scopus 로고    scopus 로고
    • B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman. PlanetLab: An Overlay Testbed for Broad-Coverage Services. ACM SIGCOMM Computer Communication Review, 33(3):00-00, July 2003.
    • B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman. PlanetLab: An Overlay Testbed for Broad-Coverage Services. ACM SIGCOMM Computer Communication Review, 33(3):00-00, July 2003.
  • 6
    • 34547651825 scopus 로고    scopus 로고
    • Towards efficient simulation of large scale p2p networks
    • Technical Report 371, University of Würzburg, October
    • T. Hoßfeld, A. Binzenhöfer, D. Schlosser, K. Eger, J. Oberender, I. Dedinski, and G. Kunzmann. Towards efficient simulation of large scale p2p networks. Technical Report 371, University of Würzburg, October 2005.
    • (2005)
    • Hoßfeld, T.1    Binzenhöfer, A.2    Schlosser, D.3    Eger, K.4    Oberender, J.5    Dedinski, I.6    Kunzmann, G.7
  • 8
    • 2442421260 scopus 로고    scopus 로고
    • Kademlia: A peer-to-peer information system based on the xor metric
    • Cambridge, MA, USA, March
    • P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In IPTPS 2002, MIT Faculty Club, Cambridge, MA, USA, March 2002.
    • (2002) IPTPS 2002, MIT Faculty Club
    • Maymounkov, P.1    Mazieres, D.2
  • 10
    • 0031108708 scopus 로고    scopus 로고
    • A comparative study of parallel and sequential priority queue algorithms
    • R. Rönngren and R. Ayani. A comparative study of parallel and sequential priority queue algorithms. ACM Trans. Model. Comput. Simul., 7(2):157-209, 1997.
    • (1997) ACM Trans. Model. Comput. Simul , vol.7 , Issue.2 , pp. 157-209
    • Rönngren, R.1    Ayani, R.2
  • 11
    • 0002245383 scopus 로고    scopus 로고
    • Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications
    • San Diego, CA, August
    • 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 2001, San Diego, CA, August 2001.
    • (2001) ACM SIGCOMM 2001
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, M.F.4    Balakrishnan, H.5


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