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

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.

• Författare: Shekhar Srivastava; Gaurav Agrawal; Michal Pioro; Deep Medhi
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2005
• Språk: Engelska
• Sidor: 9-18
• Publikation/Tidskrift/Serie: IEEE Transactions on Network and Service Management
• Volym: 2
• Issue: 1
• Länkar: http://dx.doi.org/10.1109/TNSM.2005.4798297
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Communication Systems; Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: optimal routing; link weight system; OSPF networks; traffic engineering
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 1932-4537