%0 Conference Paper
%B IEEE Global Telecommunications Conference, 2001. GLOBECOM '01
%D 2001
%T Efficient algorithms for location and sizing problems in network design
%A Kumaran,K.
%A Srinivasan, Aravind
%A Qiong Wang
%A Lanning,S.
%A Ramakrishnan,K. G
%K Algorithm design and analysis
%K Broadband communication
%K broadband communication networks
%K broadband networks
%K capacity modularity
%K Communication networks
%K computer network reliability
%K distributed network elements
%K Economies of scale
%K greedy randomized adaptive search
%K homing
%K integer programming
%K Intelligent networks
%K Internet telephony
%K large-scale location problems
%K Large-scale systems
%K Linear programming
%K mixed-integer programs
%K near-optimal solutions
%K network design
%K Optical switches
%K randomised algorithms
%K reliability
%K search problems
%K sizing
%K Technological innovation
%K telecommunication network planning
%K Web caching
%X Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments
%B IEEE Global Telecommunications Conference, 2001. GLOBECOM '01
%I IEEE
%V 4
%P 2586-2590 vol.4 - 2586-2590 vol.4
%8 2001///
%@ 0-7803-7206-9
%G eng
%R 10.1109/GLOCOM.2001.966243