In this paper, we propose an analogy based immune recognition method that focuses on the implement of the clone selection process and the negative selection process by means of analogy similarity. This method is appli...In this paper, we propose an analogy based immune recognition method that focuses on the implement of the clone selection process and the negative selection process by means of analogy similarity. This method is applied in an IDS （Intrusion Detection System） following several steps. Firstly, the initial abnormal behaviours sample set is optimized through the combining of the AIS （Artificial Immune System） and the genetic algorithm. Then, the abnormity probability algorithm is raised considering the two sides of abnormality and normality. Finally, an intrusion detection system model is established based on the above algorithms and models.展开更多
To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, a...To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, an SP publishes its services in a partition of SPs to construct connections between highly similar SPs. These SPs constitute a self-organized distributed environment. A self-organizing protocol is designed to ensure the correctness of the construction of the alliances. The protocol consists of four stages - initiating stage, developing stage, developed stage and degradation stage. The experimental results demonstrate that this protocol ensures the self-property. The visualization of alliance developing stages illustrates that sub-alliances are sp lit in balance and self-connected. Compared with the Random Walker algorithm, the time cost and the number of forwarded messages in alliance-based mechanism is lower in service discovery. On three typical topologies (Grid, Random-Graph, Power-Law), the success rate of service discovery is much higher, which shows that self-organized alliances are helpful to enhance the discovery performance.展开更多
Dynamic latency over the Intemet is an Important parameter for evaluating the performance of Web service orchestration. In this paper, we propose a performance analyzing and correctness checking method for service orc...Dynamic latency over the Intemet is an Important parameter for evaluating the performance of Web service orchestration. In this paper, we propose a performance analyzing and correctness checking method for service orchestration with dynamic latency simulated in Colored PetriNets （CPNs）. First, we extend the CPN to Web Service Composition Orchestration Network System （WS-CONS） for the description of dynamic latency in service orchestration. Secondly, with simulated dynamic latency, a buffer-limited policy and admittance-control policy are designed in WS- CONS and implemented on CPN Tools. In the buffer-limited policy, the passing messages would be discarded if the node capacity is not adequate. In the admittance-control policy, the ability of a message entering the system depends on the number of messages concurrently flowing in the system. This helps to enhance the success rate of message passing. Finally, the system performance is evaluated through running models in CPN Tools. Simulated results show that the dynamic latency plays an important role in the system throughput and response latency. This simulation helps system designers to quickly make proper compromises at low cost.展开更多
基金Supported by the National Natural Science Foundation ofChina (60563002) Scientific Research Programof the Higher EducationInstitution of Xinjiang (XJEDU2004I03)
文摘In this paper, we propose an analogy based immune recognition method that focuses on the implement of the clone selection process and the negative selection process by means of analogy similarity. This method is applied in an IDS （Intrusion Detection System） following several steps. Firstly, the initial abnormal behaviours sample set is optimized through the combining of the AIS （Artificial Immune System） and the genetic algorithm. Then, the abnormity probability algorithm is raised considering the two sides of abnormality and normality. Finally, an intrusion detection system model is established based on the above algorithms and models.
基金This paper was supported by the Natural Science Foundation of China under Grants No. 61170053, No. 61100205 the Nat- ural Science Foundation of Beijing under Grant No. 4112027 the Natural Science Foundation of Hebei under Grant No. F2009000929. The authors would like to thank the anony- mous reviewers for their helpful comments from which the preparation for this version of the paper has benefited.
文摘To improve the performance and robustness in service discovery, a self-organizing mechanism for service alliances of Service Providers (SPs) is proposed in this paper. According to the similarity of service content, an SP publishes its services in a partition of SPs to construct connections between highly similar SPs. These SPs constitute a self-organized distributed environment. A self-organizing protocol is designed to ensure the correctness of the construction of the alliances. The protocol consists of four stages - initiating stage, developing stage, developed stage and degradation stage. The experimental results demonstrate that this protocol ensures the self-property. The visualization of alliance developing stages illustrates that sub-alliances are sp lit in balance and self-connected. Compared with the Random Walker algorithm, the time cost and the number of forwarded messages in alliance-based mechanism is lower in service discovery. On three typical topologies (Grid, Random-Graph, Power-Law), the success rate of service discovery is much higher, which shows that self-organized alliances are helpful to enhance the discovery performance.
基金This paper was supported by the National Natural Science Foundation of China under Grants No.61170053,No.61101214,No.61100205，the National High-Tech Research and Development Plan of China under Grant No.2012AA010902-1，the Natural Science Foundation of Beijing under Grant No.4112027，Special Project of National CAS Union-The High Performace Cloud Service Platform for Enterprise Creative Computing
文摘Dynamic latency over the Intemet is an Important parameter for evaluating the performance of Web service orchestration. In this paper, we propose a performance analyzing and correctness checking method for service orchestration with dynamic latency simulated in Colored PetriNets （CPNs）. First, we extend the CPN to Web Service Composition Orchestration Network System （WS-CONS） for the description of dynamic latency in service orchestration. Secondly, with simulated dynamic latency, a buffer-limited policy and admittance-control policy are designed in WS- CONS and implemented on CPN Tools. In the buffer-limited policy, the passing messages would be discarded if the node capacity is not adequate. In the admittance-control policy, the ability of a message entering the system depends on the number of messages concurrently flowing in the system. This helps to enhance the success rate of message passing. Finally, the system performance is evaluated through running models in CPN Tools. Simulated results show that the dynamic latency plays an important role in the system throughput and response latency. This simulation helps system designers to quickly make proper compromises at low cost.
