Optimal overload response in sensor networks

A single commodity network that models the information flow in an arbitrary topology sensor field that collects and forwards information to a backbone through certain designated gateway nodes is considered. Resilient operation in overload stress situations caused by unpredictable traffic or topology variations is investigated. That amounts to studying the network in instability mode, where the traffic load distribution is outside the throughput region. A fluid model is adopted where superflows model traffic forwarding and backlog formations at the network level. Quantitative performance metrics of the overload including throughput, lexicographic minimization, most balanced allocation, and amount of lost traffic due to buffer overflow are considered to capture the information loss process due to overflow in the network. Optimal superflows with respect to these metrics are characterized and a distributed asynchronous algorithm that computes such superflows is given. The characterization of the optimal superflow amounts to obtaining a structural decomposition of the network in a sequence of disjoint subregions with decreasing overload such that traffic flows only from regions of higher overload to regions of lower overload. The optimal superflow represents the smoothest trajectory to overflow, followed by the network in case of instability.

[1]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[2]  L. Tassiulas,et al.  Allocation of interdependent resources for maximal throughput , 2000 .

[3]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[4]  Rafail Ostrovsky,et al.  Adaptive packet routing for bursty adversarial traffic , 1998, STOC '98.

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Bruce E. Hajek,et al.  Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods , 1987, IEEE Trans. Commun..

[7]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[8]  P. Georgatsos,et al.  Lexicographically optimal balanced networks , 2002, IEEE/ACM Trans. Netw..

[9]  J. G. Dai,et al.  Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..

[10]  Chung-Piaw Teo,et al.  Berth Allocation Planning Optimization in Container Terminals , 2008 .

[11]  Leandros Tassiulas,et al.  Most balanced overload response in sensor networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[12]  Leandros Tassiulas,et al.  Adaptive back-pressure congestion control based on local information , 1995, IEEE Trans. Autom. Control..

[13]  Bruce Hajek,et al.  Optimal dynamic routing in communication networks with continuous traffic , 1982, CDC 1982.

[14]  Leandros Tassiulas Dynamic link activation scheduling in multihop radio networks with fixed or changing connectivity , 1992 .

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[16]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[17]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Trans. Inf. Theory.

[18]  Bruce E. Hajek,et al.  Performance of global load balancing of local adjustment , 1990, IEEE Trans. Inf. Theory.

[19]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[20]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[22]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

[23]  Adrian Segall,et al.  The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..