• DocumentCode
    3035087
  • Title

    Minimum hop flow assignment and routing in computer-communication networks

  • Author

    Meditch, J.S. ; Gorecki, F.D.

  • Author_Institution
    University of Washington, Seattle, WA
  • fYear
    1980
  • fDate
    10-12 Dec. 1980
  • Firstpage
    634
  • Lastpage
    636
  • Abstract
    The problem of minimum hop flow assignment and routing in computer-communication networks subject to an average message delay constraint or to a set of end-to-end average message delay constraints is formulated, and a simple algorithm for solution of the problem is developed. The algorithm is illustrated via an example, and directions for future research are indicated.
  • Keywords
    Computer networks; Delay; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control including the Symposium on Adaptive Processes, 1980 19th IEEE Conference on
  • Conference_Location
    Albuquerque, NM, USA
  • Type

    conf

  • DOI
    10.1109/CDC.1980.271874
  • Filename
    4046740
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3035087