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

David X. Chen

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

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

Computer networks · 5 · 5 first-author

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
4 papers
Routing and switching · 57% Internet architecture and protocols · 23% Network performance modeling · 21%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Interconnection networks and networks-on-chip · 57% Performance modeling and evaluation · 42%

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

TopicWeightPapersLastEvidence papers
Routing and switching
packet switching
0.031994
Multicasting in the SCOQ Switch · INFOCOM 1994
A Buffer Management Scheme for the SCOQ Switch Under Nonuniform Traffic Loading · INFOCOM 1992
SCOQ: A Fast Packet Switch with Shared Concentration and Output Queueing · INFOCOM 1991
Internet architecture and protocols
buffer management
0.021994
A buffer management scheme for the SCOQ switch under nonuniform traffic loading · IEEE Trans. Commun. 1994
A Buffer Management Scheme for the SCOQ Switch Under Nonuniform Traffic Loading · INFOCOM 1992
Routing and switching › switching networks
copy network
0.011994
Multicasting in the SCOQ Switch · INFOCOM 1994
Routing and switching › switching networks
multicast switching
0.011994
Multicasting in the SCOQ Switch · INFOCOM 1994
Routing and switching
packet switch
0.011994
A buffer management scheme for the SCOQ switch under nonuniform traffic loading · IEEE Trans. Commun. 1994
Interconnection networks and networks-on-chip › switch architecture
output queuing
0.011993
SCOQ a fast packet switch with shared concentration and output queueing · IEEE/ACM Trans. Netw. 1993
Interconnection networks and networks-on-chip › switch architecture
packet switch architecture
0.011993
SCOQ a fast packet switch with shared concentration and output queueing · IEEE/ACM Trans. Netw. 1993
Performance modeling and evaluation
queueing analysis
0.011993
SCOQ a fast packet switch with shared concentration and output queueing · IEEE/ACM Trans. Netw. 1993
Network performance modeling › network performance analysis
packet loss and delay analysis
0.011991
SCOQ: A Fast Packet Switch with Shared Concentration and Output Queueing · INFOCOM 1991
Network performance modeling
switch performance analysis
0.011991
SCOQ: A Fast Packet Switch with Shared Concentration and Output Queueing · INFOCOM 1991
Routing and switching › switch architecture
batcher-banyan switch
0.011994
A buffer management scheme for the SCOQ switch under nonuniform traffic loading · IEEE Trans. Commun. 1994
Performance modeling and evaluation
queueing models
0.011994
A buffer management scheme for the SCOQ switch under nonuniform traffic loading · IEEE Trans. Commun. 1994

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

queueing analysis · 0.0simulation · 0.0numerical evaluation · 0.0switch architecture design · 0.0queueing model · 0.0
YearPublicationVenuePosition
1994 Multicasting in the SCOQ Switch
abstract
SCOQ, a high performance fast packet switch with shared concentration and output queueing supports, point-to-point transmissions only. The incorporation of multicast (point-to-multipoint) functions require packet duplications. If the copy network were placed on the feedforward path of the switch, it is not transparent to, and can interfere with, point-to-point switching. By placing the copy network in the feedback position, its operation can be made transparent to the point-to-point information transfer. The copy network incorporated onto the SCOQ switch is non-blocking even without an arbitration or selection network. Contrary to the feedforward approach in which the input buffers must be centrally controlled, with the copy network in the feedback loop, the input buffers all operate independent of each other.>
David X. Chen, Jon W. Mark
INFOCOM1
1994 A buffer management scheme for the SCOQ switch under nonuniform traffic loading
abstract
The SCOQ switch is a Batcher-banyan based high performance fast packet switch with shared concentration and output queueing, with a maximum of L(>
David X. Chen, Jon W. Mark
IEEE Trans. Commun.1
1993 SCOQ a fast packet switch with shared concentration and output queueing
abstract
A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of the equilibrium queue length and waiting time, throughput, and buffer overflow probability. Numerical results indicate that the switch exhibits very good delay-throughput performance over a wide range of input traffic. The switch compares favorably with some previously proposed switches in terms of fewer basic building elements used to attain the same degree of output buffering.>
David X. Chen, Jon W. Mark
IEEE/ACM Trans. Netw.1
1992 A Buffer Management Scheme for the SCOQ Switch Under Nonuniform Traffic Loading
abstract
The SCOQ switch is a Batcher-banyan-based high-performance fast packet switch with shared concentration and output queuing, with a maximum of L(>
David X. Chen, Jon W. Mark
INFOCOM1
1991 SCOQ: A Fast Packet Switch with Shared Concentration and Output Queueing
abstract
A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of the equilibrium queue length and waiting time, throughput, and buffer overflow probability. Numerical results indicate that the proposed switch exhibits very good delay-throughput performance over a wide range of input traffic. The proposed switch compares favorably with the knockout switch of Y. Yeh et al. (1987) in terms of implementation complexity and packet concentration performance, and with the sunshine switch of J. Giacopelli et al. (1989) and the modular architecture proposed by T. Lee (1990) in terms of fewer basic building elements used to attain the same degree of output buffering.>
David X. Chen, Jon W. Mark
INFOCOM1