{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T23:11:16Z","timestamp":1777331476787,"version":"3.51.4"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T00:00:00Z","timestamp":1474416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Orange Labs.","award":["CRE 8515"],"award-info":[{"award-number":["CRE 8515"]}]},{"name":"Brazilian Government\/CAPES","award":["BEX 13748-13-0"],"award-info":[{"award-number":["BEX 13748-13-0"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2016,9,21]]},"abstract":"<jats:p>In the context of fog computing, we consider a simple case where data centers are installed at the edge of the network and assume that if a request arrives at an overloaded data center, then it is forwarded to a neighboring data center with some probability. Data centers are assumed to have a large number of servers, and traffic at some of them is assumed to cause saturation. In this case, the other data centers may help to cope with this saturation regime by accepting some of the rejected requests. Our aim is to qualitatively estimate the gain achieved via cooperation between neighboring data centers. After proving some convergence results related to the scaling limits of loss systems for the process describing the number of free servers at both data centers, we show that the performance of the system can be expressed in terms of the invariant distribution of a random walk in the quarter plane. By using and developing existing results in the technical literature, explicit formulas for the blocking rates of such a system are derived.<\/jats:p>","DOI":"10.1145\/2950047","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T13:13:56Z","timestamp":1474463636000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Analysis of an Offloading Scheme for Data Centers in the Framework of Fog Computing"],"prefix":"10.1145","volume":"1","author":[{"given":"Christine","family":"Fricker","sequence":"first","affiliation":[{"name":"INRIA, Paris, France"}]},{"given":"Fabrice","family":"Guillemin","sequence":"additional","affiliation":[{"name":"Orange Labs2, Lannion, France"}]},{"given":"Philippe","family":"Robert","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}]},{"given":"Guilherme","family":"Thompson","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Amazon EC2. http:\/\/aws.amazon.com\/ec2\/.  Amazon EC2. http:\/\/aws.amazon.com\/ec2\/."},{"key":"e_1_2_1_2_1","unstructured":"Microsoft Azure. http:\/\/www.microsoft.com\/windowsazure\/.  Microsoft Azure. http:\/\/www.microsoft.com\/windowsazure\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2786372.2786377"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342509.2342513"},{"key":"e_1_2_1_5_1","volume-title":"Elementary Theory of One or Several Complex Variables","author":"Cartan H.","unstructured":"H. Cartan . 1950. Elementary Theory of One or Several Complex Variables . Dover Publications . H. Cartan. 1950. Elementary Theory of One or Several Complex Variables. Dover Publications."},{"key":"e_1_2_1_6_1","unstructured":"R. Dautray and J. L. Lions. 1985. Analyse Math\u00e9matique et Calcul Num\u00e9rique Pour Les Sciences Et Les Techniques. Masson.  R. Dautray and J. L. Lions. 1985. Analyse Math\u00e9matique et Calcul Num\u00e9rique Pour Les Sciences Et Les Techniques. Masson."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535168"},{"key":"e_1_2_1_8_1","volume-title":"Boundary Value Problems and Applications. Applications of Mathematics","volume":"40","author":"Fayolle G.","unstructured":"G. Fayolle , R. Iasnogorodski , and V. Malyshev . 1999. Random Walks in the Quarter-Plane. Algebraic Methods , Boundary Value Problems and Applications. Applications of Mathematics , Vol. 40 . Springer-Verlag. G. Fayolle, R. Iasnogorodski, and V. Malyshev. 1999. Random Walks in the Quarter-Plane. Algebraic Methods, Boundary Value Problems and Applications. Applications of Mathematics, Vol. 40. Springer-Verlag."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI","author":"Ghodsi A.","year":"2011","unstructured":"A. Ghodsi , M. Zaharia , B. Hindman , A. Konwinski , S. Shenker , and I. Stoica . 2011. Dominant resource fairness: Fair allocation of multiple resources in datacenters . In Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2011 ). 323--336. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica. 2011. Dominant resource fairness: Fair allocation of multiple resources in datacenters. In Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2011). 323--336."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(94)90071-X"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005872"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391244"},{"key":"e_1_2_1_13_1","series-title":"Stochastic Modelling and Applied Probability Series","volume-title":"Stochastic Networks and Queues","author":"Robert Philippe","unstructured":"Philippe Robert . 2003. Stochastic Networks and Queues . Stochastic Modelling and Applied Probability Series , Vol. 52 . Springer , New- York . Philippe Robert. 2003. Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series, Vol. 52. Springer, New-York."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2007477.1952699"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950047","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2950047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:49:55Z","timestamp":1750218595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2950047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,21]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,9,21]]}},"alternative-id":["10.1145\/2950047"],"URL":"https:\/\/doi.org\/10.1145\/2950047","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,21]]},"assertion":[{"value":"2015-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}