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

Jeff J. Zhu

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

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

Computer networks · 2 · 2 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
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › link-layer protocols
network access protocols
0.011992
Using Statistical Bandwidth in Token Ring Networks · INFOCOM 1992
Internet architecture and protocols › local area network › ring network
token ring
0.011992
Using Statistical Bandwidth in Token Ring Networks · INFOCOM 1992

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

simulation · 0.0
YearPublicationVenuePosition
1992 Using Statistical Bandwidth in Token Ring Networks
abstract
A new network access protocol, called restricted destination access protocol, for transmitting data packets in token ring networks, is proposed and analyzed. This protocol is based on the existing token passing access protocol and makes use of the extra statistical bandwidth that exists in token ring networks. A transmission capacity of greater than unity can be supported. Simulation results using the protocol in a modified fiber distributed data interface (FDDI) network are included.>
Jeff J. Zhu, Richard T. Denton
INFOCOM1
1990 Hidden transmission: a method to improve the performance of a token ring network
abstract
The statistically available bandwidth in token ring networks is analyzed and a protocol called Hidden Transmission is proposed which will enable a token ring network to give better performance under all load conditions. The analysis shows that for every data packet transmitted, up to 0.7 extra packets can be transmitted in one rotation of the data packet. This unused bandwidth can be used to carry extra data. It is anticipated that an improvement of 50 to 70% in throughput can be achieved with the proposed protocol for a token ring network containing at least two nodes. The changes to current token passing protocols in order to add this feature are discussed.>
Jeff J. Zhu, Richard T. Denton
LCN1