Name
Title | ||
|---|---|---|
SHARP: A Scalable Framework for Dynamic Joint Replica Placement and Request Routing Scheduling |
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/GLOCOM.2011.6134134 | GLOBECOM |
Keywords | Field | DocType |
optimisation,cdn,optimization process,scheduling,content delivery networks,mathematical analysis,computer networks,request routing scheduling,dynamic joint replica placement scheduling,mathematical formulation,djrprr scheduling,sharp,telecommunication network routing,dynamic scheduling,quality of service | Lottery scheduling,Replica,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Computer network,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | 1930-529X E-ISBN : 978-1-4244-9267-1 |
ISBN | Citations | PageRank |
978-1-4244-9267-1 | 1 | 0.37 |
References | Authors | |
4 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Wang | 1 | 35 | 14.57 |
| Chen Tian | 2 | 37 | 8.36 |
| Hongbo Jiang | 3 | 985 | 80.52 |
| Xue Liu | 4 | 3058 | 193.41 |
| Jinhua Chen | 5 | 1 | 0.37 |
| Wenyu Liu | 6 | 3131 | 170.07 |