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

Chang Su 0007

dblp:07/2757-7 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—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
Network performance modeling · 77% Network optimization and economics · 23%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
queueing network model		 0.012003
Target-Pursuing Policies for Open Multiclass Queueing Networks · INFOCOM 2003

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

parametric policy design · 0.0numerical evaluation · 0.0
YearPublicationVenuePosition
2003 Target-Pursuing Policies for Open Multiclass Queueing Networks
abstract
A new parametric class of scheduling and routing policies for open multiclass queueing networks is proposed. We establish their stability and show they are amenable to distributed implementation using localized state information. We exploit our earlier work in (Ref.1) to select appropriate parameter values and outline how optimal parameter values can be computed. We report numerical results indicating that we obtain near-optimal policies (when the optimal can be computed) and significantly outperform heuristic alternatives.
Ioannis Paschalidis, Chang Su 0007, Michael C. Caramanis
 INFOCOM2