Host-to-host congestion control for TCP

A Afanasyev, N Tilley, P Reiher… - … surveys & tutorials, 2010 - ieeexplore.ieee.org
The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the
Internet depends to a great extent on how well TCP works. Performance characteristics of a …

[PDF][PDF] A quantitative measure of fairness and discrimination

RK Jain, DMW Chiu, WR Hawe - Eastern Research Laboratory …, 1984 - ocw.cs.pub.ro
Fairness is an important performance criterion in all resource allocation schemes, including
those in distributed computer systems. However, it is often specified only mmmmmmmmmS …

Analysis and simulation of a fair queueing algorithm

A Demers, S Keshav, S Shenker - ACM SIGCOMM Computer …, 1989 - dl.acm.org
We discuss gateway queueing algorithms and their role in controlling congestion in
datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is …

On patient flow in hospitals: A data-based queueing-science perspective

M Armony, S Israelit, A Mandelbaum… - Stochastic …, 2015 - pubsonline.informs.org
Hospitals are complex systems with essential societal benefits and huge mounting costs.
These costs are exacerbated by inefficiencies in hospital processes, which are often …

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

A Orda, R Rom - Journal of the ACM (JACM), 1990 - dl.acm.org
In this paper the shortest-path problem in networks in which the delay (or weight) of the
edges changes with time according to arbitrary functions is considered. Algorithms for …

Congestion control for high speed packet switched networks

K Bala, I Cidon, K Sohraby - IEEE INFOCOM'90, 1990 - computer.org
The authors suggest and investigate a general input congestion control scheme that takes
into account a broad spectrum of network issues. As a preventive congestion control …

Round-robin scheduling for max-min fairness in data networks

EL Hahne - IEEE Journal on Selected Areas in communications, 1991 - ieeexplore.ieee.org
The author studies a simple strategy, proposed independently by EL Hahne and RG
Gallager (1986) and MGH Katevenis (1987), for fairly allocating link capacity in a point-to …

Bottleneck flow control

J Jaffe - IEEE Transactions on Communications, 1981 - ieeexplore.ieee.org
The problem of optimally choosing message rates for users of a store-and-forward network
is analyzed. Multiple users sharing the links of the network each attempt to adjust their …

Optimal control of admission to a queueing system

S Stidham - IEEE Transactions on Automatic Control, 1985 - ieeexplore.ieee.org
Congestion in a queueing system can sometimes be controlled by restricting arrivals, either
by" closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) …

CONNECT: re-examining conventional wisdom for designing nocs in the context of FPGAs

MK Papamichael, JC Hoe - Proceedings of the ACM/SIGDA international …, 2012 - dl.acm.org
An FPGA is a peculiar hardware realization substrate in terms of the relative speed and cost
of logic vs. wires vs. memory. In this paper, we present a Network-on-Chip (NoC) design …