DROPS

Document

DOI: 10.4230/OASIcs.Fog-IoT.2020.5

Addressing the Node Discovery Problem in Fog Computing

Authors: Vasileios Karagiannis, Nitin Desai, Stefan Schulte, and Sasikumar Punnekkat

Published in: OASIcs, Volume 80, 2nd Workshop on Fog Computing and the IoT (Fog-IoT 2020)

Abstract

In recent years, the Internet of Things (IoT) has gained a lot of attention due to connecting various sensor devices with the cloud, in order to enable smart applications such as: smart traffic management, smart houses, and smart grids, among others. Due to the growing popularity of the IoT, the number of Internet-connected devices has increased significantly. As a result, these devices generate a huge amount of network traffic which may lead to bottlenecks, and eventually increase the communication latency with the cloud. To cope with such issues, a new computing paradigm has emerged, namely: fog computing. Fog computing enables computing that spans from the cloud to the edge of the network in order to distribute the computations of the IoT data, and to reduce the communication latency. However, fog computing is still in its infancy, and there are still related open problems. In this paper, we focus on the node discovery problem, i.e., how to add new compute nodes to a fog computing system. Moreover, we discuss how addressing this problem can have a positive impact on various aspects of fog computing, such as fault tolerance, resource heterogeneity, proximity awareness, and scalability. Finally, based on the experimental results that we produce by simulating various distributed compute nodes, we show how addressing the node discovery problem can improve the fault tolerance of a fog computing system.

Cite as

Vasileios Karagiannis, Nitin Desai, Stefan Schulte, and Sasikumar Punnekkat. Addressing the Node Discovery Problem in Fog Computing. In 2nd Workshop on Fog Computing and the IoT (Fog-IoT 2020). Open Access Series in Informatics (OASIcs), Volume 80, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{karagiannis_et_al:OASIcs.Fog-IoT.2020.5,
  author =	{Karagiannis, Vasileios and Desai, Nitin and Schulte, Stefan and Punnekkat, Sasikumar},
  title =	{{Addressing the Node Discovery Problem in Fog Computing}},
  booktitle =	{2nd Workshop on Fog Computing and the IoT (Fog-IoT 2020)},
  pages =	{5:1--5:10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-144-3},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{80},
  editor =	{Cervin, Anton and Yang, Yang},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Fog-IoT.2020.5},
  URN =		{urn:nbn:de:0030-drops-119991},
  doi =		{10.4230/OASIcs.Fog-IoT.2020.5},
  annote =	{Keywords: Fog computing, Edge computing, Internet of Things, Node discovery, Fault tolerance}
}

Document

DOI: 10.4230/OASIcs.CERTS.2019.5

On Fault-Tolerant Scheduling of Time Sensitive Networks

Authors: Radu Dobrin, Nitin Desai, and Sasikumar Punnekkat

Published in: OASIcs, Volume 73, 4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019)

Abstract

Time sensitive networking (TSN) is gaining attention in industrial automation networks since it brings essential real-time capabilities at the data link layer. Though it can provide deterministic latency under error free conditions, TSN still largely depends on space redundancy for improved reliability. In many scenarios, time redundancy could be an adequate as well as cost efficient alternative. Time redundancy in turn will have implications due to the need for over-provisions needed for timeliness guarantees. In this paper, we discuss how to embed fault-tolerance capability into TSN schedules and describe our approach using a simple example.

Cite as

Radu Dobrin, Nitin Desai, and Sasikumar Punnekkat. On Fault-Tolerant Scheduling of Time Sensitive Networks. In 4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019). Open Access Series in Informatics (OASIcs), Volume 73, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{dobrin_et_al:OASIcs.CERTS.2019.5,
  author =	{Dobrin, Radu and Desai, Nitin and Punnekkat, Sasikumar},
  title =	{{On Fault-Tolerant Scheduling of Time Sensitive Networks}},
  booktitle =	{4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019)},
  pages =	{5:1--5:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-119-1},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{73},
  editor =	{Asplund, Mikael and Paulitsch, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CERTS.2019.5},
  URN =		{urn:nbn:de:0030-drops-108965},
  doi =		{10.4230/OASIcs.CERTS.2019.5},
  annote =	{Keywords: Time sensitive networks(TSN), Fault-tolerant schedule, Time redundancy}
}

Search Results

Documents authored by Desai, Nitin

Addressing the Node Discovery Problem in Fog Computing

Abstract

Cite as

On Fault-Tolerant Scheduling of Time Sensitive Networks

Abstract

Cite as

Thanks for your feedback!

Could not send message