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

Chao-Li Tarng

dblp:89/1303 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 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
2 papers
Internet architecture and protocols · 70% Routing and switching · 30%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 87% Performance modeling and evaluation · 13%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
protocol design
0.011993
An Inproved Method for Constructing Multiphase Communications Protocols · IEEE Trans. Computers 1993
Routing and switching › switching networks
copy network
0.011991
A High Performance Copy Network for B-ISDN · INFOCOM 1991
Internet architecture and protocols
multicast
0.011991
A High Performance Copy Network for B-ISDN · INFOCOM 1991
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
banyan network
0.011991
A High Performance Copy Network for B-ISDN · INFOCOM 1991
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011991
A High Performance Copy Network for B-ISDN · INFOCOM 1991
Performance modeling and evaluation
analytical modeling
0.011991
A High Performance Copy Network for B-ISDN · INFOCOM 1991

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

simulation · 0.0markov chain · 0.0branching process · 0.0
YearPublicationVenuePosition
1993 An Inproved Method for Constructing Multiphase Communications Protocols
abstract
An extension to an existing method for building multiphase protocols is presented. One of the limitations of the former method is a stringent restriction on the validity of phases. Consequently, the protocols built by this method must run in a noiseless environment or rely on other protocols for reliable transport. Another restriction is a rigid requirement on the selection of the points that connect different phases. The presented method either minimizes or eliminates the above restrictions. It enables a multiphase protocol to deal with message corruption and loss, and provides a less restrictive way for phase connection. It also maintains the advantages of the existing method in allowing a multiphase protocol to be constructed in an easy and modular way.>
Huai-An Lin, Chao-Li Tarng
IEEE Trans. Computers2
1991 A High Performance Copy Network for B-ISDN
abstract
A high-performance copy network, which supports multicast fast packet switching in the broadband integrated services digital network (B-ISDN), is proposed. The network uses a banyan multistage interconnection network (MIN) with speedup and requires no intermediate buffering. It has been recognized that the copying process is, in general, a difficult one. Two important design issues, namely, obtaining multiple copies of packets and assigning destination addresses of the copies, are pursued. A solution to these issues by developing a novel two-phase copying process is presented. An analytical performance model with a special structure of Markov chains, called a branching process, is formulated. Numerical results using this model for a constant number of copies as well as for a geometrically distributed number of copies show that the proposed copy network achieves very low packet blocking probability. Simulation results are provided to confirm the analytical model.>
Chao-Li Tarng, James S. Meditch
INFOCOM1