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

Pruttipong Apivatanagul

dblp:20/8707 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—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 optimization and economics · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation › bandwidth allocation
bandwidth partitioning
0.112010
A recursive algorithm for bandwidth partitioning · IEEE Trans. Commun. 2010
Network optimization and economics
resource allocation
0.112010
A recursive algorithm for bandwidth partitioning · IEEE Trans. Commun. 2010

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

recursive algorithm · 0.1dynamic programming · 0.1
YearPublicationVenuePosition
2010 A recursive algorithm for bandwidth partitioning
abstract
We consider complete partitioning of bandwidth among multiple services. When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches.
Scott Jordan 0001, Sam Charrington, Pruttipong Apivatanagul
IEEE Trans. Commun.3