Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A note on models for non-probabilistic analysis of packet switching networks
Information Processing Letters
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Worst case mobility in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Information gathering in adversarial systems: lines and cycles
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Journal of the ACM (JACM)
Optimal overload response in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Routing and scheduling in multihop wireless networks with time-varying channels
ACM Transactions on Algorithms (TALG)
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Game Theoretic Approach to the Analysis of Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Adversarial queuing theory with setups
Theoretical Computer Science
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The robustness of stability under link and node failures
Theoretical Computer Science
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Dynamic diffusion load balancing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Adversarial queueing model for continuous network dynamics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Connectivity games over dynamic networks
Theoretical Computer Science
Hi-index | 0.00 |
In this paper we consider the problem of delivering dynamically changing input streams in dynamically changing networks where both the topology and the input streams can change in an unpredictable way. In particular, we present two simple distributed balancing algorithms (one for packet injections and one for flow injections) and show that for the case of a single receiver these algorithms will always ensure that the number of packets or flow in the system isbounded at any time step, even for an injection process that completely saturates the capacities of the available edges and even if the network topology changes in a completelyunpredictable way. We also show that the maximum number of packets or flow that can be in the system at any time is essentially best possible by providing a lower bound that holds for any online algorithm, whether distributed or not. Interestingly, our balancing algorithms do not only behave well in a completely adversarial setting. We show that also in the other extreme of a static network and a static injection pattern the algorithms will converge to a point in whichthey achieve an average routing time that is close to the best possible average routing time that can be achieved by any strategy. This demonstrates that there are simple algorithms that can be efficient for very different scenarios.