Abstract: Abstract Based on a loss network model, we present an adaptive source routing scheme for a large, hierarchically organized network. To represent the “available” capacity of a peer group (subnetwork), we compute the average implied cost to go through or into the peer group. Such implied costs reflect the congestion in the peer group as well as the interdependencies among traffic streams in the network. We prove that both a synchronous and asynchronous distributed computation of the implied costs will converge to a unique solution under a lig...
(read more)
Topics: 
Distributed computing
Computer network