Tandem queues with correlated service times and finite capacity
Mathematics of Operations Research
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times
Mathematics of Operations Research
Creating a Mathematical Theory of Computer Networks
Operations Research
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
Operations Research
Performance Analysis of Queue Length Distribution of Tandem Routers for QoS Measurement
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
Call blocking probabilities in a traffic-groomed tandem optical network
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Packet Models Revisited: Tandem and Priority Systems
Queueing Systems: Theory and Applications
Effective capacity-based quality of service measures for wireless networks
Mobile Networks and Applications - Special issue: Recent advances in wireless networking
Optimization of a tandem router network using a fluid model
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Delays in a series of queues: Independent versus identical service times
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
IEEE Transactions on Information Theory
Performance analysis of a mobile communication network: the tandem case
Computer Communications
Editorial: Special issue on service delivery management in broadband networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
In almost all applications of queueing network models it is assumed that for each customer the service times at different network nodes are independent. But service times in, for instance, computer and communication networks are typically essentially determined by properties like message or packet lengths that do not change substantially on the route through the network. Therefore, the service times of any customer in a queueing network are likely to be correlated, which can significantly influence quality of service (QoS) properties and performance measures such that results obtained with the independence assumption may be misleading. We consider delays in a series of queues with correlated service times at each network node where for each customer the service time at the first node is a random variable and the successive service times are correlated with the one at the first node. A recursive scheme for delays is provided. This scheme is used in order to efficiently conduct a simulation study where two types of correlation are studied, namely identical service times, and service times with an additional Gaussian noise. The simulation study focuses on comparisons of end-to-end delays for independent service times at different nodes and correlated service times, respectively. It turns out that for both correlation types, in light traffic the delays in case of correlated service times are larger than for independent service times by a factor that first increases with increasing traffic intensity up to a maximum value approached in medium traffic after which it decreases quickly and drops down to become significantly smaller than one in heavy traffic. This effect intensifies with increasing number of network nodes and depends, as well as the crossover point from which on correlated service times yield smaller delays, on the distribution of the service times at the first node.