Abstract
An important traffic engineering problem for OSPF networks is the determination of optimal link weights. In this paper, we assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute an optimal link weights that minimizes maximum link utilization for all traffic matrices inside the bounding region. We first present a mixed-integer programming formulation to compute the optimal link weights. We then present a heuristic algorithm to find the optimal weights. Our simulations show that the proposed algorithm not only performs better than existing weight setting schemes in terms of minimizing congestion ratio, but also can achieve solution which is close to the optimal solutions.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
