Towards a queueing-based framework for in-network function computation

We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and kth-order statistics. For such functions we characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-mincut. In acyclic wireline networks we show that the maximum refresh rate is achievable by a simple algorithm that is dynamic, distributed, and only dependent on local information. In the case of wireless networks we provide a MaxWeight-like algorithm with dynamic flow-splitting, which is shown to be throughput-optimal.

[1]  Alexander L. Stolyar,et al.  Optimal resource allocation for multicast flows in multihop wireless networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[2]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[3]  M.J. Neely,et al.  Delay Analysis for Maximal Scheduling With Flow Control in Wireless Networks With Bursty Traffic , 2009, IEEE/ACM Transactions on Networking.

[4]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[5]  Massimo Franceschetti,et al.  Network Coding for Computing Part I : Cut-Set Bounds , 2009, ArXiv.

[6]  Christina Fragouli,et al.  Function computation via subspace coding , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  R. Srikant,et al.  Energy-aware routing in sensor networks: A large system approach , 2007, Ad Hoc Networks.

[8]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

[9]  Piyush Gupta,et al.  Information-theoretic bounds for multiround function computation in collocated networks , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  Ramesh Govindan,et al.  Dynamic data compression in multi-hop wireless networks , 2009, SIGMETRICS '09.

[11]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[12]  Sanjay Shakkottai,et al.  Back-pressure routing and rate control for ICNs , 2010, MobiCom '10.

[13]  Bhaskar Krishnamachari,et al.  Routing without routes: the backpressure collection protocol , 2010, IPSN '10.

[14]  Panganamala Ramana Kumar,et al.  Zero-error function computation in sensor networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[15]  Gustavo de Veciana,et al.  Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation , 2004, IEEE Journal on Selected Areas in Communications.

[16]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[17]  Sanjay Shakkottai,et al.  Towards a queueing-based framework for in-network function computation , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[19]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2009, IEEE INFOCOM 2009.

[20]  Donald F. Towsley,et al.  A unified modeling framework for distributed resource allocation of general fork and join processing networks , 2010, SIGMETRICS '10.

[21]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[22]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[23]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[24]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[25]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[26]  Jean Walrand,et al.  Stable and utility-maximizing scheduling for stochastic processing networks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[27]  T. Moscibroda,et al.  The Worst-Case Capacity of Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

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

[29]  Laurent Massoulié,et al.  Randomized Decentralized Broadcasting Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[30]  Alexander L. Stolyar,et al.  Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[31]  Panganamala Ramana Kumar,et al.  Optimal computation of symmetric Boolean functions in tree networks , 2010, 2010 IEEE International Symposium on Information Theory.

[32]  Massimo Franceschetti,et al.  Network Coding for Computing: Cut-Set Bounds , 2009, IEEE Transactions on Information Theory.

[33]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.