TY - CONF T1 - Optimal design of signaling networks for Internet telephony T2 - IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings Y1 - 2000 A1 - Srinivasan, Aravind A1 - Ramakrishnan,K. G A1 - Kumaran,K. A1 - Aravamudan,M. A1 - Naqvi,S. KW - bandwidth allocation KW - Computational efficiency KW - Computer networks KW - Cost function KW - Demand forecasting KW - demand forecasts KW - graph theory KW - graphical design tool KW - Internet telephony KW - Linear programming KW - Load forecasting KW - Load management KW - Network topology KW - optimal design KW - optimal load balancing KW - optimisation KW - performance KW - quadratic assignment problem KW - random graphs KW - randomised algorithms KW - randomized heuristics KW - Signal design KW - signaling networks KW - Switches KW - telecommunication signalling KW - topology design AB - We present an approach for efficient design of a signaling network for a network of software switches supporting Internet telephony. While one may take an integer programming approach to solve this problem, it quickly becomes intractable even for modest-sized networks. Instead, our topology design uses random graphs that we show to be nearly optimal in cost, highly connected, and computationally efficient even for large networks. We then formulate a quadratic assignment problem (QAP) to map the abstract topology into the physical network to achieve optimal load balancing for given demand forecasts, which we solve using randomized heuristics. Numerical results on several example networks illustrate the performance and computational efficiency of our method. A graphical design tool has been developed based on our algorithms JA - IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings PB - IEEE VL - 2 SN - 0-7803-5880-5 M3 - 10.1109/INFCOM.2000.832245 ER -