BGP Ingress-to-Egress Route Configuration in a Capacity-constrained AS

The BGP ingress-to-egress route configuration problem is to find a set of paths in an ISP to carry the transit flows, such that the amount of network resources consumed is minimized without violating the bandwidth constraint on all network links. To solve the problem, we first formulate it using integer linear programming (ILP). Due to the high complexity involved in ILP, a heuristic algorithm, called MPPF, is then proposed. MPPF is designed based on the idea that heavily-loaded destination prefixes should be given higher priority to select less expensive edge links and routes. Simulation results show that MPPF requires less network resources and edge link capacity than an alternative heuristic called BTF

[1]  João L. Sobrinho.  Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.

[2]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[3]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[4]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Rajeev Rastogi,et al.  Optimal configuration for BGP route selection , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[8]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[9]  Victor O. K. Li,et al.  Inter-domain router placement and traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[10]  Kwan Lawrence Yeung,et al.  Time-efficient algorithms for BGP route configuration , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).