Mobile users in an urban environment access content on the internet from different locations. It is challenging for the current service providers to cope with the increasing demand from large number of collocated mobile users. In-network caching feature to offload content at nodes close to users alleviate the issue, though efficient cache management is required to find who should cache what, when and where in an urban environment, given nodes limited computing, communication and caching resources. To address this, we first define a novel relation between content popularity and availability in the network and investigate a node's eligibility to cache content based on its urban reachability. We then allow nodes to self-organize into mobile fogs to increase the distributed cache with the goal to maximize content availability in a cost-effective manner. However, to cater rational nodes, we propose a coalition game for the nodes to offer a maximum ``virtual cacheassuming a monetary reward is paid to them by the service/content provider. Nodes are allowed to merge into different spatio-temporal coalitions in order to increase the distributed cache size at the network edge. Results obtained through simulations using realistic urban mobility trace validate the performance of our caching system showing a ratio of 60-85% of cache hits compared to the 30-40% obtained by the existing schemes and 10% in case of no coalition.
%0 Conference Paper
%1 Khan.2017
%A Khan, Junaid A.
%A Westphal, Cedric
%A Ghamri-Doudane, Yacine
%B 29th International Teletraffic Congress (ITC 29)
%C Genoa, Italy
%D 2017
%K itc itc29
%T Offloading Content with Self-organizing Mobile Fogs
%U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc29/Khan.2017.pdf?inline=true
%X Mobile users in an urban environment access content on the internet from different locations. It is challenging for the current service providers to cope with the increasing demand from large number of collocated mobile users. In-network caching feature to offload content at nodes close to users alleviate the issue, though efficient cache management is required to find who should cache what, when and where in an urban environment, given nodes limited computing, communication and caching resources. To address this, we first define a novel relation between content popularity and availability in the network and investigate a node's eligibility to cache content based on its urban reachability. We then allow nodes to self-organize into mobile fogs to increase the distributed cache with the goal to maximize content availability in a cost-effective manner. However, to cater rational nodes, we propose a coalition game for the nodes to offer a maximum ``virtual cacheassuming a monetary reward is paid to them by the service/content provider. Nodes are allowed to merge into different spatio-temporal coalitions in order to increase the distributed cache size at the network edge. Results obtained through simulations using realistic urban mobility trace validate the performance of our caching system showing a ratio of 60-85% of cache hits compared to the 30-40% obtained by the existing schemes and 10% in case of no coalition.
@inproceedings{Khan.2017,
abstract = {Mobile users in an urban environment access content on the internet from different locations. It is challenging for the current service providers to cope with the increasing demand from large number of collocated mobile users. In-network caching feature to offload content at nodes close to users alleviate the issue, though efficient cache management is required to find who should cache what, when and where in an urban environment, given nodes limited computing, communication and caching resources. To address this, we first define a novel relation between content popularity and availability in the network and investigate a node's eligibility to cache content based on its urban reachability. We then allow nodes to self-organize into mobile fogs to increase the distributed cache with the goal to maximize content availability in a cost-effective manner. However, to cater rational nodes, we propose a coalition game for the nodes to offer a maximum ``virtual cache\dq assuming a monetary reward is paid to them by the service/content provider. Nodes are allowed to merge into different spatio-temporal coalitions in order to increase the distributed cache size at the network edge. Results obtained through simulations using realistic urban mobility trace validate the performance of our caching system showing a ratio of 60-85% of cache hits compared to the 30-40% obtained by the existing schemes and 10% in case of no coalition.},
added-at = {2017-10-05T16:41:49.000+0200},
address = {Genoa, Italy},
author = {Khan, Junaid A. and Westphal, Cedric and Ghamri-Doudane, Yacine},
biburl = {https://www.bibsonomy.org/bibtex/2b1227122d86ab6ebef616381d925d7e1/itc},
booktitle = {29th International Teletraffic Congress (ITC 29)},
interhash = {ce6ee07891e7f1e8468ae56c379553bf},
intrahash = {b1227122d86ab6ebef616381d925d7e1},
keywords = {itc itc29},
timestamp = {2020-04-30T18:18:14.000+0200},
title = {Offloading Content with Self-organizing Mobile Fogs},
url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc29/Khan.2017.pdf?inline=true},
year = 2017
}