A fast time slot assignment algorithm for TDM hierarchical switching systems

A fast time slot assignment algorithm for TDM hierarchical switching systems

A fast (polynomial time) network-flow-based algorithm is presented for time slot assignment in time-division-multiplexing (TDM) hierarchical switching systems. For a nonblocking time-multiplexed central switch the algorithm produces a conflict-free time slot assignment for a given frame (whenever th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 1989-08, Vol.37 (8), p.870-874
1. Verfasser: Bonuccelli, M.A.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Costs
Exact sciences and technology
Hardware
Polynomials
Satellites
Sufficient conditions
Switches
Switching and signalling
Switching systems
Systems, networks and services of telecommunications
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Time division multiple access
Time division multiplexing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fast (polynomial time) network-flow-based algorithm is presented for time slot assignment in time-division-multiplexing (TDM) hierarchical switching systems. For a nonblocking time-multiplexed central switch the algorithm produces a conflict-free time slot assignment for a given frame (whenever this is possible) on O(M/sup 5/) time, where M is the system size.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.31186