Data networks
Dynamic link activation scheduling in multihop radio networks with fixed or changing connectivity
Dynamic link activation scheduling in multihop radio networks with fixed or changing connectivity
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Lexicographically optimal balanced networks
IEEE/ACM Transactions on Networking (TON)
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Exploiting wireless channel State information for throughput maximization
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Fluid models of congestion collapse in overloaded switched networks
Queueing Systems: Theory and Applications
Dynamic server allocation for unstable queueing networks with flexible servers
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
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.