Research: Fourier analysis for modelling some cyclic behaviour of networks

Authors:
Daryoush Habibi;D. J. H. Lewis
Affiliations:
School of Engineering, The Flinders University of South Australia, GPO Box 2100, Adelaide 5001, Australia;University of Tasmania, Hobart, Tasmania 7001, Australia
Venue:
Computer Communications
Year:
1996

Citing 6
Cited 2

Waiting-time approximations for cyclic-service systems with switchover times

Performance Evaluation
Analysis of cyclic service systems with limited service: bounds and approximations

Performance Evaluation
Exact results for the cyclic-service queue with a Bernoulli schedule

Performance Evaluation
Polling systems with zero switch-over periods: a general method for analyzing the expected delay

Performance Evaluation
Cyclic-service systems with probabilistically-limited service

IEEE Journal on Selected Areas in Communications
Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules

IEEE Journal on Selected Areas in Communications

Cyclostationarity: half a century of research

Signal Processing
Bibliography on cyclostationarity

Signal Processing

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper outlines a new method of analysis for cyclo-stationary queueing systems. These are queues where either or both the arrival rate into the queue and the departure rate out of the queue have a cyclic nature. There are many instances of such queues in telecommunication and computer networks. The analysis method given in this paper is based on using Fourier series with complex coefficients to describe cyclo-stationary probabilities of being in different states of the queueing system. Other performance parameters of the system may be obtained from these probabilities.