메뉴 건너뛰기




Volumn 4878 LNCS, Issue , 2007, Pages 372-385

Small-world networks: From theoretical bounds to practical systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; RANDOM PROCESSES; ROUTING PROTOCOLS; SYSTEMS ANALYSIS;

EID: 38449096150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77096-1_27     Document Type: Conference Paper
Times cited : (17)

References (20)
  • 1
    • 84957020501 scopus 로고    scopus 로고
    • Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient Routing in Networks with Long Range Contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, 2180, pp. 270-284. Springer, Heidelberg (2001)
    • Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient Routing in Networks with Long Range Contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 270-284. Springer, Heidelberg (2001)
  • 3
    • 38449083202 scopus 로고    scopus 로고
    • Small-World Networks: Is there a mismatch between theory and practice
    • IRISA #1849
    • Bonnet, F., Kermarrec, A.-M., Raynal, M.: Small-World Networks: Is there a mismatch between theory and practice. In: Research Report IRISA #1849 (2007)
    • (2007) Research Report
    • Bonnet, F.1    Kermarrec, A.-M.2    Raynal, M.3
  • 7
    • 38449101316 scopus 로고    scopus 로고
    • Combining the Use of Clustering and Scale-free Nature of User Exchanges into a Simple and Efficient P2P System
    • Fraigniaud, P., Gauron, P., Latapy, M.: Combining the Use of Clustering and Scale-free Nature of User Exchanges into a Simple and Efficient P2P System, In: Proc. European Conf. on Parallelism (EUROPAR 2005) (2005)
    • (2005) Proc. European Conf. on Parallelism (EUROPAR
    • Fraigniaud, P.1    Gauron, P.2    Latapy, M.3
  • 8
    • 10444227234 scopus 로고    scopus 로고
    • Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism Shrinks even Small Worlds. In: Fraigniaud, P., Gavoille, C., Paul, G (eds.) Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 169-178. ACM Press, New York (2004)
    • Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism Shrinks even Small Worlds. In: Fraigniaud, P., Gavoille, C., Paul, G (eds.) Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 169-178. ACM Press, New York (2004)
  • 10
    • 35048865013 scopus 로고    scopus 로고
    • The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-based Implementations
    • Proc. 5th ACM/IFIP/USENIX Int'l Conference on Middleware, Springer-Verlag, Heidelberg
    • Jelasity, M., Guerraoui, G., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-based Implementations. In: Proc. 5th ACM/IFIP/USENIX Int'l Conference on Middleware. Lecture Notes in Computer Science, pp. 79-98. Springer-Verlag, Heidelberg (2004)
    • (2004) Lecture Notes in Computer Science , pp. 79-98
    • Jelasity, M.1    Guerraoui, G.2    Kermarrec, A.-M.3    van Steen, M.4
  • 11
    • 0343441557 scopus 로고    scopus 로고
    • Navigation in a Small World
    • Kleinberg, J.: Navigation in a Small World. Nature 845(406) (2000)
    • (2000) Nature , vol.845 , Issue.406
    • Kleinberg, J.1
  • 12
    • 0033726520 scopus 로고    scopus 로고
    • The Small-World Phenomenon: An Algorithmic Perspective
    • ACM Press, New York
    • Kleinberg, J.: The Small-World Phenomenon: an Algorithmic Perspective. In: Proc. 32nd ACM Symposium on Theory of Computing, pp. 163-170. ACM Press, New York (2000)
    • (2000) Proc. 32nd ACM Symposium on Theory of Computing , pp. 163-170
    • Kleinberg, J.1
  • 13
    • 0002687371 scopus 로고
    • The Small-World Problem
    • Milgram, S.: The Small-World Problem. Psychology Today 61(2), 60-67 (1967)
    • (1967) Psychology Today , vol.61 , Issue.2 , pp. 60-67
    • Milgram, S.1
  • 14
    • 23944472654 scopus 로고    scopus 로고
    • Know The Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
    • IPTPS, Springer, Heidelberg
    • Naor, M., Wieder, U.: Know The Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. In: IPTPS 2004. LNCS, vol. 3279, pp. 269-277. Springer, Heidelberg (2005)
    • (2004) LNCS , vol.3279 , pp. 269-277
    • Naor, M.1    Wieder, U.2
  • 17
    • 38449102949 scopus 로고    scopus 로고
    • Epidemic-style Management of Semantic Overlays for Content-Based Searching
    • RSCTC, Springer, Heidelberg
    • Voulgaris, S., van Steen, M.: Epidemic-style Management of Semantic Overlays for Content-Based Searching. In: RSCTC 2000. LNCS (LNAI), vol. 2005, Springer, Heidelberg (2001)
    • (2000) LNCS (LNAI , vol.2005
    • Voulgaris, S.1    van Steen, M.2
  • 18
    • 0032482432 scopus 로고    scopus 로고
    • Collective Dynamics of Small-World Networks
    • Watts, D.J., Strogatz, S.H.: Collective Dynamics of Small-World Networks. Nature 393, 440-442 (1998)
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 19
    • 0001154535 scopus 로고
    • On Constructing Minimum Spanning Trees in k-dimensional Space and Related Problems
    • Yao, A.C.G: On Constructing Minimum Spanning Trees in k-dimensional Space and Related Problems. SIAM Journal of Computing 11, 721-736 (1982)
    • (1982) SIAM Journal of Computing , vol.11 , pp. 721-736
    • Yao, A.C.G.1
  • 20
    • 38449113233 scopus 로고    scopus 로고
    • http://peersim.sourceforge.net/


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