• DocumentCode
    903951
  • Title

    An improved time-slot assignment algorithm for TDM hierarchical switching systems

  • Author

    Chalasani, Suresh ; Varma, Anujan

  • Author_Institution
    Dept. of Comput. Eng., Wisconsin Univ., Madison, WI, USA
  • Volume
    41
  • Issue
    2
  • fYear
    1993
  • fDate
    2/1/1993 12:00:00 AM
  • Firstpage
    312
  • Lastpage
    317
  • Abstract
    It is shown that any hierarchical switching system can be modeled by a special class of flow networks called unit networks. Using the results available for finding maximum flow through a unit network, a time-slot assignment (TSA) algorithm that runs in O(min(L ,M2)×min(N, √M)×M2) time is presented. This is an O(max(M/N, √M)) improvement over the TSA algorithm proposed by M.A. Bonucelli (1989)
  • Keywords
    computational complexity; electronic switching systems; hierarchical systems; telecommunication traffic; time division multiplexing; TDM; flow networks; hierarchical switching system; time complexity; time division multiplexing; time-slot assignment algorithm; unit networks; Communication switching; Switching systems; Telecommunication traffic; Time division multiplexing; Traffic control;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.216505
  • Filename
    216505
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=903951