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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Joel E. Cohen

dblp:02/346 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
0000-0002-9746-6725ORCID · corroborated

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

Computer networks · 1 · 1 first-authorTheory of computation · 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
1 paper
Network performance modeling · 50% Network optimization and economics · 50%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › game theory › routing game
braess paradox		 0.011997
Congestion resulting from increased capacity in single-server queueing networks · IEEE/ACM Trans. Netw. 1997
Network performance modeling
queueing network model		 0.011997
Congestion resulting from increased capacity in single-server queueing networks · IEEE/ACM Trans. Netw. 1997

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

queueing theory · 0.0
YearPublicationVenuePosition
1997 Congestion resulting from increased capacity in single-server queueing networks
abstract
In many networks for traffic and telecommunications, minimizing delays from entry to exit is a major concern of users. In user-optimal routing, each user chooses a path to minimize delay from entry to exit, given the existing paths chosen by all other users. Under user-optimal routing, at equilibrium all users experience the same delay. Many networks, especially data networks, are commonly modeled as networks of single-server queues. We report examples of single-server queueing networks with user-optimal routing in which adding servers or increasing the capacity of existing servers worsens the delay experienced by all users.
Joel E. Cohen, Clark Jeffries
 IEEE/ACM Trans. Netw.1
1988 Threshold phenomena in random structures
Joel E. Cohen
 Discret. Appl. Math.1