메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 2135-2146

Strategyproof mechanisms for dynamic multicast tree formation in overlay networks

Author keywords

Economics; Experimentation with real networks testbeds

Indexed keywords

DISTRIBUTED ALGORITHMS; EXPERIMENTS WITH REAL NETWORKS/TESTBEDS; OVERLAY NODES; TREE FORMATION;

EID: 25844483846     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498489     Document Type: Conference Paper
Times cited : (29)

References (14)
  • 2
    • 0011116653 scopus 로고    scopus 로고
    • Informed content delivery across adaptive overlay networks
    • August
    • J. Byers and J. Considine, "Informed Content Delivery Across Adaptive Overlay Networks," in Proc. of ACM SIGCOMM, August 2002.
    • (2002) Proc. of ACM SIGCOMM
    • Byers, J.1    Considine, J.2
  • 4
    • 1242330677 scopus 로고    scopus 로고
    • A blueprint for introducing disruptive technology into the internet
    • Princeton, NJ, October
    • L. Peterson, D. Culler, T. Anderson, and T. Roscoe, "A Blueprint for Introducing Disruptive Technology into the Internet," in Proc. of HotNets-I, Princeton, NJ, October 2002.
    • (2002) Proc. of HotNets-I
    • Peterson, L.1    Culler, D.2    Anderson, T.3    Roscoe, T.4
  • 5
  • 6
  • 7
    • 25844469792 scopus 로고    scopus 로고
    • Distributed algorithmic mechanism design: Recent results and future directions
    • Atlanta, Georgia, September
    • J. Feigenbaum and S. Shenker, "Distributed Algorithmic Mechanism Design: Recent Results and Future Directions," in Proc. of ACM Dial-M, Atlanta, Georgia, September 2002.
    • (2002) Proc. of ACM Dial-M
    • Feigenbaum, J.1    Shenker, S.2
  • 8
    • 0036957186 scopus 로고    scopus 로고
    • A BGP-based mechanism for lowest-cost routing
    • New York, ACM Press.
    • J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based Mechanism for Lowest-Cost Routing," in Proc. of ACM PODC, New York, 2002, pp. 173-182. ACM Press.
    • (2002) Proc. of ACM PODC , pp. 173-182
    • Feigenbaum, J.1    Papadimitriou, C.2    Sami, R.3    Shenker, S.4
  • 10
    • 84861248169 scopus 로고    scopus 로고
    • Strategyproof mechanisms for dynamic multicast tree formation in overlay networks
    • University of Toronto
    • Selwyn Yuen and Baochun Li, "Strategyproof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks," Tech. Rep., University of Toronto, http://iqua.ece.toronto.edu/papers/vcg-overlay.pdf, 2004.
    • (2004) Tech. Rep.
    • Yuen, S.1    Li, B.2
  • 11
    • 25844447409 scopus 로고    scopus 로고
    • IOverlay: A lightweight middleware infrastructure for overlay application implementations
    • B. Li, J. Guo, and M. Wang, "iOverlay: A Lightweight Middleware Infrastructure for Overlay Application Implementations," in Proc. of ACM/USENIX Middleware 2004, Toronto, Canada, 2004.
    • (2004) Proc. of ACM/USENIX Middleware 2004, Toronto, Canada
    • Li, B.1    Guo, J.2    Wang, M.3
  • 12
    • 25844511928 scopus 로고    scopus 로고
    • Achieving budget-balance with VCG-based payment schemes in combinatorial exchanges
    • March
    • J. Kalgnanam D.C. Parkes and M. Eso, "Achieving Budget-Balance with VCG-Based Payment Schemes in Combinatorial Exchanges," in IBM Research Report RC 22218, March 2002.
    • (2002) IBM Research Report RC 22218
    • Kalgnanam, J.1    Parkes, D.C.2    Eso, M.3
  • 13
    • 0242456196 scopus 로고    scopus 로고
    • Virtual worlds: Fast and strategyproof auctions for dynamic resource allocation
    • C. Ng, D.C. Parkes, and M. Seltzer, "Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation," in ACM Conference on Electronic Commerce, 2003.
    • (2003) ACM Conference on Electronic Commerce
    • Ng, C.1    Parkes, D.C.2    Seltzer, M.3


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