Title :
Tight bounds for the maximum throughput of time-multiplex switches
Author_Institution :
Dept. of Comput. Sci., Hong Kong Polytech., Hung Hom, Hong Kong
fDate :
10/1/1996 12:00:00 AM
Abstract :
The throughput of a time-multiplex switch can be maximized by resolving transmission conflict such that the maximum number of packets are switched in each slot. We propose an upper-bound and a lower-bound for the maximum throughput of time-multiplex switches. These bounds are given in closed-form expressions, they are very tight, and they are significantly tighter than the bounds proposed by Mehmet-Ali, Youssefi and Nguyen (see ibid., vol.42, no.12, p.3189, 1994)
Keywords :
time division multiplexing; closed-form expressions; lower bound; maximum throughput; packet switching; tight bounds; time-multiplex switches; transmission conflict resolution; upper bound; Closed-form solution; Communication switching; Computer networks; Computer simulation; Fabrics; Heuristic algorithms; Packet switching; Switches; Throughput; Time division multiple access;
Journal_Title :
Communications, IEEE Transactions on
