A network scheme for TCP elastic traffic with admission control using edge-to-edge per-aggregate measurements in class-based networks

Authors:
Lluís Fàbrega;Teodor Jové;Pere Vilà;José L. Marzo
Affiliations:
Institute of Informatics and Applications, Campus Montilivi, University of Girona, Girona, Spain;Institute of Informatics and Applications, Campus Montilivi, University of Girona, Girona, Spain;Institute of Informatics and Applications, Campus Montilivi, University of Girona, Girona, Spain;Institute of Informatics and Applications, Campus Montilivi, University of Girona, Girona, Spain
Venue:
Journal of High Speed Networks
Year:
2011

Citing 16
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Self-similarity in World Wide Web traffic: evidence and possible causes

IEEE/ACM Transactions on Networking (TON)
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
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242

Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242
Improving the performance of interactive TCP applications using service differentiation

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
The War between Mice and Elephants

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A guaranteed minimum throughput service for TCP flows using measurement-based admission control: Research Articles

International Journal of Communication Systems
Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)

Distributed Systems: Concepts and Design (4th Edition) (International Computer Science)
Throughput Guarantees for TCP Flows in a Network Based on Packet Classes Using Edge-to-Edge Per Flow Measurements

Simulation
Scalable services via egress admission control

IEEE Transactions on Multimedia
Nonintrusive TCP connection admission control for bandwidth management of an Internet access link

IEEE Communications Magazine
Implicit admission control

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a network scheme with Admission Control AC for TCP flows, which can provide different minimum throughputs and isolation between flows. It is built with simple mechanisms without per-flow state, per flow signaling or per-flow processing in the core. The whole scheme uses a small set of packet classes, with a different discarding priority assigned to each one. The AC is implicit, edge-to-edge and based on per-aggregate throughput measurements. The out packets of the aggregation of accepted flows i.e., the packets that correspond to the flows' extra throughput act as a probing flow to test if the throughput in the network path is enough to satisfy the flow's request. Then signaling packets carry the per-aggregate throughput measurement from the egress to the ingress, where the AC decision is made. Through simulation we show that the scheme guarantees the requested minimum throughput to accepted flows and achieves a good utilization of resources.