Topological design of wide area communication networks, Annals of Operations Research, vol.29, issue.1, pp.365-382, 1992. ,
DOI : 10.1007/BF02094337
Neural networks for topological design of local access tree networks, Proceeding of Telecommunication Systems, Modelling and Analysis Conference, pp.256-263, 1993. ,
The access network design problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.40-49, 1998. ,
DOI : 10.1109/SFCS.1998.743427
Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem, Management Science, vol.40, issue.7, pp.40846-867, 1994. ,
DOI : 10.1287/mnsc.40.7.846
Optimal physical diversity algorithms and survivable networks, Proceedings Second IEEE Symposium on Computer and Communications, 1997. ,
DOI : 10.1109/ISCC.1997.616037
WF2Q : Worst-case Fair Weigthed Fair Queuing, Procesdings of INFOCOM, pp.120-128, 1996. ,
Long-Distance Access Network Design, BER92] Bertsekas D. and Gallager R, pp.309-325, 1992. ,
DOI : 10.1287/mnsc.1030.0161
Modélisation Différentielle du trafic et Simulation hybride de réseaux IP-MPLS DiffServ, Thèse LAAS-CNRS, pp.49-60, 2005. ,
A new optimal algorithm for backbone topology design in communications networks, Mathematical and Computer Modelling, vol.17, issue.8, pp.49-61, 1993. ,
DOI : 10.1016/0895-7177(93)90154-Q
Swarm Intelligence -From Natural to Artificial Systems Large-scale network topological optimization, IEEE Transactions on Communications, vol.25, issue.1, pp.29-47, 1977. ,
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows, pp.273-306, 2003. ,
The Convergence of a Class of Double-rank Minimization Algorithms, IMA Journal of Applied Mathematics, vol.6, issue.3, pp.223-245, 1970. ,
DOI : 10.1093/imamat/6.3.222
Hyperexponential approximation for GPS systems with an arbitrary number of traffic classes On the design problem of multitechnology networks, INFORMS Journal on Computing, vol.13, issue.3, pp.245-256, 2001. ,
An innovative technique for backbone network design, IEEE Transactions on Systems, Man, and Cybernetics, vol.19, issue.5, pp.1122-1132, 1989. ,
DOI : 10.1109/21.44028
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.170-180, 2001. ,
DOI : 10.1137/S0895480199362071
Algorithms for a multi-level network optimization problem, European Journal of Operational Research, vol.118, issue.1, pp.164-180, 1999. ,
DOI : 10.1016/S0377-2217(98)00306-3
A Comparative Study », Special Issue of Cluster Computing: The Journal of Networks, Software and Applications ,
A genetic algorithm for survivable network design, Proceedings of the Fifth International Conference on Genetic Algorithms, pp.408-415, 1993. ,
Ant algorithms and stigmergy, «Ant algorithms and stimergy», pp.851-871, 2000. ,
DOI : 10.1016/S0167-739X(00)00042-X
Minimizing congestion with a bounded number of paths, p.6, 2007. ,
« Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification », IETF RFC 2362 « Using PIM to distribute MPLS labels for multicast routes », IETF Internet draft A better approximation ratio for the minimum k-edge-connected spanning subgraph problem, Journal of Algorithms, vol.28, issue.1, pp.105-124, 1998. ,
Function minimization by conjugate gradients, The Computer Journal, vol.7, issue.2, pp.149-154, 1964. ,
DOI : 10.1093/comjnl/7.2.149
A new approach to variable metric algorithms, The Computer Journal, vol.13, issue.3, pp.3317-322, 1970. ,
DOI : 10.1093/comjnl/13.3.317
The flow deviation method: An approach to store-and-forward communication network design, Networks, vol.1, issue.2, pp.97-133, 1973. ,
DOI : 10.1002/net.3230030202
The network redesign problem for access telecommunications networks, Naval Research Logistics, vol.1, issue.5, pp.487-506, 1999. ,
DOI : 10.1002/(SICI)1520-6750(199908)46:5<487::AID-NAV3>3.0.CO;2-B
Bandwidth allocation heuristics in communication networks,1 ère Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'99 Polynomial time algorithms for edge-connectivity augmentation problems, Algorithmica, vol.36, issue.4, pp.53-58361, 1999. ,
A general model for the topological design of computer networks, GLOBECOM'86 - IEEE International Global Telecommunications Conference, pp.1584-1588, 1986. ,
Parallel savings heuristics for the topological design of local access tree networks, Proceedings of IEEE INFOCOM'86. Fifth Annual Conference on Computers and Communications Integration Design, pp.130-139, 1986. ,
Topological design of telecommunication networks-local access design methods, Annals of Operations Research, vol.31, issue.1, pp.17-71, 1991. ,
DOI : 10.1007/BF02061657
Configuring wide area computer networks, OR Spektrum, vol.4, issue.3, pp.115-128, 1992. ,
DOI : 10.1007/BF01783514
Topological design of computer communication networks ??? The overall design problem, European Journal of Operational Research, vol.58, issue.2, pp.149-172, 1992. ,
DOI : 10.1016/0377-2217(92)90204-M
Design of 1-FT Communication Network under Budget Constraint, Proceedings of Distributed Computing. Mobile and Wireless Computing. 4th International Workshop -IWDC 2002, pp.300-311, 2002. ,
DOI : 10.1007/3-540-36385-8_30
A tabu search algorithm for access network design, Annals of Operations Research, vol.106, pp.1-4229, 2001. ,
Quality-of-Service in Packet Networks Basic Mechanisms and Directions, Computer Network, issue.31, pp.169-189, 1999. ,
A family of variable-metric methods derived by variational means, Mathematics of Computation, vol.24, issue.109, pp.23-26, 1970. ,
DOI : 10.1090/S0025-5718-1970-0258249-6
A self-clocked fair queueing scheme for broadband applications, Proceedings of INFOCOM '94 Conference on Computer Communications, pp.636-646, 1994. ,
DOI : 10.1109/INFCOM.1994.337677
Using generalized capacitated trees for designing the topology of local access networks, Telecommunication Systems, vol.7, issue.4, pp.315-337, 1997. ,
DOI : 10.1023/A:1019184615054
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph, Operations Research, vol.12, issue.3, pp.450-459, 1964. ,
DOI : 10.1287/opre.12.3.450
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems, Operations Research, vol.13, issue.3, pp.462-475, 1965. ,
DOI : 10.1287/opre.13.3.462
Optimal design of a twolevel hierarchical network with tree-star configuration, Computers & Industrial Engineering, vol.22, issue.3, pp.273-281, 1992. ,
A factor 2 approximation algorithm for the generalized Steiner network problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.39-60, 2001. ,
DOI : 10.1109/SFCS.1998.743495
An efficient k-means clustering algorithm: analysis and implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.7, pp.881-892, 2002. ,
DOI : 10.1109/TPAMI.2002.1017616
Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983. ,
DOI : 10.1126/science.220.4598.671
Queueing Systems, 1976. ,
Approximation algorithms for graph augmentation, Journal of Algorithms, vol.4, issue.2, pp.214-225, 1991. ,
A hybrid genetic algorithm approach for backbone design of communication networks, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), pp.1817-1823, 1999. ,
DOI : 10.1109/CEC.1999.785495
Topological planning of communication networks, Journal of Information and Organizational Sciences, vol.26, issue.1 2, pp.57-68, 2002. ,
Approximation Algorithms for Minimum Size 2-Connectivity Problems, Proceedings of the 18th Annual Symposium Theoretical Aspects of Computer Science (STACS'01 Lecture Notes in Computer Science Introduction to linear and nonlinear programming, pp.431-442, 1973. ,
DOI : 10.1007/3-540-44693-1_38
An approach of designing local access network using Simulated Annealing method, ConTEL'99 -5th International Conference on Telecommunications, pp.241-247, 1999. ,
A Dual-Based Algorithm for Multi-Level Network Design, Management Science, vol.40, issue.5, pp.567-581, 1994. ,
DOI : 10.1287/mnsc.40.5.567
Benders decomposition for local access network design with two technologies, Discrete Mathematics & Theoretical Computer Science, vol.4, pp.235-246, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00958958
Multicommodity Flows with a bounded number of paths ? A Flow Deviation Approach, Networks, pp.1-80, 2006. ,
An efficient algorithm for designing optimal backbone topology for a communication networks, International Conference on Communication Technology Proceedings, 2003. ICCT 2003., pp.103-106, 2003. ,
DOI : 10.1109/ICCT.2003.1209046
Model and heuristics for a generalized access network design problem. Telecommunication Systems - Modelling, Analysis, Design and Management, pp.3-4257, 2000. ,
Planification à court et à moyen terme d'un réseau de télécommunications, Annales des Télécommunications, vol.29, pp.11-12, 1974. ,
Designing Hierarchical Survivable Networks, Operations Research, vol.46, issue.1, pp.116-136, 1998. ,
DOI : 10.1287/opre.46.1.116
« The Collective Behaviour of Ants: an Example of Self-Organisation in Massive Parallelism Optimal design of backbone topology for a communication network cost constraint, Proceedings of the AAAI Spring Symposium on Parallel Models of Intelligence Proceedings of ICCC 2002 -15th International Conference on Computer Communication, pp.471-485, 1988. ,
Faster approximation algorithms for weighted triconnectivity augmentation problems, Operations Research Letters, vol.21, issue.5, pp.219-223, 1997. ,
DOI : 10.1016/S0167-6377(97)00045-X
A Survey of Algorithms for Convex Multicommodity Flow Problems, Management Science, vol.46, issue.1, pp.126-147, 2000. ,
DOI : 10.1287/mnsc.46.1.126.15132
NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems, Journal of Algorithms, vol.22, issue.1, pp.187-196, 1997. ,
DOI : 10.1006/jagm.1995.0800
A tabu-search approach for designing computer-network topologies with unreliable components, IEEE Transactions on Reliability, vol.46, issue.3, pp.350-359, 1997. ,
DOI : 10.1109/24.664006
Two-Connected Augmentation Problems in Planar Graphs, Journal of Algorithms, vol.32, issue.2, pp.87-107, 1999. ,
DOI : 10.1006/jagm.1999.1005
Routage Optimal des VP/VC dans les réseaux ATM, 2000. ,
A comparison of optimal methods for local access uncapacited network design, Annals of Operations Research, vol.106, issue.1/4, pp.263-286, 2001. ,
DOI : 10.1023/A:1014569927266
The gradient projection method for non-linear programming, part1: linear constraints, Journal S.I.A.M, vol.8, pp.181-217, 1961. ,
Topological design of two-level telecommunication networks with modular switches, Operations Research, vol.48, issue.5, pp.745-760, 2000. ,
Ant based load balancing in telecommunication networks, Adaptative Behaviour, vol.5, issue.2, 1997. ,
Conditioning of quasi-Newton methods for function minimization, Mathematics of Computation, vol.24, issue.111, pp.641-656, 1970. ,
DOI : 10.1090/S0025-5718-1970-0274029-X
Optimal design of a distributed network with two-level hierarchical structure, European Journal of Operational Research, vol.62, issue.1, pp.105-115, 1992. ,
Hierarchical network design using simulated annealing, Informatics and Mathematical Modelling, 2002. ,
A heuristic for the topological design of two-tiered networks, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), pp.2962-2967, 1998. ,
DOI : 10.1109/ICSMC.1998.725114
Topological optimization of a reliable communication network, IEEE Transactions on Reliability, vol.47, issue.3, pp.225-233, 1998. ,
DOI : 10.1109/24.740489
Factor 4/3 Approximations for Minimum 2-Connected Subgraphs, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp.262-273, 2000. ,
DOI : 10.1007/3-540-44436-X_26
A minimum 3-connectivity augmentation of a graph, Journal of Computer and System Sciences, vol.46, issue.1, pp.91-128, 1993. ,
DOI : 10.1016/0022-0000(93)90050-7
Approximating Unweighted Connectivity Problems in Parallel, Information and Computation, vol.171, issue.2, pp.125-126, 2001. ,
DOI : 10.1006/inco.2000.3003