6th International ICST Conference on Broadband Communications, Networks, and Systems

Research Article

Robust Traffic Engineering using L-balanced Weight-Settings in OSPF/IS-IS

Download557 downloads
  • @INPROCEEDINGS{10.4108/ICST.BROADNETS2009.7184,
        author={Henrik Abrahamsson and Mats Bj\o{}rkman},
        title={Robust Traffic Engineering using L-balanced Weight-Settings in OSPF/IS-IS},
        proceedings={6th International ICST Conference on Broadband Communications, Networks, and Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2009},
        month={11},
        keywords={Communication system traffic control Data engineering IP networks Robustness Routing Search methods TV Telecommunication traffic Thumb Traffic control},
        doi={10.4108/ICST.BROADNETS2009.7184}
    }
    
  • Henrik Abrahamsson
    Mats Björkman
    Year: 2009
    Robust Traffic Engineering using L-balanced Weight-Settings in OSPF/IS-IS
    BROADNETS
    IEEE
    DOI: 10.4108/ICST.BROADNETS2009.7184
Henrik Abrahamsson1,*, Mats Björkman2,*
  • 1: Swedish Institute of Computer Science, Box 1263, SE-164 29 Kista, Sweden
  • 2: Mälardalen University, Västerås, Sweden
*Contact email: henrik@sics.se, Mats.Bjorkman@mdh.se

Abstract

Internet traffic volumes continue to grow at a great rate, now pushed by video and TV distribution in the networks. This brings up the need for traffic engineering mechanisms to better control the traffic. The objective of traffic engineering is to avoid congestion in the network and make good use of available resources by controlling and optimising the routing function. The challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. Today, the main alternative for intra-domain traffic engineering in IP networks is to use different methods for setting the weights in the routing protocols OSPF and IS-IS. In this paper we revisit the weight setting approach to traffic engineering but with focus on robustness. We propose l-balanced weight settings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level l. This gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present a heuristic search method for finding l-balanced weight settings and show that it works well in real network scenarios.