Internet access is becoming even more heterogeneous, including different wireless backhauling links, with Ka-band satellites as a possible alternative. Since communication path is unknown a priori, adoption of PEP sol...Internet access is becoming even more heterogeneous, including different wireless backhauling links, with Ka-band satellites as a possible alternative. Since communication path is unknown a priori, adoption of PEP solutions to optimize TCP performance over satellite is discouraged to allow dynamic network reconfigurations. To opposite, an endto-end TCP performance evaluation on such a challenging scenario, with possible large latency and transmission losses, is herein considered of paramount importance. Several TCP variants exist to tackle different aspects of communication networks. In Linux, the different TCP congestion control schemes differ from the theoretical formulations and RFC specifications, introducing a varying set of optimizations and options. This aspect makes difficult to identify a standard/reference TCP version for the proposed scenario, while testing with the real protocol stacks is deemed necessary to obtain consistent results. In addition, an innovative end-to-end TCP, namely TCP Wave, is introduced to replace the traditional window-based transmission with a burst-based strategy, representing a valid alternative to Linux TCP. To offer a fair, realistic and comprehensive evaluation, we configured a simulation setup where different Linux TCPs can be run within ns-3 network simulator and compared with TCP Wave.展开更多
Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algori...Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of SA algorithm validation to verify it,and the method is proved to be feasible.展开更多
文摘Internet access is becoming even more heterogeneous, including different wireless backhauling links, with Ka-band satellites as a possible alternative. Since communication path is unknown a priori, adoption of PEP solutions to optimize TCP performance over satellite is discouraged to allow dynamic network reconfigurations. To opposite, an endto-end TCP performance evaluation on such a challenging scenario, with possible large latency and transmission losses, is herein considered of paramount importance. Several TCP variants exist to tackle different aspects of communication networks. In Linux, the different TCP congestion control schemes differ from the theoretical formulations and RFC specifications, introducing a varying set of optimizations and options. This aspect makes difficult to identify a standard/reference TCP version for the proposed scenario, while testing with the real protocol stacks is deemed necessary to obtain consistent results. In addition, an innovative end-to-end TCP, namely TCP Wave, is introduced to replace the traditional window-based transmission with a burst-based strategy, representing a valid alternative to Linux TCP. To offer a fair, realistic and comprehensive evaluation, we configured a simulation setup where different Linux TCPs can be run within ns-3 network simulator and compared with TCP Wave.
基金National Natural Science Foundation of China(No.50574037)Henan Soft Science Research Project(No.102400410033No.102400410032)
文摘Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of SA algorithm validation to verify it,and the method is proved to be feasible.
