A note on models for non-probabilistic analysis of packet switching networks

Authors:
Adi Rosén
Affiliations:
Department of Computer Science, Technion, Haifa 32000, Israel
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 8

Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The effects of temporary sessions on network performance

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Adaptive packet routing for bursty adversarial traffic

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Stability of Adversarial Queues via Fluid Models

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

On delivery times in packet networks under adversarial traffic

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks

IEEE Transactions on Parallel and Distributed Systems
Stability of FIFO networks under adversarial models: State of the art

Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability of the multiple-access channel under maximum broadcast loads

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The robustness of stability under link and node failures

Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel

ACM Transactions on Algorithms (TALG)
Dynamic internet congestion with bursts

HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Simulation of adversarial scenarios in OMNeT++: putting adversarial queueing theory from its head to feet

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types of models, and between them and the set of sequences of packets that allow stability. We also consider the adaptive setting in which packets are injected with only their source and destination but without a prescribed path to follow.