• DocumentCode
    1277821
  • Title

    Minimum-interference routing based on flow maximisation

  • Author

    Bauer, D.

  • Author_Institution
    IBM Res., IBM Zurich Res. Lab., Ruschlikon, Switzerland
  • Volume
    38
  • Issue
    8
  • fYear
    2002
  • fDate
    4/11/2002 12:00:00 AM
  • Firstpage
    364
  • Lastpage
    365
  • Abstract
    A new on-line routing algorithm based on the notion of minimum-interference is presented. The algorithm maximises the sum of residual flows of ingress-egress pairs, using a simple heuristic method. It achieves good results in terms of total bandwidth routed
  • Keywords
    flow graphs; telecommunication network routing; bandwidth; directed graph; flow maximisation; heuristic method; ingress-egress pairs; minimum-interference routing; online routing algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20020254
  • Filename
    998327
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1277821