An integrated methodology for supporting packet network engineering
暂无分享,去创建一个
[1] Clayton Lewis,et al. Designing for usability—key principles and what designers think , 1983, CHI '83.
[2] Jonathan L. Wang,et al. Integrated methodology for supporting packet network performance management and planning , 1990, Comput. Commun..
[3] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.
[6] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[7] Hisashi Kobayashi,et al. Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..
[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[9] J. Y. Yen. An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .
[10] R. Rathore,et al. Service provisioning operations for public packet switched network (PPSN) access , 1987, IEEE Communications Magazine.