The FCFS service discipline: Stable network topologies, bounds on traffic burstiness and delay, and control by regulators

Authors:
G. I. Winograd;P. R. Kumar
Affiliations:
Department of Electrical and Computer Engineering and the Coordinated Science Laboratory University of Illinois, 1308 West Main Street, Urbana, IL 61801, U.S.A.;Department of Electrical and Computer Engineering and the Coordinated Science Laboratory University of Illinois, 1308 West Main Street, Urbana, IL 61801, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 2
Cited 5

A calculus for network delay. I. Network elements in isolation

IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis

IEEE Transactions on Information Theory

Fluid approximations for a processor-sharing queue

Queueing Systems: Theory and Applications
Stability of a three-station fluid network

Queueing Systems: Theory and Applications
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Lyapunov method for the stability of fluid networks

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

We consider the well-known First Come First Serve (FCFS) scheduling policy under bursty arrivals. This policy is commonly used in scheduling communication networks and manufacturing systems. Recently it has been shown that the FCFS policy can be unstable for some nonacyclic network topologies. We identify some network topologies under which FCFS is stable for all arrival and service rate vectors within the system's capacity. This is done by determining a sharp bound on the burstiness of traffic exiting from a tandem section of the system, in terms of the burstiness of the incoming traffic. This burstiness bound further allows us to provide a bound on the maximum number of parts in the system, and the maximum delay. It also enables us to analyze the performance of some systems controlled by the use of traffic smoothing regulators. The maximum delay can remain bounded even in the heavy traffic limit, when all stations are 100% utilized.