메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

Fast data access over asymmetric channels using fair and secure bandwidth sharing

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; BROADBAND NETWORKS; CHANNEL CODING; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; INTERNET;

EID: 33947680750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.38     Document Type: Conference Paper
Times cited : (6)

References (25)
  • 1
    • 33947685639 scopus 로고    scopus 로고
    • Foldershare.com, Bytetaxi, Inc
    • Foldershare.com, Bytetaxi, Inc.
  • 3
    • 33947710936 scopus 로고    scopus 로고
    • Sherman Networks, Kazaa, http://www.kazaa.com.
    • Sherman Networks, "Kazaa", http://www.kazaa.com.
  • 4
    • 84892602950 scopus 로고    scopus 로고
    • Carnegie Mellon University
    • Carnegie Mellon University, "Coda file system ",http://www. coda.cs.cmu.edu/.
    • Coda file system
  • 5
    • 33947661644 scopus 로고    scopus 로고
    • Xerox Parc, Bayou Project, http://www2.parc.com/csl/ projects/bayou/.
    • Xerox Parc, "Bayou Project", http://www2.parc.com/csl/ projects/bayou/.
  • 7
    • 33947659171 scopus 로고    scopus 로고
    • Joanna Glasner, P2P fuels global bandwidth binge, http://www.wired.com/news/business/0,1367,67202,00.html, Wired, April 14, 2005.
    • Joanna Glasner, "P2P fuels global bandwidth binge", http://www.wired.com/news/business/0,1367,67202,00.html, Wired, April 14, 2005.
  • 8
    • 24144496767 scopus 로고    scopus 로고
    • Modelling and performance analysis of bittorrent-like peer-to-peer networks
    • August
    • D. Qiu, and R. Srikant, "Modelling and performance analysis of bittorrent-like peer-to-peer networks", ACM Sigcomm, August 2004.
    • (2004) ACM Sigcomm
    • Qiu, D.1    Srikant, R.2
  • 9
    • 8344262309 scopus 로고    scopus 로고
    • Service capacity of peer-to-peer networks
    • X. Yang and G. de Veciana, "Service capacity of peer-to-peer networks", IEEE Infocom, 2004.
    • (2004) IEEE Infocom
    • Yang, X.1    de Veciana, G.2
  • 11
    • 8344233542 scopus 로고    scopus 로고
    • A game theoretic approach to provide incentive and service differentiation in P2P networks
    • R. Ma, S. Lee, D. Yau, "A game theoretic approach to provide incentive and service differentiation in P2P networks", ACE SIGMETRICS/Performance Evaluation Review, 2004.
    • (2004) ACE SIGMETRICS/Performance Evaluation Review
    • Ma, R.1    Lee, S.2    Yau, D.3
  • 12
    • 0042473987 scopus 로고    scopus 로고
    • Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems
    • April
    • T.S.E Ng, Y. Chu, S.G. Rao, K. Sripanidkulchai, and H. Zhang, "Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems", IEEE Infocom, April 2003.
    • (2003) IEEE Infocom
    • Ng, T.S.E.1    Chu, Y.2    Rao, S.G.3    Sripanidkulchai, K.4    Zhang, H.5
  • 14
    • 25644448947 scopus 로고    scopus 로고
    • C. Gkantsidis, P. Rodriguez, Network Coding for large scale content distribution, IEEE Infocom March 2005, (Also as Microsoft Research Technical Report (MSR-TR-2004-80).
    • C. Gkantsidis, P. Rodriguez, "Network Coding for large scale content distribution", IEEE Infocom March 2005, (Also as Microsoft Research Technical Report (MSR-TR-2004-80).
  • 17
    • 33947652917 scopus 로고    scopus 로고
    • Eric W. Weisstein. Coupon collector's Problem, from MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/ CouponCollectorsProblem.html.
    • Eric W. Weisstein. "Coupon collector's Problem", from MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/ CouponCollectorsProblem.html.
  • 18
    • 33745140230 scopus 로고    scopus 로고
    • How good is random linear coding based distributed Networked Storage?
    • Invited talk
    • S. Acedanski, S. Deb, M. Medard and R. Koetter, "How good is random linear coding based distributed Networked Storage?", Invited talk, NetCod, 2005.
    • (2005) NetCod
    • Acedanski, S.1    Deb, S.2    Medard, M.3    Koetter, R.4
  • 19
    • 33947706448 scopus 로고
    • On the sequential and random selection of subspaces over a finite field
    • E. Calabi and H. S. Wilf. "On the sequential and random selection of subspaces over a finite field", Journal of Combinatorial Theory (A), 22: 107109, 1977.
    • (1977) Journal of Combinatorial Theory (A) , vol.22 , pp. 107109
    • Calabi, E.1    Wilf, H.S.2


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