• DocumentCode
    780344
  • Title

    A Dynamic Programming Approach to Optimization of Switching Networks Composed of Digital Switching Matrices

  • Author

    Jajszczyk, Andrzej

  • Author_Institution
    Technical Univ. of Poznań, Poznań,Poland
  • Volume
    35
  • Issue
    12
  • fYear
    1987
  • fDate
    12/1/1987 12:00:00 AM
  • Firstpage
    1342
  • Lastpage
    1346
  • Abstract
    In this paper, the problem of selecting minimum cost switching networks composed of digital switching matrices is discussed. It is shown that the conventional continuous optimization method may lead to nonoptimal structures. The optimization problem is solved by using the dynamic programming principle. The relevant formulas are derived and samplings of the results of optimization are presented. Different network structures are compared and discussed.
  • Keywords
    Communication switching; Dynamic programming; Switching, communication; Communication switching; Cost function; Dynamic programming; Optimization methods; Phase change materials; Sampling methods; Switches; Switching circuits; Symmetric matrices; Transmission line matrix methods;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1987.1096718
  • Filename
    1096718
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=780344