Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

SLA Conceptual Model for IoT Applications

Awatif Alqahtani, Ellis Solaiman, Rajiv Ranjan

TL;DR

The paper analyzes consensus in a network of heterogeneous, second-order agents operating under nonlinear control protocols. Using a Lyapunov-based approach and Barbalat's lemma on a connected graph, it proves asymptotic consensus for both leaderless and leader-following scenarios, deriving explicit expressions for the consensus value that depend on initial conditions, masses, and velocity gains. A corollary provides the exact limit for the no-leader case, while the leader case shows followers track the leader when connectivity is satisfied; a sufficient condition on the Lyapunov parameters ensures convergence. Numerical simulations with six agents corroborate the theoretical results, demonstrating rapid convergence and leader-tracking behavior, highlighting the robustness of the approach to heterogeneity and nonlinearity in the interaction protocols.

Abstract

Since SLAs specify the contractual terms that are formally used between consumers and providers, there is a need to aggregate QoS requirements from the perspectives of Clouds, networks, and devices to deliver the promised IoT functionalities. Therefore, the main objective of this chapter is to provide a conceptual model of SLA for the IoT as well as rich vocabularies to describe the QoS and domain-specific configuration parameters of the IoT on an end-to-end basis. We first propose a conceptual model that identifies the main concepts that play a role in specifying end-to-end SLAs. Then, we identify some of the most common QoS metrics and configuration parameters related to each concept. We evaluated the proposed conceptual model using a goal-oriented approach, and the participants in the study reported a high level of satisfaction regarding the proposed conceptual model and its ability to capture main concepts in a general way.

SLA Conceptual Model for IoT Applications

TL;DR

The paper analyzes consensus in a network of heterogeneous, second-order agents operating under nonlinear control protocols. Using a Lyapunov-based approach and Barbalat's lemma on a connected graph, it proves asymptotic consensus for both leaderless and leader-following scenarios, deriving explicit expressions for the consensus value that depend on initial conditions, masses, and velocity gains. A corollary provides the exact limit for the no-leader case, while the leader case shows followers track the leader when connectivity is satisfied; a sufficient condition on the Lyapunov parameters ensures convergence. Numerical simulations with six agents corroborate the theoretical results, demonstrating rapid convergence and leader-tracking behavior, highlighting the robustness of the approach to heterogeneity and nonlinearity in the interaction protocols.

Abstract

Since SLAs specify the contractual terms that are formally used between consumers and providers, there is a need to aggregate QoS requirements from the perspectives of Clouds, networks, and devices to deliver the promised IoT functionalities. Therefore, the main objective of this chapter is to provide a conceptual model of SLA for the IoT as well as rich vocabularies to describe the QoS and domain-specific configuration parameters of the IoT on an end-to-end basis. We first propose a conceptual model that identifies the main concepts that play a role in specifying end-to-end SLAs. Then, we identify some of the most common QoS metrics and configuration parameters related to each concept. We evaluated the proposed conceptual model using a goal-oriented approach, and the participants in the study reported a high level of satisfaction regarding the proposed conceptual model and its ability to capture main concepts in a general way.
Paper Structure (8 sections, 4 theorems, 9 equations, 3 figures, 1 table)

This paper contains 8 sections, 4 theorems, 9 equations, 3 figures, 1 table.

Table of Contents

  1. Introduction
  2. Problem formulations
  3. Consensus of non-identical agents with non-linear protocols
  4. Consensus of non-identical agents without a leader
  5. Consensus of non-identical agents with a leader
  6. Numerical simulations
  7. Conclusion
  8. Acknowledgments

Key Result

Theorem 1

Consider system (1) with control protocol (2) and assume that the undirected graph $\mathcal{G}$ is connected. Then, $\lim_{t \rightarrow +\infty} (p_{jl}(t)\,{-}\,p_{il}(t))\,{=}\,0$, $\lim_{t \rightarrow +\infty} q_{il}(t)\,{=}\,0$$(i, j\,{\in}\,\bar{N}, l\in\bar{n})$.

Figures (3)

  • Figure 1: Chained interconnection topology with and without a leader
  • Figure 2: Consensus of trajectories of agents without a leader a $\cos({\rm t})\omega_1=0.5$ b $\omega_1=0$ Initial conditions and other parameters are chosen as $(p_i(0),q_i(0))=(0.2i,0.3i)$, $c_{ij}=c_{ji}=0.2(i+j)$ and $m_i=0.1i (i,j=1,2,\ldots,6)$.
  • Figure 3: Consensus of trajectories of agents with a leader a $d_L(t)=0.6+0.15\cos(t),\omega_2=0.5$ b $b_L=0.6, \omega_2=0$ Initial conditions and other parameters are chosen as $(p_i(0),q_i(0))=(-0.3i,0.4i)$, $(p_L(0),q_L(0))=(1,0.3)$, $c_{ij}=c_{ji}=0.3(i+j)$, $b_i(t)=0.2i+0.15\cos(t),\omega_1=0.5$, $c_{1L}=1$ and $m_i=m_L=1$$(i,j=1,2,\ldots,5)$.

Theorems & Definitions (7)

  • Theorem 1
  • Corollary 1
  • Remark 1
  • Remark 2
  • Theorem 2
  • Corollary 2
  • Remark 3