Considering BGP Routing for the Network Planing of Uncertain Traffic Demands

This paper describes a new approach for the network dimensioning of interdomain traffic. To reduce the capacity requirements caused by the unknown outgoing border router we consider the rules how the interdomain routing protocol BGP calculates the best path to a destination. The result of our case study provides a reduction of the link capacities in a range from 2% to 75% compared to the existing hose approach. How much capacity could be saved depends on the type of the network and the assumed policies