SHARP: A Scalable Framework for Dynamic Joint Replica Placement and Request Routing Scheduling

Author

Wang, Yi ; Tian, XChen ; Jiang, Hongbo ; Liu, Xue ; Chen, Jinhua ; Liu, Wenyu

Author_Institution

Dept. of EIE, Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2011

fDate

5-9 Dec. 2011

Firstpage

1

Lastpage

5

Abstract

This paper presents SHARP: a scalable framework for Dynamic Joint Replica Placement and Request Routing (DJRPRR) scheduling in content delivery networks. After grouping similar proxies and modeling them by a single section, we propose a hierarchical scheduling framework to greatly reduce the dimensions of the mathematical formulation. In every phase the obtained shaped formulation has an easy-solvable form and the complete optimization process is highly scalable. To verify the scalability and effectiveness of our approach, SHARP is evaluated by comprehensive experiment settings which are derived from realistic data/topology of an operational commercial CDN.

Keywords

computer networks; mathematical analysis; optimisation; scheduling; telecommunication network routing; CDN; DJRPRR scheduling; SHARP; content delivery networks; dynamic joint replica placement scheduling; mathematical formulation; optimization process; request routing scheduling; Bandwidth; Content distribution networks; Dynamic scheduling; Optimization; Peer to peer computing; Quality of service;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Conference_Location

Houston, TX, USA

ISSN

1930-529X

Print_ISBN

978-1-4244-9266-4

Electronic_ISBN

1930-529X

Type

conf

DOI

10.1109/GLOCOM.2011.6134134

Filename

6134134