Abstract
A new routing design algorithm is presented for circuit-switched networks with dynamic routing capabilities. It is assumed that, in such networks, a transaction request can be set up by trying a sequence of paths connecting the originating switch and destination switch. The request will be connected through the first path that has an available circuit at the time of the request. The objective of this algorithm is to maximize the network throughput or revenue under a given capacity and load. The algorithm is a heuristic that first solves a simpler linear programming (LP) problem. It then transforms the LP solution into a feasible solution for the original nonlinear optimization problem. The solution is then improved through “route trimming” and “route expansion” processes. By using variants of Karmarkar's method implemented on the AT&T KORBX® system to solve the LP problem, the algorithm can be applied to large networks with potentially hundreds of switches. Furthermore, in many cases the algorithm provides near-optimal routing solutions with objective values that are within 0.5 percent of the optimal solutions.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
