Service gap minimization in G/D/1/B+1 queues

M.S Andersland; C.W Lee

doi:10.1109/9.839951

Back

Service gap minimization in G/D/1/B+1 queues

Journal article

Peer reviewed

Service gap minimization in G/D/1/B+1 queues

M.S Andersland and C.W Lee

IEEE transactions on automatic control, Vol.45(2), pp.290-294

02/2000

DOI: 10.1109/9.839951

View Online

Abstract

When a G/D/1/B1 queue's B position buffer overflows, arriving or buffered jobs must be dropped. Assuming a nonbatch arrival process with bounded increments, we use sample path arguments to identify the overflow dropping policy that minimizes the average number of consecutively dropped jobs (the average service gap). This policy, which creates gaps whenever possible, as close to the front of the buffer as possible, remains optimal drop-by-drop for batch arrivals, blocking servers, and time-varying buffer sizes.

Network servers

Protocols

Circuits

Investments

Traffic control

Cities and towns

Buffer overflow

Electronic mail

Delay

Asynchronous transfer mode

Details

Title: Subtitle: Service gap minimization in G/D/1/B+1 queues
Creators: M.S Andersland - Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA
C.W Lee
Resource Type: Journal article
Publication Details: IEEE transactions on automatic control, Vol.45(2), pp.290-294
Publisher: IEEE
DOI: 10.1109/9.839951
ISSN: 0018-9286
eISSN: 1558-2523
Language: English
Date published: 02/2000
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984083209902771

Metrics

18 Record Views