基于IEEE802.15.5的高速无线个域网(wireless personal area network,WPAN)Mesh网络中的基于服务器的路由算法(server routing,SR)在链路状态信息注册阶段和最优路径建立阶段均存在冗余的开销和操作。提出一种高效率低时延的路由算法(hi...基于IEEE802.15.5的高速无线个域网(wireless personal area network,WPAN)Mesh网络中的基于服务器的路由算法(server routing,SR)在链路状态信息注册阶段和最优路径建立阶段均存在冗余的开销和操作。提出一种高效率低时延的路由算法(high-efficiency and low-delay routing algorithm,HLRA)。在HLRA算法中引入了广播链路状态注册消息机制和缩短中继列表长度机制,从而利于更快速地建立最优路。理论分析和仿真结果表明,与SR算法相比,HLRA算法在保持包的投递率不变的前提下,减小了网络开销,降低了平均端到端时延。展开更多
In the past two decades, software aging has been studied by both academic and industry communities. Many scholars focused on analytical methods or time series to model software aging process. While machine learning ha...In the past two decades, software aging has been studied by both academic and industry communities. Many scholars focused on analytical methods or time series to model software aging process. While machine learning has been shown as a very promising technique in application to forecast software state: normal or aging. In this paper, we proposed a method which can give practice guide to forecast software aging using machine learning algorithm. Firstly, we collected data from a running commercial web server and preprocessed these data. Secondly, feature selection algorithm was applied to find a subset of model parameters set. Thirdly, time series model was used to predict values of selected parameters in advance. Fourthly, some machine learning algorithms were used to model software aging process and to predict software aging. Fifthly, we used sensitivity analysis to analyze how heavily outcomes changed following input variables change. In the last, we applied our method to an IIS web server. Through analysis of the experiment results, we find that our proposed method can predict software aging in the early stage of system development life cycle.展开更多
The secure socket layer/ transport layer security（SSL/TLS） handshake protocol uses public key cryptographic algorithms such as RSA for key establishment. Typically, public key cryptographic algorithm is computationa...The secure socket layer/ transport layer security（SSL/TLS） handshake protocol uses public key cryptographic algorithms such as RSA for key establishment. Typically, public key cryptographic algorithm is computational intensive due to the modular multiplications. Therefore, SSL/TLS servers often become swamped while performing public key decryptions when the simultaneous requests increase quickly. A batch RSA decryption algorithm was proposed. The novel algorithm provides the reasonable response time and optimizes server performance significantly. The decryption speedup is proportional to the batch size b, for instance, the speedup factor is 4, while in Shacham＇s scheme the acceleration rate is only 2.5 when b = 4.展开更多
Distributed Data Mining is expected to discover preciously unknown, implicit and valuable information from massive data set inherently distributed over a network. In recent years several approaches to distributed data...Distributed Data Mining is expected to discover preciously unknown, implicit and valuable information from massive data set inherently distributed over a network. In recent years several approaches to distributed data mining have been developed, but only a few of them make use of intelligent agents. This paper provides the reason for applying Multi-Agent Technology in Distributed Data Mining and presents a Distributed Data Mining System based on Multi-Agent Technology that deals with heterogeneity in such environment. Based on the advantages of both the CS model and agent-based model, the system is being able to address the specific concern of increasing scalability and enhancing performance.展开更多
To reduce the potential signaling traffic in IP multimedia subsystem （IMS）, the session establishment procedures were investigated. The serving call session eontrol function （S-CSCF） is the major bottleneck in IMS...To reduce the potential signaling traffic in IP multimedia subsystem （IMS）, the session establishment procedures were investigated. The serving call session eontrol function （S-CSCF） is the major bottleneck in IMS and the existing 3GPP service triggering algorithm （STA） based on initial filter eriteria （iFC） increases the end-to-end session setup delay remarkably. To reduce the session setup delay and improve the system performanee, a SIP response message based filter criteria （rFC） was proposed. Based on the rFC, a SIP response message based STA （RSTA） was further proposed. The modeling and theoretical analysis of 3GPP STA and RSTA were presented. Simulation results show that, compared with 3GPP STA, the RSTA can avoid the additional signaling traffie load of the S-CSCF and application server （AS） effectively, reduce the session setup delay eonsiderably, increase the throughput of the S-CSCF and improve the quality of service （QoS） of IMS network.展开更多
Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clu...Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clusters by utilizing all system resources effectively and to avoid violent shaking of the system per- formance. A lot of simulations on the Petri net model of load balance system are conducted and the algorithm is compared with some traditional algorithms on balancing ability for heterogeneity, system throughput, re- quest response time and performance stability. The results of simulations show that the algorithm achieves system higher performance and it has excellent ability to deal with the heterogeneity of clustered media server.展开更多
Based on the demand of the admission control of softswitch-based clustered media server, this pa- per proposed a new dynamic quota-based admission control algorithm that has a sub-negotiation process. The strongpoint ...Based on the demand of the admission control of softswitch-based clustered media server, this pa- per proposed a new dynamic quota-based admission control algorithm that has a sub-negotiation process. The strongpoint of quota-based algorithm had been inherited in the algorithm and at the same time some new ideas had also been introduced into it. Simulations of the algorithm had been conducted on the Petri net model and the results show that this algorithm has excellent performance. In order to find the optimal resource quota set- ting in real time, the paper proposed two approximation analysis methods. It can be seen from analysis results that these two methods can be used to get sub-optimal quota values quickly and effectively. These two ap- proximation analysis methods will play important roles in implementation of the algorithm in system.展开更多
This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The fi...This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm(GA) to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound(BB) algorithm and the heuristic algorithm, coordinated scheduling(CS), which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.展开更多
A web-based fashion design system-FashDesn was developed for non-professionals to make their own style-based design by choosing and combining fashion parts. We use genetic algorithm to find the optimal satisfied style...A web-based fashion design system-FashDesn was developed for non-professionals to make their own style-based design by choosing and combining fashion parts. We use genetic algorithm to find the optimal satisfied style, while the fitness function of GA is approached by artificial neural network. The users’ style intention can be reached through the learning process of the artificial neural network. The system architecture and some realization details of the system are given in the paper. An output contrast for elegant style women’s before and after user’s interaction is used to illustrate its usefulness in the end.展开更多
The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (...The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.展开更多
In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues wi...In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.展开更多
文摘基于IEEE802.15.5的高速无线个域网(wireless personal area network,WPAN)Mesh网络中的基于服务器的路由算法(server routing,SR)在链路状态信息注册阶段和最优路径建立阶段均存在冗余的开销和操作。提出一种高效率低时延的路由算法(high-efficiency and low-delay routing algorithm,HLRA)。在HLRA算法中引入了广播链路状态注册消息机制和缩短中继列表长度机制,从而利于更快速地建立最优路。理论分析和仿真结果表明,与SR算法相比,HLRA算法在保持包的投递率不变的前提下,减小了网络开销,降低了平均端到端时延。
基金supported by the grants from Natural Science Foundation of China(Project No.61375045)the joint astronomic fund of the national natural science foundation of China and Chinese Academic Sinica(Project No.U1531242)Beijing Natural Science Foundation(4142030)
文摘In the past two decades, software aging has been studied by both academic and industry communities. Many scholars focused on analytical methods or time series to model software aging process. While machine learning has been shown as a very promising technique in application to forecast software state: normal or aging. In this paper, we proposed a method which can give practice guide to forecast software aging using machine learning algorithm. Firstly, we collected data from a running commercial web server and preprocessed these data. Secondly, feature selection algorithm was applied to find a subset of model parameters set. Thirdly, time series model was used to predict values of selected parameters in advance. Fourthly, some machine learning algorithms were used to model software aging process and to predict software aging. Fifthly, we used sensitivity analysis to analyze how heavily outcomes changed following input variables change. In the last, we applied our method to an IIS web server. Through analysis of the experiment results, we find that our proposed method can predict software aging in the early stage of system development life cycle.
基金The National Natural Science Foundation of China (No. 60273049, 60303026, 60473020)
文摘The secure socket layer/ transport layer security（SSL/TLS） handshake protocol uses public key cryptographic algorithms such as RSA for key establishment. Typically, public key cryptographic algorithm is computational intensive due to the modular multiplications. Therefore, SSL/TLS servers often become swamped while performing public key decryptions when the simultaneous requests increase quickly. A batch RSA decryption algorithm was proposed. The novel algorithm provides the reasonable response time and optimizes server performance significantly. The decryption speedup is proportional to the batch size b, for instance, the speedup factor is 4, while in Shacham＇s scheme the acceleration rate is only 2.5 when b = 4.
文摘Distributed Data Mining is expected to discover preciously unknown, implicit and valuable information from massive data set inherently distributed over a network. In recent years several approaches to distributed data mining have been developed, but only a few of them make use of intelligent agents. This paper provides the reason for applying Multi-Agent Technology in Distributed Data Mining and presents a Distributed Data Mining System based on Multi-Agent Technology that deals with heterogeneity in such environment. Based on the advantages of both the CS model and agent-based model, the system is being able to address the specific concern of increasing scalability and enhancing performance.
基金Supported by National Science Fund for Distinguished Young Scholars (No. 60525110)National Basic Research Program of China (No.2007CB307100, 2007CB307103)+1 种基金Program for New Century Excellent Talents in University (No. NCET-04-0111 )Development Fund Project for Electronic and Information Industry (Mobile Service and Application System Based on 3G)
文摘To reduce the potential signaling traffic in IP multimedia subsystem （IMS）, the session establishment procedures were investigated. The serving call session eontrol function （S-CSCF） is the major bottleneck in IMS and the existing 3GPP service triggering algorithm （STA） based on initial filter eriteria （iFC） increases the end-to-end session setup delay remarkably. To reduce the session setup delay and improve the system performanee, a SIP response message based filter criteria （rFC） was proposed. Based on the rFC, a SIP response message based STA （RSTA） was further proposed. The modeling and theoretical analysis of 3GPP STA and RSTA were presented. Simulation results show that, compared with 3GPP STA, the RSTA can avoid the additional signaling traffie load of the S-CSCF and application server （AS） effectively, reduce the session setup delay eonsiderably, increase the throughput of the S-CSCF and improve the quality of service （QoS） of IMS network.
基金Supported by: (1) Specialized Research Fund for the Doctoral Program of Higher Education (No. 20030013006) (2) National Specialized R&D Project for the Product of Mobile Communications (Develop-ment and Application of Next Generation Mobile Intel-ligent Network System) (3) Development Fund for Electronic and Information Industry (Value-added Ser-vice Platform and Application System for Mobile Communications).
文摘Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clusters by utilizing all system resources effectively and to avoid violent shaking of the system per- formance. A lot of simulations on the Petri net model of load balance system are conducted and the algorithm is compared with some traditional algorithms on balancing ability for heterogeneity, system throughput, re- quest response time and performance stability. The results of simulations show that the algorithm achieves system higher performance and it has excellent ability to deal with the heterogeneity of clustered media server.
基金(1) Specialized Research Fund for the Doctoral Program of Higher Education (No.20030013006) (2) National Specialized R&D Pro-ject for the Product of Mobile Communications (Devel-opment and Application of Next Generation Mobile In-telligent Network System) (3) Development Fund for Electronic and Information Industry (Value-added Ser-vice Platform and Application System for Mobile Communications).
文摘Based on the demand of the admission control of softswitch-based clustered media server, this pa- per proposed a new dynamic quota-based admission control algorithm that has a sub-negotiation process. The strongpoint of quota-based algorithm had been inherited in the algorithm and at the same time some new ideas had also been introduced into it. Simulations of the algorithm had been conducted on the Petri net model and the results show that this algorithm has excellent performance. In order to find the optimal resource quota set- ting in real time, the paper proposed two approximation analysis methods. It can be seen from analysis results that these two methods can be used to get sub-optimal quota values quickly and effectively. These two ap- proximation analysis methods will play important roles in implementation of the algorithm in system.
基金Supported by National Natural Science Foundation of China(No.61271374)Beijing Natural Science Foundation(No.4122068)
文摘This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm(GA) to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound(BB) algorithm and the heuristic algorithm, coordinated scheduling(CS), which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.
文摘A web-based fashion design system-FashDesn was developed for non-professionals to make their own style-based design by choosing and combining fashion parts. We use genetic algorithm to find the optimal satisfied style, while the fitness function of GA is approached by artificial neural network. The users’ style intention can be reached through the learning process of the artificial neural network. The system architecture and some realization details of the system are given in the paper. An output contrast for elegant style women’s before and after user’s interaction is used to illustrate its usefulness in the end.
基金Projects(51007021, 60402004) supported by the National Natural Science Foundation of China
文摘The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.
基金supported by National Science Foundation under DMI-0200306supported in part by a grant from National Natural Science Foundation of China under No.70228001.
文摘In this paper we study a queueing system with state-dependent services and state-dependent vacations, or simply G/M（n）/1/K. Since the service rate is state-dependent, this system includes G/M/c and G/M/c/K queues with various types of station vacations as special cases. We provide a recursive algorithm using the supplementary variable technique to numerically compute the stationary queue length distribution of the system. The only input requirement is the Laplace-Stieltjes transform of the interarrival distribution as well as the state-dependent service rate and state-dependent vacation rate. In a subsequent companion paper, we study its dual system M（n）/G/1/K queue with statedependent vacations.
