• DocumentCode
    73624
  • Title

    Preventive start-time optimisation of open shortest path first link weights for hose model

  • Author

    Sandaruwan Ranaweera, Ravindra ; Mohammad Kamrul, Islam ; Oki, Eiji

  • Author_Institution
    Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan
  • Volume
    3
  • Issue
    2
  • fYear
    2014
  • fDate
    Jun-14
  • Firstpage
    143
  • Lastpage
    149
  • Abstract
    Optimising link weights in an open shortest path first network is a challenging traffic engineering problem to reduce network congestion. Most of the previous studies have focused on the application of start-time optimisation (SO) and run-time optimisation on both pipe and hose models of link weight optimisation. In a more recent study, an efficient policy, preventive start-time optimisation (PSO), has been introduced for link weight optimisation. However, no studies have been reported on the application of PSO to the hose model where the exact traffic demand between each source and destination node pair does not need to be specified. A PSO policy for the hose model to optimise the link weights against link failures is proposed. The proposed scheme employs a heuristic algorithm to determine a suitable set of link weights to reduce worst-case congestion for any single link failure. It efficiently selects the worst-case performance traffic matrix and reduces the worst-case congestion ratio as compared with a brute-force scheme which is computationally expensive when searching the link weight space against all the possible traffic matrices and topologies created by single link failures. The numerical results show that the proposed scheme is more effective in the reduction of worst-case congestion ratio than the scheme utilising SO.
  • Keywords
    IP networks; Internet; computer network reliability; failure analysis; heuristic programming; matrix algebra; optimisation; routing protocols; telecommunication traffic; IGP; IP networks; Internet; PSO policy; brute-force scheme; destination node pair; heuristic algorithm; hose model; link-state-based interior gateway routing protocol; network congestion reduction; open shortest path first link weight optimization; pipe model; preventive start-time optimisation; run-time optimisation; single link failure; source node pair; traffic engineering problem; worst-case congestion ratio reduction; worst-case performance traffic matrix;
  • fLanguage
    English
  • Journal_Title
    Networks, IET
  • Publisher
    iet
  • ISSN
    2047-4954
  • Type

    jour

  • DOI
    10.1049/iet-net.2012.0226
  • Filename
    6845409