Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ming-Hung Ng

dblp:99/6880 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › switching networks › multistage interconnection network
clos network
0.011998
Blocking and nonblocking multirate Clos switching networks · IEEE/ACM Trans. Netw. 1998
Routing and switching › switching networks
multistage interconnection network
0.011998
Blocking and nonblocking multirate Clos switching networks · IEEE/ACM Trans. Netw. 1998
Routing and switching › switching networks
nonblocking conditions
0.011998
Blocking and nonblocking multirate Clos switching networks · IEEE/ACM Trans. Netw. 1998
Routing and switching
multicast routing
0.011998
Blocking and nonblocking multirate Clos switching networks · IEEE/ACM Trans. Netw. 1998

Methods — techniques the papers use, named apart from their topics

simulation · 0.0bandwidth partitioning · 0.0
YearPublicationVenuePosition
1998 Blocking and nonblocking multirate Clos switching networks
abstract
This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applicable to multirate circuit and fast-packet switching systems. Necessary and sufficient nonblocking conditions are derived analytically. Based on the results, an optimal bandwidth partitioning scheme is proposed to reduce switch complexity while maintaining the nonblocking property. The blocking behavior of blocking switches supporting multicast connections is investigated by means of simulation. We propose a novel simulation model that filters out external blocking events without distorting the bandwidth and fanout (for multicasting) distributions of connection requests. In this way, the internal blocking statistics that truly reflect the switch performance can be gathered and studied. Among many simulation results, we have shown that for point-to-multipoint connections, a heuristic routing policy that attempts to build a narrow multicast tree can have relatively low blocking probabilities compared with other routing policies. In addition, when small blocking probability can be tolerated, our results indicate that situations with many large-fanout connection requests do not necessarily require a switch architecture of higher complexity compared to that with only point-to-point requests.
Soung Chang Liew, Ming-Hung Ng, Cathy W. Chan
IEEE/ACM Trans. Netw.2