Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic

Giacomazzi, P.

doi:10.1016/j.comcom.2008.11.022

Cited by 12 publications

(11 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solving for the feedback gains K i , i = 1, ..., n in Theorem 1 involves nonlinear terms, e. g. P T 2 BK i and P T 3 BK i in (16). These nonlinear terms render the inequality in (16) into a bilinear matrix inequality (BMI) problem, whose solutions are difficult to find as it is non-convex and NPhard.…”

Section: Controller Designmentioning

confidence: 98%

See 1 more Smart Citation

Switching Control for a Networked Vision-based Control System

Chen

Kühnlenz

et al. 2011

At - Automatisierungstechnik

View full text Add to dashboard Cite

Advances in communication and computation technology facilitate closed loop control via communication networks. Such networked control systems may include distributed sensors and actuators as well as distributed computational resources. In the field of vision-based control, the possibility of distributed computation is of particular interest due to the large amounts of visual data to be processed. Time-delay caused by data transfer through the network and by processing algorithms impair stability and performance of the controlled closed-loop system. In this article, a novel switching control scheme for networked vision-based control systems is proposed accounting for varying time-delay in order to improve control performance. The closed-loop system is modeled as a continuous system with varying time-delay considering processing and transfer time-delays as well as sampling intervals. Mean exponential stability is proven based on occurrence probabilities of delays. The article concludes with comparative experiments showing a significant improvement of control performance of the proposed approach with respect to a non-switching reference controller. Zusammenfassung Fortschritte in Kommunikations-und Rechentechnik ermöglichen regelungstechnische Anwendungen über Kommunikationsnetze. Derartige vernetzte Regelungssysteme können sowohl verteilte Sensoren und Aktoren als auch verteilte Rechenressourcen beinhalten. Insbesondere im Bereich der bildbasierten Regelungen ist die Möglichkeit verteilter Rechenressourcen aufgrund der hohen anfallenden Datenmengen interessant. Durch den Datenaustausch über das Kommunikationsnetz und Verarbeitungsalgorithmen entstehende Zeitverzögerungen beeinträchtigen jedoch Stabilität und Regelgüte. Dieser Artikel schägt ein neuartiges schaltendes Regelungskonzept für vernetzte bildbasierte Regelungssysteme vor, das variable Zeitverzögerun-gen berücksichtigt, um die Regelgüte zu verbessern. Die Modellierung des Gesamtsystems unter Berücksichtigung der Rechen-und Übertragungszeitverzögerungen sowie der Abtastintervalle erfolgt über ein kontinuierliches System mit stochastischen Zeitverzögerungen. Die exponentielle Stabilität der Mittelwerte wird basierend auf der Auftrittswahrscheinlichkeit der Zeitverzögerungen sichergestellt. Abschliessende Experimente mit einem bildbasierten Regelungssystem in Form eines kamerageführten Linearaktors validieren den vorgeschlagenen Ansatz. Die experimentellen Ergebnisse zeigen eine signifikante Verbesserung der Performanz durch den vorgeschlagenen Ansatz gegenüber einem Referenzsystem mit nichtschaltendem Regler.

show abstract

Section: Controller Designmentioning

confidence: 98%

“…For communication time-delay i. i. d. processes or Markov processes are popular models in the communication community [16]. The choice largely depends on the communication protocol and concurrent traffic characteristics.…”

mentioning

confidence: 99%

Switching Control for a Networked Vision-based Control System

Chen

Kühnlenz

et al. 2011

At - Automatisierungstechnik

View full text Add to dashboard Cite

show abstract

“…Refinements of a leftover characterization with service curves that account for specific scheduling algorithms have been considered before [8], [16], [21], however, with the exception of FIFO [8], the accuracy of the characterizations has not been established. An application of the blind multiplexing analysis of [6] to FIFO networks in [12] has concluded that the delay bounds for Markov-modulated arrivals can be very pessimistic.…”

Section: Introductionmentioning

confidence: 99%

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Liebeherr

Ghiassi-Farrokhfal

Burchard

2011

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-We seek to provide an analytical answer whether the impact of link scheduling algorithms on end-to-end delays diminishes on long network paths. The answer is provided through a detailed multi-hop delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a buffered link for various scheduling algorithms. This characterization is sharp enough to provide necessary and sufficient conditions for satisfying worst-case delay bounds at a single link; (2) We obtain end-to-end delay bounds by solving an optimization problem, in which the service received on a multi-hop path is subsumed into a single function. Since our analysis captures the properties of a broad group of schedulers in a single parameter, it can provide insight how the choice of scheduling algorithms impacts end-to-end delay bounds. An important finding of this paper is that schedulers may exhibit noticeable performance differences which persist in a network setting with long paths.

show abstract

“…Refinements of a leftover characterization with service curves that account for specific scheduling algorithms have been considered before [8], [16], [20], however, with the exception of FIFO [8], the accuracy of the characterizations has not been accounted for. An application of the blind multiplexing analysis of [6] to FIFO networks in [12] has concluded that the delay bounds for Markov-modulated arrivals can be very pessimistic.…”

Section: Introductionmentioning

confidence: 99%

Does Link Scheduling Matter on Long Paths?

Liebeherr

Ghiassi-Farrokhfal

Burchard

2010

2010 IEEE 30th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-We seek to provide an analytical answer whether the impact of the selection of link scheduling algorithms diminishes on long network paths. The answer is provided through a detailed multi-node delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a node for various scheduling algorithms. The function has an accuracy that recovers necessary and sufficient conditions for satisfying worst-case delay bounds at a single node; (2) We obtain end-to-end delay bounds by providing an explicit solution to an optimization problem, in which the service received at multiple nodes is subsumed into a single function. By presenting a unified analysis that captures the properties of a broad group of schedulers in a single parameter, we can provide insight how the choice of scheduling algorithms impacts end-to-end delay bounds. An important finding of this paper is that some schedulers show noticeable performance differences which persist in a network setting with long paths.

show abstract

Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic

Cited by 12 publications

References 24 publications

Switching Control for a Networked Vision-based Control System

Switching Control for a Networked Vision-based Control System

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Does Link Scheduling Matter on Long Paths?

Contact Info

Product

Resources

About