On multicast routing in Clos networks

Jan Ming Ho, De Ron Liang, Kuo Hui Tsai

Research output: Contribution to conferencePaperpeer-review

Abstract

An online multicast routing problem in Clos network with two optimizing criteria is studied. These criteria are network throughput and quality of service (QOS). Five routing algorithms are proposed according to five system measures using routing indices. The problem to find an optimal routing according to each of these system measures corresponds to an off-line routing problem. All of these off-line routing problems were shown to be NP-complete except for the least-busy routing problem. A series of simulation experiments was also conducted to study the system performance, namely, the network throughput and QOS, using these routing algorithms as on-line algorithms.

Original languageEnglish
Pages394-400
Number of pages7
StatePublished - 1996
EventProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
Duration: 12 Jun 199614 Jun 1996

Conference

ConferenceProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
CityBeijing, China
Period12/06/9614/06/96

Fingerprint

Dive into the research topics of 'On multicast routing in Clos networks'. Together they form a unique fingerprint.

Cite this