English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

International audienceIn the context of fog computing, we consider a simple case when data centersinstalled at the edge of the network are backed up by a central (bigger) datacenter. The system considered precisely comprises two data centers in parallel.We assume that if a request arrives at an overloaded data center, it isforwarded to the other data center with a given probability. Both data centersare assumed to have a large number of servers (rescaling of the system) andthat traffic to one of them is causing saturation so that the other data centermay help to cope with this saturation regime by reducing the rejection ofrequests. Our aim here is to qualitatively estimate the gain achieved by thecollaboration of the two data centers. After proving some convergence results,related to the scaling limits of loss systems, for the process describing thenumber of free servers at both data centers, we show that the performance ofthe system can be expressed in terms of the invariant distribution of a randomwalk in the quarter plane. By using and developing existing results in thetechnical literature, explicit formulas for the blocking rates of such a systemare derived

Analysis of an Offloading Scheme for Data Centers in the Framework of Fog Computing