Advanced

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

Srivastava, Shekhar; Agrawal, Gaurav; Pioro, Michal LU and Medhi, Deep (2005) In IEEE Transactions on Network and Service Management 2(1). p.9-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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
optimal routing, link weight system, OSPF networks, traffic engineering
in
IEEE Transactions on Network and Service Management
volume
2
issue
1
pages
9 - 18
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
ISSN
1932-4537
DOI
10.1109/TNSM.2005.4798297
language
English
LU publication?
yes
id
e537fb7a-79c2-49a3-b8da-c3254fdd1a88 (old id 1390819)
date added to LUP
2009-04-27 13:59:47
date last changed
2016-04-16 07:04:14
@misc{e537fb7a-79c2-49a3-b8da-c3254fdd1a88,
  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.},
  author       = {Srivastava, Shekhar and Agrawal, Gaurav and Pioro, Michal and Medhi, Deep},
  issn         = {1932-4537},
  keyword      = {optimal routing,link weight system,OSPF networks,traffic engineering},
  language     = {eng},
  number       = {1},
  pages        = {9--18},
  publisher    = {ARRAY(0xa880168)},
  series       = {IEEE Transactions on Network and Service Management},
  title        = {Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach},
  url          = {http://dx.doi.org/10.1109/TNSM.2005.4798297},
  volume       = {2},
  year         = {2005},
}