Abstract

Traffic engineering helps to use network resources more efficiently. Network operators use TE to obtain different objectives such as load balancing, congestion avoidance and average delay reduction. Plane IP routing protocols such as OSPF, a popular intradomain routing protocol, are believed to be insufficient for TE. OSPF is based on the shortest path algorithm in which link weights are usually static value without considering network load. They can be set using the inverse proportional bandwidth capacity or certain value. However, Optimization theory helps network researchers and operators to analyze the network behavior more precisely. It is not a practical approach can be implemented in traditional protocol .This paper proposes that to address the feasibility requirements, a weight set can be extracted from optimization problem use as a link metric in OSPF. We show the routes that selected in OSPF with these metric distribute the traffic more close to optimal situation than routes from OSPF with default metric.

Highlights

  • This In recent years, the use of the Internet as communication infrastructure for different telecommunication applications has been growing significantly

  • Optimization theory helps network researchers and operators to analyze the network behavior more precisely. It is not a practical approach can be implemented in traditional protocol .This paper proposes that to address the feasibility requirements, a weight set can be extracted from optimization problem use as a link metric in OSPF

  • We show the routes that selected in OSPF with these metric distribute the traffic more close to optimal situation than routes from OSPF with default metric

Read more

Summary

Introduction

This In recent years, the use of the Internet as communication infrastructure for different telecommunication applications has been growing significantly. Traffic engineering (TE) is a bandwidth management technique that considers different objectives such as maximum throughput, minimum congestion and load balancing in the network. In this paper we present a formulation of the optimization problem that object to provide maximum load balancing. This objective function is useful in a situation that network entrance is random since increase the probability of new traffic admission. In addition we try to extract the OSPF metric from this problem and reach the load balancing with OSPF routing These attempts result in a new definition such as equivalent weight set and equivalent constraints. Proves bandwidth efficiency and reduces network congestion and leads to a substantial reduction in the end to end delay

Problem Statement
The Dual Problem
Practical Requirements
Simulation Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call