Distributed dynamic routing schemes
暂无分享,去创建一个
[1] J. M. Akinpelu,et al. The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.
[2] P. Lin,et al. Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..
[3] Peter Key. Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation , 1988 .
[4] P. R. Srikantakumar,et al. A LEARNING MODEL FOR ROUTING IN TELEPHONE NETWORKS , 1982 .
[5] Kumpati S. Narendra,et al. The use of learning algorithms in telephone traffic routing - A methodology , 1983, Autom..
[6] J. H. Weber,et al. A simulation study of routing and control in communications networks , 1964 .
[7] Kumpati S. Narendra,et al. On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing , 1980, IEEE Transactions on Systems, Man, and Cybernetics.
[8] Steven A. Lippman,et al. Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..
[9] F. Kelly. Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.
[10] Peter Key,et al. Optimal Control and Trunk Reservation in Loss Networks , 1990 .
[11] F. Kelly. Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.
[12] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[13] F. P. Kelly,et al. Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..
[14] R. H. Cardwell,et al. Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.