메뉴 건너뛰기




Volumn 69, Issue 5 1, 2004, Pages

Efficiency and reliability of epidemic data dissemination in complex networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; INFORMATION DISSEMINATION; INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PROBABILITY; TOPOLOGY;

EID: 42749108922     PISSN: 15393755     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (109)

References (19)
  • 5
    • 0038483826 scopus 로고    scopus 로고
    • A.-L. Barabási and R. Albert, Science 286, 509 (1999); A.-L. Barabási, R. Albert, and H. Jeong, Physica A 272, 173 (1999).
    • (1999) Science , vol.286 , pp. 509
    • Barabási, A.-L.1    Albert, R.2
  • 15
    • 0037845502 scopus 로고    scopus 로고
    • Cambridge University Press, Cambridge, U.K
    • D. J. Daley and J. Gani, Epidemic Modeling (Cambridge University Press, Cambridge, U.K., 2000).
    • (2000) Epidemic Modeling
    • Daley, D.J.1    Gani, J.2
  • 17
    • 33645070605 scopus 로고    scopus 로고
    • note
    • The model proposed here has been considered before keeping λ=α=1 [12] in Watts-Strogatz networks with a different level of randomness in the connectivity pattern.
  • 18
    • 33645094452 scopus 로고    scopus 로고
    • note
    • Generally, in order to optimize the spreading process, spreaders avoid meeting again the individual from whom they learned the rumor.


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