메뉴 건너뛰기




Volumn 13, Issue 1, 2007, Pages 19-33

Sampling cluster endurance for peer-to-peer based content distribution networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; REQUIREMENTS ENGINEERING; ROUTING ALGORITHMS;

EID: 34547405792     PISSN: 09424962     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00530-007-0078-9     Document Type: Conference Paper
Times cited : (4)

References (45)
  • 3
    • 33745169136 scopus 로고    scopus 로고
    • Gnutella. http://www.gnutella.com (2005)
    • (2005) Gnutella
  • 4
    • 34547436424 scopus 로고    scopus 로고
    • eDonkey2000. http://www.edonkey2000.com (2005)
    • eDonkey2000. http://www.edonkey2000.com (2005)
  • 7
    • 33645697706 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Computer Science, Technische Universität Darmstadt, Germany, June
    • Darlagiannis, V.: Overlay network mechanisms for Peer-to-Peer systems. Ph.D. thesis, Department of Computer Science, Technische Universität Darmstadt, Germany, June (2005)
    • (2005) Overlay network mechanisms for Peer-to-Peer systems
    • Darlagiannis, V.1
  • 13
    • 0003550450 scopus 로고    scopus 로고
    • Streaming live media over a peer-to-peer network
    • Technical Report, Stanford University 2001
    • Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over a peer-to-peer network. Technical Report 2001-31, Stanford University (2001)
    • (2001)
    • Deshpande, H.1    Bawa, M.2    Garcia-Molina, H.3
  • 21
    • 15944367594 scopus 로고    scopus 로고
    • Overlay design mechanisms for heterogeneous, large scale, dynamic P2P systems
    • Darlagiannis, V., Mauthe, A., Steinmetz, R.: Overlay design mechanisms for heterogeneous, large scale, dynamic P2P systems. J. Netw. Syst. Manag. 12(3), 371-395 (2004)
    • (2004) J. Netw. Syst. Manag , vol.12 , Issue.3 , pp. 371-395
    • Darlagiannis, V.1    Mauthe, A.2    Steinmetz, R.3
  • 23
    • 0031274016 scopus 로고    scopus 로고
    • Efficient routing and sorting schemes for de Bruijn networks
    • Hsu, F., Wei, D.: Efficient routing and sorting schemes for de Bruijn networks. IEEE Trans. Parallel. Distrib. Syst. 8(11), 1157-1170 (1997)
    • (1997) IEEE Trans. Parallel. Distrib. Syst , vol.8 , Issue.11 , pp. 1157-1170
    • Hsu, F.1    Wei, D.2
  • 24
    • 0030247367 scopus 로고    scopus 로고
    • Routing and transmitting problems in de Bruijn networks
    • Liu, Z., Sung, T.-Y.: Routing and transmitting problems in de Bruijn networks. IEEE Trans. Comput. 45(9), 1056-1062 (1996)
    • (1996) IEEE Trans. Comput , vol.45 , Issue.9 , pp. 1056-1062
    • Liu, Z.1    Sung, T.-Y.2
  • 25
    • 0021422681 scopus 로고
    • Line digraph iterations and the (d,k) digraph problem
    • Fiol, M., Yebra, L.A., de Miquel, I.A.: Line digraph iterations and the (d,k) digraph problem. IEEE Trans. Comput. 33(5), 400-403 (1984)
    • (1984) IEEE Trans. Comput , vol.33 , Issue.5 , pp. 400-403
    • Fiol, M.1    Yebra, L.A.2    de Miquel, I.A.3
  • 26
    • 0040273728 scopus 로고
    • On the impossibility of directed Moore graphs
    • Bridges, W., Toueg, S.: On the impossibility of directed Moore graphs. J. Comb. Theory Ser. B 29, 339-341 (1980)
    • (1980) J. Comb. Theory Ser. B , vol.29 , pp. 339-341
    • Bridges, W.1    Toueg, S.2
  • 27
    • 0026884871 scopus 로고
    • The partial line digraph technique in the design of large interconnection networks
    • Fiol, M., Llado, A.: The partial line digraph technique in the design of large interconnection networks. IEEE Trans. Comput. 41(7), 848-857 (1992)
    • (1992) IEEE Trans. Comput , vol.41 , Issue.7 , pp. 848-857
    • Fiol, M.1    Llado, A.2
  • 28
    • 0028377211 scopus 로고
    • Lightwave networks based on de Bruijn graphs
    • Trans, TON) 21
    • Sivarajan, K., Ramaswami, R.: Lightwave networks based on de Bruijn graphs. IEEE/ACM Trans. Netw. (TON) 2(1), 70-79 (1994)
    • (1994) Netw , pp. 70-79
    • Sivarajan, K.1    Ramaswami, R.2
  • 29
    • 1242310022 scopus 로고    scopus 로고
    • Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience
    • August
    • Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proceedings of ACM SIGCOMM'03, pp. 395-406, August (2003)
    • (2003) Proceedings of ACM SIGCOMM'03 , pp. 395-406
    • Loguinov, D.1    Kumar, A.2    Rai, V.3    Ganesh, S.4
  • 35
    • 11144290951 scopus 로고    scopus 로고
    • Cluster-based optimizations for distributed hash tables
    • Technical Report 2003-031, CS Department, Boston University, November
    • Considine, J.: Cluster-based optimizations for distributed hash tables. Technical Report 2003-031, CS Department, Boston University, November (2002)
    • (2002)
    • Considine, J.1
  • 38
    • 33745664022 scopus 로고    scopus 로고
    • Large alphabets and incompresibility
    • Gagie, T.: Large alphabets and incompresibility. Inf. Proc. Lett., 246-251 (2006)
    • (2006) Inf. Proc. Lett , vol.246-251
    • Gagie, T.1
  • 39
    • 34547404850 scopus 로고    scopus 로고
    • Feller, W: An introduction to probability theory and its applications, II, 2nd edn. Wiley, NewYork (1971)
    • Feller, W: An introduction to probability theory and its applications, vol. II, 2nd edn. Wiley, NewYork (1971)
  • 41
    • 34547468535 scopus 로고    scopus 로고
    • Dynamic operation of peer-to-peer overlay networks. Prax. Informationsverarbeitung Kommun. (PIK)
    • 2, 65-73
    • Meer, H.D., Tütschku, K., Gia, P.T.: Dynamic operation of peer-to-peer overlay networks. Prax. Informationsverarbeitung Kommun. (PIK) 2003(2), 65-73 (2003)
    • (2003)
    • Meer, H.D.1    Tütschku, K.2    Gia, P.T.3
  • 42
    • 33646902236 scopus 로고    scopus 로고
    • Towards a better understanding of Churn in peer-to-peer networks
    • Technical Report CIS-TR-04-06, Department of Computer Science, University of Oregon, November
    • Stutzbach, D., Rejaie, R.: Towards a better understanding of Churn in peer-to-peer networks. Technical Report CIS-TR-04-06, Department of Computer Science, University of Oregon, November (2004)
    • (2004)
    • Stutzbach, D.1    Rejaie, R.2


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