Stability analysis of multiple state-based schedulers with CSMA

Stability analysis of multiple state-based schedulers with CSMA

In this paper, we identify sufficient conditions for Lyapunov Mean Square Stability (LMSS) of a contention-based network of first-order systems, with state-based schedulers. The stability analysis helps us to choose policies for adapting the scheduler threshold to the delay from the network and sche...

Full description

Bibliographic Details
Main Authors: Ramesh, Chithrupa, Sandberg, Henrik, Johansson, Karl Henrik
Format: Others
Language:English
Published: KTH, Reglerteknik 2012
Subjects:
Closed loop systems
Customer relationship management
Delay
Estimation error
Markov processes
Stability analysis
Steady-state
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-111461
http://nbn-resolving.de/urn:isbn:978-1-4673-2064-1
Description
Summary:In this paper, we identify sufficient conditions for Lyapunov Mean Square Stability (LMSS) of a contention-based network of first-order systems, with state-based schedulers. The stability analysis helps us to choose policies for adapting the scheduler threshold to the delay from the network and scheduler. We show that three scheduling laws can result in LMSS: constant-probability laws and additively increasing or decreasing probability laws. Our results counter the notions that increasing probability scheduling laws alone can guarantee stability of the closed-loop system, or that decreasing probability scheduling laws are required to mitigate congestion in the network. === <p>QC 20130116</p>

Similar Items