Also In This Section
  • Categories

  • Recent News

  • Category: Ebnenasir

    Call for Manuscripts: Fault Tolerance in Cloud/Edge/Fog Computing

    Call for Manuscripts:

    Special Issue on Fault Tolerance in Cloud/Edge/Fog Computing in Future Internet, an international peer-reviewed open access monthly journal published by MDPI.

    Informational Flyer

    https://blogs.mtu.edu/icc/files/2021/04/ali-ebnenasir-call-for-papers-032521-sm.pdf

    Deadline

    April 20, 2021

    Author Notification

    June 10, 2021

    Website

    mdpi.com/journal/futureinternet/special_issues/FT_CEFC

    Collection Editors

    Keywords

    • Fault tolerance
    • Cloud computing
    • Edge computing
    • Resource-constrained devices
    • Distributed protocols
    • State replication

    Topics

    Including, but not limited to:

    • Faults and failures in cloud and edge computing.
    • State replication on edge devices under the scarcity of resources.
    • Fault tolerance mechanism on the edge and in the cloud.
    • Models for the predication of service latency and costs in distributed fault-tolerant protocols on the edge and in the cloud.
    • Fault-tolerant distributed protocols for resource management of edge devices.
    • Fault-tolerant edge/cloud computing.
    • Fault-tolerant computing on low-end devices.
    • Load balancing (on the edge and in the cloud) in the presence of failures.
    • Fault-tolerant data intensive applications on the edge and the cloud.
    • Metrics and benchmarks for the evaluation of fault tolerance mechanisms in cloud/edge computing.

    Background

    The Internet of Things (IoT) has brought a new era of computing that permeates in almost every aspect of our lives. Low-end IoT devices (e.g., smart sensors) are almost everywhere, monitoring and controlling the private and public infrastructure (e.g., home appliances, urban transportation, water management system) of our modern life. Low-end IoT devices communicate enormous amount of data to the cloud computing centers through intermediate devices, a.k.a. edge devices, that benefit from stronger computational resources (e.g., memory, processing power).

    To enhance the throughput and resiliency of such a three-tier architecture (i.e., low-end devices, edge devices and the cloud), it is desirable to perform some tasks (e.g., storing shared objects) on edge devices instead of delegating everything to the cloud. Moreover, any sort of failure in this three-tier architecture would undermine the quality of service and the reliability of services provided to the end users.

    Scope

    Theoretical and experimental methods that incorporate fault tolerance in cloud and edge computing, which have the potential to improve the overall robustness of services in three-tier architectures.

    Manuscript Submission Information

    Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website (https://www.mdpi.com/user/login/). Once you are registered, click here to go to the submission form (https://susy.mdpi.com/user/manuscripts/upload/?journal=futureinternet).

    Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

    Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page.

    Please visit the Instructions for Authors page before submitting a manuscript.

    The Article Processing Charge (APC) for publication in this open access journal is 1400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English.

    Authors may use MDPI’s English editing service prior to publication or during author revisions.


    Ali Ebnenasir is Co-author of Article in ACM Transactions on Computational Logic

    Ali EbnenasirAli Ebnenasir (SAS/CS), professor of computer science, is co-author of the article, “On the verification of livelock-freedom and self-stabilization on parameterized rings,” published in the July 2019 issue of the journal ACM Transactions on Computational Logic. The article is co-authored by Alex Klinkhamer of Google.

    Abstract: This article investigates the verification of livelock-freedom and self-stabilization on parameterized rings consisting of symmetric, constant space, deterministic, and self-disabling processes. The results of this article have a significant impact on several fields, including scalable distributed systems, resilient and self-* systems, and verification of parameterized systems. First, we identify necessary and sufficient local conditions for the existence of global livelocks in parameterized unidirectional rings with unbounded (but finite) number of processes under the interleaving semantics. Using a reduction from the periodic domino problem, we show that, in general, verifying livelock-freedom of parameterized unidirectional rings is undecidable (specifically, Π10-complete) even for constant space, deterministic, and self-disabling processes. This result implies that verifying self-stabilization for parameterized rings of self-disabling processes is also undecidable. We also show that verifying livelock-freedom and self-stabilization remain undecidable under (1) synchronous execution semantics, (2) the FIFO consistency model, and (3) any scheduling policy. We then present a new scope-based method for detecting and constructing livelocks in parameterized rings. The proposed semi-algorithm behind our scope-based verification is based on a novel paradigm for the detection of livelocks that totally circumvents state space exploration. Our experimental results on an implementation of the proposed semi-algorithm are very promising as we have found livelocks in parameterized rings in a few microseconds on a regular laptop. The results of this article have significant implications for scalable distributed systems with cyclic topologies.

    Citation: Klinkhamer, A., & Ebnenasir, A. (2019). On the verification of livelock-freedom and self-stabilization on parameterized rings. ACM Transactions on Computational Logic, 20(3), 16:1-16:36. http://dx.doi.org/10.1145/3326456

    MTU Digital Commons link: https://digitalcommons.mtu.edu/michigantech-p/146/

    ACM link: https://dl.acm.org/citation.cfm?doid=3338853.3326456


    Ali Ebnenasir is Co-Author of Publication in ACM Transactions on Computational Logic

    Ali Ebnenasir

    An article co-authored by Ali Ebnenasir (SAS/CS) and Alex Klinkhamer, “Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings,” was recently published in ACM Transactions on Computational Logic.

    Abstract: This article investigates the verification of livelock-freedom and self-stabilization on parameterized rings consisting of symmetric, constant space, deterministic, and self-disabling processes. The results of this article have a significant impact on several fields, including scalable distributed systems, resilient and self-* systems, and verification of parameterized systems. First, we identify necessary and sufficient local conditions for the existence of global livelocks in parameterized unidirectional rings with unbounded (but finite) number of processes under the interleaving semantics. Using a reduction from the periodic domino problem, we show that, in general, verifying livelock-freedom of parameterized unidirectional rings is undecidable (specifically, Π10-complete) even for constant space, deterministic, and self-disabling processes. This result implies that verifying self-stabilization for parameterized rings of self-disabling processes is also undecidable. We also show that verifying livelock-freedom and self-stabilization remain undecidable under (1) synchronous execution semantics, (2) the FIFO consistency model, and (3) any scheduling policy. We then present a new scope-based method for detecting and constructing livelocks in parameterized rings. The proposed semi-algorithm behind our scope-based verification is based on a novel paradigm for the detection of livelocks that totally circumvents state space exploration. Our experimental results on an implementation of the proposed semi-algorithm are very promising as we have found livelocks in parameterized rings in a few microseconds on a regular laptop. The results of this article have significant implications for scalable distributed systems with cyclic topologies.

    https://dl.acm.org/citation.cfm?id=3326456&dl=ACM&coll=DL

    doi: 10.1145/3326456