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

C. J. May

dblp:56/4732 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—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
Transport protocols and congestion control · 61% Internet architecture and protocols · 39%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › broadband network
broadband packet networks
0.011991
Congestion Avoidance Strategies in Broadband Packet Networks · INFOCOM 1991
Transport protocols and congestion control › TCP congestion control
congestion avoidance
0.011991
Congestion Avoidance Strategies in Broadband Packet Networks · INFOCOM 1991
Transport protocols and congestion control
rate control
0.011991
Congestion Avoidance Strategies in Broadband Packet Networks · INFOCOM 1991
Internet architecture and protocols
packet scheduling
0.011991
Congestion Avoidance Strategies in Broadband Packet Networks · INFOCOM 1991

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

simulation · 0.0queueing model · 0.0
YearPublicationVenuePosition
1991 Congestion Avoidance Strategies in Broadband Packet Networks
abstract
The authors examine the networking environment of the future, pose the technical questions that need to be addressed to provide service assurance, and propose a set of strategies for congestion avoidance. Congestion avoidance is recommended instead of congestion control, which has very limited value in a high-speed network, where the latency in detecting congestion and reacting to it may make the control ineffective. The proposed solution consists of enforcing rate-control at the network edges, bandwidth reservation for continuous bit oriented (CBO) traffic using a unique two-queue strategy, and a scheduler-based packet cross-connect system. Simulation results of a Q+ model of an access node are presented that quantify the performance of this solution and compare it to existing congestion control mechanisms. The results demonstrate that it is possible to meet the differing needs of traffic types needing datagram transport and those needing virtual-circuit transport by using an intelligent scheduling strategy and a meaningful packet transport protocol.>
Rajiv S. Dighe, C. J. May, Gopalakrishnan Ramamurthy
INFOCOM2