Elsevier

Automatica

Volume 49, Issue 5, May 2013, Pages 1310-1317
Automatica

Brief paper
On a rate control protocol for networked estimation

https://doi.org/10.1016/j.automatica.2013.01.050Get rights and content

Abstract

We study the problem of congestion control in a communication network that is supporting remote estimation of multiple processes. A stochastic rate control protocol is developed using the network utility maximization (NUM) framework. This decentralized protocol avoids congestion by regulating the transmission probabilities of the sources. The presence of estimation costs poses new challenges; however, for low congestion levels, the form of rate controller resembles that of the standard TCP rate controller. Stability of the protocol is analyzed in the presence of fixed network delays.

Introduction

The architecture and protocols in a communication network should ideally depend on the objectives of the end users. Traditionally, such networks were used with the sole goal of reliable data transfer. More recently, such networks have been proposed to be used in control and estimation applications in the so-called Networked Control Systems (see, e.g., the special issue Antsaklis & Baillieul, 2007 and the references therein). In such applications, the performance metric is a complicated function of delay, throughput, and reliability; hence, traditional network protocols may not be suitable. For both the cases when the communication network is designed specifically for estimation or control, and when the communication network is shared with data unrelated to such applications, it is of interest to design network protocols that optimize the performance relevant to these applications.

However, most of the research in Networked Control Systems so far has focused on analyzing and designing a single networked control system in isolation. While this has led to important foundational results, it has ignored the new problems that may arise when multiple such systems operate over a common communication network. As an example, networked communication may give rise to congestion or MAC delays. Such effects will impact the performance of every networked control system and in fact, will couple their performance even though the systems may not be dynamically coupled. It is, thus, of interest to study the impact of communication network protocols on the performance of multiple control systems sharing a common network, and further, design network protocols more suitable for estimation and control (Garone et al., 2007, Schenato et al., 2007).

In this paper, we focus on a rate control protocol suitable for an estimation oriented cost function. We consider multiple systems, each of which consists of an estimator that remotely estimates the state of an associated process. A sensor collocated with each process transmits information over a shared communication network to the estimator. The network has capacity constraints for every link. Such a capacity constrained network may result in congestion when the network load increases. Congestion results in packet losses and delays, which adversely affect the estimation performance. We show that traditional rate control protocols such as TCP may not be suitable for optimizing estimation performance, and propose a new distributed rate control protocol that can co-exist with existing rate control protocols.

The problem of congestion control has been well studied for communication networks (see, e.g., Jacobson, 1988). TCP (RFC, 1981) is the most widely used congestion control protocol on the Internet. While originally an engineering heuristic, TCP has now been reverse engineered to show that it is a distributed solution that optimizes a particular utility function (Kelly, 2001). The chief tool in this regard is the Network Utility Maximization (NUM) framework (Kelly et al., 1998) which transforms the end objective to an optimization problem with constraints. The communication protocols are the distributed solutions to these optimization problems (Chiang et al., 2007).

The primary aim of traditional TCP is reliable transfer of data, even at the expense of delays. For estimation and control, it may be more useful to have a lower reliability, but a higher throughput. Moreover, not all processes need to transmit data at the same rate to achieve the same estimation error covariance. Thus, issues such as fairness relevant to traditional TCP may not be applicable. In fact, using TCP for estimation purposes may result in instability of the estimation error covariance. Because of these reasons, designing an estimation oriented rate control protocol is not simply a matter of substituting the estimation error covariance as a cost function instead of the throughput. Our proposed protocol, while sharing the formal structure of TCP protocols, considers these issues directly. The proposed protocol is implemented at the transport layer of the standard OSI layer stack, and thus, preserves the layered structure of the network.

To ensure that the proposed protocol can coexist with the standard TCP, we use a cost minimization framework that is analogous to the standard NUM framework. The total cost that the rate control protocol aims to minimize includes both an estimation performance cost and a congestion cost. The work closest to ours is that of Al-Hammouri et al. (2006) which presents a bandwidth allocation scheme by using a dual form of NUM problem. However, our solution is in the primal form and is similar to the structure of the standard TCP protocol. Moreover, we present a stochastic transmission scheme as opposed to the deterministic transmission scheme in Al-Hammouri et al. (2006).

We also come up with conditions on network delay and system parameters for which the original protocol remains stable. The delays can be time varying in realistic networks. However, we analyze the stability of the system with fixed delays for tractability. Although it is a special case, fixed delay analysis is important and has a rich history for standard TCP (Chiang et al., 2007, Johari and Tan, 2001, Low and Lapsley, 1999, Vinnicombe, 2002).

The main contributions of the paper are as follows

  • We propose a probabilistic rate control strategy and evaluate an estimation error measure.

  • Using the NUM framework, we obtain a scalable rate control protocol that allocates rates optimally such that an estimation error metric is minimized.

  • The protocol is developed in primal form and we show that under low network congestion, it resembles the structure of the standard TCP protocol.

