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

Koling Chang

dblp:40/3721 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none

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

Computer networks · 2 · 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
2 papers
Transport protocols and congestion control · 80% Internet architecture and protocols · 10% Network performance modeling · 10%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › file systems › distributed file system
network file system
0.011997
NFS Dynamics Over Flow-Controlled Wide Area Networks · INFOCOM 1997
Transport protocols and congestion control › flow control
credit-based flow control
0.011995
Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks · INFOCOM 1995
Transport protocols and congestion control
flow control
0.011995
Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks · INFOCOM 1995
Internet architecture and protocols › buffer management
buffer sizing
0.011995
Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks · INFOCOM 1995
Network performance modeling
round trip time
0.011995
Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks · INFOCOM 1995

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

performance measurement · 0.0simulation · 0.0analysis · 0.0
YearPublicationVenuePosition
1997 NFS Dynamics Over Flow-Controlled Wide Area Networks
abstract
The network file system protocol (NFS) has been the leading distributed file system for workstations since it was first introduced by Sun Microsystems in 1986. The geographical scale of NFS has been limited to the local area due to its relatively low performance on the wide area Internet. However, with the advent of high bandwidth wide area networks such as ATM, NFS over WANs may become more promising. In this paper, the performance of NFS over various sizes of WAN is studied The effects of ATM flow-control and queueing strategies on NFS are discussed, as are the performance of TCP and UDP as NFS transport protocols. The primary conclusion is that standard NFS over UDP works well over ATM WANs as long as ATM-level flow control keeps the cell loss rate under one percent. In some cases, NFS over TCP works badly with small packets due to unfortunate interactions with TCP's congestion window.
Koling Chang, Robert Morris 0005, H. T. Kung 0001
INFOCOM1
1995 Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks
abstract
In credit-based flow control for ATM networks, a buffer is first allocated to each VC (virtual circuit) and then credit control is applied to the VC for avoiding possible buffer overflow. Receiver-oriented, adaptive buffer allocation allows a receiver to allocate its buffer dynamically, to VCs from multiple upstream nodes based on their bandwidth usage. The paper describes, in detail, such an adaptive algorithm capable of supporting a wide range of link speeds and propagation delays, and also packing multiple allocation and credit records in a single message. Analysis and simulation results show that even under highly bursty traffic, the adaptive scheme guarantees no cell loss due to congestion, and achieves excellent performance in utilization, fairness, ramp-up and packing, while requiring only relatively small node memory and bandwidth overhead. The required memory need only be 4*RTT+2*N, where RTT is the link round-trip time in cell cycles and N is the number of VCs.
H. T. Kung 0001, Koling Chang
INFOCOM2