01.03.2013 Views

TCP-PCP: A Transport Control Protocol Based on the Prediction of ...

TCP-PCP: A Transport Control Protocol Based on the Prediction of ...

TCP-PCP: A Transport Control Protocol Based on the Prediction of ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

S1<br />

Si<br />

Sn<br />

100 Mbps<br />

3 ms<br />

R1<br />

20 Mbps<br />

40 ms<br />

R2<br />

10 Mbps<br />

3 ms<br />

Fig. 9: Network topology 3<br />

metric, in which <strong>the</strong> network settings are marked. As shown<br />

in Fig.9, 10 same <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> flows share a 20 Mbps bottleneck<br />

link.<br />

We use Jain’s fairness index to justify <strong>the</strong> fairness <strong>of</strong><br />

<str<strong>on</strong>g>TCP</str<strong>on</strong>g> variants Ref. [14]. Simulati<strong>on</strong> results are summarized in<br />

Table II, which show that all <str<strong>on</strong>g>TCP</str<strong>on</strong>g> variants including <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<br />

<str<strong>on</strong>g>PCP</str<strong>on</strong>g> achieve fairly satisfactory fairness index with different<br />

link losses. Meanwhile, it is shown from Table II that <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<br />

<str<strong>on</strong>g>PCP</str<strong>on</strong>g> still keeps higher throughput than Westwood and Jersey<br />

in this case.<br />

TABLE II: Comparis<strong>on</strong> <strong>of</strong> fairness and throughput<br />

Westwood Jersey <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g><br />

LossRate Thru Fair Thru Fair Thru Fair<br />

(kbps) (-) (kbps) (-) (kbps) (-)<br />

0 1759 0.935 1783 0.962 1795 0.997<br />

0.001 1741 0.998 1757 0.999 1761 0.999<br />

0.005 1612 0.999 1619 1.0 1647 1.0<br />

0.01 1457 0.999 1489 0.998 1532 0.999<br />

D. Friendliness analysis<br />

The experiment <strong>of</strong> friendliness partiti<strong>on</strong>s ten flows into two<br />

parts, <strong>on</strong>e uses <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g>, <strong>the</strong> o<strong>the</strong>r uses <strong>the</strong> traditi<strong>on</strong>al <str<strong>on</strong>g>TCP</str<strong>on</strong>g><br />

protocol, such as Westwood.<br />

Table III gives <strong>the</strong> change <strong>of</strong> average throughput, which is<br />

calculated by summing up <strong>the</strong> throughput <strong>of</strong> <strong>the</strong> same <str<strong>on</strong>g>TCP</str<strong>on</strong>g><br />

variant and divided by <strong>the</strong> number <strong>of</strong> c<strong>on</strong>necti<strong>on</strong>s. It is clear<br />

that <strong>the</strong> bandwidth allocati<strong>on</strong> <strong>of</strong> <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> and Westwood is<br />

close to its fair share without link loss occurring. When <strong>the</strong><br />

link loss rate raises from 0.1% to 1%, <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> achieves<br />

higher throughput than Westwood. The results are according<br />

with that <strong>of</strong> <strong>on</strong>e <str<strong>on</strong>g>TCP</str<strong>on</strong>g> flow. But <strong>the</strong> increase is within a<br />

tolerable range as regard to friendliness performance. It can be<br />

c<strong>on</strong>cluded that <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> can coexist friendly with Westwood.<br />

V. CONCLUSION<br />

In this paper we proposed a novel <str<strong>on</strong>g>Transport</str<strong>on</strong>g> <str<strong>on</strong>g>C<strong>on</strong>trol</str<strong>on</strong>g> <str<strong>on</strong>g>Protocol</str<strong>on</strong>g><br />

based <strong>on</strong> <strong>the</strong> predicti<strong>on</strong> <strong>of</strong> C<strong>on</strong>gesti<strong>on</strong> Probability. It<br />

can improve <str<strong>on</strong>g>TCP</str<strong>on</strong>g> throughput in hybrid networks because <strong>the</strong><br />

sender judges network state by serial ECN feedbacks o<strong>the</strong>r<br />

than single ECN feedback or packet dropping.<br />

Actually, <strong>the</strong> c<strong>on</strong>gesti<strong>on</strong>-aware scheme used in <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g><br />

can be easily extended to existed <str<strong>on</strong>g>TCP</str<strong>on</strong>g> variants. Our next works<br />

focus <strong>on</strong> checking its functi<strong>on</strong> <strong>on</strong> o<strong>the</strong>r <str<strong>on</strong>g>TCP</str<strong>on</strong>g> variants both <strong>on</strong><br />

NS2 simulati<strong>on</strong> and wired/wirelss testbed.<br />

D1<br />

Di<br />

Dn<br />

TABLE III: Friendliness Performance<br />

Loss rate: 0 Loss rate:0.001<br />

Westwood:<str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> Westwood <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> Westwood <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g><br />

(kbps) (kbps) (kbps) (kbps)<br />

3:7 1162.00 1174.85 1161.33 1174.14<br />

5:5 1316.80 1331.40 1312.80 1329.40<br />

7:3 1519.28 1536.66 1511.00 1539.00<br />

Loss rate: 0.005 Loss rate:0.01<br />

Westwood:<str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> Westwood <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g> Westwood <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-<str<strong>on</strong>g>PCP</str<strong>on</strong>g><br />

(kbps) (kbps) (kbps) (kbps)<br />

3:7 1289.66 1314.85 1099.00 1186.57<br />

5:5 1294.80 1319.80 1269.80 1352.2<br />

