TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On achievable service differentiation with token bucket marking for TCP
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242
Integrated Admission Control for Streaming and Elastic Traffic
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Traffic Handling in AQUILA QoS IP Network
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Performance evaluation of TCP connections in ideal and non-ideal network environments
Computer Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
The paper describes a new admission control (AC) algorithm for greedy TCP connections. The algorithm has passed positive tests in pre-production QoS IP network [2], developed inside European IST project AQUILA network. The algorithm operates per single TCP flow and it assumes the setting of advertised receiver TCP window size for maintaining ideal TCP behaviour (no packet losses). The QoS objective is to guarantee the requested bit rate, say Rreq, a user demands from the network. Furthermore, on the basis of the Rreq and information about round trip time (RTT), the user request is mapped into the form of single token bucket parameters, i.e. token accumulating rate (R) and bucket size (BS), constituting input parameters for AC decision. For admitted TCP connection the Rreq is guaranteed, even if running connections differ in Rreq and RTTmin- Included simulation results confirm the efficiency of the algorithm.