Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Queuing Network Models with State-Dependent Routing
Journal of the ACM (JACM)
Optimal routing in networks with flow-controlled virtual channels
Proceedings of the Computer Network Performance Symposium
Dynamic route selection algorithms for session based communication networks
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Heuristic design algorithm for computer communication networks with different classes of packets
IBM Journal of Research and Development
Novel topological framework for adaptive routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 48.22 |
Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routing algorithm. These models show that adaptive routing does not satisfy the necessary conditions for an optimal routing. Adaptive routing tends to overuse the direct path and underuse alternate routes because it does not consider the impact of its current routing decision on the future state of the network. The form of the optimality conditions suggests that a modification of the adaptive algorithm will result in optimality. The modification requires the substitution of a quadratic bias term instead of a linear one in the routing table maintained at each network node. Simulation results are presented which confirm the theoretical analysis for a simple network.