ADAPTIVE VIRTUAL CIRCUIT ROUTING

The paper deals with the adaptive routing problem in virtual circuit c ommunication networks. A newly arriving call at a source node is route d along the minimum length path to its destination node. All packers b elonging to this call follow the same path through the network. The su periority of a quadratic state-dependent routing algorithm to the shor test-queue routing algorithm is shown via simulation, The sooner the n etwork state information becomes available to the router and the more often that this information is updated, the smaller the achieved avera ge packet delay. Also, the age of this information at the router shoul d be less or at least comparable to (but not extremely larger than) th e mean interarrival time of virtual circuits.