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) in O(M5) time, where M is the system size.
A FAST TIME SLOT ASSIGNMENT ALGORITHM FOR TDM HIERARCHICAL SWITCHING SYSTEMS
BONUCCELLI, MAURIZIO ANGELO
1989-01-01
Abstract
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) in O(M5) time, where M is the system size.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
