A Popularity-Based Approach for Effective Cloud Offload in Fog Deployments

Recent research has put forward the concept of Fog computing, a deported intelligence for IoT networks. Fog clusters are meant to complement current cloud deployments, providing compute and storage resources directly in the access network – which is particularly useful for low-latency applications. However, Fog deployments are expected to be less elastic than cloud platforms, since elasticity in Cloud platforms comes from the scale of the data-centers. Thus, a Fog node dimensioned for the average traffic load of a given application will be unable to handle sudden bursts of traffic. In this paper, we explore such a use-case, where a Fog-based latency-sensitive application must offload some of its processing to the Cloud. We build an analytical queueing model for deriving the statistical response time of a Fog deployment under different request Load Balancing (LB) strategies, contrasting a naive, an ideal (LFU-LB, assuming a priori knowledge of the request popularity) and a practical (LRU-LB, based on online learning of the popularity with an LRU filter) scheme. Using our model, and confirming the results through simulation, we show that the LRU-LB achieves close-to-ideal performance, with high savings on Cloud offload cost with respect to a request-oblivious strategy in the explored scenarios.

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

[2]  Hao Che,et al.  Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..

[3]  Paolo Giaccone,et al.  Temporal locality in today's content caching: why it matters and how to model it , 2013, CCRV.

[4]  Dario Rossi,et al.  Analyzing cacheable traffic in isp access networks for micro cdn applications via content-centric networking , 2014, ICN '14.

[5]  T. Ott THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[6]  Dennis Shasha,et al.  2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.

[7]  Robert B. Miller,et al.  Response time in man-computer conversational transactions , 1899, AFIPS Fall Joint Computing Conference.

[8]  Natarajan Gautam The M/G/∞ Queue , 2011 .

[9]  Jarek Nabrzyski,et al.  Cost minimization for computational applications on hybrid cloud infrastructures , 2013, Future Gener. Comput. Syst..

[10]  Giovanna Carofiglio,et al.  FOCAL: Forwarding and Caching with Latency Awareness in Information-Centric Networking , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).

[11]  Masayuki Murata,et al.  Analysis and Modeling of World Wide Web Traffic for Capacity Dimensioning of Internet Access Lines , 1998, Perform. Evaluation.

[12]  David Lillethun,et al.  Mobile fog: a programming model for large-scale applications on the internet of things , 2013, MCC '13.

[13]  Raja Lavanya,et al.  Fog Computing and Its Role in the Internet of Things , 2019, Advances in Computer and Electrical Engineering.

[14]  Yacine Ghamri-Doudane,et al.  A content-based centrality metric for collaborative caching in information-centric fogs , 2017, 2017 IFIP Networking Conference (IFIP Networking) and Workshops.

[15]  Bo Li,et al.  Handling flash deals with soft guarantee in hybrid cloud , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[16]  Asser N. Tantawi,et al.  An analytical model for multi-tier internet services and its applications , 2005, SIGMETRICS '05.

[17]  Mateusz Dzida,et al.  On popularity-based load balancing in content networks , 2012, 2012 24th International Teletraffic Congress (ITC 24).

[18]  Mahadev Satyanarayanan,et al.  An empirical study of latency in an emerging class of edge computing applications for wearable cognitive assistance , 2017, SEC.

[19]  Philippe Robert,et al.  Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Meng Wang,et al.  Fog computing based content-aware taxonomy for caching optimization in information-centric networks , 2017, 2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[21]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[22]  K. Svanberg The method of moving asymptotes—a new method for structural optimization , 1987 .