Aim To Put forward an improve algorithm for real-time connection admission control (CAC) decision. Methods converted equations of Cell loss ratio (CLR) upper bound were derived based on typical approaches to reduce co...Aim To Put forward an improve algorithm for real-time connection admission control (CAC) decision. Methods converted equations of Cell loss ratio (CLR) upper bound were derived based on typical approaches to reduce computing load. Moreover, the effects of usage parameter control (UPC) policing and bandwidth allocation functions were combined to deduce improver equations. computing load and admission region of the new algorithm were analyzed, while numerical examples and comparisons with classical non-parametic method were also included. Results Computing burden was reduced. More accurate estimation of CLR was obtained. The admission region of new algorithm was larger than typical non-parametric approach and was variable according to the burst length.Conclusion The calculation burden of new algorithm for CLR estimation is lighter than classical non-parametric approach. In addition to that, just as many information as what we can get in connection setup process are used for CAC decision. So it is not only a practicable but also an effective method that can be used in real-time processing.展开更多
The modeling of network traffic is important for the design and application of networks, but little is known as to the characteristics of distribution of packets in network traffic. In this letter the distribution of ...The modeling of network traffic is important for the design and application of networks, but little is known as to the characteristics of distribution of packets in network traffic. In this letter the distribution of packets in network traffic is explored.展开更多
In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP i...In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness.However,we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers.In this paper,we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots.In order to address the problem,we propose an equally-weighted congestion control algorithm for MPTCP,namely EW-MPTCP,without need for centralized control,additional infrastructure and a hardware upgrade.In our scheme,in addition to the coupled congestion control performed on each subflow of an MPTCP connection,we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers.The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck.The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.展开更多
As the core part of reciprocating compressor,piston rod is easy to cause a serious accident when abrasion and breakage fault occur to it. Therefore,it is very important to monitor its running state. At present,a small...As the core part of reciprocating compressor,piston rod is easy to cause a serious accident when abrasion and breakage fault occur to it. Therefore,it is very important to monitor its running state. At present,a small number of reciprocating compressors have been installed on-line monitoring and diagnosis system,most of which can only monitor a single vertical subsidence of piston rod and it can't fully represent the running state of piston rod. Therefore,a method of monitoring the vertical and horizontal displacement of piston rod axis orbit is simultaneously used. In view of the characteristics that the piston rod axis orbit is disordered and difficult to extract features,purification of the axis orbit is carried out based on harmonic wavelet and then features are extracted such as vibration energy,natural frequency and the axis orbit envelope area. After that,a nonlinear local tangent space manifold learning algorithm is used to reduce the dimension of the features and obtain sensitive features. By analyzing the practical cases,the effectiveness of the method for fault monitoring and diagnosis of reciprocating compressor piston rod assembly has been verified. Finally,as BP neural network has the characteristics of solving complex nonlinear problems,the validity of the fault diagnosis method of reciprocating compressor piston rod based on harmonic wavelet and manifold learning is proved by actual case data analysis based on BP neural network.展开更多
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.展开更多
In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area netwo...In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area network to wideband code division multiple access）. Efficient vertical handoff should allocate network resources efficiently and maintain good quality of service （QoS） for the end users. The objective of this work is to determine conditions under which vertical handoff can be performed. The channel usage situation of each access network is formulated as a birth-death process with the objective of predicting the avaliable bandwidth and the blocking probability. A reward function is used to capture the network bandwidth and the blocking probability is expressed as a cost function. An end user will access the certain network which maximizes the total function defined as the combination of the reward fimction and the cost function. Simulation results show that the proposed algorithm can significantly improve the network performance, including higher bandwidth for end users and lower new call blocking and handoff call blocking probability for networks.展开更多
An essential characteristic of the 4th Generation(4G) wireless networks is integrating various heterogeneous wireless access networks.This paper considers the network selection for both admission and handoff strategy ...An essential characteristic of the 4th Generation(4G) wireless networks is integrating various heterogeneous wireless access networks.This paper considers the network selection for both admission and handoff strategy problems in heterogeneous network of 3G/WLAN.A novel dynamic programming algorithm is proposed by taking heterogeneous network characteristics,user mobility and different service types into account.The specificity of our approach is that it puts the situations in a new model and makes decisions in stages of different states.Simulation results validate that the proposed scheme can obtain better new call blocking and handoff dropping probability performance than traditional schemes while ensuring quality-of-services(QoS) for both real-time and data connections.展开更多
This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint fail...This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint failure probability. Survivable Traffic Assignment (STA) algorithm and Conventional Traffic Assignment (CTA) algorithm are added to illustrate the effectiveness of our proposed STC. We investigate the effect of joint failure probability on blocking probability, spectral utilization ratio, average joint failure probability, and the average hops. Simulation results show that our proposed STC not only achieves better performance in terms of blocking probability and spectral utilization ratio than CTA and STA, but also does not cause higher average joint failure probability or larger average hops compared with STA. As a result, STC makes the best use of spectral resources and does not cause large average joint failure probability.展开更多
In the paper,we propose a framework to investigate how to effectively perform traffic flow splitting in heterogeneous wireless networks from a queue point.The average packet delay in heterogeneous wireless networks is...In the paper,we propose a framework to investigate how to effectively perform traffic flow splitting in heterogeneous wireless networks from a queue point.The average packet delay in heterogeneous wireless networks is derived in a probabilistic manner.The basic idea can be understood via treating the integrated heterogeneous wireless networks as different coupled and parallel queuing systems.The integrated network performance can approach that of one queue with maximal the multiplexing gain.For the purpose of illustrating the effectively of our proposed model,the Cellular/WLAN interworking is exploited.To minimize the average delay,a heuristic search algorithm is used to get the optimal probability of splitting traffic flow.Further,a Markov process is applied to evaluate the performance of the proposed scheme and compare with that of selecting the best network to access in terms of packet mean delay and blocking probability.Numerical results illustrate our proposed framework is effective and the flow splitting transmission can obtain more performance gain in heterogeneous wireless networks.展开更多
文摘Aim To Put forward an improve algorithm for real-time connection admission control (CAC) decision. Methods converted equations of Cell loss ratio (CLR) upper bound were derived based on typical approaches to reduce computing load. Moreover, the effects of usage parameter control (UPC) policing and bandwidth allocation functions were combined to deduce improver equations. computing load and admission region of the new algorithm were analyzed, while numerical examples and comparisons with classical non-parametic method were also included. Results Computing burden was reduced. More accurate estimation of CLR was obtained. The admission region of new algorithm was larger than typical non-parametric approach and was variable according to the burst length.Conclusion The calculation burden of new algorithm for CLR estimation is lighter than classical non-parametric approach. In addition to that, just as many information as what we can get in connection setup process are used for CAC decision. So it is not only a practicable but also an effective method that can be used in real-time processing.
文摘The modeling of network traffic is important for the design and application of networks, but little is known as to the characteristics of distribution of packets in network traffic. In this letter the distribution of packets in network traffic is explored.
基金supported in part by the HUT Distributed and Mobile Cloud Systems research project and Tekes within the ITEA2 project 10014 EASI-CLOUDS
文摘In recent years,dual-homed topologies have appeared in data centers in order to offer higher aggregate bandwidth by using multiple paths simultaneously.Multipath TCP(MPTCP) has been proposed as a replacement for TCP in those topologies as it can efficiently offer improved throughput and better fairness.However,we have found that MPTCP has a problem in terms of incast collapse where the receiver suffers a drastic goodput drop when it simultaneously requests data over multiple servers.In this paper,we investigate why the goodput collapses even if MPTCP is able to actively relieve hot spots.In order to address the problem,we propose an equally-weighted congestion control algorithm for MPTCP,namely EW-MPTCP,without need for centralized control,additional infrastructure and a hardware upgrade.In our scheme,in addition to the coupled congestion control performed on each subflow of an MPTCP connection,we allow each subflow to perform an additional congestion control operation by weighting the congestion window in reverse proportion to the number of servers.The goal is to mitigate incast collapse by allowing multiple MPTCP subflows to compete fairly with a single-TCP flow at the shared bottleneck.The simulation results show that our solution mitigates the incast problem and noticeably improves goodput in data centers.
基金Supported by the National Basic Research Program of China(863Program)(No.2014AA041806)the National Key Research and Development Plan(No.2016YFF0203305)
文摘As the core part of reciprocating compressor,piston rod is easy to cause a serious accident when abrasion and breakage fault occur to it. Therefore,it is very important to monitor its running state. At present,a small number of reciprocating compressors have been installed on-line monitoring and diagnosis system,most of which can only monitor a single vertical subsidence of piston rod and it can't fully represent the running state of piston rod. Therefore,a method of monitoring the vertical and horizontal displacement of piston rod axis orbit is simultaneously used. In view of the characteristics that the piston rod axis orbit is disordered and difficult to extract features,purification of the axis orbit is carried out based on harmonic wavelet and then features are extracted such as vibration energy,natural frequency and the axis orbit envelope area. After that,a nonlinear local tangent space manifold learning algorithm is used to reduce the dimension of the features and obtain sensitive features. By analyzing the practical cases,the effectiveness of the method for fault monitoring and diagnosis of reciprocating compressor piston rod assembly has been verified. Finally,as BP neural network has the characteristics of solving complex nonlinear problems,the validity of the fault diagnosis method of reciprocating compressor piston rod based on harmonic wavelet and manifold learning is proved by actual case data analysis based on BP neural network.
基金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.
基金Project(20040533035) supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject (50275150) supported by the National Natural Science Foundation of China
文摘In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area network to wideband code division multiple access）. Efficient vertical handoff should allocate network resources efficiently and maintain good quality of service （QoS） for the end users. The objective of this work is to determine conditions under which vertical handoff can be performed. The channel usage situation of each access network is formulated as a birth-death process with the objective of predicting the avaliable bandwidth and the blocking probability. A reward function is used to capture the network bandwidth and the blocking probability is expressed as a cost function. An end user will access the certain network which maximizes the total function defined as the combination of the reward fimction and the cost function. Simulation results show that the proposed algorithm can significantly improve the network performance, including higher bandwidth for end users and lower new call blocking and handoff call blocking probability for networks.
基金Supported by the National Natural Science Foundation and Civil Aviation Administration of China(No.61071105)
文摘An essential characteristic of the 4th Generation(4G) wireless networks is integrating various heterogeneous wireless access networks.This paper considers the network selection for both admission and handoff strategy problems in heterogeneous network of 3G/WLAN.A novel dynamic programming algorithm is proposed by taking heterogeneous network characteristics,user mobility and different service types into account.The specificity of our approach is that it puts the situations in a new model and makes decisions in stages of different states.Simulation results validate that the proposed scheme can obtain better new call blocking and handoff dropping probability performance than traditional schemes while ensuring quality-of-services(QoS) for both real-time and data connections.
基金supported in part by 973 Program under Grants No. 2010CB328204,No. 2012CB315604863 Program under Grant No. 2012AA011301+3 种基金National Natural Science Foundation of China under Grants No. 61271189,No. 61201154, No. 60932004RFDP Project under Grants No. 20090005110013,No. 20120005120019the Fundamental Research Funds for the Central Universitiesthe State Scholarship Fund
文摘This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint failure probability. Survivable Traffic Assignment (STA) algorithm and Conventional Traffic Assignment (CTA) algorithm are added to illustrate the effectiveness of our proposed STC. We investigate the effect of joint failure probability on blocking probability, spectral utilization ratio, average joint failure probability, and the average hops. Simulation results show that our proposed STC not only achieves better performance in terms of blocking probability and spectral utilization ratio than CTA and STA, but also does not cause higher average joint failure probability or larger average hops compared with STA. As a result, STC makes the best use of spectral resources and does not cause large average joint failure probability.
基金ACKNOWLEDGEMENT This work was supported by National Natural Science Foundation of China （Grant No. 61231008）, National Basic Research Program of China （973 Program） （Grant No. 2009CB320404）, Program for Changjiang Scholars and Innovative Research Team in University （Grant No. IRT0852）, and the 111 Project （Grant No. B08038）.
文摘In the paper,we propose a framework to investigate how to effectively perform traffic flow splitting in heterogeneous wireless networks from a queue point.The average packet delay in heterogeneous wireless networks is derived in a probabilistic manner.The basic idea can be understood via treating the integrated heterogeneous wireless networks as different coupled and parallel queuing systems.The integrated network performance can approach that of one queue with maximal the multiplexing gain.For the purpose of illustrating the effectively of our proposed model,the Cellular/WLAN interworking is exploited.To minimize the average delay,a heuristic search algorithm is used to get the optimal probability of splitting traffic flow.Further,a Markov process is applied to evaluate the performance of the proposed scheme and compare with that of selecting the best network to access in terms of packet mean delay and blocking probability.Numerical results illustrate our proposed framework is effective and the flow splitting transmission can obtain more performance gain in heterogeneous wireless networks.
