Optimal design of signaling networks for Internet telephony
| Title | Optimal design of signaling networks for Internet telephony |
| Publication Type | Conference Papers |
| Year of Publication | 2000 |
| Authors | Srinivasan A, Ramakrishnan KG, Kumaran K, Aravamudan M, Naqvi S |
| Conference Name | IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings |
| Date Published | 2000/// |
| Publisher | IEEE |
| ISBN Number | 0-7803-5880-5 |
| Keywords | bandwidth allocation, Computational efficiency, Computer networks, Cost function, Demand forecasting, demand forecasts, graph theory, graphical design tool, Internet telephony, Linear programming, Load forecasting, Load management, Network topology, optimal design, optimal load balancing, optimisation, performance, quadratic assignment problem, random graphs, randomised algorithms, randomized heuristics, Signal design, signaling networks, Switches, telecommunication signalling, topology design |
| Abstract | 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 |
| DOI | 10.1109/INFCOM.2000.832245 |