Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Computing | en_US |
| dc.creator | Ng, Ping-wing | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3116 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | An empirical study of TCP's fairness | en_US |
| dcterms.abstract | It has been reported that TCP connection discriminates against long round trip times with regards to the throughput. The cause of the unfairness is the "slow start" and "congestion avoidance" algorithms used by TCP, which result in unfair bandwidth allocation when multiple connections with different round trip times share a congested gateway. This fairness problem is particularly severe for networks with long round trip delay. An experimental approach is used in this project to identify this fairness problem. To solve this problem, two algorithms have been proposed by some researchers. These algorithms, termed as the "linear rate policy" and "constant rate policy", have been implemented and studied. The result is that these algorithms solve the problem to a certain extent but with some shortcomings. During the experiment, a new factor is discovered based on the measurement data. This finding reveals that there is a positive correlation between the round trip time and the congestion window during the congestion phase. Based on this finding, a new algorithm is then devised and implemented to address this problem together with experimental measurements of how well this algorithm performs. Judging from the measured result, it is found that the "linear rate policy" and "constant rate policy" suffer from a fundamental disadvantage of inducing more congestion during the congestion phase. Hence additional insight about the nature of congestion is gained from the measurements. The new algorithm is found to be very promising because it do not suffer from the mentioned fundamental disadvantage in addition to its capability to restore fairness. This sheds light on future improvement and implementation of TCP, and there is plenty of rooms for future work. | en_US |
| dcterms.extent | viii, 76 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1999 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | TCP/IP (Computer network protocol) | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14792771.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.76 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3116