The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The fair allocation of the resources is an important issue in wireless local area network (WLAN) because all wireless nodes compete for the same wireless radio channel. When uplink and downlink transmission congestion protocol (TCP) flows coexist in WLAN, the network service is biased toward the uplink TCP flows, and the downlink TCP flows tend to starve. In this article, we investigate the special...
TCP fairness is an important issue in WLAN because the wireless channel is shared by all wireless nodes. Due to TCP-unfriendly nature of ACK packet, the network service is biased toward the uplink TCP flow and the downlink TCP flow tends to starve. In this paper, a buffer allocation algorithm on the downlink buffer of the Access Point (AP) is proposed to improve the fairness among uplink and downlink...
The fair allocation of the resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate-limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as the recently...
Significant TCP unfairness in wireless local networks has been reported during the past several years. This unfairness results from the greedy TCP protocol and shared wireless medium. To solve the unfairness problem between uplink TCP flows, we proposed a scheduling algorithm called uplink weighted fair queueing (UWFQ). By adjusting the service weight of ACK packets, UWFQ achieves the channel adaptive...
In wireless LAN connected with Internet, the anomaly of wireless channel and the greedy nature of closed loop control in TCP lead to the congestion problem and significant unfair bandwidth distribution between TCP flows. In this paper, an ECN-based access point congestion control algorithm called APCC (AP congestion control) is proposed. The main properties of APCC are: (1) Using both wireless channel...
Different from wired networks, TCP over wireless networks needs to be cross-layer designed which depends on information of MAC. However, it is difficult to apply existing cross-layer design into hybrid networks. Based on researches of congestion metrics from MAC layer over wireless networks, this paper proposes an cross-layer ECN scheme that TCP sender will trigger congestion control by ECN if RTS...
In wireless local area networks (WLANs), the greedy closed loop control nature of TCP and the performance anomaly of wireless channel lead to the up/down and time unfairness problems between TCP flows. To achieve the wireless channel usage time fairness between the uplink and downlink TCP flows, we propose the up/down time fair LAS (UDTFLAS) scheduling algorithm. Taking into account the transmission...
In multi-rate 802.11 wireless LAN, when the wireless node with lower data rate dominates shared channel usage time, the throughput experienced by other nodes transmitting at higher data rates will be drastically reduced. While most fair AQM (active queue management) algorithms are based on throughput fairness, we prove that temporal fair AQM algorithm can achieve more total throughput than throughput...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.