Estimation of linear stochastic systems over a queueing network

Michael Epstein*, Abhishek Tiwari, Ling Shi, Richard M. Murray

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

5 Citations (Scopus)

Abstract

In this paper, we consider the standard state estimation problem over a congested packet-based network. The network is modeled as a queue with a single server processing the packets. This provides a framework to consider the effect of packet drops, packet delays and bursty losses on state estimation. We use a modified Kalman Filter with buffer to cope with delayed packets. We analyze the stability of the estimates with varying buffer length and queue size. We use high order Markov chains for our analysis. Simulation examples are presented to illustrate the theory.

Original languageEnglish
Title of host publicationProceedings - 2005 Systems Communications
Subtitle of host publicationICW 2005, Wireless - ICHSN 2005, High Speed Networks - ICMCS 2005, Multimedia Communications Systems - SENET 2005, Sensor Networks
Pages389-394
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventSystems Communications 2005 - Montreal, Canada
Duration: 14 Aug 200517 Aug 2005

Publication series

NameProceedings - 2005 Systems Communications: ICW 2005, Wireless - ICHSN 2005, High Speed Networks - ICMCS 2005, Multimedia Communications Systems - SENET 2005, Sensor Networks
Volume2005

Conference

ConferenceSystems Communications 2005
Country/TerritoryCanada
CityMontreal
Period14/08/0517/08/05

Fingerprint

Dive into the research topics of 'Estimation of linear stochastic systems over a queueing network'. Together they form a unique fingerprint.

Cite this