• DocumentCode
    900199
  • Title

    Finding all hops shortest paths

  • Author

    Cheng, Gang ; Ansari, Nirwan

  • Author_Institution
    Electr. & Comput. Eng. Dept., Newark Inst. of Technol., NJ, USA
  • Volume
    8
  • Issue
    2
  • fYear
    2004
  • Firstpage
    122
  • Lastpage
    124
  • Abstract
    In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.
  • Keywords
    quality of service; telecommunication network routing; AD hops shortest paths problem; QoS routing; optimal comparison-based solutions; quality of service; worst-case computational complexities; Computational complexity; Computer networks; Computer science education; Cost function; Educational technology; Electronic mail; Quality of service; Routing;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2004.823365
  • Filename
    1268006
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=900199