We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
In this paper we experimentally analyse various dynamic timeout adjustment strategies in server queues as potential counter-measures against degradation of service attacks. Previo...
In this paper we study communication networks that employ drop-tail queueing and additive-increase multiplicative-decrease (AIMD) congestion control algorithms. We show that the t...
Robert Shorten, Chris King, Fabian Wirth, Douglas ...
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
Johan van Leeuwaarden, Dee Denteneer, Jacques Resi...
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...