Time slot assignment in TDM multicast switching systems

Author

Chen, Wen-Tsuen ; Sheu, Pi-Rong ; Yu, Jiunn-Hwa

Author_Institution

Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

fYear

1991

fDate

7-11 Apr 1991

Firstpage

1296

Abstract

The time slot assignment problem is studied in time-division multiplexing (TDM) switching systems which can support multicast transmissions. It is shown that this problem is NP-complete, i.e., computationally intractable. Two effective heuristic algorithms are proposed. To evaluate and compare the performance of these algorithms, a lower bound on the solution of this problem is derived and computer simulations are performed. The results of simulations show that the solutions generated by these heuristic algorithms are close to this lower bound on the average

Keywords

heuristic programming; packet switching; switching networks; time division multiplexing; TDM multicast switching systems; computer simulations; heuristic algorithms; lower bound; time division multiplexing; time slot assignment; Computer science; Computer simulation; Heuristic algorithms; Matrix decomposition; Multicast algorithms; Packet switching; Performance evaluation; Switches; Switching systems; Time division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Conference_Location

Bal Harbour, FL

Print_ISBN

0-87942-694-2

Type

conf

DOI

10.1109/INFCOM.1991.147654

Filename

147654