Queueing Analysis of a Jockeying Model

Abstract

In this paper, we solve a type of shortest queue problem, which is related to multibeam satellite systems. We assume that the packet interarrival times are independently distributed according to an arbitrary distribution function, that the service times are Markovian with possibly different service rates, that each server has its own buffer for packet waiting, and that jockeying among buffers is permitted. Packets always join the shortest buffer(s). Jockeying takes place as soon as the difference between the longest and shortest buffers exceeds a preset number (not necessarily 1). In this case, the last packet in a longest buffer jockeys instantaneously to the shortest buffer(s). We prove that the equilibrium distribution of packets in the system is modified vector geometric. Expressions of main performance measures, including the average number of packets in the system, the average packet waiting time in the system, and the average number of jockeying, are given. Based on these solutions, numerical results are computed. By comparing the results for jockeying and nonjockeying models, we show that a significant improvement of the system performance is achieved for the jockeying model.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 51 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.