Zhao Jianpeng

Design and Implementation of Security Cloud Storage Framework

As cloud computing is mature gradually, cloud computing applications are more and more, as the important aspect, cloud storage received wide attention of industry experts. Based on the deep research of the cloud storage technology, for the problems of confidentiality and privacy in cloud storage framework, design the security cloud storage framework, Solves the confidentiality of documents, and ensure the customers privacy, the Framework has wide application value.

A Congestion Control Scheme Based on Improved RED Algorithm in Internet Topology Simulation

This paper first introduces existing congestion control algorithms and analyses their weakness. And after discusses the features and requirements of network topology simulation system, a congestion control scheme based on improved RED algorithm named DFCC was presented. DFCC reduces the package loss by adjusting link delay dynamically when congestion happens. And by means of twice optimization of adjusting rate of the link delay, it can ensure the stability of the average length of the queue. The experiment results indicate that when the amount of packets increases gradually, the package loss of DFCC scheme will distinctly less than RED algorithm.

Method of Complex Attack Behavior Modeling Based on Atom Function

With the attack tree modeling as the theoretical foundation, this paper reviews the previous researches on methods of attack modeling based on attack tree, and also elaborately describes and weights the tree nodes, and adds the relation of ordering and and probability or to tree nodes. Extract atom functions as leaf nodes, define the tree nodes, and design the algorithm of constructing attack tree, fitting for modeling complex attack behavior, and finally take an example to describe the process of construct attack tree, the result shows that the attack tree describes attack behavior with high precision.

A Static/Dynamic Mixed Routing Simulation Mechanism Based on Core Nodes

This paper firstly analyzes the characteristics and status of the routing simulation. And then according to the characteristics of the network topology simulation system, a static/dynamic mixed routing simulation mechanism based on core nodes is proposed. When one core node operates overload or breaks down, the mechanism will switch subsequent routing to another core node, which can improve authenticity of the network topology simulation and simultaneously ensure the efficiency of the simulation. Experimental results show that the mechanism can not only reflect the changes of the network topology dynamically but also reduce the storage space for the routing tables in the network topology simulation, thus it is valuable for practical application.

Discussion of Soft-Switch Routing Technology Exploration and Its Structure Analysis

Soft switch technology development is the trend, but with its large-scale networking surviving on many issues, such as user location and network addressing, different operators soft switch network interoperability and so on. In this paper, the soft switch routing technology carried out a detailed analysis of argumentation, lists the industry routing solution. In the actual design of soft-switched networks, the routing structure selection and comprehensive consideration of various factors, such as the maturity of protocols and standards, product support capabilities and network scale.

The Analysis and Utilization of SSL Vulnerabilities Used in WEB Application

SSL protocol can ensure the security of the information in WEB application by cryptography. Via analyzing the architecture and the work process of the SSL protocol, in this paper, we propose several methods to attack the protocol, and interpret the conditions to success and the probability ties.

Multi-information Flow Control for Important Information System

In modern operating system, program is executed as process, and each process has an independent running virtual environment. Theres no command transition between processes but data sharing. In common operating systems like Windows or Linux, process has an open structure, malicious processes could interrupt other processes in many ways, and system resource is distributed openly, which could cause many security problems. This paper analysis security control method in multi-application running system, which focus on solving the non-interference information flow, and propose the method to marking data packets of applications information flow, Using those marks to distinguish different applications information flow, then implement security control.

Scalable IP Multicast over Label-Switching Wireless ATM Networks

A Mobile IP multicast prototype that integrates a label-switching wireless asynchronous transfer mode, the mobile core-based multicast architecture, and an Internet multicast infrastructure will be presented. MCOM creates multiple core-based layer 2 multicast trees that are independently established in member networks. They are interconnected via the Internet using layer 3 multicast routing. Gateways on the border of the Internet and wireless ATM networks convert ATM multicast traffic to suitable IP packets as well as converting from IP packets to ATM cells for MCOM. To solve the cell interleaving problem that results, ATM block transfer/immediate transmission capability is reasonably modified. Additionally, class-based block buffer management for ATM multicast connections is built into wireless ATM switches for soft quaky of service control. Dynamic group management, multicast channel rerouting, and reliable multicasting are also studied in relation to existing Internet protocols like Mobile IP, Internet group management protocols, and multicast routing protocols.

A Routing Computation Strategy Based on Improved Clustering Algorithm

A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and Dijkstra (CAKD) in topology partitioning. The routing information of each node can be computed during the clustering process, and CAKD reduces the time cost in routing computation and the storage in storing routing information. Experiments showed that, compared with using Dijkstra to cluster, CAKD cost less time. Meanwhile, compared with the strategy of global shortest path, the routing computation strategy based on improved clustering algorithm costs less storage in storing routing information.

A Fast Routing Selection Method Based on Ant Colony Optimization

A fast clustering routing algorithm based on ant colony optimization and Dijkstra Algorithm is proposed on account of the router-level network topology simulation. First, FCRSA takes advantages of ant colony optimization to cluster the nodes in the network, then uses the improved Dijkstra algorithm to search for the shortest paths in the clusters, reducing the time needed for path selecting in router-level network topology simulation effectively. Experimental results show that the FCRSA-based simulation system of network topology is adequate for topology simulation on router-level.