论文信息 - Oblivious Routing Scheme Using Load Balancing Over Shortest Paths

Oblivious Routing Scheme Using Load Balancing Over Shortest Paths

In this paper, we propose the oblivious routing scheme based on shortest-path routing and load balancing. We present the LP model that finds the optimal routing. Then we compare the performance of the proposed scheme with the performance of the shortest-path routing for some regular and real-case network topologies. We show that the proposed routing strategy allows to achieve higher guaranteed traffic from/to a node in the network, compared to the case of the classical shortest-path routing.

Aleksandra Smiljanic | Marija Antic

[1] Murali S. Kodialam,et al. Traffic-Oblivious Routing for Guaranteed Bandwidth Performance , 2007, IEEE Communications Magazine.

[2] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.

[3] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[4] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.

[5] Ratul Mahajan,et al. Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[6] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[7] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2003, STOC '03.

[8] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..

[9] Sudipta Sengupta,et al. Efficient and robust routing of highly variable traffic , 2005 .

[10] Bernd Gärtner,et al. Understanding and using linear programming , 2007, Universitext.

[11] William J. Dally,et al. Worst-case Traffic for Oblivious Routing Functions , 2002, IEEE Computer Architecture Letters.

[12] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .