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

Shun-Jee Liu

dblp:98/4626 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Computer networks · 2

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
2 papers
Routing and switching · 64% Internet architecture and protocols · 36%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › ATM networks
ATM switch architecture
0.011994
Performance Analysis of a Large-Scale ATM Switch with Input and Output Buffers · INFOCOM 1994
Routing and switching › switch scheduling
input-queued switch throughput
0.011994
Performance Analysis of a Large-Scale ATM Switch with Input and Output Buffers · INFOCOM 1994
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011994
Performance Analysis of a Large-Scale ATM Switch with Input and Output Buffers · INFOCOM 1994
Interconnection networks and networks-on-chip › permutation network
sort-banyan network
0.011994
Performance Analysis of a Large-Scale ATM Switch with Input and Output Buffers · INFOCOM 1994
Routing and switching › switching networks
multicast switching
0.011992
A Fair High-Speed Copy Network for Multicast Packet Switch · INFOCOM 1992
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
banyan network
0.011992
A Fair High-Speed Copy Network for Multicast Packet Switch · INFOCOM 1992

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

simulation · 0.0queueing analysis · 0.0pipelined architecture · 0.0
YearPublicationVenuePosition
1994 Performance Analysis of a Large-Scale ATM Switch with Input and Output Buffers
abstract
The maximum throughput of a single-stage non-blocking input-queued switch such as the sort-banyan network is shown to be 0.586 under the uniform traffic model. It can be increased to 0.88 or 0.97 respectively if the switch is speeded up by a factor of 2 or 3. Hui and Lee (1992) showed that, for a large scale three-stage switch built with sort-banyan switch modules, the maximum throughput reduces to 0.458. The analysis was performed based on the assumption that the number of middle-stage switch modules is equal to the number of input/output links of a switch module. In the paper, the authors study the effect of increasing the number of middle-stage switch modules and speeding up the switch. Numerical results are obtained and verified by computer simulations for various combinations. For example, with a speedup factor of 2, the maximum throughput can be improved to 0.85 if the number of middle-stage switch modules is doubled.>
Tsern-Huei Lee, Shun-Jee Liu
INFOCOM2
1992 A Fair High-Speed Copy Network for Multicast Packet Switch
abstract
A fair high-speed copy network for multicast packet switching is described. The authors modify the architecture of the copy network proposed by T.T. Lee (1988) to make it fair to all the inlets, and reduce the clock rate requirement of the switching fabric. Fairness is achieved by adding a banyan network to perform cyclic shifts in front of the copy network. A pipelined architecture is proposed to avoid a huge internal speed-up. The clock rate requirement of the proposed copy network is evaluated and compared with that of the original design. It is found that the clock rate requirement can be reduced significantly if the number of inlets is larger than 64.>
Tsern-Huei Lee, Shun-Jee Liu
INFOCOM2