Title :
Scheduling packet transfers in a class of TDM hierarchical switching systems
Author :
Jain, Ravi ; Sasaki, Galen
Author_Institution :
Texas Univ., Austin, TX, USA
Abstract :
A tree network is studied which consists of a set of sending users, connected to a bank of multiplexers, followed by a bank of demultiplexers, which are connected to a set of receiving users. Special cases of this network include satellite-switch/TDM networks. A scheduling algorithm is presented that minimizes the amount of time to transfer a set of packets through the network, where it is assumed the packets are of equal length. The time complexity of the algorithm is O(N4C), where N is the number of users and C is the average capacity of the input and output links. The time complexity is an improvement over time complexities of existing algorithms
Keywords :
electronic switching systems; packet switching; satellite relay systems; TDM hierarchical switching systems; demultiplexers; multiplexers; packet transfers; satellite-switch/TDM networks; scheduling algorithm; time complexity; tree network; Intelligent networks; Packet switching; Scheduling algorithm; Switches; Switching systems; Time division multiple access; Time division multiplexing; Tree graphs; Virtual manufacturing; Virtual reality;
Conference_Titel :
Communications, 1991. ICC '91, Conference Record. IEEE International Conference on
Conference_Location :
Denver, CO
Print_ISBN :
0-7803-0006-8
DOI :
10.1109/ICC.1991.162262
