SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Simultaneous analysis of flow and error control strategies with congestion-dependent errors
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Loss-load curves: support for rate-based congestion control in high-speed datagram networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Characteristics of wide-area TCP/IP conversations
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Minimizing round-trip times for high-performance transport communication
Minimizing round-trip times for high-performance transport communication
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Image transfer: an end-to-end design
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Dynamic bandwidth allocation using loss-load curves
IEEE/ACM Transactions on Networking (TON)
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
Loss-load curves are a recently proposed feedback mechanism for rate-based congestion control in datagram computer networks. In the loss-load model, packet loss inside the network is a direct function of sender transmission rates, and senders have the responsibility of choosing their own transmission rate based on the loss-load tradeoff curve provided by the network. Earlier work has provided the mathematical basis for the loss-load model and provided preliminary simulation results demonstrating its responsiveness, fairness, and stability. The loss-load model works well for simple network environments where each source has many packets to transmit, and wishes to maximize raw throughput.In this paper, the applicability of loss-load curves is extended to senders with more general network traffic requirements, such as file transfer activities. In particular, the paper considers senders wishing to minimize the response time for a transfer of N packets. When N is small, a sender chooses a low transmission rate, to minimize the probability of packet loss. When N is large, a higher transmission rate is chosen to increase raw throughput. The loss-load curve mechanism provides necessary and sufficient information for senders at the edges of the network to choose a proper transmission rate based on their traffic requirements and the current network load.Simulation results show that the loss-load mechanism is effective in achieving high network utilization and minimizing response time for file transfers. The loss-load model also does a good job of providing equitable service to senders with different traffic workloads and different round trip times.