Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Authors:
Shigeo Shioda
Affiliations:
Urban Environment Systems, Faculty of Engineering, Chiba University, Chiba, Japan 263-8522
Venue:
Queueing Systems: Theory and Applications
Year:
2008

Citing 6
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
On the performance of multiplexing independent regulated inputs

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Monotonicity Results For Single-Server Finite-Capacity Queues With Respect To Directionally Convex Order

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a single-server finite-capacity queue with batch fluid inputs. We assume that the input traffic is observed in an interval-wise basis; that is, along the time axis divided into fixed-length intervals, with the amount of work brought into the queue during each interval sequentially observed. Since the sequence of the amounts of work during respective intervals, which is referred to as the interval-wise input process in this paper, does not reveal complete information about an input process, we cannot be precisely aware of the performance of the queue. Thus, in this paper, we focus on knowing the performance limit of the queue based on the interval-wise input process. In particular, we establish an upper limit of the long-run loss ratio of the workload in the queue. Our results would reveal useful tools to evaluate the performance of queuing systems when information about input processes in a fine timescale is not available.