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

Sheng-Lin Wu

dblp:03/4780 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 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
Internet architecture and protocols · 87% Network optimization and economics · 13%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › traffic shaping
leaky bucket
0.011996
The token-bank leaky bucket mechanism for group connections in ATM networks · ICNP 1996
Internet architecture and protocols
traffic policing
0.011996
The token-bank leaky bucket mechanism for group connections in ATM networks · ICNP 1996

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

simulation · 0.0
YearPublicationVenuePosition
1996 The token-bank leaky bucket mechanism for group connections in ATM networks
abstract
A well accepted policing mechanism for ATM networks is the leaky bucket mechanism. The original leaky bucket has been shown to be effective for traffic with a constant bit rate, but reacts poorly to bursty traffic. Although there are some other policing mechanisms in the literature that provide improvements over the original leaky bucket, most of them enforce the negotiated parameters for individual source traffic and do not fully utilize the statistical multiplexing of multiple connections. As a result, the bandwidth utilisation is low. Even though some source policing mechanisms have been proposed for group connections, they either fail to explore statistical multiplexing fully or do not provide a scheme to protect well-behaved sources from malicious ones in the group. We propose a new source policing mechanism, called the token-bank leaky bucket, for group connections in ATM networks. The mechanism explores the statistical multiplexing of multiple connections in the group and allows the unused bandwidth to be effectively shared by the connections that need it. In addition, it sets a limit of excessive data cells a source can send in a cycle in order to protect well-behaved sources against malicious sources. It is shown by simulations to have a lower violation probability and better bandwidth utilization even for small group connections when compared to the original leaky bucket with a similar configuration.
Sheng-Lin Wu, Wen-Shyen E. Chen
ICNP1