A Parallel Algorithm for Time-Slot Assignment Problems in TDM Hierarchical Switching Systems

Nobuo Funabiki, Yoshiyasu Takefuji

研究成果: Article査読

8 被引用数 (Scopus)

抄録

This paper presents a parallel algorithm for timeslot assignment problems in TDM hierarchical switching systems, based on the neural network model. The TDM systems are operated. in repetitive frames composed of several Time-Slots. A Time-Slot represents a switching configuration where one packet is transmitted through an I/O line. The goal of our algorithm is to find conflict-free Time-Slot assignments for given switching demands. The algorithm runs on a maximum of n2×m processors for m-Time-Slot problems in n×n TDM systems. In small problems up to a 24×24 TDM system, the algorithm can find the optimum solution in a nearly constant time, when it is performed on n2×m processors.

本文言語English
ページ(範囲)2890-2898
ページ数9
ジャーナルIEEE Transactions on Communications
42
10
DOI
出版ステータスPublished - 1994 10
外部発表はい

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「A Parallel Algorithm for Time-Slot Assignment Problems in TDM Hierarchical Switching Systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル