The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. ...The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.展开更多
One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate （ABR）. The dynamic controller is designed based on the control theory and the feedback mechanism of e...One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate （ABR）. The dynamic controller is designed based on the control theory and the feedback mechanism of explicit rates With the given method of a chosen parameter, it can guarantee the stability of the controller and closed loop system with propagation delay and bandwidth oscillation. It needs less parameters（only one） to be designed. The queue length can converge to the given value in the least steps. The fairness of different connections is considered further. The simulations show better performance and good quality of service（QoS） is achieved.展开更多
The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and coopera...The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.展开更多
The improved ERICA algorithm for ABR flow congestion control is presented based on available bandwidth prediction using the BP neural networks in ATM networks. The switch periodically calculates the available bandwidt...The improved ERICA algorithm for ABR flow congestion control is presented based on available bandwidth prediction using the BP neural networks in ATM networks. The switch periodically calculates the available bandwidth, monitors the load of network and updates the ER value according to the PERICA algorithm. The proposed algorithm can keep better performance than ERICA algorithm in simulations.展开更多
There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria ...There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.展开更多
Considering the instability of data transferred existing in high speed network, a new method is proposed for improving the stability using control theory. Under this method, the mathematical model of such a network is...Considering the instability of data transferred existing in high speed network, a new method is proposed for improving the stability using control theory. Under this method, the mathematical model of such a network is established. Stability condition is derived from the mathematical model. Several simulation experiments are performed. The results show that the method can increase the stability of data transferred in terms of the congestion window, queue size, and sending rate of the source.展开更多
Design of an effective congestion control scheme is a hot topic in the development of compute network. The flow control scheme can adjust the packet sending rate in source host, thus effectively avoiding the network c...Design of an effective congestion control scheme is a hot topic in the development of compute network. The flow control scheme can adjust the packet sending rate in source host, thus effectively avoiding the network congestion. This paper proposes a flow control scheme based on discrete control theory. The simulation results show that this method can adjust the sending rate and queue level in buffer rapidly and effectively. The method is easy to implement and applicable to high speed networks.展开更多
Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combin...Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.展开更多
A novel and efficient method to evaluate the transmission control protocol （TCP） performance over satellite links is presented. A TCP module is divided into three functional blocks, namely data processing, congestio...A novel and efficient method to evaluate the transmission control protocol （TCP） performance over satellite links is presented. A TCP module is divided into three functional blocks, namely data processing, congestion control and error control The re-established TCP module is easy to update TCP congestion control strategy or error control strategy. With the proposed analysis approach, the interactions between different congestion control and error control mechanisms, as well as the performanee of various combination protocols in satellite environments have been investigated. Simulation results obtained through a series of experiments have shown that SNACK-based error control strategy can perform well with any other congestion control strategy. The best performanee can be achieved by TCP NewReno congestion control strategy and SNACK-based error control strategy.展开更多
In order to support the mobility of computers during communication, the transport control protocol (TCP) connections between fixed host and mobile host often traverse wired and wireless networks, and the recovery of t...In order to support the mobility of computers during communication, the transport control protocol (TCP) connections between fixed host and mobile host often traverse wired and wireless networks, and the recovery of the losses due to wireless transmission error is much different from congestion control. This paper analyzes the interaction between TCP and link layer retransmission scheme when the correlated packet are losses handled, indicates that a higher value of the maximum number of successive link layer timeout retransmissions has an adverse effect on TCP ability to perform congestion control rapidly. To achieve a better TCP performance, the paper proposes a strategy combining link-layer selective-reject automatic repeat request (ARQ) with explicit loss notification mechanism, which can respond to congestion quickly while keeping wireless link more reliable, and make TCP react to the different packet losses more suitably.展开更多
An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and aband...An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and abandoned if they are from the same flow.But MCHOKeM uses multiple virtual queues for different priority packets and enhances the drawing function by adjusting the maximum number of draws based on the current status of virtual queue length.The number of parameters that MCHOKeM needs to maintain is determined by the number of priority levels being supported by the router,which usually has a small limited value.In order to explain the features of MCHOKeM,an analytical model is used.A series of simulation tests to evaluate the performance are given.展开更多
基金supported in part by the National Natural Science Foundation of China (10671170,60404022)the National Outstanding Youth Foundation of China (60525303)and the Natural Science Foundation of Hebei Province (07M005,F2008000864)
文摘The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.
基金This project was supported partly by the Outstanding Youth Scientific Foundation of China(60525303)the National Natural Science Foundation of China(60404022, 60604012)the Natural Science Foundation of Hebei Province of China(F2005000390).
文摘One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate （ABR）. The dynamic controller is designed based on the control theory and the feedback mechanism of explicit rates With the given method of a chosen parameter, it can guarantee the stability of the controller and closed loop system with propagation delay and bandwidth oscillation. It needs less parameters（only one） to be designed. The queue length can converge to the given value in the least steps. The fairness of different connections is considered further. The simulations show better performance and good quality of service（QoS） is achieved.
基金Projects(61202488, 61070199, 61103182) supported by the National Natural Science Foundation of China
文摘The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.
文摘The improved ERICA algorithm for ABR flow congestion control is presented based on available bandwidth prediction using the BP neural networks in ATM networks. The switch periodically calculates the available bandwidth, monitors the load of network and updates the ER value according to the PERICA algorithm. The proposed algorithm can keep better performance than ERICA algorithm in simulations.
基金Project(60973127) supported by the National Natural Science Foundation of ChinaProject(09JJ3123) supported by the Natural Science Foundation of Hunan Province,China
文摘There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.
基金the National Natural Science Foundation of China (50579022 50539140).
文摘Considering the instability of data transferred existing in high speed network, a new method is proposed for improving the stability using control theory. Under this method, the mathematical model of such a network is established. Stability condition is derived from the mathematical model. Several simulation experiments are performed. The results show that the method can increase the stability of data transferred in terms of the congestion window, queue size, and sending rate of the source.
基金This paper was supported by the National Natural Science Foundation of China (No. 69874025).
文摘Design of an effective congestion control scheme is a hot topic in the development of compute network. The flow control scheme can adjust the packet sending rate in source host, thus effectively avoiding the network congestion. This paper proposes a flow control scheme based on discrete control theory. The simulation results show that this method can adjust the sending rate and queue level in buffer rapidly and effectively. The method is easy to implement and applicable to high speed networks.
基金Project(531107040202) supported by the Fundamental Research Funds for the Central Universities of China
文摘Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.
文摘A novel and efficient method to evaluate the transmission control protocol （TCP） performance over satellite links is presented. A TCP module is divided into three functional blocks, namely data processing, congestion control and error control The re-established TCP module is easy to update TCP congestion control strategy or error control strategy. With the proposed analysis approach, the interactions between different congestion control and error control mechanisms, as well as the performanee of various combination protocols in satellite environments have been investigated. Simulation results obtained through a series of experiments have shown that SNACK-based error control strategy can perform well with any other congestion control strategy. The best performanee can be achieved by TCP NewReno congestion control strategy and SNACK-based error control strategy.
基金National Natural Science Foundation of China(69874025).
文摘In order to support the mobility of computers during communication, the transport control protocol (TCP) connections between fixed host and mobile host often traverse wired and wireless networks, and the recovery of the losses due to wireless transmission error is much different from congestion control. This paper analyzes the interaction between TCP and link layer retransmission scheme when the correlated packet are losses handled, indicates that a higher value of the maximum number of successive link layer timeout retransmissions has an adverse effect on TCP ability to perform congestion control rapidly. To achieve a better TCP performance, the paper proposes a strategy combining link-layer selective-reject automatic repeat request (ARQ) with explicit loss notification mechanism, which can respond to congestion quickly while keeping wireless link more reliable, and make TCP react to the different packet losses more suitably.
基金supported by the Beijing Natural Science Foundation(4102050)USFC-KOSEF Joint Research Project of China and Korea(60811140343)
文摘An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and abandoned if they are from the same flow.But MCHOKeM uses multiple virtual queues for different priority packets and enhances the drawing function by adjusting the maximum number of draws based on the current status of virtual queue length.The number of parameters that MCHOKeM needs to maintain is determined by the number of priority levels being supported by the router,which usually has a small limited value.In order to explain the features of MCHOKeM,an analytical model is used.A series of simulation tests to evaluate the performance are given.
