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.

Wenge Ren

dblp:85/6682 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 5 · 4 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 · 39% Transport protocols and congestion control · 30% Routing and switching · 30%

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

TopicWeightPapersLastEvidence papers
Routing and switching › switch buffer management
early packet discard
0.011997
Improved virtual queueing and dynamic EPD techniques for TCP over ATM · ICNP 1997
Internet architecture and protocols
quality of service
0.011997
Improved virtual queueing and dynamic EPD techniques for TCP over ATM · ICNP 1997
Transport protocols and congestion control › TCP
TCP over ATM
0.011997
Improved virtual queueing and dynamic EPD techniques for TCP over ATM · ICNP 1997
Internet architecture and protocols
ATM networks
0.011997
Improved virtual queueing and dynamic EPD techniques for TCP over ATM · ICNP 1997

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

simulation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1999 Excess buffer requirement for EPD schemes in ATM networks
Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki
Comput. Commun.1
1998 Meltipoint-to-Multipoint ABR Service in ATM
Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki, Masayuki Shinohara
Comput. Networks1
1998 Performance of TCP in IP/ATM internetworks
Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki, Gopalakrishnan Ramamurthy
Comput. Commun.1
1997 Multipoint-to-Point ABR Service in ATM Networks
abstract
Efficient support for scalable multipoint-to-multipoint (mpt-mpt) communication in ATM has recently become a hot topic of discussion at the ATM Forum. Previously, we presented a new class of efficient switch algorithms for point-to-multipoint (pt-mpt) ABR service that deliver high performance in terms of fairness and link utilization and are significantly simpler to implement than other proposed protocols. However, the more challenging problem of providing bidirectional mpt-mpt ABR service has not been addressed before. While a number of key issues have been resolved in unidirectional pt-mpt ABR service, no satisfactory solution for multipoint-point (mpt-pt) ABR service is known. In this paper, we propose new efficient mpt-pt ABR mechanisms that can interoperate with existing standards for ABR service and provide a truly transparent and scalable solution to multipoint communication in ATM. We present simulation results to illustrate that our proposed ABR schemes provide high link utilization and fair bandwidth allocation in a mpt-pt connection for heterogeneous sources with different data rates.
Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki
ICC (3)1
1997 Improved virtual queueing and dynamic EPD techniques for TCP over ATM
abstract
It is known that TCP throughput can degrade significantly over UBR service in a congested ATM network, and the early packet discard (EPD) technique has been proposed to improve the performance. However, recent studies show that EPD cannot ensure fairness among competing VCs in a congested network, but the degree of fairness can be improved using various forms of fair buffer allocation techniques. Based upon the work by H.Y. Tzeng and K.Y. Siu (1996), we propose an improved scheme that utilizes only a single shared FIFO queue for all VCs and admits simple implementation for high speed ATM networks. Our scheme achieves nearly perfect fairness of throughput among multiple TCP connections, comparable to the expensive per-VC queuing technique. Analytical and simulation results are presented to show the validity of this new scheme and significant improvement in performance as compared with existing fair buffer allocation techniques for TCP over ATM.
Kai-Yeung Siu, Wenge Ren
ICNP3