Cart (Loading....) | Create Account
Close category search window
 

FDA: a novel base station flow control scheme for TCP over heterogeneous networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jian-Hao Hu ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., China ; Yeung, K.L.

A novel proactive base station flow control algorithm, called forced duplicate acknowledgement (FDA), is proposed for extending TCP over wireless networks. FDA is implemented at the base station (BS) of a wireless network. It works in conjunction with existing TCP enhancement schemes such as Snoop or New Snoop. In FDA, if the average occupied buffer size at a BS exceeds a pre-defined threshold, an incipient congestion is detected. Then three forced duplicate ACKs, functioning as a congestion notification, will be generated by the BS and forwarded to a set of selected TCP senders. Upon receiving the forced duplicate ACKs, a sender reduces its transfer rate as a result of performing the fast retransmit procedure. To prevent multiple packet dropping due to buffer overflow at the BS, a quality guaranteed cache release policy is designed. The idea is to make room for the on-the-fly packets by releasing some cached but not-yet-acknowledged packets at the BS in advance. The performance of the proposed FDA is evaluated by simulations. We found that under various traffic and system configurations, FDA can not only fairly allocate the available wireless bandwidth among all TCP connections, but also achieves the highest throughput as compared to other schemes we have investigated

Published in:

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:1 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.