18765129
Security Analysis of Enterprise Network Based on Stochastic Game Nets Model
In this paper, we propose a novel modeling method, Stochastic Game Nets (SGN), and use it to model and analyze the security issues in enterprise networks. Firstly, the definition and modeling algorithm of Stochastic Game Nets are given. And then we apply the Stochastic Game Nets method to describe the attack and defense course in the enterprise networks successfully, and find a Nash equilibrium. Finally we analyze the confidentiality and integrity of the enterprise network quantificationally based on the model. The method can also be applied to other areas with respect to a game.
23190531
Algorithm for yield driven correction of layout
As the development of VLSI technique, the critical dimension of IC has become smaller than the exposure wavelength. Due to the diffraction and interaction of optical waves, deformations between the image on wafer and the feature on layout are undeniable. This results in bad performance or even invalid circuits of the chips. OPC is critical compensation technique to correct the deformations on wafer images. This work presents a layout correction and optimization algorithm called MOPC; it's a flexible and efficient core for the model-based OPC system. Since we divide the target features into different types before correction, the OPE between the target features and the environment features and the OPE between the neighboring segments of the inside feature are both considered during the correction.
18554673
Network processing performability evaluation on heterogeneous reliability multicore processors using SRN model
Future network systems and embedded infrastructure devices in ubiquitous environments will need to consume low power and process large amounts of network packet traffic. In order to meet necessary high processing efficiency requirements, future processors will have many heterogeneous cores with reduced reliability due to low voltage, small transistor sizes, semiconductor wearout, and environmental factors such as noise and interference. It will be necessary for multi-core network infrastructure software to mitigate transient hardware faults to maintain acceptable system reliability. Applications such as packet processing can benefit from the reliability versus performance tradeoff. We propose a model based on Stochastic Reward Nets to evaluate the performance vs. reliability tradeoff of unreliable embedded multi-core network processors, and apply this model to a multi-core packet processing application.
17238158
A Novel Cookie-Based DDoS Protection Scheme and its Performance Analysis
Seamless handover is one of the most attractive research fields in B3G systems. Many mechanisms are proposed to provide certain QoS guarantees in handovers of mobile systems, which would also introduce new threats, such as DoS and DDOS attacks. In this paper, we extend a cookie-based scheme to protect systems from DoS and DDoS attacks. We also adopt a novel queuing network model to analyze our scheme by estimating two essential metrics, i.e. the mean total response time and the mean queue length of MAP. Numerical results indicate that our mechanism works better than the traditional cookie-based scheme and it could effectively help networks defend against abnormal attacks in the handover process.
18413233
Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks
Localization algorithm continues to be an important and challenging topic in today's wireless sensor networks (WSNs). In this paper, a novel range-free localization algorithm using expected hop progress (LAEP) to predict the location of any sensor in a WSN is proposed. This algorithm is based on an accurate analysis of hop progress in a WSN with randomly deployed sensors and arbitrary node density. By deriving the expected hop progress from a network model for WSNs in terms of network parameters, the distance between any pair of sensors can be accurately computed. Since the distance estimation is a key issue in localization systems for WSNs, the proposed range-free LAEP achieves better performance and less communication overhead as compared to some existent schemes like DV-Hop and RAW. In addition, we study the effect of anchor placement on the algorithm performance by deriving the corresponding mean position error range. Extensive simulations are performed and the results are observed to be in good agreement with the theoretical analysis.
30687848
Application of Distributed GA-Based RBF Neural Network in Fire Detection
Distributed neural network based on RBF network is used to establish the model of fire detection in view of complexity of fire process and multiplicity of fire environment. For guaranteeing network adaptability, the number of subnets neural network and degree of sample belong to subnet are determined by fuzzy nearest clustering, RBF network is optimized though a improved genetic algorithm by adaptive genetic algorithm is improved by auto-adaptive crossover probability and the mutation probability that determined the adaptation value. The feasibility of adaptability of the model is proved through training and testing in fire detection model.
206780897
An efficient hybrid join algorithm: a DB2 prototype
A new join method, called hybrid join, is proposed which uses the join-index filtering and the skip sequential prefetch mechanism for efficient data access. With this method, the outer table is sorted on the join column. Then, the outer is joined with the index on the join column of the inner. The inner tuple is represented by its surrogate, equivalent of its physical disk address, which is carried in the index. The partial join result is sorted on the surrogate and then the inner table is accessed sequentially to complete the join result. Local predicate filtering can also be applied before the access of the inner relation through the index AND/ORing. Efficient methods for skip sequential access and prefetching of logically discontiguous leaf pages of B/sup +/-tree indexes are also presented.<<ETX>>
17622745
Automatic synthesis of multi-tasking implementations from real-time object-oriented models
Presents an approach towards the automatic synthesis of implementations from real-time object-oriented design models. From an application design model that addresses the functional requirements of the system, and given end-to-end timing requirements, our synthesis approach generates a feasible implementation model, i.e. one that will meet the timing requirements. The synthesis process is supported by automatic code generation that can take the application design model and the synthesized implementation model, and can generate code for the target platform. The synthesis of an implementation model is facilitated through the use of a generic (application-independent) implementation architecture, thereby reducing the synthesis problem to selecting a mapping of the application design model to the artifacts of the implementation architecture. In this paper, we use a multi-threaded event handling architecture with fixed event priorities. The synthesis problem then consists of determining priorities for events and mapping events to threads. We show how, given such a mapping, the response times can be analyzed, and then how, using the analysis, a feasible implementation model can be automatically synthesized.
24862782
A Robust Load Balancing Pattern for Grid Computing
Availability of grid resources is dynamic, which raises the need to develop robust and effective applications against changing circumstances. The paper proposes a robust load balancing pattern and centralized control task scheduler is discussed. Based on improving fault tolerant service on request chain processing, the paper enhances ORBUS1.1 software with load balancing service. Simulation results show that the implementation is able to obtain high system performance with central-control task scheduling and MAXPERFORMpolicy.