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

Xia-ping Qiu

dblp:21/7022 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—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 · 75% Internet architecture and protocols · 25%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation › bandwidth allocation
dynamic bandwidth allocation
0.011988
Dynamic bandwidth allocation in a network · SIGCOMM 1988
Network optimization and economics › resource allocation › bandwidth allocation
fair bandwidth allocation
0.011988
Dynamic bandwidth allocation in a network · SIGCOMM 1988
Internet architecture and protocols
multi-band network
0.011988
Dynamic bandwidth allocation in a network · SIGCOMM 1988
Network optimization and economics
resource allocation
0.011988
Dynamic bandwidth allocation in a network · SIGCOMM 1988

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

simulation · 0.0distributed algorithm · 0.0
YearPublicationVenuePosition
1988 Dynamic bandwidth allocation in a network
abstract
Recently protocols have been introduced which enable us to integrate periodic traffic (voice or video) and aperiodic traffic (data) and to extend the size of local area networks without any loss in speed and capacity. One of these, the DRAMA protocol, is based on broadband technology and allows for dynamic allocation of bandwidth to clusters of nodes in the total network. In this paper we propose a distributed algorithm to allocate bandwidth in a fair manner, where we have defined fair to mean that every node in the network, regardless of its location, should have the same expected access delay to the net. We show by means of simulation that the algorithm is stable and within a few percentage points of the optimal solution. Stability is measured in terms of the time it takes the system to return to near optimal distribution of the bandwidth after strong disturbances. The algorithm is shown to handle total reallocation of the resources within O(100ms).
Kurt Maly, C. Michael Overstreet, Xia-ping Qiu, Deqing Tang
SIGCOMM3