Integration of equipment constraints in the capacity-planning process
暂无分享,去创建一个
[1] Luigi Fratta,et al. Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets , 1977, IBM J. Res. Dev..
[2] S. Wittevrongel,et al. Queueing systems , 2019, Autom..
[3] Sawasd Tantaratana,et al. Link Capacity Assignment in Packet-Switched Networks: The Case of Piecewise Linear Concave Cost Function , 1999 .
[4] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[5] Abdelhamid Benchakroun,et al. Capacity and flow assignment of data networks by generalized Benders decomposition , 2001, J. Glob. Optim..
[6] B. W. Meister,et al. New Optimization Criteria for Message-Switching Networks , 1971 .
[7] D. T. Tang,et al. Discrete Link Capacity Assignment in Communication Networks , 1976, ICCC.
[8] B. John Oommen,et al. Continuous Learning Automata Solutions to the Capacity Assignment Problem , 2000, IEEE Trans. Computers.
[9] Bernd Werner Meister,et al. On the Optimization of Message-Switching Networks , 1972, IEEE Trans. Commun..
[10] Donald T. Tang,et al. Discrete Link Capacity and Priority Assignments in Communication Networks , 1977, IBM J. Res. Dev..
[11] G. J. A. Stern,et al. Queueing Systems, Volume 2: Computer Applications , 1976 .
[12] Hong-Hsu Yen,et al. Delay Constrained Routing and Link Capacity Assignment in Virtual Circuit Networks , 2005, IEICE Trans. Commun..
[13] Deep Medhi,et al. Routing, flow, and capacity design in communication and computer networks , 2004 .