메뉴 건너뛰기




Volumn 67, Issue 3, 2010, Pages 141-159

An analytical framework for self-organizing peer-to-peer anti-entropy algorithms

Author keywords

Anti entropy; Counting; Delay; Epidemic; Markov chain; Overhead; Peer to peer; Self organizing

Indexed keywords

BIOLOGICALLY INSPIRED; DATA DISSEMINATION; DISTRIBUTED SYSTEMS; ENTROPY ALGORITHMS; ENTROPY APPROACH; EPIDEMIC; EVENTUAL CONSISTENCY; EXPECTED MESSAGE DELAY; FAILURE DETECTION; FIRST PASSAGE TIME; GROUP MEMBERSHIPS; LOCAL DATA; LOSS RECOVERY; MARKOV CHAIN; MULTICAST PROTOCOL; NETWORK SERVICES; PAIRWISE INTERACTION; PEER TO PEER; PERFORMANCE MEASURE; SELF ORGANIZING; SELF-ORGANIZING PEERS; THEORETICAL RESULT;

EID: 73149084644     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2009.09.009     Document Type: Article
Times cited : (8)

References (29)
  • 6
    • 73149124600 scopus 로고    scopus 로고
    • R. Golding, K. Taylor, Group Membership in the Epidemic Style, Technical Report, UCSC-CRL-92-13, University of California at Santa Cruz, 1992
    • R. Golding, K. Taylor, Group Membership in the Epidemic Style, Technical Report, UCSC-CRL-92-13, University of California at Santa Cruz, 1992
  • 11
    • 33746780102 scopus 로고    scopus 로고
    • Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining
    • van Renesse R., Birman K., and Vogels W. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems 21 (2003) 164-206
    • (2003) ACM Transactions on Computer Systems , vol.21 , pp. 164-206
    • van Renesse, R.1    Birman, K.2    Vogels, W.3
  • 16
    • 42549105614 scopus 로고    scopus 로고
    • A chain-binomial model for pull and push-based information diffusion
    • Istanbul, Turkey
    • M. Çaǧlar, Ö. Özkasap, A chain-binomial model for pull and push-based information diffusion, in: Proc. of IEEE ICC, Istanbul, Turkey, 2006
    • (2006) Proc. of IEEE ICC
    • Çaǧlar, M.1    Özkasap, O.2
  • 17
    • 0002706835 scopus 로고
    • Epidemic process on a random graph: Some preliminary results
    • Gertsbakh I.B. Epidemic process on a random graph: Some preliminary results. Journal of Applied Probability 14 (1977) 427-438
    • (1977) Journal of Applied Probability , vol.14 , pp. 427-438
    • Gertsbakh, I.B.1
  • 18
    • 0033236708 scopus 로고    scopus 로고
    • Epidemic processes on digraphs of random mappings
    • Jaworski J. Epidemic processes on digraphs of random mappings. Journal of Applied Probability 36 (1999) 780-798
    • (1999) Journal of Applied Probability , vol.36 , pp. 780-798
    • Jaworski, J.1
  • 20
    • 40249108603 scopus 로고    scopus 로고
    • Optimal scheduling of peer-to-peer file dissemination
    • Mundinger J., Weber R., and Weiss G. Optimal scheduling of peer-to-peer file dissemination. Journal of Scheduling 11 (2008) 105-120
    • (2008) Journal of Scheduling , vol.11 , pp. 105-120
    • Mundinger, J.1    Weber, R.2    Weiss, G.3
  • 26
    • 73149102161 scopus 로고    scopus 로고
    • MATLAB codes for simulations can be found under http://home.ku.edu.tr/~mcaglar
    • MATLAB codes for simulations can be found under http://home.ku.edu.tr/~mcaglar
  • 27
    • 0003726016 scopus 로고    scopus 로고
    • Improving simulation for network research, USC Computer Science Dept
    • Technical Report
    • S. Bajaj, L. Breslau, D. Estrin, et al., Improving simulation for network research, USC Computer Science Dept. Technical Report, 1999, pp. 99-702
    • (1999) , pp. 99-702
    • Bajaj, S.1    Breslau, L.2    Estrin, D.3
  • 28
    • 73149120819 scopus 로고    scopus 로고
    • GT-ITM topology generator
    • GT-ITM topology generator, http://www.isi.edu/nsnam/ns/ns-topogen.html
  • 29


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