Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effect...Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks (RBMR-NC). Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.展开更多
An algorithm of traffic distribution called active multi-path routing (AMR)in active network is proposed. AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic am...An algorithm of traffic distribution called active multi-path routing (AMR)in active network is proposed. AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths. It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly. The frame of AMR includes adaptive trafficallocation model, the conception of supply bandwidth and its' allocation model, the principle ofcongestion restraint and its' model, and the implement of AMR based on multi-agents system in activenetwork. Through simulations, AMR has distinct effects on network performance. The results show AMRisa valid traffic regulation algorithm.展开更多
Large-scale and diverse businesses based on the cloud computing platform bring the heavy network traffic to cloud data centers.However,the unbalanced workload of cloud data center network easily leads to the network c...Large-scale and diverse businesses based on the cloud computing platform bring the heavy network traffic to cloud data centers.However,the unbalanced workload of cloud data center network easily leads to the network congestion,the low resource utilization rate,the long delay,the low reliability,and the low throughput.In order to improve the utilization efficiency and the quality of services(QoS)of cloud system,especially to solve the problem of network congestion,we propose MTSS,a multi-path traffic scheduling mechanism based on software defined networking(SDN).MTSS utilizes the data flow scheduling flexibility of SDN and the multi-path feature of the fat-tree structure to improve the traffic balance of the cloud data center network.A heuristic traffic balancing algorithm is presented for MTSS,which periodically monitors the network link and dynamically adjusts the traffic on the heavy link to achieve programmable data forwarding and load balancing.The experimental results show that MTSS outperforms equal-cost multi-path protocol(ECMP),by effectively reducing the packet loss rate and delay.In addition,MTSS improves the utilization efficiency,the reliability and the throughput rate of the cloud data center network.展开更多
Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path r...Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.展开更多
An algorithm for direction angle of arrival(DOA) estimation and array calibration of signals from multiple mobile users in the CDMA systems and multi-path environment was presented . The main idea is that the algorith...An algorithm for direction angle of arrival(DOA) estimation and array calibration of signals from multiple mobile users in the CDMA systems and multi-path environment was presented . The main idea is that the algorithm employs code-matched filter and model of the inter-symbol interference and multiple-access interference exactly. The correlation matrices of the received signals before and after code-matched filtering were employed to eliminate the effect of the additive white Gaussian noise, and a new mathematical problem was created, a new maximum likelihood method based on the strong law of large number was derived for DOA estimation and array calibration. Computer simulation results prove that the algorithm is effective.展开更多
The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this p...The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.展开更多
Adaptive genetic algorithm A SA GA, a novel algorithm, which can dynamically modify the parameters of Genetic Algorithms in terms of simulated annealing mechanism, is proposed for path planning of loosely coordinated ...Adaptive genetic algorithm A SA GA, a novel algorithm, which can dynamically modify the parameters of Genetic Algorithms in terms of simulated annealing mechanism, is proposed for path planning of loosely coordinated multi robot manipulators. Over the task space of a multi robot, a strategy of decoupled planning is also applied to the evolutionary process, which enables a multi robot to avoid falling into deadlock and calculating of composite C space. Finally, two representative tests are given to validate A SA GA and the strategy of decoupled planning.展开更多
This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,le...This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.展开更多
On the basis of a multi-length scale modeling, a mixture-averaged multi-component /multiphase micro-segregation model was proposed without pre-set function for the micro-scale solute profile. The model explains the ef...On the basis of a multi-length scale modeling, a mixture-averaged multi-component /multiphase micro-segregation model was proposed without pre-set function for the micro-scale solute profile. The model explains the effect of morphologies of solidifying phases and solid back diffusion (SBD) on segregation, and covers the two limiting solidification cases of Scheil and Lever-rule models. A commercial Thermo-Calc software package/database was linked to the algorithms via its TQ6-interface for instantaneous determination of the related thermodynamic data of the multi-component alloys. The influences of cooling rate and other parameters on the solidification path and micro-segregation behavior were numerically investigated by sample calculation of the ternary Al-Cu-Mg alloys. A parallel experimental investigation on Al-Cu-Si alloys solidified under different cooling conditions was conducted to validate the theoretical model. Reasonable agreements were gained between the predicted solidification paths and the measured results.展开更多
A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of ...A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.展开更多
This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shap...This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.展开更多
Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D pa...Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D path planning, a modified ant colony optimization is proposed in this paper. Firstly, the grid method for environment modeling is adopted. Heuristic information is connected with the planning space. A semi-iterative global pheromone update mechanism is proposed. Secondly, the optimal ants mutate the paths to improve the diversity of the algorithm after a defined iterative number. Thirdly, co-evolutionary algorithm is used. Finally, the simulation result shows the effectiveness of the proposed algorithm in solving the problem of 3D pipe path planning.展开更多
Massive MIMO is one of the enabling technologies for beyond 4G and 5G systems due to its ability to provide beamforming gain and reduce interference Dual-polarized antenna is widely adopted to accommodate a large numb...Massive MIMO is one of the enabling technologies for beyond 4G and 5G systems due to its ability to provide beamforming gain and reduce interference Dual-polarized antenna is widely adopted to accommodate a large number of antenna elements in limited space. However,current CSI(channel state information)feedback schemes developed in LTE for conventional MIMO systems are not efficient enough for massive MIMO systems since the overhead increases almost linearly with the number of antenna. Moreover,the codebook for massive MIMO will be huge and difficult to design with the LTE methodology. This paper proposes a novel CSI feedback scheme named layered Multi-paths Information based CSI Feedback(LMPIF),which can achieve higher spectrum efficiency for dual-polarized antenna system with low feedback overhead. The MIMO channel is decomposed into long term components(multipath directions and amplitudes)and short term components(multipath phases). The relationship between the two components and the optimal precoder is derived in closed form. To reduce the overhead,different granularities in feedback time have been applied for the long term components and short term componentsLink and system level simulation results prove that LMPIF can improve performance considerably with low CSI feedback overhead.展开更多
Many "rich - connected" topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize t...Many "rich - connected" topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl'ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying (RPS), Hedera and equal-cost multi-path routing (ECMP), our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.展开更多
Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domai...Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.展开更多
Soccer robot system is a tremendously challenging intelligent system developed to mimic human soccer competition based on the multi discipline research: robotics, intelligent control, computer vision, etc. robot path ...Soccer robot system is a tremendously challenging intelligent system developed to mimic human soccer competition based on the multi discipline research: robotics, intelligent control, computer vision, etc. robot path planning strategy is a very important subject concerning to the performance and intelligence degree of the multi robot system. Therefore, this paper studies the path planning strategy of soccer system by using fuzzy logic. After setting up two fuzziers and two sorts of fuzzy rules for soccer system, fuzzy logic is applied to workspace partition and path revision. The experiment results show that this technique can well enhance the performance and intelligence degree of the system.展开更多
基金supported by the National Natural Science Foundation of China (Grant Nos.60472060 and 60473039)the National High Technology Research and Development Programof China (863 Program,Grant No.2006AA01Z119)the Innovation Fund of Chinese Academy of Space Technology (Grant No.CAST20090801)
文摘Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks (RBMR-NC). Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.
基金Supported by the National Natural Science Foun dation of China(90204008)
文摘An algorithm of traffic distribution called active multi-path routing (AMR)in active network is proposed. AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths. It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly. The frame of AMR includes adaptive trafficallocation model, the conception of supply bandwidth and its' allocation model, the principle ofcongestion restraint and its' model, and the implement of AMR based on multi-agents system in activenetwork. Through simulations, AMR has distinct effects on network performance. The results show AMRisa valid traffic regulation algorithm.
基金supported by the National Key Research and Development Program of China(2018YFB1003702)the National Natural Science Foundation of China(61472192)the Scientific and Technological Support Project(Society)of Jiangsu Province(BE2016776)
文摘Large-scale and diverse businesses based on the cloud computing platform bring the heavy network traffic to cloud data centers.However,the unbalanced workload of cloud data center network easily leads to the network congestion,the low resource utilization rate,the long delay,the low reliability,and the low throughput.In order to improve the utilization efficiency and the quality of services(QoS)of cloud system,especially to solve the problem of network congestion,we propose MTSS,a multi-path traffic scheduling mechanism based on software defined networking(SDN).MTSS utilizes the data flow scheduling flexibility of SDN and the multi-path feature of the fat-tree structure to improve the traffic balance of the cloud data center network.A heuristic traffic balancing algorithm is presented for MTSS,which periodically monitors the network link and dynamically adjusts the traffic on the heavy link to achieve programmable data forwarding and load balancing.The experimental results show that MTSS outperforms equal-cost multi-path protocol(ECMP),by effectively reducing the packet loss rate and delay.In addition,MTSS improves the utilization efficiency,the reliability and the throughput rate of the cloud data center network.
文摘Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.
基金Project supported by the National Defense Pre-research Foundation
文摘An algorithm for direction angle of arrival(DOA) estimation and array calibration of signals from multiple mobile users in the CDMA systems and multi-path environment was presented . The main idea is that the algorithm employs code-matched filter and model of the inter-symbol interference and multiple-access interference exactly. The correlation matrices of the received signals before and after code-matched filtering were employed to eliminate the effect of the additive white Gaussian noise, and a new mathematical problem was created, a new maximum likelihood method based on the strong law of large number was derived for DOA estimation and array calibration. Computer simulation results prove that the algorithm is effective.
基金National Nature Science Foundation of China (No. 60496311)Nature Science Foundation of Jiangsu Province (No. BK2004067&BK2005409)Foundation of Huawei Technology (No. YJCB2004018NP).
文摘The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.
文摘Adaptive genetic algorithm A SA GA, a novel algorithm, which can dynamically modify the parameters of Genetic Algorithms in terms of simulated annealing mechanism, is proposed for path planning of loosely coordinated multi robot manipulators. Over the task space of a multi robot, a strategy of decoupled planning is also applied to the evolutionary process, which enables a multi robot to avoid falling into deadlock and calculating of composite C space. Finally, two representative tests are given to validate A SA GA and the strategy of decoupled planning.
基金supported by the National Natural Science Foundation of China(6167321461673217+2 种基金61673219)the Natural Science Foundation of the Jiangsu Higher Education Institutions of China(18KJB120011)the Postgraduate Research and Practice Innovation Program of Jiangsu Province(KYCX19_0299)
文摘This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.
基金supported by the Open Project of State Key Laboratory of Powder Metallurgy of Central South University (Grant No. 2008112042)the National Natural Science Foundation of China (Grant Nos. 51071062 and 50801019)Project 973 (Grant No. 2011CB610406)
文摘On the basis of a multi-length scale modeling, a mixture-averaged multi-component /multiphase micro-segregation model was proposed without pre-set function for the micro-scale solute profile. The model explains the effect of morphologies of solidifying phases and solid back diffusion (SBD) on segregation, and covers the two limiting solidification cases of Scheil and Lever-rule models. A commercial Thermo-Calc software package/database was linked to the algorithms via its TQ6-interface for instantaneous determination of the related thermodynamic data of the multi-component alloys. The influences of cooling rate and other parameters on the solidification path and micro-segregation behavior were numerically investigated by sample calculation of the ternary Al-Cu-Mg alloys. A parallel experimental investigation on Al-Cu-Si alloys solidified under different cooling conditions was conducted to validate the theoretical model. Reasonable agreements were gained between the predicted solidification paths and the measured results.
文摘A new algorithm is proposed for underwater vehicles multi-path planning. This algorithm is based on fitness sharing genetic algorithm, clustering and evolution of multiple populations, which can keep the diversity of the solution path, and decrease the operating time because of the independent evolution of each subpopulation. The multi-path planning algorithm is demonstrated by a number of two-dimensional path planning problems. The results show that the multi-path planning algorithm has the following characteristics: high searching capability, rapid convergence and high reliability.
文摘This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.
基金Supported by National Natural Science Foundation of China (50875165)
文摘Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D path planning, a modified ant colony optimization is proposed in this paper. Firstly, the grid method for environment modeling is adopted. Heuristic information is connected with the planning space. A semi-iterative global pheromone update mechanism is proposed. Secondly, the optimal ants mutate the paths to improve the diversity of the algorithm after a defined iterative number. Thirdly, co-evolutionary algorithm is used. Finally, the simulation result shows the effectiveness of the proposed algorithm in solving the problem of 3D pipe path planning.
基金supported by the National High-Tech R&D Program(863 Program 2015AA01A705)
文摘Massive MIMO is one of the enabling technologies for beyond 4G and 5G systems due to its ability to provide beamforming gain and reduce interference Dual-polarized antenna is widely adopted to accommodate a large number of antenna elements in limited space. However,current CSI(channel state information)feedback schemes developed in LTE for conventional MIMO systems are not efficient enough for massive MIMO systems since the overhead increases almost linearly with the number of antenna. Moreover,the codebook for massive MIMO will be huge and difficult to design with the LTE methodology. This paper proposes a novel CSI feedback scheme named layered Multi-paths Information based CSI Feedback(LMPIF),which can achieve higher spectrum efficiency for dual-polarized antenna system with low feedback overhead. The MIMO channel is decomposed into long term components(multipath directions and amplitudes)and short term components(multipath phases). The relationship between the two components and the optimal precoder is derived in closed form. To reduce the overhead,different granularities in feedback time have been applied for the long term components and short term componentsLink and system level simulation results prove that LMPIF can improve performance considerably with low CSI feedback overhead.
基金supported by the National Basic Research Program of China(973 program)under Grant No.2014CB347800 and No.2012CB315803the National High-Tech R&D Program of China(863 program)under Grant No.2013AA013303+1 种基金the Natural Science Foundation of China under Grant No.61170291,No.61133006,and No.61161140454ZTE IndustryAcademia-Research Cooperation Funds
文摘Many "rich - connected" topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl'ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying (RPS), Hedera and equal-cost multi-path routing (ECMP), our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.
基金Acknowledgements This work was supported by Chang Jiang Scholars Program of the Ministry of Education of China, National Science Fund for Distinguished Young Scholars under Grant No.60725104 the National Basic Research Program of China under Grant No. 2007CB310706+2 种基金 the National Natural Science Foundation of China under Ca'ant No. 60932002, No. 60932005, No. 61071101 the Hi-Tech Research and Development Program of China under Grant No. 2009AA01Z254, No. 2009AA01Z215 NCEF Program of MoE of China, and Sichuan Youth Science and Technology Foundation under Crant No. 09ZQ026-032.
文摘Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.
文摘Soccer robot system is a tremendously challenging intelligent system developed to mimic human soccer competition based on the multi discipline research: robotics, intelligent control, computer vision, etc. robot path planning strategy is a very important subject concerning to the performance and intelligence degree of the multi robot system. Therefore, this paper studies the path planning strategy of soccer system by using fuzzy logic. After setting up two fuzziers and two sorts of fuzzy rules for soccer system, fuzzy logic is applied to workspace partition and path revision. The experiment results show that this technique can well enhance the performance and intelligence degree of the system.