Resource-aware server selection in content delivery networks

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications

Volumn 35, Issue 3, 2012, Pages 103-107

  Hui, Wen ^a,b   Lin, Chuang ^b   Yang, Yang ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Content delivery network; Hierarchical clustering; Network coordinate; Resource location

Indexed keywords

COMMUNICATION OVERHEADS; CONTENT DELIVERY NETWORK; COORDINATE SPACE; DIFFERENT SERVICES; HIER-ARCHICAL CLUSTERING; HIERARCHICAL CLUSTERING ALGORITHMS; NETWORK COORDINATES; RESOURCE AWARE; RESOURCE LOCATION; SERVER SELECTION; SERVICE NODES; SERVICE PERFORMANCE; TIME PERFORMANCE;

COMPUTER NETWORKS; ELECTRICAL ENGINEERING;

ALGORITHMS;

EID: 84860117273     PISSN: 10075321     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Pathan A M K, Buyya R. A taxonomy and survey of content delivery networks[D]. Parkville, Australia: GRIDS Laboratory Department of Computer Science and Software Engineering, University of Melbourne, 2006.
2. DeCandia G, Hastorun D, Jampani M, et al. Dynamo: Amazon's highly available key-value store[J]. ACM SIGOPS Operating Systems Review, 2007, 41(6): 205-220.
3. Chen Y, Leblet J, Simon G. On reducing the inter-AS traffic of box-powered CDN[C]// ICCCN San Francisco: IEEE, 2009: 1-6.
4. Su A J, Choffnes D R, Kuzmanovic A, et al. Drafting behind Akamai: inferring network conditions based on CDN redirections[J]. IEEE/ACM Transactions on Networking, 2009, 17(6): 1752-1765.
5. Guo C X, Lu G H, Li D, et al. BCube: a high performance, server-centric network architecture for modular data centers[J]. ACM SIGCOMM Computer Communication Review, 2009, 39(4): 63-74.
6. Martello S, Pisinger D, Toth P. New trends in exact algorithms for the 0-1 knapsack problem[J]. European Journal of Operational Research, 2000, 123(2): 325-332.
7. Ball N, Pietzuch P. Distributed content delivery using load-aware network coordinates[C]// ACM CoNEXT Conference. Madrid: ACM, 2008: 77.
8. Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases[J]. ACM SIGMOD Record, 1998, 27(2): 73-84.