Modeling of QoS-oriented content delivery networks

A content delivery network (CDN) is composed by a set of "reverse proxies" placed in proper geographical locations which provide caching and content distribution services to third party Web sites. Client requests are dispatched to one of the cache nodes that constitute the proxy by using content-aware and state-aware switching. Different distributions are generally believed to be more representative of the general traffic behavior; the classical Markovian model well captures the peculiarities of high intensity traffic during the busiest periods. The Markov chain is finite since, it admits a maximum amount of concurrently processed requests and derive the asymptotic state probabilities of the model of the CDN which can be finally used to configure the CDN with proper parameters to sustain the requested service levels, and thus to meet the SLA for each service class.

[1]  Alec Wolman,et al.  On the scale and performance of cooperative Web proxy caching , 1999, SOSP.

[2]  Arun Iyengar,et al.  A scalable system for consistently caching dynamic Web data , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Donald F. Towsley,et al.  Statistical Analysis of Generalized Processor Sharing Scheduling Discipline , 1995, IEEE J. Sel. Areas Commun..

[4]  Daniela Rosu,et al.  Web Proxy Acceleration , 2004, Cluster Computing.

[5]  Donald F. Towsley,et al.  Call admission control schemes under generalized processor sharing scheduling , 1997, Telecommun. Syst..

[6]  Martin Arlitt,et al.  A workload characterization study of the 1998 World Cup Web site , 2000, IEEE Netw..

[7]  Syam Gadde,et al.  The Trickle-Down Effect: Web Caching and Server Request Distribution , 2002, Comput. Commun..

[8]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[9]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Michele Colajanni,et al.  Mechanisms for quality of service in Web clusters , 2001, Comput. Networks.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[13]  Virgílio A. F. Almeida,et al.  Capacity Planning for Web Services: Metrics, Models, and Methods , 2001 .

[14]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[15]  Eric Levy-Abegnoli,et al.  Architecture of a Web server accelerator , 2002, Comput. Networks.

[16]  Daniel M. Dias,et al.  Engineering Highly Accessed Web Sites for Performance , 2001, Web Engineering.