DocumentCode
549072
Title
Real-time capacity of networked data fusion
Author
Iandola, Forrest ; Saremi, Fatemeh ; Abdelzaher, Tarek ; Jayachandr, Praveen ; Yener, Aylin
Author_Institution
Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL, USA
fYear
2011
fDate
5-8 July 2011
Firstpage
1
Lastpage
8
Abstract
In networked data fusion systems, results must be produced by end-to-end deadlines. As such, latency is an important attribute contributing to quality-of-information (Qol) in these systems. A key question is how much work can be completed on time given some amount of distributed resources and the logical workflow topology of the data fusion graph. To answer this question, this paper presents the concept of realtime capacity; a performance metric in line with the recently introduced operational information content capacity (OICC) of a networked data fusion system. It extends results developed by the authors recently in the real-time systems community to analyze the capacity of various data fusion workflow topologies. A simple closed-form expression for a topology-dependent realtime capacity bound is derived and is shown to be accurate via extensive simulations.
Keywords
graph theory; sensor fusion; data fusion graph; data fusion workflow topologies; distributed resources; end-to-end deadlines; logical workflow topology; networked data fusion; operational information content capacity; quality-of-information; topology-dependent realtime capacity bound; Latency; capacity; data fusion; pipelines;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Fusion (FUSION), 2011 Proceedings of the 14th International Conference on
Conference_Location
Chicago, IL
Print_ISBN
978-1-4577-0267-9
Type
conf
Filename
5977507
Link To Document