Research On Multipath Selection Mechanism Using Shared Congestion In Next-Generation Internet

The requirements of network integration lead to the birth of the next generation Internet, which has the following features:It can support transmission technology with QoS ability by using a variety of bandwidth; Users can get in touch with different service providers; and it can support mobility, etc. SCTP-CMT solve the shortage of traditional TCP, UDP protocol in this aspect. At present, multipath selection problem of SCTP-CMT existing between the Shared congestion cases has always been a one of the core issues of concern to scholars, needs further research.SCTP-CMT inherited many advantages of the SCTP protocol but the problem of receiving buffer congestion will be relatively serious than the single path transmission. In order to alleviate the phenomenon, some scholars made improvements on retransmission strategy and path selection mechanism.The previous study of SCTP-CMT is on multipath transmission under no shared congestion conditions, considering the actual situation of the real network need and is based on the hypothesis that each path is independent. Scholars from Beijing University of Posts and Telecommunications proposed that GMS algorithm make proper choices under the condition of the share congestion. Although GMS algorithm can ensure that multiple paths are independent, it doesn’t make further analysis for share congestion situation, resulting in wasted resources in share congestion location.This article makes a thorough analysis for multipath transmission under sharing congestion situation, improves the irrationality of GMS algorithm on share congestion control, makes performance analysis on several links in share congestion, and establishes the virtual model of the multipath and proposes Knapsack-based Multipath Selection, KMS). Firstly, it is necessary to detect the Shared congestion, one-way performance parameters of the path measurement such as one-way delay and end-to-end available bandwidth. Secondly, it makes a vital choice of the paths with big differences by using chebyshev inequality; and makes a choice again of the paths with small differences by using knapsack algorithm. Multiple route choice based on Shared congestion; first of all, At last, it makes analysis about KMS algorithm, GMS algorithm, RMS algorithm, the under the condition of shared congestion with two circumstances:multiple paths with a big difference and a small difference. The results of the experiments also proved that the difference between GMS and KMS algorithm under the case of a best path. But in other cases, KMS RMS algorithm is superior to the GMS algorithm. It also fully illustrated the rationality of the algorithm for Share congestion processing and correctness of the virtual multipath models. Finally, it summarizes the subjects, and gives the prospect for future research.