On a theory of interacting queues

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a possible way to extend queuing theory to account for interactions between adjacent queues in a packet-switched network. The interaction between queues arises because of the influence of the routing protocol on each switching decision and the stochastic nature of packet lengths and inter-arrival times. Both the methodology and the analysis tools are adaptations of methods of statistical mechanics and are presented in outline here. The justification for their use lies in experimental evidence given in [1,2,3] that aggregate, core-network IP traffic exhibits quasi-Markovian properties. In this paper, we focus on the interaction between pairs of queues, either in a cascaded arrangement, or connected to the same switching fabric, in the presence of an idealised routing protocol.

Cite

CITATION STYLE

APA

Stepanenko, A., Constantinou, C. C., Arvanitis, T. N., & Baughan, K. (2002). On a theory of interacting queues. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2345, pp. 769–777). Springer Verlag. https://doi.org/10.1007/3-540-47906-6_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free