Affordable Access

Publisher Website

Adaptive virtual circuit routing

Authors
Journal
Computer Networks and ISDN Systems
0169-7552
Publisher
Elsevier
Publication Date
Volume
28
Issue
3
Identifiers
DOI: 10.1016/0169-7552(95)00006-2
Keywords
  • Adaptive Routing
  • Connection-Oriented
  • Dynamic Routing
  • Simulation
  • State-Dependent Routing
  • Virtual Channel
  • Virtual Circuit
  • Virtual Connection
  • Virtual Route
Disciplines
  • Communication
  • Computer Science

Abstract

Abstract The paper deals with the adaptive routing problem in virtual circuit communication networks. A newly arriving call at a source node is routed along the minimum length path to its destination node. All packets belonging to this call follow the same path through the network. The superiority of a quadratic state-dependent routing algorithm to the shortest-queue routing algorithm is shown via simulation. The sooner the network state information becomes available to the router and the more often that this information is updated, the smaller the achieved average packet delay. Also, the age of this information at the router should be less or at least comparable to (but not extremely larger than) the mean interarrival time of virtual circuits.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Deadlock-free connection-based adaptive routing wi...

on Journal of Parallel and Distri... Jan 01, 2007

On-line routing for permanent virtual circuits

on Computer Communications Jan 01, 1996

Competitive Routing of Virtual Circuits with Unkno...

on Journal of Computer and System...
More articles like this..