Time-efficient algorithms for BGP route configuration

Based on the concept of most popular prefix first, two efficient algorithms for BGP route configuration are proposed. The first algorithm MPPF/spl I.bar/SES is designed for solving the single egress selection (SES) problem, and the second algorithm MPPF/spl I.bar/MES is for multiple egress selection (MES). MPPF/spl I.bar/MES has two variants, one aims at minimizing the total amount of resources consumed for carrying the transit traffic, and the other tries to minimize the egress link capacity required. Compared with the existing algorithms, a comparable performance in terms of network resources consumed can be obtained. In case of SES, our MPPF/spl I.bar/SES can earn a given traffic load with much lower egress link capacity requirement. In case of MES, our MPPF/spl I.bar/MES tends to provide a more stable performance. Last but not the least, our proposed algorithms have a much lower time complexity than the existing approach.