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 purpose of this research is to design the new queueing algorithm effectively controlling the heavy-tailed traffics based on the comparison between the performance of the passive queue algorithm and that of the active queue algorithm. We adopted the tail-drop algorithm for PQM and the Random Early Detection (RED) for AQM, and conducted the experiments using ns-2 simulator. As the results, we extracted...
Active Queue Management (AQM) algorithm is important to manage buffers and transfer packets for wired/wireless networks. However, the unresponsive flows to the network congestion control is dangerous to the network equilibrium and Quality of Service (QoS), especially from the point of network resource allocation. In some certain scenarios, the limited network resource (buffers) can be occupied by...
In IEEE 802.11-based wireless mesh networks, routing is crucial in achieving high throughput in face of both interflow and intra-flow interference. Prior work focuses on finding the maximum available bandwidth path when a new flow enters the network. However, few has considered the effect of the new flow on the throughput of the existing flows. We propose a routing framework that uses the topology...
In wireless mesh networks, the end-to-end throughput of a flow over a multiple-hop wireless link rapidly decreases as the hop-count between the source and destination nodes increases, and the flows that travel over a path of more than 4-5 hops from its source node eventually starve. To alleviate this unfairness, we propose a weighted random early detection (RED) mechanism that has a different dropping...
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.