The rest of the paper is organized as follows. In the next section, we describe the problem setting with random delays and formulate an optimization problem. In Section 3, we propose a distributed solution to the problem using the NUM framework and present our analysis results. In Section 4, we obtain conditions under which the network is stable for fixed delays and present simulation results. We conclude in Section 5.

Section snippets

Problem formulation

Network and process setting: Consider the problem set up shown in Fig. 1. Let all the sources form the source set S. With every source sS, associate a unique destination d and denote the destination set by D. Let every source be connected to its corresponding destination through a shared capacity constrained network N. We model the network as a graph, wherein the end-nodes are the sources and the destinations, the intermediate nodes are routers that forward packets and the edges correspond to

Analysis and results

Cost function: The following upper and lower bounds for the cost follow from algebraic manipulations on (6).

Lemma 3

The steady state value fs(ps,ds) satisfies fsl(ps,ds)<fs(ps,ds)<fsu(ps,ds), wherefsu(ps,ds)ps(1ds)msu+(1ps(1ds))qs1as,max(1ps(1ds))fsl(ps,ds)ps(1ds)msl+(1ps(1ds))qs1as,min(1ps(1ds))msu={(ms+qsas,max1)E[as,maxτsd]qsas,max1ifas,max1,ms+qsE[τsd]otherwise,msl={(ms+qsas,min1)E[as,minτsd]qsas,min1ifas,min1,ms+qsE[τsd]otherwise,where λ(A) denotes the eigenvalues of A, as,max

Stability with delays in the network

We now consider the effect of network delays on the stability of the proposed probability controllers. For tractability, we assume that the delays are constant. Let the delay in the forward direction between source s and link l be denoted by τslf. Further, let the delay in backward direction between link l and source s via the corresponding destination d be denoted by τslb. Both the forward and backward delays are assumed to be positive integers. We assume that the total round trip time w.r.t.

Conclusion

We studied the problem of rate control for networked estimation in the presence of congestion. A stochastic rate control protocol was proposed that optimizes the estimation performance of the network by varying the source transmission probabilities. The protocol was developed using a minimization framework analogous to NUM framework and is scalable for large networks. An approximated controller analogous to the standard TCP controller was also developed. The stability of the network was

Vaibhav Katewa is a Ph.D. candidate in the Department of Electrical Engineering at the University of Notre Dame. He received his B.Tech. degree from the Indian Institute of Technology, Kanpur and M.S. degree from the University of Notre Dame, both in Electrical Engineering. His research interests include decentralized control and protocol design for networked control systems.

References (17)

  • Al-Hammouri, A., et al. (2006). Decentralized and dynamic bandwidth allocation in networked control systems....
  • Special issue on networked control systems

    Proceedings of the IEEE

    (2007)
  • R. Caceres

    Multicast-based inference of network-internal loss characteristics

    IEEE Transactions on Information Theory

    (1999)
  • M. Chiang

    Layering as optimization decomposition: a mathematical theory of network architectures

    Proceedings of IEEE

    (2007)
  • C.A. Desoer et al.

    On the generalized Nyquist stability criterion

    IEEE Transactions on Automatic Control

    (1980)
  • S. Floyd et al.

    Random early detection gateways for congestion avoidance

    IEEE/ACM Transactions on Networking

    (1993)
  • Garone, E., et al. (2007). Communication protocols for optimal control over lossy networks. In Allerton conference on...
  • V. Gupta

    Data transmission over networks for estimation and control

    IEEE Transactions on Automatic Control

    (2009)
There are more references available in the full text version of this article.

Vaibhav Katewa is a Ph.D. candidate in the Department of Electrical Engineering at the University of Notre Dame. He received his B.Tech. degree from the Indian Institute of Technology, Kanpur and M.S. degree from the University of Notre Dame, both in Electrical Engineering. His research interests include decentralized control and protocol design for networked control systems.

Vijay Gupta is an Assistant Professor in the Department of Electrical Engineering at the University of Notre Dame. He received his B. Tech degree from the Indian Institute of Technology, Delhi and the M.S. and Ph.D. degrees from the California Institute of Technology, all in Electrical Engineering. He has served as a research associate in the Institute for Systems Research at the University of Maryland, College Park, and as a consultant to the Systems Group at the United Technology Research Center, Hartford, CT. His research interests include various topics at the interaction of communication, computation and control. He received the NSF Career award in 2009.

Research was funded in part by NSF awards 0834771 and 0846631. The American Control Conference (ACC2011), June 29–July 1, 2011, San Francisco, California, USA. This paper was recommended for publication in revised form by Associate Editor Huijun Gao under the direction of Editor Ian R. Petersen.

1

Tel.: +1 5746311136; fax: +1 5746314393.

View full text