1990•IMA Journal of Mathematical Control and InformationRequires access

Dynamic Routing in Fully Connected Networks

Richard Gibbens, F. P. Kelly

Abstract

This paper considers various aspects of dynamic routing in fully connected circuit-switched networks. Bounds are obtained for the performance of any dynamic routing scheme, some theoretical considerations affecting the choice of trunk reservation parameters are presented, and a very simple dynamic routing scheme called dynamic alternative routing is described, which performs well under a variety of conditions. Finally, some of the capacity planning issues which arise for networks using dynamic routing are discussed.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 84 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Adaptive routing, Computer science, Static routing, Dynamic Source Routing, Routing (electronic design automation), Link-state routing protocol, Multipath routing, Policy-based routing