To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SO...To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.展开更多
This paper describes the architecture of global distributed storage system for data grid. It focue on the management and the capability for the maximum users and maximum resources on the Internet, as well as performan...This paper describes the architecture of global distributed storage system for data grid. It focue on the management and the capability for the maximum users and maximum resources on the Internet, as well as performance and other issues.展开更多
Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing...Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing algorithms to leverage modern hardware platforms to achieve high performance. This paper presents a Structural Compression （SC） method that optimizes the data structures of both algorithms. It reviews both algorithms under the model of search space decomposition, and homogenizes their search data structures. This approach not only guarantees deterministic lookup speed but also optimizes the data structure for efficient implementation oi1 many-core platforms. The performance evaluation reveals that the homogeneous data structure achieves 10Gbps line-rate 64byte packet classification throughput and multi-Gbps deep inspection speed.展开更多
More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new met...More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new method supporting out of core computations on grids is presented in this paper. The framework and the data storage strategy are described, based on which an easy and efficient out of core programming interface is provided for the programmers.展开更多
The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consi...The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are ignored.In this paper,we first propose the resource allocation with the dynamic SN,and denote it as GraphMap-DS.Then,we propose an efficient mapping algorithm for GraphMap-DS.The performance of the proposed algorithm is evaluated by performing simulation experiments.Our results show that the proposed algorithm can effectively solve the GraphMap-DS.展开更多
基金supported by the 863 Program (2015AA01A705)NSFC (61271187)
文摘To achieve the higher resource efficiency, Coverage and Capacity Optimization(CCO) as an important role of the network self-healing and self-optimization, has become a focus topic in wireless Self-Organized Network(SON). In this paper, a novel CCO scheme is proposed to maximize utility function of the integrated coverage and capacity. It starts with the analysis on the throughput proportional fairness(PF) algorithm and then proposes the novel Coverage and Capacity Proportional Fairness(CCPF) allocation algorithm along with a proof of the algorithms convergence. This proposed algorithm is applied in a coverage capacity optimization scheme which can guarantee the reasonable network capacity by the coverage range accommodation. Next, we simulate the proposed CCO scheme based on telecom operators' real network data and compare with three typical resource allocation algorithms: round robin(RR), proportional fairness(PF) and max C/I. In comparison of the PF algorithm, the numerical results show that our algorithm increases the average throughput by 1.54 and 1.96 times with constructed theoretical data and derived real network data respectively.
文摘This paper describes the architecture of global distributed storage system for data grid. It focue on the management and the capability for the maximum users and maximum resources on the Internet, as well as performance and other issues.
文摘Modem network security devices employ packet classification and pattern matching algorithms to inspect packets. Due to the complexity and heterogeneity of different search data structures, it is difficult for existing algorithms to leverage modern hardware platforms to achieve high performance. This paper presents a Structural Compression （SC） method that optimizes the data structures of both algorithms. It reviews both algorithms under the model of search space decomposition, and homogenizes their search data structures. This approach not only guarantees deterministic lookup speed but also optimizes the data structure for efficient implementation oi1 many-core platforms. The performance evaluation reveals that the homogeneous data structure achieves 10Gbps line-rate 64byte packet classification throughput and multi-Gbps deep inspection speed.
文摘More and more out of core problems that involve solving large amounts of data are researched by scientists. The computational grid provides a wide and scalable environment for those large scale computations. A new method supporting out of core computations on grids is presented in this paper. The framework and the data storage strategy are described, based on which an easy and efficient out of core programming interface is provided for the programmers.
基金supported by the National Basic Research of China(973 Program)under Grant No.2011CB302601the National Natural Science Foundation of China under Grants No.90818028,No.6903043,No.61202117the National High Technology Research and Development Program of China(863 Program)under Grant No.2012AA011201
文摘The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud providers.Existing studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are ignored.In this paper,we first propose the resource allocation with the dynamic SN,and denote it as GraphMap-DS.Then,we propose an efficient mapping algorithm for GraphMap-DS.The performance of the proposed algorithm is evaluated by performing simulation experiments.Our results show that the proposed algorithm can effectively solve the GraphMap-DS.
