• DocumentCode
    3812449
  • Title

    Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach

  • Author

    Shekhar Srivastava;Gaurav Agrawal;Michal Pioro;Deep Medhi

  • Author_Institution
    University of Missouri-Kansas City, USA
  • Volume
    2
  • Issue
    1
  • fYear
    2005
  • Firstpage
    9
  • Lastpage
    18
  • Abstract
    An important traffic engineering problem for OSPF networks is the determination of optimal link weights. Certainly, this depends on the traffic engineering objective. Regardless, often a variety of performance measures may be of interest to a network provider due to their impact on the network. In this paper, we consider different objectives and discuss how they impact the determination of the link weights and different performance measures. In particular, we propose a composite objective function; furthermore, we present a Lagrangian relaxation-based dual approach to determine the link weight system. We then consider different performance measures and discuss the effectiveness of different objectives through computational studies of a variety of network topologies. We find that our proposed composite objective function with Lagrangian relaxation-based dual approach is very effective in meeting different performance measures and is computationally very fast.
  • Keywords
    "Lagrangian functions","Telecommunication traffic","Traffic control","Computer networks","Routing protocols","IP networks","Delay","Cost function","Engineering management","Network topology"
  • Journal_Title
    IEEE Transactions on Network and Service Management
  • Publisher
    ieee
  • ISSN
    1932-4537
  • Type

    jour

  • DOI
    10.1109/TNSM.2005.4798297
  • Filename
    4798297