메뉴 건너뛰기




Volumn 106, Issue 4, 2008, Pages 152-158

Reducing communication costs in robust peer-to-peer networks

Author keywords

Adaptive adversary; Algorithms; Distributed computing; Fault tolerance; Peer to peer

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; COSTS; FAULT TOLERANCE; ROBUST CONTROL;

EID: 40849100435     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.11.004     Document Type: Article
Times cited : (14)

References (12)
  • 1
    • 33749571809 scopus 로고    scopus 로고
    • B. Awerbuch, C. Scheideler, Towards a scalable and robust DHT, in: Proceedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006, pp. 318-327
    • B. Awerbuch, C. Scheideler, Towards a scalable and robust DHT, in: Proceedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006, pp. 318-327
  • 2
    • 0027188428 scopus 로고    scopus 로고
    • M. Ben-Or, R. Canetti, O. Goldreich, Asynchronous secure computation, in: Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing (STOC), 1993, pp. 52-61
    • M. Ben-Or, R. Canetti, O. Goldreich, Asynchronous secure computation, in: Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing (STOC), 1993, pp. 52-61
  • 3
    • 84968779644 scopus 로고    scopus 로고
    • A. Fiat, J. Saia, Censorship resistant peer-to-peer content addressable networks, in: Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA), 2002, pp. 94-103
    • A. Fiat, J. Saia, Censorship resistant peer-to-peer content addressable networks, in: Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms (SODA), 2002, pp. 94-103
  • 4
    • 27144478012 scopus 로고    scopus 로고
    • A. Fiat, J. Saia, M. Young, Making chord robust to Byzantine attacks, in: Proceedings of the 13th Annual European Symposium on Algorithms (ESA), 2005, pp. 803-814
    • A. Fiat, J. Saia, M. Young, Making chord robust to Byzantine attacks, in: Proceedings of the 13th Annual European Symposium on Algorithms (ESA), 2005, pp. 803-814
  • 5
    • 35248832638 scopus 로고    scopus 로고
    • K. Hildrum, J. Kubiatowicz, Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks, in: Proceedings of the 17th International Symposium on Distributed Computing, 2004, pp. 321-336
    • K. Hildrum, J. Kubiatowicz, Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks, in: Proceedings of the 17th International Symposium on Distributed Computing, 2004, pp. 321-336
  • 6
    • 0030671783 scopus 로고    scopus 로고
    • M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, V. Stemann, Practical loss-resilient codes, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997, pp. 150-159
    • M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, V. Stemann, Practical loss-resilient codes, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997, pp. 150-159
  • 7
    • 34248566417 scopus 로고    scopus 로고
    • M. Naor, U. Wieder, A simple fault tolerant distributed hash table, in: Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), 2003, pp. 88-97
    • M. Naor, U. Wieder, A simple fault tolerant distributed hash table, in: Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), 2003, pp. 88-97
  • 8
    • 84974727234 scopus 로고    scopus 로고
    • Asynchronous unconditionally secure computation: An efficiency improvement
    • INDOCRYPT 2002, Springer-Verlag
    • Prabhu B., Srinathan K., and Rangan C.P. Asynchronous unconditionally secure computation: An efficiency improvement. INDOCRYPT 2002. Lecture Notes in Computer Science vol. 2551 (2002), Springer-Verlag 93-107
    • (2002) Lecture Notes in Computer Science , vol.2551 , pp. 93-107
    • Prabhu, B.1    Srinathan, K.2    Rangan, C.P.3
  • 9
    • 0034775826 scopus 로고    scopus 로고
    • S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp. 161-172
    • S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp. 161-172
  • 10
    • 84947784853 scopus 로고    scopus 로고
    • Efficient asynchronous secure multiparty distributed computation
    • INDOCRYPT 2000, Springer-Verlag
    • Srinathan K., and Rangan C.P. Efficient asynchronous secure multiparty distributed computation. INDOCRYPT 2000. Lecture Notes in Computer Science vol. 1977 (2000), Springer-Verlag 117-129
    • (2000) Lecture Notes in Computer Science , vol.1977 , pp. 117-129
    • Srinathan, K.1    Rangan, C.P.2
  • 11
    • 0034782005 scopus 로고    scopus 로고
    • I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proceedings of the 2001 ACM SIGCOMM Conference, 2001, pp. 149-160
    • I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proceedings of the 2001 ACM SIGCOMM Conference, 2001, pp. 149-160
  • 12
    • 40849124119 scopus 로고    scopus 로고
    • B.Y. Zhao, J. Kubiatowicz, A.D. Joseph, Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD-01-1141, University of California at Berkeley, April 2001
    • B.Y. Zhao, J. Kubiatowicz, A.D. Joseph, Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD-01-1141, University of California at Berkeley, April 2001


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