3009217
Design and Implementation of an Out-of-Band Virtualization System on Solaris 10
In out-of-band virtualization systems, it is typical that the virtual storage manager (VSM) maintains the metadata for all Agents and performs the address mapping. The Agent performs I/O access according to the mapped address. High network latency, poor performance and low scalability are the main problems of this method. This article introduces an improved design and implementation of an out-of-band virtualization system, in which each Agent maintains a copy of the metadata and performs the address mapping by itself, so as to improve performance, reliability and scalability. This article discusses the on-line extension of a logical volume and the related problems such as synchronization. This function improves the ability of uninterrupted service. The system was tested on the UFS of Solaris 10 and the results showed that the performance of a stripe volume consisting of four disks exceeded that of a linear volume by an average of 103.65%.
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.
18897982
An Efficient SAN-Level Caching Method Based on Chunk-Aging
SAN-level caching can manage caching within a global view so that global hot data can be identified and cached. However, two problems may be encountered in the existing SAN-level caching methods: first, too many migrations from disks to cache resulting from cache thrashing; second, too few cache hits resulting from insufficient caching. This paper proposes a SAN-level caching method employing chunk-aging to control the migrations of chunks of data from disks to cache, which takes the temporal distribution of chunk accesses into account and solves the two problems above. Then by employing two LRU lists to manage the cache replacement, this method separates and manages two types of hot data chunks, one of which have burst accesses and the other have long-term frequent accesses, thus preventing them from interfering with each other in cache. The simulation results demonstrate that our method can achieve a high hit ratio while maintaining a relatively low migration rate.
8746552
A queueing analysis for the denial of service (DoS) attacks in computer networks
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in the current literature. In this paper, we propose one queueing model for the evaluation of the denial of service (DoS) attacks in computer networks. The network under DoS attacks is characterized by a two-dimensional embedded Markov chain model. With this model, we can develop a memory-efficient algorithm for finding the stationary probability distribution which can be used to find other interesting performance metrics such as the connection loss probability and buffer occupancy percentages of half-open connections for regular traffic and attack traffic. Different from previous works in the literature, this paper gives a more general analytical approach to the study of security measures of a computer network under DoS attacks. We hope that our approach opens a new avenue to the quantitative evaluation of more complicated security schemes in computer networks.
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.
12547630
Performance Evaluation of a Privacy-Enhancing Framework for Personalized Websites
Reconciling personalization with privacy has been a continuing interest in the user modeling community. In prior work, we proposed a dynamic privacy-enhancing user modeling framework based on a software product line architecture (PLA). Our system dynamically selects personalization methods during runtime that respect users' current privacy preferences as well as the prevailing privacy laws and regulations. One major concern about our approach is its performance since dynamic architectural reconfiguration during runtime is usually resource-intensive. In this paper, we describe four implementations of our system that vary two factors, and an in-depth performance evaluation thereof under realistic workload conditions. Our study shows that a customized version performs better than the original PLA implementation, that a multi-level caching mechanism improves both versions, and that the customized version with caching performs best. The average handling time per user session is less than 0.2 seconds for all versions except the original PLA implementation. Overall, our results demonstrate that with a reasonable number of networked hosts in a cloud computing environment, an internationally operating website can use our dynamic PLA-based user modeling approach to personalize their user services, and at the same time respect the individual privacy desires of their users as well as the privacy norms that may apply.
12250963
Boosting for Learning Multiple Classes with Imbalanced Class Distribution
Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which assume a relatively balanced class distribution and equal misclassification costs. This learning difficulty attracts a lot of research interests. Most efforts concentrate on bi-class problems. However, bi-class is not the only scenario where the class imbalance problem prevails. Reported solutions for bi-class applications are not applicable to multi-class problems. In this paper, we develop a cost-sensitive boosting algorithm to improve the classification performance of imbalanced data involving multiple classes. One barrier of applying the cost-sensitive boosting algorithm to the imbalanced data is that the cost matrix is often unavailable for a problem domain. To solve this problem, we apply Genetic Algorithm to search the optimum cost setup of each class. Empirical tests show that the proposed cost-sensitive boosting algorithm improves the classification performances of imbalanced data sets significantly.
33302534
A space-efficient algorithm for sequence alignment with inversions and reversals
A dynamic programming algorithm to find an optimal alignment for a pair of DNA sequences has been described by Schoniger and Waterman. The alignments use not only substitutions, insertions, and deletions of single nucleotides, but also inversions, which are the reversed complements, of substrings of the sequences. With the restriction that the inversions are pairwise non-intersecting, their proposed algorithm runs in O(n2m2) time and consumes O(n2m2) space, where n and m are the lengths of the input sequences, respectively. We develop a space-efficient algorithm to compute such an optimal alignment which consumes only O(nm) space within the same amount of time. Our algorithm enables the computation for a pair of DNA sequences of length up to 10,000 to be carried out on an ordinary desktop computer. Simulation study is conducted to verify some biological facts about gene shuffling across species.
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.
1917143
Wireless Sensing, Actuation and Control - With Applications to Civil Structures
Structural monitoring and control have been subjects of interests in structural engineering for quite some time. Structural sensing and control technologies can benefit in terms of installation cost and time from wireless communication and embedded computing. The hardware and software requirements pose an interesting, interdisciplinary research challenge. This paper describes a low-cost wireless sensing system that is judiciously designed for large-scale applications in civil structures. Laboratory and field tests have been conducted to validate the performance of the prototype system for measuring vibration responses. By incorporating an actuation signal generation interface, the wireless sensing system has the capabilities to perform structural actuation and support structural control applications. Structural control tests have been performed to validate the wireless sensing and actuation system.