A new service overlays dimensioning approach based on stochastic geometry

The global provisioning of some types of evolved services over the Internet requires the deployment of servers; the approach is usually called service overlays. An optimal design of the number of servers and of their location is critical in order to minimize the deployment cost while providing the quality of service expected by users. In this paper, we propose an original modelling, analysis and optimization approach based on stochastic geometry to deal with this design issue. Two particular cases of service overlays are emphasized: servers deployed for content delivery (i.e. to deploy a content delivery network or CDN) and servers deployed for reliable multicast communications. In our approach, the network topology, the subscribers' location and the servers' location are represented by point processes in the plane. Point process theory and Palm Calculus are used in order to obtain closed form expressions for the expected value of realistic cost functions. These closed forms allow us to evaluate the optimal cost of a future deployment.

[1]  F. Baccelli,et al.  On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications , 2001, Advances in Applied Probability.

[2]  Jean-Louis Rougier,et al.  Optimization of hierarchical routing protocols , 2000, Perform. Evaluation.

[3]  Christian Maihöfer.  Bandwidth Analysis and Simulation of Reliable Multicast Transport Protocols , 2003, Telecommun. Syst..

[4]  Mark Crovella,et al.  Characteristics of WWW Client-based Traces , 1995 .

[5]  Arun Venkataramani,et al.  Bandwidth constrained placement in a WAN , 2001, PODC '01.

[6]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[7]  Sanjoy Paul,et al.  TRACK Architecture: A Scalable Real-time Reliable Multicast Protocol , 2000 .

[8]  François Baccelli,et al.  Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks , 1999, Oper. Res..

[9]  Don Towsley,et al.  Packet loss correlation in the MBone multicast network , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[10]  Dah Ming Chiu,et al.  Reliable Multicast Transport Building Block for TRACK , 2002 .

[11]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[12]  Jean-Louis Rougier,et al.  Optimization of content delivery networks server placement , 2003 .

[13]  Bartomiej Baszczyszyn,et al.  On a Coverage Process Ranging from the Boolean Model to the Poisson Voronoi Tessellation , 2000 .

[14]  Mark Handley,et al.  Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer , 2001, RFC.

[15]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  Fabián A. Chudak,et al.  Improved approximation algorithms for a capacitated facility location problem , 1999, SODA '99.

[17]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[18]  Konstantinos Kalpakis,et al.  Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs , 2001, IEEE Trans. Parallel Distributed Syst..

[19]  Balachander Krishnamurthy,et al.  On network-aware clustering of Web clients , 2000, SIGCOMM.

[20]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[21]  T. Mattfeldt.  Stochastic Geometry and Its Applications , 1996 .

[22]  Jean-Louis Rougier,et al.  Self organizing hierarchical multicast trees and their optimization , 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).

[23]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[24]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[25]  Supratik Bhattacharyya,et al.  An Overview of Source-Specific Multicast (SSM) , 2003, RFC.

[26]  Seok Koh,et al.  Reliable Multicast Transport Building Block: Tree Auto-Configuration , 2003 .

[27]  J. J. Garcia-Luna-Aceves,et al.  The case for reliable concurrent multicasting using shared ACK trees , 1997, MULTIMEDIA '96.

[28]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[29]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[30]  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).

[31]  François Baccelli,et al.  Spatial Averages of Coverage Characteristics in Large CDMA Networks , 2002, Wirel. Networks.

[32]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[33]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[34]  Jean-Louis Rougier,et al.  Impact of Tree Structure on Retransmission Efficiency for TRACK , 2001, Networked Group Communication.

[35]  François Baccelli,et al.  Stochastic geometry and architecture of communication networks , 1997, Telecommun. Syst..

[36]  Deborah Estrin,et al.  Protocol independent multicast-dense mode (pim-dm): protocol specification , 1996 .

[37]  Daniel Kofman,et al.  Analysis and optimization of hierarchical reliable transport protocols , 2001 .