Path assignment for virtual circuit routing
暂无分享,去创建一个
We consider a network which routes on a virtual-circuit. Each virtual-circuit is associated with a session. Virtual-circuit is assigned to a session at the time the session is initiated. We address the dynamic case where new sessions arrive and old sessions terminate. We formulate an optimal control problem to deduce which virtual-circuit an incoming session will be assigned to. We then discuss various approximations to the problem and show that the heuristic rule, "route on the shortest marginal delay path", is close to optimal in an asympotic sense.
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[3] Seyyed Jamaaloddin Golestaani,et al. A unified theory of flow control and routing in data communication networks , 1980 .