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

DOI10.1007/s11134-012-9296-8zbMath1273.68068arXiv1105.5651OpenAlexW2568789534MaRDI QIDQ373447

Piyush Gupta, Siddhartha Banerjee, Sanjay Shakkottai

Publication date: 22 October 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.5651

zbMATH Keywords

wireless sensor networksdynamic routing and scheduling algorithmsin-network function computation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items (1)

Lower bounds for in-network computation of arbitrary functions

Uses Software

• TAG

Cites Work

• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Resource Allocation and Cross-Layer Control in Wireless Networks
• The capacity of wireless networks
• Coding for computing
• SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
• Network Coding for Computing: Cut-Set Bounds
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Optimal resource allocation for multicast sessions in multi-hop wireless networks

This page was built for publication: Towards a queueing-based framework for in-network function computation