A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 366-370

  Ajili, Farid ^a   Rodošek, Robert ^a   Eremin, Andrew ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Column Generation; Constraint Propagation; Internet Routing; Valid Cuts

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; BENCHMARKING; INTERNET; MATHEMATICAL MODELS; NETWORK COMPONENTS; OPTIMIZATION; TELECOMMUNICATION INDUSTRY;

COLUMN GENERATION; CONSTRAINT PROPAGATION; INTERIOR GATEWAY PROTOCOL (IGP); INTERNET ROUTING; VALID CUTS;

NETWORK PROTOCOLS;

EID: 33644556457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066677.1066763     Document Type: Conference Paper

References (14)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network flows: theory, algorithms and applications. Prentice-Hall, 1993.
2. C. Barnhart, C. A. Hane, and P. H. Vance. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48:318-326, 2000.
3. W. Ben-Ameur and E. Gourdin. Internet routing and related topology issues. SIAM Journal on Discrete Mathematics, 17(1):18-49, 2003.
4. U. Black. IP Routing Protocols, RIP, OSPF, BGP, PNNI and Cisco routing protocols. Prentice-Hall, 2000.
5. A. Bley, M. Grotchël, and R. Wessläy. Design of broadband virtual private private networks: model and heuristics for the B-WiN. Technical Report SC 98-13, Konrad-Zuse-Zentrum fur Infor., Berlin, 1998.
6. B. Davie and Y. Rekhter. MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000.
7. M. Ericsson, M. Resende, and P. Pardalos. A genetic algorithm for the weight setting problem in OSPF routing. Journal of combinatorial optimization, 6(3):299-333, 2002.
8. B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. In IEEE Comm. Magazine, pages 118-124, 2003.
9. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proc. 19th INFOCOM, pages 519-528, 2000.
10. e 5.7 User Manual, 2003. http://www.icparc.ic.ac.uk/eclipse.
11. M. Milano, editor. Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers, 2003.
12. E. Osborne and A. Simha. Traffic engineering with MPLS. Pearson Higher Education, 2002.
13. W. Ouaja and B. Richards. A hybrid multicommodity routing algorithm for traffic engineering. Networks, 43(3):125-140, 2004.
14. R. Rodošek, F. Ajili, and A. Eremin. Mathematical models for the IGP metric optimisation problem with no flow splitting. Technical Report 04-1, IC-Parc, 2004.