Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal routing for end-to-end guarantees: the price of multiplexing
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Adversarial queuing theory with setups
Theoretical Computer Science
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Tight performance bounds in the worst-case analysis of feed-forward networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
We show that for any r 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that, • The network load is r with respect to the Permanent Sessions Model with Bounded Arrivals. • The network can be made unstable.