QoS Guaranteed Multi-Poll Access Scheme with Transmission Control over High Throughput Wireless LANs

Author(s):  
Hiroaki Murata ◽  
Tomotaka Wada ◽  
Tadahiro Maekawa ◽  
Kouichi Mutsuura ◽  
Hiromi Okada
2002 ◽  
Author(s):  
W. Meng ◽  
I. Habib ◽  
T.N. Saadawi

Author(s):  
Seyyed Alireza Hoseini ◽  
Behnam Khodabandeloo ◽  
Mahdi Jelodari Mamaghani ◽  
Peyman Teymoori ◽  
Nasser Yazdani

Electronics ◽  
2021 ◽  
Vol 10 (16) ◽  
pp. 1942
Author(s):  
Min Chen ◽  
Muhammad Waleed Raza ◽  
Xing Zhou ◽  
Thomas Dreibholz ◽  
Yuyin Tan

The transmission performance of a multi-path transmission control protocol (MPTCP) is affected by many parameters, such as path management, congestion control, buffer size, and subflow bandwidth. Most of the previous studies have focused almost exclusively on the improvement of a single parameter, without a holistic view. In this paper, a multi-parameter comprehensive optimized algorithm (MPCOA) is proposed to comprehensively optimize the above parameters. The MPCOA algorithm can find a smaller buffer size and select an appropriate congestion control and path management algorithm on the premise of ensuring better throughput. Experiments in three scenarios show that MPCOA can save buffer space and subflow resources, and achieve a high throughput. Meanwhile, a set of quantitative improvement results given by MPCOA is convenient for us to evaluate the quality of the MPTCP network and provide reference for our ongoing future work.


Author(s):  
Sandeep Kumar Gonnade ◽  
Naresh Kumar Nagwani

When the packet is reordered the most standard implementation of the Transmission control protocol (TCP) gives poor performance. This paper proposes a new version of the TCP which gives the high throughput when the packet reordering occurs and in another case if the packet reordering is not occurs then in that case also it is friendly to other version of the TCP. Transmission control protocol constant Packet Reordering (TCP-CPR) does not depend or rely on the duplicate acknowledgement to detect the packet loss. Instead the timer is used to maintain how long packet is transmitted. In this case timer is used to keep the track how long packets are transmitted. If acknowledgement are not received within the appropriate time then packet assume to loss because of the TCP-CPR does not depend on the duplicate acknowledgement. Packet reordering has does not effect on the performance of TCP-CPR. Through the performance of the TCP-CPR consistently better than existing mechanism that make the try to make the TCP more robust to packet reordering. In case where packets are not reordered, it’s verified that TCP-CPR maintains the same throughput as the typical implementation of TCP.


Sign in / Sign up

Export Citation Format

Share Document