Monitoring virtual machine (VM) is an essential function for virtualized platforms. Existing solutions are either coarse-grained - monitoring in granularity of VM level, or not general - only support specific monitori...
详细信息
Monitoring virtual machine (VM) is an essential function for virtualized platforms. Existing solutions are either coarse-grained - monitoring in granularity of VM level, or not general - only support specific monitoring functions for particular guest operating system (OS). Thus they do not satisfy the monitoring requirement in large-scale server cluster such as data center and public cloud platform, where each physical platform runs hundreds of VMs with different guest OSes. In this paper, we propose VMDriver, a general and fine-grained approach for virtualization monitoring. The novel design of VMDriver is the separation of event interception point in VMM level and rich guest OS semantic reconstructions in management domain. With this design, variant monitoring drivers in management domain can mask the differences of guest OSes. We implement VMDriver on Xen and our experimental study shows that it introduces very small performance overhead. We demonstrate its generality by inspecting four aspects information about the target virtual machines with different guest OSes. The unified interface of VMDriver brings convenience to develop complex monitoring tools for distributed virtualization environment.
Warcraft III is one of the most popular Multiplayer Online Game (MOG) games, where users are designed to interact with support of a dedicated server. PKTown is a P2P-based third-party middleware developed to replace t...
详细信息
Warcraft III is one of the most popular Multiplayer Online Game (MOG) games, where users are designed to interact with support of a dedicated server. PKTown is a P2P-based third-party middleware developed to replace the dedicated servers. This paper presents the scalability and robustness of PKTown 2.0 architecture. The evaluation demonstrates the efficiency of the architecture.
When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other...
详细信息
When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications by-pass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead.
Peer-to-peer (P2P) on-demand streaming systems inevitably suffer from peers churn that is the inherent dynamic characteristic of overlay network. With frequent peer departure, a large amount of media data cached on pe...
详细信息
Peer-to-peer (P2P) on-demand streaming systems inevitably suffer from peers churn that is the inherent dynamic characteristic of overlay network. With frequent peer departure, a large amount of media data cached on peer disk turns offline and unavailable, which becomes the major reason of heavy server load. To address the above issue, a new proactive data replication mechanism is proposed and implemented in existing P2P on-demand system GirdCast. Based on the new mechanism, peer can proactively replicate data chunks to stable cache servers for future sharing, when it has high possibility to leave the overlay. Two key heuristic algorithms are designed for departure prediction and replicated chunks selection. System trace driven simulation shows that the mechanism greatly decreases bandwidth load of media source server and improves the availability of chunks highly demanded but poorly provisioned by overlay peers.
Peer-to-Peer SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. A lot of companies can be benefited if conventional SIP environment does not require the config...
详细信息
Peer-to-Peer SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. A lot of companies can be benefited if conventional SIP environment does not require the configuration and maintenance of central servers. However, existing P2PSIP systems put too much emphasis on the decentralization of SIP elements and the briefness of distribution. To some extent, P2PSIP system is manageable, but the control of the entire system is still relatively weak. In this paper, we propose a hierarchical P2PSIP system to address the manageable problems. Actual deployment and exhaustive simulations are performed to evaluate the performance of our P2PSIP schemes. Results indicate that the manageable approach not only solves the control liability problem, but also performs good reliability, scalability, and interoperability.
This paper investigates the problem of Partitioning Skew in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amo...
详细信息
This paper investigates the problem of Partitioning Skew in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads.
Data hiding in computer system is an interesting and important research issue, which brings benefits for secret communication and watermarking. The development of virtual machine brings new potential for data hiding. ...
详细信息
Data hiding in computer system is an interesting and important research issue, which brings benefits for secret communication and watermarking. The development of virtual machine brings new potential for data hiding. In this paper we explore the potential for data hiding in virtual machine disk images, and especially hiding schemes that can be used with copy-on-write images. Besides being considered as a way for valid uses such as secret communication and watermarking, these schemes can be a warning against malicious intentions as well. Furthermore, it lays the foundation for a more thorough analysis of the whole virtual machine system for data hiding.
Agent-based grid data loading method aims at integrating heterogeneous hospitals' information systems into a medical information exchange platform based on grid middleware. It collects distributed data sets for de...
详细信息
Virtual machine (VM) technologies are becoming more and more important among industrial and academic institutions with the decreasing cost of computer hardware. It can offer a lot of benefits including performance iso...
详细信息
ISBN:
(纸本)9781605584058
Virtual machine (VM) technologies are becoming more and more important among industrial and academic institutions with the decreasing cost of computer hardware. It can offer a lot of benefits including performance isolation, server consolidation, and live migration. However, the development of virtualization technology is preferred to application isolation as yet, thus the performance overheads of communicate between virtual machines which are resident on the same physical machine are relatively high. In network-intensive applications, such as Internet servers, are consolidated in a physical machine using VM technology, the inter-domain shared memory communication mechanisms is necessary. In other words, nearly all the virtual machine monitors are not very efficient in I/O performance to meet these applications' requirements. As a result, some scholars resort to inter-domain shared memory mechanisms to improve data transferring performance, but some of these solutions only provide one-way tunnel for domains to communicate with each other, and others are not network-bypass, which use the existing AF-INET protocol family, and incur unnecessary overhead brought by TCP/IP stack. In this paper, we present an inter-domain data transferring system, called IDTS, with dual-way tunnels and fully network-bypass features in Xen virtual machine environment. The design of IDTS is different from virtual network scheme in that IDTS uses static circular memory buffer shared between domains instead of the Xen page-flipping mechanism. In order to enable dual-way communication, IDTS provides two shared memory tunnels for co-resident domains to communicate with each other. Our evaluation demonstrates that IDTS can reduce inter-domain round trip latency by nearly a factor of 4, and increase bandwidth by approximately 5 times, and also keep high scalability, compared with traditional TCP/IP approach. Copyright 2009 ACM.
Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks beco...
详细信息
暂无评论