A Bottleneck-Aware Multipath Scheduling Mechanism for Social Networks

As the demand for real-time and high-quality social network services in mobile communications continues to grow, the performance defects of single-path transmission networks have become more and more prominent. At the same time, multipath transmission provides people with the possibility of stable and smooth communication in mobile wireless social networks. However, since it is usually difficult to obtain frequently varying delays along each path, packets always appear out of order during the communication of heterogeneous social networks, which will cause additional waiting delays in the receiving process. Therefore, it is still a very challenging task to construct a high-bandwidth and low-latency multipath transmission mechanism for social networks in mobile communications. According to the behavioral features of packets of social networks in mobile scenarios, a social network model BAH that reveals wireless social networks bottlenecks is established. Subsequently, this paper proposes a bottleneck-aware algorithm BFDE, which utilizes the one-way delay of periodically probing to derive the features of the wireless social networks bottleneck, so as to achieve an accurate estimation of the delay of each path. In the analysis and simulation, we compared it with the baseline EDPF and proved that the BFDE algorithm can achieve effective scheduling in complex and changeable mobile wireless social networks, thereby effectively increasing the multipath aggregation bandwidth, and has a strong robustness.