Allocating network resources by weight between TCP traffics

DOI10.1007/BF02948892MaRDI QIDQ1429446zbMATH OpenFDO

Authors ChangBiao Xu, Shizhong Yang, Keping Long

Publication date 18 May 2004

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02948892

zbMATH Keywords

additive-increase multiplicative-decrease (AIMD)congestion controltransmission control protocol (TCP)weighted resource allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• TCP is competitive with resource augmentation
• TCP-friendly congestion control mechanism based on adaptive weighted average
• scientific article; zbMATH DE number 2043508
• scientific article; zbMATH DE number 2088552
• Resource pricing and the evolution of congestion control

Cites work

• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Cited in

(5)

• A comparison of congestion control and time slot algorithms in Internet transmission performance
• Explicit TCP window adaptation in a shared memory architecture
• scientific article; zbMATH DE number 2043508 (Why is no real title available?)
• scientific article; zbMATH DE number 2088134 (Why is no real title available?)
• TCP is competitive with resource augmentation

This page was built for publication: Allocating network resources by weight between TCP traffics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429446)