The Estimation of Delay Gradients for Purposes of Routing in Data - Communication Networks
Abstract
Appealing to current and past work on the routing problem in data - communication networks, we motivate the need for algorithms that estimate the derivative with respect to flow, of the total message delay on each of the links. We then cast the problem in a queueing theory framework and, making no statistical assumptions other than stationarity, we propose three algorithms that process the record of arrivals and departures of a single-sever queue to derive an estimate of the derivative, with respect to arrival rate, of the total delay accumulated per unit time. Through simulation and analysis we show that all three algorithms are asymptotically unbiased and efficient for M/D/1 queues. By simulation of other queues we investigate the relative robustness of the three procedures. Finally, through examination of the storage and computational requirements we identify a single most promising algorithm
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1977
- Accession Number
- ADA043248
Entities
People
- Martin G. Bello
Organizations
- Massachusetts Institute of Technology