Change search
ReferencesLink to record
Permanent link

Direct link
TCP/IP technology for modern network environments
2008 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

To facilitate the merging of wireless access technologies and the traditional Internet, the core protocols for data communication should be robust and have low overhead. In this thesis, we propose refinements to the Transmission Control Protocol (TCP) that improve its cost efficiency over wireless links.TCP is unable to distinguish between congestion and error induced losses, reordered, or delayed segments. A reordering robust TCP would make it possible to simplify network elements, now performing explicit actions to prevent reordering, and open up for deployment of new technologies that naturally cause reordering. We propose TCP-Aix; a set of TCP modifications that improves the robustness of TCP to reordering and delay spikes. TCP-Aix decouples loss recovery and congestion control actions. We also present an algorithm called the winthresh algorithm for computing a duplicate acknowledgment threshold based on TCP buffer space and current send window size. The results show that TCP-Aix with the winthresh algorithm is able to maintain almost constant performance even in scenarios frequently displaying long reordering durations. It is also fair towards competing standards-compliant TCP flows.In wireless networks, where the links out of efficiency constraints are more error prone than wired links, the error and the reordering sensitivity of TCP have motivated link layer protocols that perform retransmissions and enforce in-order delivery. We investigate the potential gains of using a reordering robust TCP, like TCP-Aix, with a wireless link layer that allows out-of-order delivery, compared to using in-order delivery with a standardscompliant TCP. We found that the smoothness of TCP is strongly affected by the link layer configuration. In-order delivery leads to burstier traffic and larger network layer buffering needs, than out-of-order delivery and TCP-Aix. The interference and power consumption in foremost wireless networks make it important to reduce the communication overhead. The TCP receiver acknowledges each or every second segment. We study how to reduce the acknowledgment frequency while preserving throughput performance also in wireline networks where frequent acknowledgments generally are not problematic. To preserve throughput, the sender should use byte counting and be involved in determining the acknowledgment frequency. The results show that acknowledging four segments per send window is sufficient to maintain throughput performance also in wireline scenarios. This indicates that a lower acknowledgment frequency than provided through the delayed acknowledgment algorithm is possible today for general usage.A key service to the successful merging of traditional Internet technology and wireless cellular networks is Voice over IP (VoIP). Channels to be shared by both VoIP and TCP-based traffic is being considered for wireless cellular systems. It is challenging to provide VoIP over a shared wireless cellular channel, because VoIP is a low bitrate service with high demands on channel availability to bound the delay. The scheduling algorithm, controlling access to the channel, is central to achieve efficiency as well as to satisfy user demands. We study how a scheduler for a mix of VoIP and interactive (TCP-based) traffic should be designed for High Speed Downlink Packet Access (HSDPA). In particular, we find that slowly increasing the priority of a VoIP session relative TCP-based services is important to take advantage of the varying network conditions.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2008. , 136 p.
Doctoral thesis / Luleå University of Technology 1 jan 1997 → …, ISSN 1402-1544 ; 2008:30
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-25736Local ID: ae3b7ec0-2640-11dd-9e62-000ea68e967bOAI: diva2:998891
Godkänd; 2008; 20080520 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(1446 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 1446 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Landström, Sara

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link