7:3 1485.28 1508.33 1388.14 1506.00<br />

ACKNOWLEDGEMENT<br />

This work was partially supported by <strong>the</strong> Nati<strong>on</strong>al Natural<br />

Science Foundati<strong>on</strong> <strong>of</strong> China (60673164), Provincial Natural<br />

Science Foundati<strong>on</strong> <strong>of</strong> Hunan (06JJ10009), <strong>the</strong> Specialized<br />

Research Fund for <strong>the</strong> Doctoral Program <strong>of</strong> Higher Educati<strong>on</strong><br />

<strong>of</strong> China (20060533057), Program for New Century Excellent<br />

Talents in University (NCET-05-0683), CityU Strategic<br />

Research Grant No. 7002214.<br />

REFERENCES<br />

[1] T. Nurmela, “Distinguishing between c<strong>on</strong>gesti<strong>on</strong> and corrupti<strong>on</strong> using<br />

end-to-end approaches,” Seminar <strong>on</strong> Selected Topics <strong>on</strong> <str<strong>on</strong>g>Transport</str<strong>on</strong>g> <str<strong>on</strong>g>Protocol</str<strong>on</strong>g>s<br />

for Wireless Internet, 2004.<br />

[2] Gurtov, S. Floyd, “Modeling Wireless Links for <str<strong>on</strong>g>Transport</str<strong>on</strong>g> <str<strong>on</strong>g>Protocol</str<strong>on</strong>g>s,”<br />

ACM SIGCOMM Computer Communicati<strong>on</strong>s Review, Vol. 34, No. 2,<br />

April 2004.<br />

[3] C. Casetti, M. Gerla, S. Mascolo, M. Y. Sanadidi, R. Wang, “<str<strong>on</strong>g>TCP</str<strong>on</strong>g> Westwood:<br />

bandwidth estimati<strong>on</strong> for enhanced transport over wireless links,”<br />

ACM C<strong>on</strong>ference <strong>on</strong> Mobile Computing and Networking (MOBICOM),<br />

Rome, July 2001.<br />

[4] V. Raghunathan and P. R. Kumar, “A Counterexample in C<strong>on</strong>gesti<strong>on</strong><br />

<str<strong>on</strong>g>C<strong>on</strong>trol</str<strong>on</strong>g> <strong>of</strong> Wireless Networks,” Performance Evaluati<strong>on</strong>, vol. 64, no. 5,<br />

pp. 399-418, June 2007.<br />

[5] K. Xu, Y .Tian, N. Ansari, “Improving <str<strong>on</strong>g>TCP</str<strong>on</strong>g> performance in integrated<br />

wireless communicati<strong>on</strong>s networks,” Computer Networks, vol. 47, no. 2,<br />

pp. 219-237, 2005.<br />

[6] F. Abrantes, M. Ricardo, “XCP for shared-Access Multi-Rate Media,”<br />

ACM SIGOSOMM Computer Communicati<strong>on</strong> Review, vol. 36, no. 3,<br />

pp. 27-38, July 2006.<br />

[7] K. Xu, Y. Tian, and N. Ansari, <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-Jersey for Wireless IP Communicati<strong>on</strong>s,IEEE<br />

Journal <strong>on</strong> Selected Areas in Communicati<strong>on</strong>s, Vol. 22, No.<br />

4, pp. 747-756, May 2004.<br />

[8] S. Biaz, X. Wang, “Can ECN Be Used to Differentiate C<strong>on</strong>gesti<strong>on</strong><br />

Losses from Wireless Losses,” Technical Report CSSE04-04, May, 2004.<br />

[9] H. Bai, D. Lilja, and M. Atiquzzaman, “Applying speculative technique<br />

to improve <str<strong>on</strong>g>TCP</str<strong>on</strong>g> throughput over lossy links,” IEEE Global Ccmmunicati<strong>on</strong>s<br />

C<strong>on</strong>ference (GLOBECOM), St. Louis, November 2005.<br />

[10] Xu C.b.,Ke ping, L. Shi zh<strong>on</strong>g, “An improved <str<strong>on</strong>g>TCP</str<strong>on</strong>g> c<strong>on</strong>gesti<strong>on</strong> c<strong>on</strong>trol<br />

mechanism <str<strong>on</strong>g>TCP</str<strong>on</strong>g>-RD for wireless network,” JOURNAL-CHINA INSTI-<br />

TUTE OF COMMUNICATIONS, 2003, VOL 24; PART 3, pages 86-90.<br />

[11] VINT Project UC Berkeley/LBNL, NS2: network simulator versi<strong>on</strong> 2.<br />

http://www.isi.edu/nsnam/ns.<br />

[12] <str<strong>on</strong>g>TCP</str<strong>on</strong>g> Jersey Home Page, http://web.njit.edu/anl/download.html.<br />

[13] Westwood Home Page, http://www.cs.ucla.edu/NRL/hpi/tcpw/index.html.<br />

[14] R. Jain, D. chiu, and W. Hawe, “A quantitative measure <strong>of</strong> fairness and<br />

discriminati<strong>on</strong> in shared computer systems,”DEC,Res.Rep.TR-301,1984.<br />

978-1-4244-2324-8/08/$25.00 © 2008 IEEE.<br />

This full text paper was peer reviewed at <strong>the</strong> directi<strong>on</strong> <strong>of</strong> IEEE Communicati<strong>on</strong>s Society subject matter experts for publicati<strong>on</strong> in <strong>the</strong> IEEE "GLOBECOM" 2008 proceedings.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!