메뉴 건너뛰기




Volumn 4290 LNCS, Issue , 2006, Pages 101-120

Trading off resources between overlapping overlays

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; FORMAL LOGIC; FREQUENCY ALLOCATION; MIDDLEWARE; RESOURCE ALLOCATION; COMPUTATION THEORY;

EID: 33845939384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11925071_6     Document Type: Conference Paper
Times cited : (11)

References (36)
  • 6
    • 0002847012 scopus 로고    scopus 로고
    • Hierarchical packet fair queueing algorithms
    • Jon C.R. Bennett and Hui Zhang. Hierarchical packet fair queueing algorithms. In Proc. SIGCOMM, 1996.
    • (1996) Proc. SIGCOMM
    • Bennett, J.C.R.1    Zhang, H.2
  • 9
    • 0002528364 scopus 로고    scopus 로고
    • Distributed schedule management in the tiger video fileserver
    • William J. Bolosky, Robert P. Fitzgerald, and John R. Douceur. Distributed schedule management in the tiger video fileserver. In Proc. SOSP, 1997.
    • (1997) Proc. SOSP
    • Bolosky, W.J.1    Fitzgerald, R.P.2    Douceur, J.R.3
  • 11
    • 1842704832 scopus 로고    scopus 로고
    • Forwarding in a content-based network
    • A. Carzaniga and A. L. Wolf. Forwarding in a content-based network. In Proc. SIGCOMM, 2003.
    • (2003) Proc. SIGCOMM
    • Carzaniga, A.1    Wolf, A.L.2
  • 15
    • 1142303698 scopus 로고    scopus 로고
    • Approximate join processing over data streams
    • A. Das, J. Gehrke, and M. Riedewald. Approximate join processing over data streams. In Proc. SIGMOD, 2003.
    • (2003) Proc. SIGMOD
    • Das, A.1    Gehrke, J.2    Riedewald, M.3
  • 16
    • 0024889726 scopus 로고
    • Analysis and simulation of a fair queueing algorithm
    • A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proc. SIGCOMM, 1989.
    • (1989) Proc. SIGCOMM
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 17
    • 0003212892 scopus 로고    scopus 로고
    • Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks
    • P. Goyal, H. M. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. In Proc. SIGCOMM, 1996.
    • (1996) Proc. SIGCOMM
    • Goyal, P.1    Vin, H.M.2    Cheng, H.3
  • 19
    • 0038533333 scopus 로고    scopus 로고
    • Aggregate traffic performance with active queue management and drop from tail
    • G. lannaccone, M. May, and C. Diot. Aggregate traffic performance with active queue management and drop from tail. Computer Communication Review, 31(3):4-13, 2001.
    • (2001) Computer Communication Review , vol.31 , Issue.3 , pp. 4-13
    • lannaccone, G.1    May, M.2    Diot, C.3
  • 20
    • 33845957860 scopus 로고    scopus 로고
    • Engineering realities of building a working peer-to-peer system
    • MSR-TR-2004-54, available at
    • M. B. Jones and J. Dunagan. Engineering realities of building a working peer-to-peer system. Microsoft Research Technical Report MSR-TR-2004-54, available at ftp://ftp.research.microsoft.com/pub/tr/TR-2004-54.pdf, 2004.
    • (2004) Microsoft Research Technical Report
    • Jones, M.B.1    Dunagan, J.2
  • 26
    • 0034823616 scopus 로고    scopus 로고
    • Adaptive precision setting for cached approximate values
    • C. Olston, B. T. Loo, and J. Widom. Adaptive precision setting for cached approximate values. In Proc. SIGMOD, 2001.
    • (2001) Proc. SIGMOD
    • Olston, C.1    Loo, B.T.2    Widom, J.3
  • 30
    • 85094631495 scopus 로고    scopus 로고
    • MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks
    • A. Rodriguez, C. Killian, S. Bhat, D. Kostic, and A. Vahdat. MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks. In Proc. NSDI, 2004.
    • (2004) Proc. NSDI
    • Rodriguez, A.1    Killian, C.2    Bhat, S.3    Kostic, D.4    Vahdat, A.5
  • 31
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems
    • A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proc. Middleware, 2001.
    • (2001) Proc. Middleware
    • Rowstron, A.1    Druschel, P.2
  • 34
    • 0002709112 scopus 로고    scopus 로고
    • Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high speed networks
    • I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high speed networks. In Proc. SIGCOMM, 1998.
    • (1998) Proc. SIGCOMM
    • Stoica, I.1    Shenker, S.2    Zhang, H.3
  • 35
    • 0036373331 scopus 로고    scopus 로고
    • Efficient search in peer-to-peer networks
    • B. Yang and H. Garcia-Molina. Efficient search in peer-to-peer networks. In ICDCS, 2002.
    • (2002) ICDCS
    • Yang, B.1    Garcia-Molina, H.2


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