A packet class-based scheme for providing throughput guarantees to TCP flows

Authors:
Lluís Fàbrega;Teodor Jové;Pere Vilà;José Marzo
Affiliations:
Institute of Informatics and Applications (IIiA), University of Girona, Girona, Spain;Institute of Informatics and Applications (IIiA), University of Girona, Girona, Spain;Institute of Informatics and Applications (IIiA), University of Girona, Girona, Spain;Institute of Informatics and Applications (IIiA), University of Girona, Girona, Spain
Venue:
IPOM'05 Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based Networks
Year:
2005

Citing 9
Cited 0

Congestion avoidance and control

ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Endpoint admission control: architectural issues and performance

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Statistical bandwidth sharing: a study of congestion at flow level

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Throughput guarantees for elastic flows using end-to-end admission control

LANC '03 Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research
Nonintrusive TCP connection admission control for bandwidth management of an Internet access link

IEEE Communications Magazine
Understanding Internet traffic streams: dragonflies and tortoises

IEEE Communications Magazine
Implicit admission control

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

TCP flows generated by applications such as the web or ftp require a minimum network throughput to satisfy users. To build this service, we propose a scheme with Admission Control (AC) using a small set of packet classes in a core-stateless network. At the ingress each flow packet is marked as one of the set of classes, and within the network, each class is assigned a different discarding priority. The AC method is based on edge-to-edge per-flow measurements, and it requires flows to be sent at a minimum rate. The scheme is able to provide different throughput to different flows and protection against non-responsive sources. We evaluate the scheme through simulation in several network topologies with different traffic loads consisting of TCP flows that carry files of varying sizes. In the simulation, TCP uses a new algorithm to keep the short-term sending rate above a minimum value. The results prove that the scheme guarantees the throughput to accepted flows and achieves high utilization of resources, similar to the ideal results of a classical hop-by-hop AC.