메뉴 건너뛰기




Volumn 21, Issue 2, 2003, Pages 164-206

Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

Author keywords

Algorithms; Design; Management; Performance; Reliability; Security

Indexed keywords

DISTRIBUTED APPLICATIONS; DISTRIBUTED SYNCHRONIZATION; INFORMATION PROPAGATION; NODES; SCALABLE TECHNOLOGY; SECURITY;

EID: 33746780102     PISSN: 07342071     EISSN: 07342071     Source Type: Journal    
DOI: 10.1145/762483.762485     Document Type: Article
Times cited : (441)

References (34)
  • 4
    • 84958951042 scopus 로고    scopus 로고
    • INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery
    • F. Mattern and M. Naghshineh, Eds. Lecture Notes in Computer Science. Springer, Zürich, Switzerland
    • BALAZINSKA, M., BALAKRISHNAN, H., AND KARGER, D. 2002. INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery. In Proceedings of the 1st International Conference on Pervasive Computing (Pervasive 2002), F. Mattern and M. Naghshineh, Eds. Lecture Notes in Computer Science, vol. 2414. Springer, Zürich, Switzerland, 195-210.
    • (2002) Proceedings of the 1st International Conference on Pervasive Computing (Pervasive 2002) , vol.2414 , pp. 195-210
    • Balazinska, M.1    Balakrishnan, H.2    Karger, D.3
  • 7
    • 0020118361 scopus 로고
    • Grapevine: An exercise in distributed computing
    • BIRRELL, A., LEVIN, R., NEEDHAM, R., AND SCHROEDER, M. 1982. Grapevine: an exercise in distributed computing. CACM 25, 4 (Apr.), 260-274.
    • (1982) CACM , vol.25 , Issue.4 APR , pp. 260-274
    • Birrell, A.1    Levin, R.2    Needham, R.3    Schroeder, M.4
  • 8
    • 0014814325 scopus 로고
    • Space/time tradeoffs in hash coding with allowable errors
    • BLOOM, B. 1970. Space/time tradeoffs in hash coding with allowable errors. CACM 13, 7 (July), 422-426.
    • (1970) CACM , vol.13 , Issue.7 JULY , pp. 422-426
    • Bloom, B.1
  • 10
    • 0001655450 scopus 로고    scopus 로고
    • Design and evaluation of a wide-area event notification service
    • CARZANIGA, A., ROSENBLUM, D., AND A.L., W. 2001. Design and evaluation of a wide-area event notification service. ACM Trans. Comput. Syst. 19, 3 (Aug.), 332-383.
    • (2001) ACM Trans. Comput. Syst. , vol.19 , Issue.3 AUG , pp. 332-383
    • Carzaniga, A.1    Rosenblum, D.2    W., A.L.3
  • 12
    • 0001621285 scopus 로고
    • A weak-consistency architecture for distributed information services
    • GOLDING, R. 1992. A weak-consistency architecture for distributed information services. Comput. Syst. 5, 4 (Fall), 379-405.
    • (1992) Comput. Syst. , vol.5 , Issue.4 FALL , pp. 379-405
    • Golding, R.1
  • 13
    • 84978426536 scopus 로고
    • The REFDBMS distributed bibliographic database system
    • Santa Fe, NM
    • GOLDING, R., LONG, D., AND WILKES, J. 1994. The REFDBMS distributed bibliographic database system. In Proceedings of Usenix'94. Santa Fe, NM, 47-62.
    • (1994) Proceedings of Usenix'94 , pp. 47-62
    • Golding, R.1    Long, D.2    Wilkes, J.3
  • 17
    • 0012771925 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY
    • MINSKY, Y. 2002. Spreading rumors cheaply, quickly, and reliably. Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY.
    • (2002) Spreading Rumors Cheaply, Quickly, and Reliably
    • Minsky, Y.1
  • 23
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • Heidelberg, Germany
    • ROWSTRON, A. AND DRUSCHEL, P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of Middleware 2001. Heidelberg, Germany.
    • (2001) Proceedings of Middleware 2001
    • Rowstron, A.1    Druschel, P.2
  • 31
    • 0002513952 scopus 로고    scopus 로고
    • A gossip-style failure detection service
    • IFIP, The Lake District, UK
    • VAN RENESSE, R., MINSKY, Y., AND HAYDEN, M. 1998. A gossip-style failure detection service. In Proceedings of Middleware'98. IFIP, The Lake District, UK, 55-70.
    • (1998) Proceedings of Middleware'98 , pp. 55-70
    • Van Renesse, R.1    Minsky, Y.2    Hayden, M.3
  • 34
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-tolerant wide-area location and routing
    • University of California, Berkeley, Computer Science Department
    • ZHAO, B., KUBIATOWICZ, J., AND JOSEPH, A. 2001. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California, Berkeley, Computer Science Department.
    • (2001) Tech. Rep. , vol.UCB-CSD-01-1141
    • Zhao, B.1    Kubiatowicz, J.2    Joseph, A.3


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