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

M. S. Yeung

dblp:63/5889 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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 · 87% Network performance modeling · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › switching networks › multistage interconnection network
banyan network
0.011995
Design and analysis of a novel fast packet switch: pipeline Banyan · IEEE/ACM Trans. Netw. 1995
Routing and switching
packet switching
0.011995
Design and analysis of a novel fast packet switch: pipeline Banyan · IEEE/ACM Trans. Netw. 1995
Interconnection networks and networks-on-chip › routing algorithms
self-routing
0.011995
Design and analysis of a novel fast packet switch: pipeline Banyan · IEEE/ACM Trans. Netw. 1995
Interconnection networks and networks-on-chip
switching network
0.011995
Design and analysis of a novel fast packet switch: pipeline Banyan · IEEE/ACM Trans. Netw. 1995
Network performance modeling
throughput analysis
0.011995
Design and analysis of a novel fast packet switch: pipeline Banyan · IEEE/ACM Trans. Netw. 1995

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

simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1995 Design and analysis of a novel fast packet switch: pipeline Banyan
abstract
Proposes a new fast packet switch architecture-pipeline banyan. It has a control plane and a number of parallel data planes which are of the same banyan topology. Packet headers are self-routed through the control plane to their destinations. As a result, they establish the corresponding routing paths in the data planes. The data planes do not need to do routing decisions, hence their complexity can be significantly reduced. Pipeline banyan can give a close to 100% maximum throughput and can deliver packets in a sequential order. Through analysis and simulation, the authors show that pipeline banyan has a better throughput and packet loss performance when compared with other banyan-type switch architectures.>
P. C. Wong, M. S. Yeung
IEEE/ACM Trans. Netw.2