The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

Summary, in English

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.

Publishing year

2005

Language

English

Pages

9-18

Publication/Series

IEEE Transactions on Network and Service Management

Volume

2

Issue

1

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Communication Systems
  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • optimal routing
  • link weight system
  • OSPF networks
  • traffic engineering

Status

Published

ISBN/ISSN/Other

  • ISSN: 1932-4537