Dynamic Routing and Call Repacking in Circuit-Switched Networks
暂无分享,去创建一个
[1] E. Harrington,et al. Voice/Data Integration Using Circuit Switched Networks , 1980, IEEE Trans. Commun..
[2] D. Bertsekas. A class of optimal routing algorithms for communication networks , 1980 .
[3] M. Ackroyd. Call Repacking in Connecting Networks , 1979, IEEE Trans. Commun..
[4] 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.
[5] V. E. Benes,et al. Reduction of network states under symmetries , 1978, The Bell System Technical Journal.
[6] Harry Rudin,et al. On Routing and "Delta Routing": A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks , 1976, IEEE Trans. Commun..
[7] Adrian Segall,et al. The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..
[8] V. Benes. Programming and Control Problems Arising from Optimal Routing in Telephone Networks , 1966 .
[9] P. Lin,et al. Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..
[10] J. E. Knepley. Minimum Cost Design for Circuit Switched Networks. , 1973 .
[11] Kumpati S. Narendra,et al. Application of Learning Automata to Telephone Traffic Routing and Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.