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.

K. David Lin

dblp:12/933 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Computer networks · 3

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
Network performance modeling · 33% Network optimization and economics · 33% Internet architecture and protocols · 20%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
queueing analysis
0.021993
A Burst-Level Adaptive Input-Rate Flow Control Scheme for ATM Networks · INFOCOM 1993
Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks · INFOCOM 1991
Network optimization and economics
resource allocation
0.021993
A Burst-Level Adaptive Input-Rate Flow Control Scheme for ATM Networks · INFOCOM 1993
Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks · INFOCOM 1991
Transport protocols and congestion control
rate-based flow control
0.011991
Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks · INFOCOM 1991
Internet architecture and protocols
ATM networks
0.021993
A Burst-Level Adaptive Input-Rate Flow Control Scheme for ATM Networks · INFOCOM 1993
Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks · INFOCOM 1991
Internet architecture and protocols › traffic management
traffic control
0.021993
A Burst-Level Adaptive Input-Rate Flow Control Scheme for ATM Networks · INFOCOM 1993
Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks · INFOCOM 1991

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

queueing model · 0.0analytical modeling · 0.0simulation · 0.0numerical analysis · 0.0
YearPublicationVenuePosition
1994 Input Rate Flow Control for High-Speed Communication Networks: Blocking and Delay at the Access Points
Izhak Rubin, K. David Lin
Comput. Networks ISDN Syst.2
1993 A Burst-Level Adaptive Input-Rate Flow Control Scheme for ATM Networks
abstract
An input rate flow control mechanism, the burst level feedback scheme, is introduced and studied. Burst level information is used to gain performance improvement. An analytical methodology, based on queuing models, is presented for the analysis and performance evaluation of this scheme. Performance results are shown to illustrate the features of the analytical technique and to demonstrate the performance improvement obtained by the scheme. This input rate control method is shown to be effective for traffic regulation at the access to an asynchronous transfer mode (ATM) network loaded by highly bursty stations. The analytical tools developed allow the system designer to evaluate the proper level of input regulation that should be used to guarantee acceptable queue-size and delay levels at the source station's buffer and at the buffer of the shared network switch.>
Izhak Rubin, K. David Lin
INFOCOM2
1991 Queueing Behavior Under Flow Control at the Subscriber-to-Network Interface for High Speed Metropolitan Area Networks
abstract
A credit manager algorithm (CMA) is introduced and used to control the flow of packets between a subscriber station (or a local area network) and the access to a high-speed metropolitan area network. The parameters of the algorithm are used to regulate the mean throughput and the level of burstiness at the subscriber-to-network interface (SNI). Simulation results are presented for the average system size at the SNI, representing the packet delays at the sender's buffer. The regulated output traffic across the SNI is statistically characterized by categorizing its states into three modes; idle, burst, and restricted modes. Presented also is a model for the queueing behavior of an asynchronous transfer mode (ATM)-type system, where single segment packets (cells) are served. A numerical method is used to solve for the underlying system state probabilities.>
Izhak Rubin, K. David Lin
INFOCOM2