Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Adversarial queuing theory with setups
Theoretical Computer Science
| Hi-index | 5.23 |
We consider the problem faced by a server offering multiple services with adversarial service request sequences. The server may offer a single service at a time and suffers a fixed latency whenever it switches the type of offered service. This problem captures realistic features of traffic and packet routing on network components such as multiplexers. We state the problem as a packet routing problem on bounded size buffer networks and then examine the crucial issue of stability--under what conditions will the number of unserviced requests remain bounded as the system runs for an arbitrarily long period of time? We obtain a tight characterization in terms of a natural packet density criterion for star networks with bounded buffer size.