• DocumentCode
    3023450
  • Title

    A minimum principle/queueing theory approach to routing in message-switched networks

  • Author

    Meditch, J.S.

  • Author_Institution
    University of Washington, Seattle, Washington
  • fYear
    1979
  • fDate
    10-12 Jan. 1979
  • Firstpage
    242
  • Lastpage
    245
  • Abstract
    Preliminary results for minimum message-delay routing in message-switched, store-and-forward, data-communication networks are presented using a minimum principle/queueing theory approach. The routing algorithm is a decentralized one which requires only local information. The results are illustrated via a special case, and extensions and problems for future research are discussed.
  • Keywords
    Costs; Data mining; Delay effects; Delay estimation; Feedback; Intelligent networks; Optimal control; Queueing analysis; Routing; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control including the 17th Symposium on Adaptive Processes, 1978 IEEE Conference on
  • Conference_Location
    San Diego, CA, USA
  • Type

    conf

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