A Simple Path Diversity Algorithm for Interdomain Routing

This paper proposes a simple path diversity algorithm (SPDA) for Interdomain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second, a given source is able to detect whether the point of congestion along the best path occurs. Third, if congestion occurs, the source will specify an alternate path and direct traffic over the best and alternate path concurrently. Simulation results indicate that the SPDA produces better performance than existing approaches in average end-to-end delay.