Some approaches to solving a multihour broadband network capacity design problem with single-path routing
暂无分享,去创建一个
[1] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.
[2] Deep Medhi. Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.
[3] Amitava Dutta,et al. Capacity planning of private networks using DCS under multibusy-hour traffic , 1994, IEEE Trans. Commun..
[4] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[5] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[6] Dimitri P. Bertsekas,et al. Data networks (2nd ed.) , 1992 .
[7] Deep Medhi,et al. Models for Network Design, Servicing and Monitoring of ATM Networks Based on the Virtual Path Concept , 1997, Comput. Networks ISDN Syst..
[8] Deep Medhi,et al. Generalized proximal point algorithm for convex optimization , 1996 .
[9] Bezalel Gavish,et al. A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..
[10] Mario Gerla,et al. Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..
[11] M. Eisenberg. Engineering traffic networks for more than one busy hour , 1977, The Bell System Technical Journal.
[12] Warren B. Powell,et al. A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..
[13] Erik Rolland,et al. Heuristic solution Procedures for the Graph Partitioning Problem , 1992, Computer Science and Operations Research.
[14] Heinz Mühlenbein,et al. Parallel Genetic Algorithms in Combinatorial Optimization , 1992, Computer Science and Operations Research.
[15] Bezalel Gavish,et al. Capacity and Flow Assignments in Large Computer Networks , 1986, INFOCOM 1986.
[16] Stella Dafermos,et al. An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .
[17] Norman Zadeh,et al. On building minimum cost communication networks over time , 1974, Networks.
[18] Doan B. Hoang,et al. Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..
[19] Bernard Yaged,et al. Minimum cost routing for static network models , 1971, Networks.
[20] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[21] Åke Arvidsson. Management of Reconfigurable Virtual Path Networks , 1994 .
[22] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[23] Bernard Yaged. Minimum cost routing for dynamic network models , 1973, Networks.
[24] Frank Y. S. Lin,et al. A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks , 1992, INFORMS J. Comput..
[25] Hanan Luss,et al. Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..
[26] Eric Rosenberg,et al. A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network , 1987, Oper. Res..
[27] Sidney L. Hantler,et al. An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..
[28] William Stallings,et al. ISDN and broadband ISDN with frame relay and ATM (3rd ed.) , 1995 .
[29] Andre Girard,et al. Routing and Dimensioning in Circuit-Switched Networks , 1990 .
[30] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[31] Bezalel Gavish,et al. Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..
[32] R. H. Cardwell,et al. Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.
[33] Roy D. Yates,et al. A Layered Broadband Switching Architecture with Physical or Virtual Path Configurations , 1991, IEEE J. Sel. Areas Commun..
[34] Cheng-Hong Yang,et al. Genetic Algorithms for the Traveling Salesman Problem with Time Windows , 1992, Computer Science and Operations Research.
[35] John Burgin. Broadband ISDN Resource Management , 1990, Comput. Networks ISDN Syst..
[36] W. Prager,et al. Optimal and suboptimal capacity allocation in communication networks , 1971 .
[37] M. De Prycker. ATM switching on demand , 1992 .
[38] R. Tyrrell Rockafellar,et al. Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..
[39] G. Ash,et al. Servicing and real-time control of networks with dynamic routing , 1981, The Bell System Technical Journal.
[40] David K. Smith,et al. Mathematical Programming: Theory and Algorithms , 1986 .
[41] Dimitri P. Bertsekas,et al. Data Networks: Second Edition , 1992 .
[42] J. G. Klincewicz,et al. A scaled reduced gradient algorithm for network flow problems with convex separable costs , 1981 .
[43] C. Ha. A generalization of the proximal point algorithm , 1987, 26th IEEE Conference on Decision and Control.
[44] Dirk Van Gucht,et al. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..
[45] Moshe Sidi,et al. Topological design of local area networks using genetic algorithms , 1995, Proceedings of INFOCOM'95.
[46] Michel Minoux,et al. Mathematical Programming , 1986 .
[47] W. Elsner. A descent algorithm for the multihour sizing of traffic networks , 1977, The Bell System Technical Journal.
[48] R. Siebenhaar,et al. Optimized ATM virtual path bandwidth management under fairness constraints , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.
[49] Michael C. Ferris,et al. Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem , 1994, INFORMS J. Comput..
[50] Amitava Dutta,et al. A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks , 1992, Oper. Res..
[51] Deep Medhi,et al. A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..
[52] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[53] Stephen Chen,et al. Solving large telecommunications network loading problems , 1989, AT&T Technical Journal.
[54] Martin Davies,et al. Computer Science and Operations Research: New Developments in Their Interfaces , 1992 .
[55] Michael Florian,et al. A Method for Computing Network Equilibrium with Elastic Demands , 1974 .
[56] R. L. Smith. Deferral strategies for a dynamic communications network , 1979, Networks.
[57] Shigeo Shioda,et al. Centralized Virtual Path Bandwidth Allocation Scheme for ATM Networks , 1992 .
[58] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..