• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

      Thumbnail
      View / Download
      653.4 Kb
      Author
      Altın, A.
      Belotti, P.
      Pınar, M. Ç.
      Date
      2010
      Source Title
      Optimization and Engineering
      Print ISSN
      1389-4420
      Electronic ISSN
      1573-2924
      Publisher
      Springer
      Volume
      11
      Issue
      3
      Pages
      395 - 422
      Language
      English
      Type
      Article
      Item Usage Stats
      97
      views
      315
      downloads
      Abstract
      We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and a routing is sought with a fair performance for any feasible traffic matrix in the polyhedron. The problem accurately reflects real world networks, where demands can only be estimated, and models one of the main traffic forwarding technologies, Open Shortest Path First (OSPF) routing with equal load sharing. This is an NP-hard problem as it generalizes the problem with a fixed demand matrix, which is also NP-hard. We prove that the optimal oblivious routing under polyhedral traffic uncertainty on a non-OSPF network can be obtained in polynomial time through Linear Programming. Then we consider the OSPF routing with equal load sharing under polyhedral traffic uncertainty, and present a compact mixed-integer linear programming formulation with flow variables. We propose an alternative formulation and a branch-and-price algorithm. Finally, we report and discuss test results for several network instances.
      Keywords
      OSPF
      Oblivious routing
      Traffic engineering
      ECMP
      Branch-and-price
      Traffic uncertainty
      Permalink
      http://hdl.handle.net/11693/22474
      Published Version (Please cite this version)
      http://dx.doi.org/10.1007/s11081-009-9098-y
      Collections
      • Department of Industrial Engineering 677
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy