Towards a versatile transport protocol
Article No.: 21, Pages 1 - 2
Abstract
In the context of a reconfigurable transport protocol, this paper introduces two protocol instances based on the composition and specialisation of the TFRC congestion control and Selective Acknowledgment mechanisms. The two resulting transport architectures lead respectively to the QTPAF protocol, specifically designed to operate over QoS-enabled networks and the QTPlight protocol, specifically designed for resource-limited end systems connected to powerful servers. QTPAF combines QoS-aware TFRC congestion control with full reliability to provide a transport service similar to TCP but additionally taking into account network-level bandwidth reservations. QTPlight proposes a modification of TFRC that shifts from the receiver to the sender the complexity of the loss rate estimation mechanism. This modification allows to alleviate the processing and communication load of "light" resource limited mobile receivers. We present the concept of these protocols and their adaptation in the EuQoS European project framework.
References
[1]
A. Leiggener and R. Schmitz and A. Festag and L. Eggert and W. Effelsberg. Analysis of Path Characteristics and Transport Protocol Design in Vehicular Ad Hoc Networks. In In Proceedings of the 63. IEEE Semiannual Vehicular Technology Conference, May 2006.
[2]
XiaoLin Chang and Jogesh K. Muppala. On improving bandwidth assurance in AF-based DiffServ networks using a control theoric approach. "Computer Networks", 49(6):816--839, March 2005.
[3]
M. Georg and S. Gorinsky. Protecting TFRC from a Selfish Receiver. In Proc. of Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (ICAS/ICNS 2005), October 2005.
[4]
M. Handley, S. Floyd, J. Pahdye, and J. Widmer. TCP Friendly Rate Control (TFRC): Protocol Specification. Request For Comments 3448, IETF, January 2003.
[5]
Emmanuel Lochin, Laurent Dairaine, and Guillaume Jourjon. Guaranteed TCP Friendly Rate Control (gTFRC) for DiffServ/AF Network. Internet Draft draft-lochin-ietf-tsvwg-gtfrc-02, IETF, August 2006.
[6]
M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgment Options. Request For Comments 2018, IETF, October 1996.
[7]
Mohamed A. El-Gendy and Kang G. Shin. Equation-Based Packet Marking for Assured Forwarding Services. In Proc. of IEEE INFOCOM, 2002.
[8]
N. Seddigh, B. Nandy, and P. Pieda. Bandwidth Assurance Issues for TCP Flows in a Differentiated Services Network. In Proc. of IEEE GLOBECOM, page 6, Rio De Janeiro, Brazil, December 1999.
[9]
Sarah Sharafkandi and Naceur Malouch. Simple and Effective End-to-End Approach to Increase TCP Throughput over Ad-hoc Networks. In The 19th International Teletraffic Congress, August 2005.
Index Terms
- Towards a versatile transport protocol
Recommendations
Design, implementation and evaluation of a QoS-aware transport protocol
In the context of a reconfigurable transport protocol framework, we propose a QoS-aware Transport Protocol (QSTP), specifically designed to operate over QoS-enabled networks with bandwidth guarantee. QSTP combines QoS-aware TFRC congestion control ...
RELD, RTT ECN Loss Differentiation to optimize the performance of transport protocols on wireless networks
One major yet unsolved problem in wired-cum-wireless networks is the classification of losses, which might result from wireless temporary interferences or from network congestion. The transport protocol response to losses should be different for these ...
Fast selective ACK scheme for throughput enhancement of multi-homed SCTP hosts
This Letter proposes a fast selective ACK scheme for Stream Control Transmission Protocol (SCTP) to enhance transmission throughput in multi-homing scenarios. In the proposed scheme, a multi-homed receiver sends SACK chunks to the sender over the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2006 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Fundacao para a Ciencia e Tecnologia
- Associacao de Turismo de Lisboa
- SIGCOMM: ACM Special Interest Group on Data Communication
- Microsoft: Microsoft
- Intel: Intel
- ISCTE
- Thomson
- CISCO
- Camara Municipal de Lisboa
- E-Next
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 December 2006
Check for updates
Author Tags
Qualifiers
- Poster
Acceptance Rates
Overall Acceptance Rate 198 of 789 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 93Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in