Building blocks for Fog applications in computing resource-scarce environnements

Publié le
Equipe (ou département si l'offre n'est pas rattachée à une équipe)
Date de début de thèse (si connue)
October 2020
Lieu
IRISA - Campus universitaire de Beaulieu, Rennes
Unité de recherche
IRISA - UMR 6074
Description du sujet de la thèse

While the Internet was built in a decentralized fashion, we are currently witnessing a strong centralization of computing facilities run by clouds. The intrinsic limitations to this model are increasingly visible chiefly due to privacy, energy issues and reliability. Fog computing proposes to localize computing resources close to users. Fog will be composed of small entities with limited resources but geographically distributed. The aim is then to provide services that are relevant in a particular area (such as gathering and displaying feedbacks on local shops, managing avaiable slots in a parking) but also to provide services with strong constraints in terms of latency and interactions (augmented reality in tourism applications).

Fog provides a distributed infrastructure which will cover part of a territory according to the application needs. The Fog resources are, in contrast to Clouds, limited in terms of capacity (network, computing capacity, storage…). Consequently, most applications will actually distribute their computation over a hybrid infrastructure composed of both local Fog resources and a core Cloud facility.

In areas such as national parks spreading over large portions of heterogeneous and potentially rough terrain, networking infrastructure is typically sparsely deployed while difficult and costly to install and maintain.

Would they be park managers or hikers, many users would have a common interest in exploiting these scarce resources, for instance to obtain meteo conditions, emergency management or simply tourism related applications such as sharing picture and obtaining experience feedbacks. As the networking infrastructure is poor, a collaboration between users and this ad-hoc infrastructure will be necessary to offer these services to everyone in the whole park area. In some part of the park the communication will be ensure by hikers walking from one connected point to another, and in more connected place the application has a direct access to the Internet and more classical services. The application should be able to manage the user mobility, the need of aggregate users’ information, allow user to discover his environment (resources available, services) allow user to interact and share information. As these applications compute users’ information the aspect of privacy, anonymity has to be taken into account.

The majority of current mobile application use clouds. Most of the time, they require a constant connectivity to the Internet. A large research field (over the last 20 years) has been based on ad-hoc wireless communication [11] called Delay Tolerant Network (DTN) where the communication pattern does not allow to establish end-to-end paths on-the-fly. Solutions to this problem are based on the "store and forward" concept, where data are incrementally moved and stored throughout the network in hopes that it will eventually reach its destination. More strictly related to the PhD subject, the Mobile Opportunistic Social Network (MOSN) exploits human behaviours, to allow the end-to-end communication. Routing in MOSNs is a trade-off between the routing performance and the prior knowledge on the network state information [1]. This prior knowledge can be contact history [2], social centrality [3], or clustering [4].

Fog computing adds some infrastructure resources close to the edge to provide local services and avoid communication with the distant cloud, or act as an intermediary node between the edge and the cloud [5, 6].

Focused on this context, the aim of this Phd is to identify the basic building blocks and define the distribution of computation between local resources and the distant Cloud. 

To achieve this goal, the way will be to take a first application like sharing picture or emergency management and identify the basic services as routing, services localisation and data aggregation.  For each of these services, we have to define models matching the reality of these infrastructures and define distributed algorithms to ensure the needed spreading and aggregation of information. The algorithms developed will be validated through analysis, simulation and/or  real experiments at scale.

 

This project will be conducted within the IRISA Myriads team which is working on the design of innovative infrastructures and middleware for future fog computing platforms [12]. 

Required qualifications:

  • A master degree in distributed systems and/or Cloud computing. 
  • Excellent programming skills in Linux environments.
  • Excellent communication and writing skills.
  • Good command of English. 
  • Knowledge of the following technologies is not mandatory but will be considered as a plus: 
    • Distributed alorithms
    • Cloud resource scheduling
    • Experiments on large computing platforms

Note that knowledge of French is *not* required for this position. 

Contract duration: 3 years, full time. 

Start date: October 2020. 

Location: Rennes is the capital city of Brittany, in the western part of France. It is easy to reach thanks to the high-speed train line to Paris. Rennes is a lively city and a major center for higher education and research. The job will take place within the INRIA/IRISA research center, which is internationally recognized for its research in the domain of information and communication sciences.

Applications: to apply to this position, please send the following documents to Marin Bertier (marin [*] bertieratirisa [*] fr): 

  • A detailed CV 
  • A motivation letter 
  • Grade transcripts 
  • If possible: TOIC/CLES/TOEFL/IELTS certificate 
  • Two recommendation letters. 

 

Bibliographie

[1]  K. Lee, J. Jeong, Y. Yi, H. Won, I. Rhee and S. Chong, Max contribution: An online approximation of optimal resource allocation in delay tolerant networks, IEE Trans. Mobile Computation, 2015

[2] V. Erramilli, M. Crovella, A. Chaintreau and C. Diot, Delegation forwarding, in Proc ACM Int. Sump. Mobile Ad Hoc Netw. Comput., 2008

[3] W. Gao, G. Gao, T. La Porta and J. Han, On exploiting transient social contact patterns for data forwarding in delay tolerant networks, IEEE Trans. Mobile Comput. 2013

[4] Y. Tao and X.-F. Wang, Adaptive clustering hierarchy routing for delay tolerant network, J. Central South Univ. 2012

[5] Yi, S., Hao, Z., Qin, Z., Li, Q., 2015a. Fog computing: platform and applications. In: Proceedings of the Third IEEE Workshop on Hot Topics in Web Systems and Technologies, pp. 73–78.

[6] Hu, P., Dhelim, S., Ning, H., & Qiu, T. (2017). Survey on fog computing: architecture, key technologies, applications and open issues. Journal of Network and Computer Applications, 98, 27-42.

[7] R. Pereira, A. Casaca, J. J. P. C. Rodrigues, V. N. G. J. Soares, J. Triay and C. Cervello-Pastor, "From Delay-Tolerant Networks to Vehicular Delay-Tolerant Networks," in IEEE Communications Surveys & Tutorials, 2012.

[8] Bonomi, F., 2011. Connected vehicles, the internet of things, and fog computing. In: Proceedings of the Eighth ACM International Workshop on Vehicular Inter- Networking (VANET), pp. 13–15.

[9] Luan, T.H., Gao, L., Li, Z., Xiang, Y., Wei, G., Sun, L., 2015. Fog computing: focusing on mobile users at the edge. Comput. Sci., 1–11.

[10] Alam M.G.R., Yan, K.T., Hong, C.S., 2016. Multi-agent and reinforcement learning based code offloading in mobile fog. In: Proceedings of the International Conference on Information Networking, pp. 285–290.

[11] Shi, W., Dustdar, S., 2016. The promise of edge computing. Computer 49 (5), 78–81.

[12] Myriads INRIA/IRISA team. https://team.inria.fr/myriads/

Liste des encadrants et encadrantes de thèse

Nom, Prénom
TEDESCHI Cédric
Type d'encadrement
Directeur.trice de thèse
Unité de recherche
UMR 6074, Inria

Nom, Prénom
BERTIER Marin
Type d'encadrement
Co-encadrant.e
Unité de recherche
UMR 6074, Inria
Contact·s
Mots-clés
distributed algorithms, FOG Computing