This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, b...This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, but most researches focus on the situations without the RBUF limit. In this study, we analyze the impact of the RBUF size on the performance. Computer simulations show that the network utility is low in reliable transfer, when the RBUF size is smaller than bandwidth delay product. By studying the transmission sequence number （TSN） transfer progress, we find that the peer receiver window （PEER_RWND）, which lags behind the true receiver window （RWND）, leads to the poor network utility. To improve SCTP performance with limited RBUF, the virtual receiver window （VIRTUAL_RWND） is introduced. Based on the VIRTUAL_RWND, one algorithm is proposed to increase the sending rate. Computer simulations have evaluated an excellent performance of the proposed algorithm at both ideal link without lost packet and nonideal link with lost packet.展开更多
A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited int...A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited intermediate buffer , and it facilitates the scheduling optimization for this process.To find out the optimal solution of the scheduling problem , an improved genetic algorithm hybridized with problem knowledge-based heuristics is also proposed , which provides high-quality initial solutions and fast searching speed.The efficiency of the algorithm is verified by the computational experiments.展开更多
基金supported by grants from China major projects of the wireless mobile communications network (2011ZX03005-005, 2010ZX03006-002-03, 2011ZX03005-004-02)the National Natural Science Foundation of China (61170275)
文摘This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, but most researches focus on the situations without the RBUF limit. In this study, we analyze the impact of the RBUF size on the performance. Computer simulations show that the network utility is low in reliable transfer, when the RBUF size is smaller than bandwidth delay product. By studying the transmission sequence number （TSN） transfer progress, we find that the peer receiver window （PEER_RWND）, which lags behind the true receiver window （RWND）, leads to the poor network utility. To improve SCTP performance with limited RBUF, the virtual receiver window （VIRTUAL_RWND） is introduced. Based on the VIRTUAL_RWND, one algorithm is proposed to increase the sending rate. Computer simulations have evaluated an excellent performance of the proposed algorithm at both ideal link without lost packet and nonideal link with lost packet.
基金Item Sponsored by National Key Technology Research and Development Program in 11th Five-Year Plan of China ( 2006AA04Z184 )National Natural Science Foundation of China ( 60974023 )
文摘A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited intermediate buffer , and it facilitates the scheduling optimization for this process.To find out the optimal solution of the scheduling problem , an improved genetic algorithm hybridized with problem knowledge-based heuristics is also proposed , which provides high-quality initial solutions and fast searching speed.The efficiency of the algorithm is verified by the computational experiments.
