Performance Analysis of Target Adapted RED Algorithm on TCP/IP based GEO Satellite Communication Network 


Vol. 29,  No. 6, pp. 667-676, Jun.  2004


PDF
  Abstract

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the QOS for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad performance on satellite communication network that is many of connecting user at same time. This paper propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Seo and D. Kim, "Performance Analysis of Target Adapted RED Algorithm on TCP/IP based GEO Satellite Communication Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 667-676, 2004. DOI: .

[ACM Style]

Jin-won Seo and Doug-nyun Kim. 2004. Performance Analysis of Target Adapted RED Algorithm on TCP/IP based GEO Satellite Communication Network. The Journal of Korean Institute of Communications and Information Sciences, 29, 6, (2004), 667-676. DOI: .

[KICS Style]

Jin-won Seo and Doug-nyun Kim, "Performance Analysis of Target Adapted RED Algorithm on TCP/IP based GEO Satellite Communication Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 6, pp. 667-676, 6. 2004.