• DocumentCode
    347832
  • Title

    A compact routing technique for communication networks

  • Author

    Fath, Khalid ; Flocchini, Paola ; Pierre, Samuel

  • Author_Institution
    Dept. of Comput. Sci., Montreal Univ., Que., Canada
  • Volume
    1
  • fYear
    1999
  • fDate
    9-12 May 1999
  • Firstpage
    191
  • Abstract
    The authors propose a new compact routing scheme which was first introduced for chordal grids and then generalized to arbitrary networks. Some of the concerns when designing the scheme were the minimization of the storage complexity and the adaptability of the routing scheme to a change of the network and to communication failures. Preliminary experimental results confirm that the algorithm is quite efficient when compared with existing routing techniques.
  • Keywords
    graph theory; minimisation; packet switching; telecommunication network routing; arbitrary networks; chordal grids; communication failures; communication networks; compact routing technique; packet routing; storage complexity minimisation; Algorithm design and analysis; Communication networks; Computer science; Costs; Labeling; Network topology; Operations research; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 1999 IEEE Canadian Conference on
  • Conference_Location
    Edmonton, Alberta, Canada
  • ISSN
    0840-7789
  • Print_ISBN
    0-7803-5579-2
  • Type

    conf

  • DOI
    10.1109/CCECE.1999.807194
  • Filename
    807194