Oblivious routing scheme using load balancing over shortest paths

IEEE International Conference on Communications

Volumn , Issue , 2008, Pages 5783-5787

  Antić, Marija ^a   Smiljanić, Aleksandra ^a  

^a Faculty of Electrical Engineering   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SENSOR NETWORKS;

INTERNATIONAL CONFERENCES; SHORTEST PATHS;

COMPUTER NETWORKS;

EID: 51249106954     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2008.1082     Document Type: Conference Paper

References (13)

1. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993.
2. J. Matoušek, B. Gärtner, Understanding and Using Linear Programming, Springer Verlag, 2007.
3. D. Applegate and E. Cohen, "Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs," Proc. of SIGCOMM '03, 2003.
4. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke, "Optimal oblivious routing in polynomial time," Proc. of the 35th ACM Symposium on the Theory of Computing, 2003.
5. LpSolve, Reference Guide [Online]. Available:http://lpsolve. sourceforge.net, 2005.
6. M. Kodialam, T. V. Lakshman, and S. Sengupta, "Efficient and Robust Routing of Highly Variable Traffic," 3rd Wksp. Hot Topics in Networks, 2004.
7. M. Kodialam, T. V. Lakshman, and S. Sengupta, "Traffic-Oblivious Routing for Guaranteed Bandwidth Performance," Communications Magazine, 45(4):46-51, Apr. 2007.
8. H. Räcke, "Minimizing congestion in general networks," FOCS 43, 2002.
9. C. Harrelson, K.Hildrum, and S. Rao, "A Polynomial-time Tree Decomposition to Minimize Congestion," in Proc. of SPAA'03, 2003.
10. M. Bienkowski, M. Korzeniowski, and H. Räcke, "A Practical Algorithm for Constructing Oblivious Routing Schemes", Proc. of SPAA'03, 2003.
11. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," Proc. of the ACM SIGCOMM02, 2002.
12. B. Towles and W. J. Dally, "Worst-case Traffic for Oblivious Routing Functions," Computer Architecture Letters, 1, Feb. 2002.
13. S. R. Thorncraft, H. R. Outhred, and D. J. Clements, "Evaluation of Open-Source LP Optimization Codes in Solving Electricity Spot Market Optimization Problems," 19th Mini-Euro Conference on Operation Research Models and Methods in the Energy Sector, Sept. 2006.