Distributed routing with on-line marginal delay estimation

Author

Cassandras, Christos G. ; Abidi, M. Vasmi ; Towsley, Don

Author_Institution

Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA

Volume

38

Issue

3

fYear

1990

fDate

3/1/1990 12:00:00 AM

Firstpage

348

Lastpage

359

Abstract

A procedure is presented for estimating online marginal packet delays through links with respect to link flows without making the standard assumptions (exponentially distributed packet lengths, Poisson arrival processes). This procedure is based on a technique known as perturbation analysis. No knowledge of network parameters (arrival rates, link capacities) is required. This is used in the context of a minimum delay distributed routing algorithm for real-time implementation. Experimental results are included to investigate the effect of the algorithm step-size and observation period parameters, demonstrate the adaptivity of the approach, and compare it to well-known analytical approximation

Keywords

computer networks; delays; packet switching; queueing theory; computer networks; distributed routing algorithm; observation period parameters; on-line marginal delay estimation; packet delays; perturbation analysis; step-size; ARPANET; Algorithm design and analysis; Closed-form solution; Communication switching; Delay estimation; Helium; Optimal control; Routing; System recovery; Throughput;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.48893

Filename

48893