Conclusions of the ARTIST2 roadmap on control of computing systems
ACM SIGBED Review - Special issue on major international initiatives on real-time and embedded systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and optimization of transmission schemes in energy-constrained wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Distributed network utility maximization in wireless networks with a bounded number of paths
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Joint congestion control, contention control and resource allocation in wireless networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Distributed resource allocation algorithms for peer-to-peer networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A framework for distributed bandwidth allocation in peer-to-peer networks
Performance Evaluation
Utility-based asynchronous flow control algorithm for wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Separation principles in wireless networking
IEEE Transactions on Information Theory
Fast algorithms for resource allocation in wireless cellular networks
IEEE/ACM Transactions on Networking (TON)
Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.13 |
Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful framework for studying such cross-layer issues. In this paper, we review and explain three distinct techniques that can be used to engineer utility-maximizing protocols: primal, dual, and cross decomposition. The techniques suggest layered, but loosely coupled, network architectures and protocols where different resource allocation updates should be run at different time-scales. The decomposition methods are applied to the design of fully distributed protocols for two wireless network technologies: networks with orthogonal channels and network-wide resource constraints, as well as wireless networks where the physical layer uses spatial-reuse time-division multiple access. Numerical examples are included to demonstrate the power of the approach