IJCTT - Dynamic Buffer Sizing Algorithms for 802.11 Wireless Networks
<p style="text-align: center;"><span style="color: #75a13b; font-size: 14pt;">Dynamic Buffer Sizing Algorithms for 802.11 Wireless Networks<br /></span></p>
<table style="width: 647px; height: 160px;">
<tbody style="background-color: #ffffff; text-align: left; border-width: 0px;">
<tr style="background-color: #ffffff; border-style: none; border-width: 0px;">
<td style="background-color: #ffffff; border-style: none; border-width: 0px;" rowspan="6"> <img src="/images/ijctt-book.png" alt="IJCOT-book-cover" /><br /> </td>
<td style="background-color: #ffffff; border-style: none; border-width: 0px;"><strong><span style="font-family: verdana,geneva; font-size: 10pt; border-style: none; border-color: #ffffff;">International Journal of Computer Trends and Technology (IJCTT)</span></strong></td>
<td style="background-color: #ffffff; border-style: none; border-width: 0px;" rowspan="6"> <br /> <a href="/Volume3/issue-1/IJCTT-V3I1P132.pdf" target="_blank"><img src="/images/PDF3.png" alt="" /></a></td>
</tr>
<tr style="border-width: 0px;">
<td style="background-color: #ffffff; text-align: left; border-width: 0px;"><span style="font-size: 10pt; font-family: verdana,geneva;">© - Issue 2012 by IJCTT Journal</span></td>
</tr>
<tr style="background-color: #ffffff; text-align: left; border-width: 0px;">
<td style="background-color: #ffffff; text-align: left; border-width: 0px;"><span style="font-family: verdana,geneva; font-size: 10pt;">Volume-3 Issue-1 <br /></span></td>
</tr>
<tr style="background-color: #ffffff; text-align: left; border-width: 0px;">
<td style="background-color: #ffffff; text-align: left; border-width: 0px;"><span style="font-family: verdana,geneva; font-size: 10pt;">Year of Publication : 2012</span></td>
</tr>
<tr style="background-color: #ffffff; text-align: left; border-width: 0px;">
<td style="background-color: #ffffff; text-align: left; border-width: 0px;"><strong><span style="color: #ff6600;">Authors</span></strong><span style="color: #ff6600;"> :</span><span style="color: #ff6600;"><span style="color: #000000;">Sripathi Giridhar, K.Raja Rao. </span></span></td>
</tr>
</tbody>
</table>
<p style="text-align: left;"><span style="font-family: arial,helvetica,sans-serif; font-size: 10pt; color: #0d4c89;"><img src="/images/citation.gif" alt="MLA" /></span></p>
<p style="text-align: justify;"><span style="font-size: 10pt;"><span lang="ES"><span style="color: #ff6600;"><span style="color: #000000;">Sripathi Giridhar, K.Raja Rao.</span></span>"Dynamic Buffer Sizing Algorithms for 802.11 Wireless Networks"<em>International Journal of Computer Trends and Technology (IJCTT)</em>,V3(1):157-160 Issue 2012 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.</span> </span></p>
<p style="text-align: justify;"><span style="color: #0d4c89;"><strong>Abstract: </strong></span>- 802.11 is a set of standards for implementing wireless local area network (WLAN) computer communication in the 2.4, 3.6 and 5 GHz frequency bands. They are created and maintained by the IEEE LAN/MAN Standards Committee (IEEE 802). Buffers play a key role in 802.11/802.11e wireless networks. Buffers are used to accommodate short-term packet bursts so as to mitigate packet drops and to maintain high link efficiency. Packets are queued if too many packets arrive in a sufficiently short interval of time during which a network device lacks the capacity to process all of them immediately. The use of fixed size buffers in 802.11 networks inevitably leads to either undesirable channel under-utilization or unnecessary high delays. In this paper our objective is to maintain high network utilization while providing low queuing delays in 802.11 wireless networks through dynamic buffer sizing algorithms.</p>
<p class="IEEEHeading1" style="margin-left: 0in; text-indent: 0in; text-align: justify;"><strong><span style="color: #0d4c89;">References-</span></strong></p>
<p style="text-align: justify;">[1] V. Gambiroza, B. Sadeghi, and E. Knightly, “End-to-end performance and fairness in multihop wireless backhaul networks,” in Proc. of the ACM MobiCom ’04, Sep. 2004, pp. 287–301. <br />[2] G. Appenzeller, I. Keslassy, and N. McKeown, “Sizing router buffers,” in Proc. of the ACM SIGCOMM ’04, Sep. 2004, pp. 281–292. <br />[3] R. Johari and D. Tan, “End-to-end congestion control for the internet: delays and stability,” IEEE/ACM Transactions on Networking, vol. 9, no. 6, pp. 818–832, Dec. 2001. <br />[4] Bufferbloat. http://www.bufferbloat.net/. <br />[5] C. Villamizar and C. Song, “High performance TCP in ANSNET,” SIGCOMM Computer Communications Review, vol. 24, no. 5, pp. 45– 60, 1994. <br />[6] The network simulator - ns-2. http://www.isi.edu/nsnam/ns. <br />[7] S. Floyd, T. Henderson, and A. Gurtov, “The NewReno modification to TCP’s fast recovery algorithm,” Internet Engineering Task Force, RFC 3782, Apr. 2004. [Online]. Available: http://www.rfc-editor.org/ rfc/rfc3782.txt <br />[8] K. Kumaran, M. Mandjes, A.L. Stolyar, “Convexity Properties of Loss and Overflow Functions,” Operations Research Letters, vol. 31, no.2, pp. 95- 100, 2003.</p>
<p style="text-align: justify;"><span style="color: #0d4c89;"><strong>Keywords</strong></span> — Wireless LAN, 802.11 network, Buffering.</p>