Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

University of Nebraska - Lincoln

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1411 - 1440 of 1739

Full-Text Articles in Computer Sciences

Channel-Aware Peer Selection In Multi-View Peer-To-Peer Multimedia Streaming, Miao Wang, Lisong Xu, Byrav Ramamurthy Jan 2008

Channel-Aware Peer Selection In Multi-View Peer-To-Peer Multimedia Streaming, Miao Wang, Lisong Xu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Motivated by the success of the Picture in Picture feature of the traditional TV, several commercial Peer-to-Peer Multi-Media Streaming (P2PMMS) applications now support the multi-view feature, with which a user can simultaneously watch multiple channels on its screen. This paper considers the peer selection problem in multi-view P2PMMS. This problem has been well studied in the traditional single-view P2PMMS; however, it becomes more complicated in multi-view P2PMMS, mainly due to the fact that a peer watching multiple channels joins multiple corresponding overlays. In this paper, we propose a novel peer selection algorithm, called Channel-Aware Peer Selection (CAPS), where a peer …

Go to article

Predicting Accurate And Actionable Static Analysis Warnings: An Experimental Approach, Joseph Ronald Ruthruff, John Penix, J. David Morgenthaler, Sebastian Elbaum, Gregg Rothermel Jan 2008

Predicting Accurate And Actionable Static Analysis Warnings: An Experimental Approach, Joseph Ronald Ruthruff, John Penix, J. David Morgenthaler, Sebastian Elbaum, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Static analysis tools report software defects that may or may not be detected by other verification methods. Two challenges complicating the adoption of these tools are spurious false positive warnings and legitimate warnings that are not acted on. This paper reports automated support to help address these challenges using logistic regression models that predict the foregoing types of warnings from signals in the warnings and implicated code. Because examining many potential signaling factors in large software development settings can be expensive, we use a screening methodology to quickly discard factors with low predictive power and cost-effectively build predictive models. Our …

Go to article

An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal Jan 2008

An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal

School of Computing: Conference and Workshop Papers

Extraction of features from images has been a goal of researchers since the early days of remote sensing. While significant progress has been made in several applications, much remains to be done in the area of accurate identification of high-level features such as buildings and roads. This paper presents an approach for detecting bridges over water bodies from multispectral imagery. The multispectral image is first classified into eight land-cover types using a majority-must-be-granted logic based on the multiseed supervised classification technique. The classified image is then categorized into a trilevel image: water, concrete, and background. Bridges are then recognized in …

Go to article

Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh Jan 2008

Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh

School of Computing: Faculty Publications

Our system, based on a multiagent framework called collaborative understanding of distributed knowledge (CUDK), is designed with the overall goal of balancing agents’ conceptual learning and task accomplishment. The tradeoff between the two is that while conceptual learning allows an agent to improve its own concept base, it could be counter-productive: conceptual learning is time consuming and requires processing resources necessary for the agent to accomplish its tasks. In our current phase of research, we investigate the roles of resource and knowledge constraints, environmental factors (such as the frequency of queries), and learning mechanisms in a CUDK-based distributed information retrieval …

Go to article

Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy Jan 2008

Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Peer-to-peer (P2P) streaming systems, in which individual nodes or peers operated by ordinary Internet users collaborate to serve video streams, have recently aroused considerable interest in both academia and industry. An important problem in P2P streaming systems is how to reduce their consumed bandwidth, which is a major concern of Internet service providers. Our work is motivated by the fact that a user may dynamically change the size of a window displaying a video stream according to his/her personal choice, a scenario we refer to as dynamic window resizing. In this paper, we propose a scheme called the Partial Forwarding …

Go to article

A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou Jan 2008

A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou

School of Computing: Conference and Workshop Papers

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security …

Go to article

Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang Jan 2008

Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang

School of Computing: Conference and Workshop Papers

In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so that the reliability requirement can be satisfied. An equation based fair rate control algorithm is used to improve the fairness among the LTRES flows sharing the congestion path. The performance evaluations show that LTRES can provide …

Go to article

A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue Jan 2008

A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue

School of Computing: Conference and Workshop Papers

Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple …

Go to article

Computation Of A Face Attractiveness Index Based On Neoclassical Canons, Symmetry, And Golden Ratios, Kendra Schmid, David Marx, Ashok Samal Jan 2008

Computation Of A Face Attractiveness Index Based On Neoclassical Canons, Symmetry, And Golden Ratios, Kendra Schmid, David Marx, Ashok Samal

School of Computing: Faculty Publications

Analysis of attractiveness of faces has long been a topic of research. Literature has identified many different factors that can be related to attractiveness. In this research we analyze the role of symmetry, neoclassical canons, and golden ratio in the determination of attractiveness of a face. We focus on the geometry of a face and use actual faces for our analysis. We find there are some differences in the criteria used by males and females to determine attractiveness. The model we have developed to predict the attractiveness of a face using its geometry is accurate with low residual errors.

Go to article

Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz Jan 2008

Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz

School of Computing: Conference and Workshop Papers

In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required …

Go to article

Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar Jan 2008

Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar

School of Computing: Conference and Workshop Papers

The integration of CMOS cameras with embedded processors and wireless communication devices has enabled the development of distributed wireless vision systems. Wireless Vision Sensor Networks (WVSNs), which consist of wirelessly connected embedded systems with vision and sensing capabilities, provide wide variety of application areas that have not been possible to realize with the wall-powered vision systems with wired links or scalar-data based wireless sensor networks. In this paper, the design of a middleware for a wireless vision sensor node is presented for the realization of WVSNs. The implemented wireless vision sensor node is tested through a simple vision application to …

Go to article

Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander Jan 2008

Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander

School of Computing: Technical Reports

Network coding has become a useful means for achieving efficient multicast, and the optical community has started to examine its application to optical networks. However, a number of challenges, including limited processing capability and coarse bandwidth granularity, need to be overcome before network coding can be effectively used in optical networks. In this paper, we address some of these problems. We consider the problem of finding efficient routes to use with coding, and we study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic. We also propose architectures for all-optical circuits capable of performing the processing …

Go to article

Automated Refinement And Augmentation Of Web Service Description Files, Marc Fisher Ii, Sebastian Elbaum, Gregg Rothermel Dec 2007

Automated Refinement And Augmentation Of Web Service Description Files, Marc Fisher Ii, Sebastian Elbaum, Gregg Rothermel

School of Computing: Technical Reports

Web Service Description Language (WSDL) is being increasingly used to specify web service interfaces. Specifications of this type, however, are often incomplete or imprecise. For example, cursory examination of the WSDL file for Amazon’s E-Commerce Web Service reveals that it often uses a less specific type where a more specific type is applicable, or declares that elements could be missing where other documentation indicates that they are required. Further, specifications reflecting the temporal relationships between operations are completely missing, which is not surprising since they are not supported by the current WSDL standard. These problems in WSDL specifications can cause …

Go to article

Scalable And Adaptive Metadata Management In Ultra Large-Scale File Systems, Yu Hua, Yifeng Zhu, Hong Jiang Nov 2007

Scalable And Adaptive Metadata Management In Ultra Large-Scale File Systems, Yu Hua, Yifeng Zhu, Hong Jiang

School of Computing: Technical Reports

This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (≥ Petabytes or even Exabytes). Our scheme logically organizes metadata servers (MDS) into a multi-layered query hierarchy and exploits grouped Bloom filters to efficiently route metadata requests to desired MDSs through the hierarchy. This metadata lookup scheme can be executed at the network or memory speed, without being bounded by the performance of slow disks. An effective workload balance algorithm is also developed in this paper for server reconfigurations. This scheme is evaluated through extensive trace-driven simulations and prototype implementation in Linux. Experimental results …

Go to article

An Architectural Approach To Improving The Availability Of Parity-Based Raid Systems, Lei Tian, Hong Jiang, Dan Feng, Qin Xin, Sai Huang Nov 2007

An Architectural Approach To Improving The Availability Of Parity-Based Raid Systems, Lei Tian, Hong Jiang, Dan Feng, Qin Xin, Sai Huang

School of Computing: Technical Reports

In this paper, we propose an architectural approach, Supplementary Partial Parity (SPP), to addressing the availability issue of parity encoded RAID systems. SPP exploits free storage space and idle time to generate and update a set of partial parity units that cover a subset of disks (or data stripe units) during failure-free and idle/lightly-loaded periods, thus supplementing the existing full parity units for improved availability. By applying the exclusive OR operations appropriately among partial parity, full parity and data units, SPP can reconstruct the data on the failed disks with a fraction of the original overhead that is proportional to …

Go to article

Amp: An Affinity-Based Metadata Prefetching Scheme In Large-Scale Distributed Storage Systems, Lin Li, Xuemin Li, Hong Jiang, Yifeng Zhu Nov 2007

Amp: An Affinity-Based Metadata Prefetching Scheme In Large-Scale Distributed Storage Systems, Lin Li, Xuemin Li, Hong Jiang, Yifeng Zhu

School of Computing: Technical Reports

Prefetching is an effective technique for improving file access performance, which can reduce access latency for I/O systems. In distributed storage system, prefetching for metadata files is critical for the overall system performance. In this paper, an Affinity-based Metadata Prefetching (APM) scheme is proposed for metadata servers in large-scale distributed storage systems to provide aggressive metadata prefetching. Through mining useful information about metadata assesses from past history, AMP can discover metadata file affinities accurately and intelligently for prefetching. Compared with LRU and some of the latest file prefetching algorithms such as NEXUS and C-miner, trace-driven simulations show that AMP can …

Go to article

Race: A Robust Adaptive Caching Strategy For Buffer Cache, Yifeng Zhu, Hong Jiang Nov 2007

Race: A Robust Adaptive Caching Strategy For Buffer Cache, Yifeng Zhu, Hong Jiang

School of Computing: Faculty Publications

While many block replacement algorithms for buffer caches have been proposed to address the well-known drawbacks of the LRU algorithm, they are not robust and cannot maintain an consistent performance improvement over all workloads. This paper proposes a novel and simple replacement scheme, called RACE (Robust Adaptive buffer Cache management schemE), which differentiates the locality of I/O streams by actively detecting access patterns inherently exhibited in two correlated spaces: the discrete block space of program contexts from which I/O requests are issued and the continuous block space within files to which I/O requests are addressed. This scheme combines global I/O …

Go to article

Statistics And Analysis Tools For A Computer- Supported Collaborative Learning System, L. D. Miller, Adam Eck, Leen-Kiat Soh, Hong Jiang Oct 2007

Statistics And Analysis Tools For A Computer- Supported Collaborative Learning System, L. D. Miller, Adam Eck, Leen-Kiat Soh, Hong Jiang

School of Computing: Conference and Workshop Papers

Traditional computer-supported collaborative learning (CSCL) systems focus primarily on facilitating group work amongst students, providing several different modes for different types of communication, from chatting applications to shared whiteboards. The power of a good CSCL system, in addition to the interactions it supports, lies with the data the system can gather from those interactions (both relational and content-based). Thus, we have developed the Intelligent Multiagent Infrastructure for Distributed System in Education (I-MINDS), a CSCL system built on the Microsoft ConferenceXP platform that tracks real-time data to support student learning and classroom management. I-MINDS facilitates (1) student-student interactions through message dialogs, …

Go to article

Modelling Computational Requirements Of Mobile Robotic Systems Using Zones And Processing Windows, Ala' Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor Sep 2007

Modelling Computational Requirements Of Mobile Robotic Systems Using Zones And Processing Windows, Ala' Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor

School of Computing: Technical Reports

Mobile robotic systems must sense constraints imposed by a dynamically changing environment and predictably react to those changes in real-time. Complexity arises in mobile robotic systems because the computing platform travels through the environment with which the system is interacting. These systems have spatio-temporal requirements in the sense that correct behavior is defined in terms of both space and time. The focus of this paper is mobile robotic platforms that must sense their environment and avoid obstacles as they navigate from one point to another. We present a design and analysis methodology for these platforms that integrates spatio-temporal attributes with …

Go to article

Group Rekeying Schemes For Secure Group Communication In Wireless Sensor Networks, Yong Wang, Byrav Ramamurthy, Yuyan Xue Sep 2007

Group Rekeying Schemes For Secure Group Communication In Wireless Sensor Networks, Yong Wang, Byrav Ramamurthy, Yuyan Xue

School of Computing: Technical Reports

Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory, limited energy resources, and so on. Grouping is an important technique to localize computation and reduce communication overhead in wireless sensor networks. In this paper, we use grouping to refer to the process of combining a set of sensor nodes with similar properties. We propose four centralized group rekeying (CGK) schemes for secure group communication in sensor networks. The lifetime of a group is divided into three phases, i.e., group formation, group maintenance, and group dissolution. …

Go to article

An Efficient Scheme For Removing Compromised Sensor Nodes From Wireless Sensor Networks, Yong Wang, Byrav Ramamurthy, Xukai Zou, Yuyan Xue Sep 2007

An Efficient Scheme For Removing Compromised Sensor Nodes From Wireless Sensor Networks, Yong Wang, Byrav Ramamurthy, Xukai Zou, Yuyan Xue

School of Computing: Technical Reports

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first review and summarize the current key revocation schemes for sensor networks. Then, we present an efficient scheme of removing compromised sensor nodes from wireless sensor networks. Unlike most …

Go to article

Ukeying: A Key Management Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue Sep 2007

Ukeying: A Key Management Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue

School of Computing: Technical Reports

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. Key management includes two aspects: key distribution and key revocation. The goal of the key distribution is to establish the required keys between sensor nodes which must exchange data. Key revocation is used to remove compromised sensor nodes from the network. Although many key distribution schemes and key revocation schemes have been proposed in the literature, there is a lack of a framework which can integrate the schemes. In this paper, we propose a key management framework, uKeying, for wireless sensor …

Go to article

Variable Neighbor Selection In Live Peer-To-Peer Multimedia Streaming Networks, Jagannath Ghoshal, Byrav Ramamurthy, Lisong Xu Sep 2007

Variable Neighbor Selection In Live Peer-To-Peer Multimedia Streaming Networks, Jagannath Ghoshal, Byrav Ramamurthy, Lisong Xu

School of Computing: Technical Reports

Data-driven (or swarming based) streaming is one of the popular ways to distribute multimedia streaming traffic over live Peer-to-Peer (P2P) networks. In data-driven streaming networks, each peer independently selects its neighbors based on gossip-style overlay construction and then exchanges streaming data with the neighbors using data scheduling. In a P2P network the major advantage is that each peer contributes its own resources to the network. As a result, there is an increase in the amount of overall resources of the network, such as bandwidth, storage space, and computing power. However such type of networks exhibit end user bandwidth heterogeneity. Consequently, …

Go to article

Fault Tolerant Firewall Sandwiches, Stephen M. Goddard Aug 2007

Fault Tolerant Firewall Sandwiches, Stephen M. Goddard

School of Computing: Faculty Publications

Firewall sandwich configurations having improved levels of system availability as well as an application-space implementation of a firewall load balancer (FLB) which provides greater operational flexibility while reducing the need for custom hardware and/or operating system software. Also disclosed is a firewall capable of functionally replacing an FLB upon detecting a failure therein.

Go to article

A Scalable Approach For Survivable Virtual Topology Routing In Optical Wdm Networks, Ajay Todimala, Byrav Ramamurthy Aug 2007

A Scalable Approach For Survivable Virtual Topology Routing In Optical Wdm Networks, Ajay Todimala, Byrav Ramamurthy

School of Computing: Faculty Publications

The survivable virtual topology routing problem is to route a virtual topology graph on a optical fiber physical topology such that the virtual topology remains connected when failures occur in the physical topology. In this work we study the problem of survivable virtual topology routing under single node/SRLG (Shared Risk Link Group) failure model. We prove that the survivable virtual topology routing problem under node/SRLG failures is NP-complete. We present an improved integer linear programming (ILP) formulation for computing the survivable routing of a virtual topology graph. However, ILP is not scalable when the network size scales more than a …

Go to article

Conferencexp-Powered I-Minds: A Multiagent System For Intelligently Supporting Online Collaboration, Adam Eck, L.D. Miller, Leen-Kiat Soh, Hong Jiang, Tim Chou Apr 2007

Conferencexp-Powered I-Minds: A Multiagent System For Intelligently Supporting Online Collaboration, Adam Eck, L.D. Miller, Leen-Kiat Soh, Hong Jiang, Tim Chou

School of Computing: Technical Reports

In this paper, we describe a multiagent system designed for intelligently supporting online human collaboration, built on top of the ConferenceXP platform developed by Microsoft Research. Many current collaborative systems are passive in nature and do not provide active, intelligent support to users. A multiagent system can be used to track user behavior, perform automated tasks for humans, find optimal collaborative groups, and create and present helpful processed information based on data mining without detracting from the rest of the collaborative experience. Our ConferenceXP-powered I-MINDS application currently offers five different components for enhancing collaboration and sup-porting moderator decision making by …

Go to article

Real-Time Divisible Load Scheduling With Different Processor Available Times, Xuan Lin, Steve Goddard, Ying Lu, Jitender Deogun Feb 2007

Real-Time Divisible Load Scheduling With Different Processor Available Times, Xuan Lin, Steve Goddard, Ying Lu, Jitender Deogun

School of Computing: Technical Reports

Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, some of proposed approaches may cause Inserted Idle Times (IITs) that are detrimental to system performance. In this paper we propose a new approach that utilizes IITs and thus enhances the system performance. The novelty of our approach is that, to simplify the analysis, a homogenous system with IITs is transformed to an equivalent heterogeneous system, and that our algorithms can schedule real-time divisible loads with different processor available times. …

Go to article

Novel Force Matrix Transformations With Optimal Load-Balance For 3-Body Potential Based Parallel Molecular Dynamics In A Heterogeneous Cluster Environment, Sumanth J.V, David Swanson, Hong Jiang Jan 2007

Novel Force Matrix Transformations With Optimal Load-Balance For 3-Body Potential Based Parallel Molecular Dynamics In A Heterogeneous Cluster Environment, Sumanth J.V, David Swanson, Hong Jiang

School of Computing: Technical Reports

Evaluating the Force Matrix constitutes the most computationally intensive part of a Molecular Dynamics (MD) simulation. In three-body MD simulations, the total energy of the system is determined by the energy of every unique triple in the system and the force matrix is three-dimensional. The execution time of a three-body MD algorithm is thus proportional to the cube of the number of atoms in the system. Fortunately, there exist symmetries in the Force Matrix that can be exploited to improve the running time of the algorithm. While this optimization is straight forward to implement in the case of sequential code, …

Go to article

Idea: An Infrastructure For Detection-Based Adaptive Consistency Control In Replicated Services, Yijun Lu, Ying Lu, Hong Jiang Jan 2007

Idea: An Infrastructure For Detection-Based Adaptive Consistency Control In Replicated Services, Yijun Lu, Ying Lu, Hong Jiang

School of Computing: Technical Reports

In Internet-scale distributed systems, replication-based scheme has been widely deployed to increase the availability and efficiency of services. Hence, consistency maintenance among replicas becomes an important research issue because poor consistency results in poor QoS or even monetary loss. Recent research in this area focuses on enforcing a certain consistency level, instead of perfect consistency, to strike a balance between consistency guarantee and system’s scalability.
In this paper, we argue that, besides balancing consistency and scalability, it is equally, if not more, important to achieve adaptability of consistency maintenance. I.e., the system adjusts its consistency level on the fly to …

Go to article

Cvretrieval: Separating Consistency Retrieval From Consistency Maintenance, Yijun Lu, Hong Jiang, Ying Lu Jan 2007

Cvretrieval: Separating Consistency Retrieval From Consistency Maintenance, Yijun Lu, Hong Jiang, Ying Lu

School of Computing: Technical Reports

In distributed online collaboration applications, such as digital white board and online gaming, it is important to guarantee the consistency among participants’ views to make collaboration meaningful. However, maintaining even a relaxed consistency in a distributed environment with a large number of geographically dispersed participants still involves formidable communication and management cost among them.
In this paper, we propose CVRetrieval (Consistency View Retrieval) to solve this scalability problem. Based on the observation that not all participants are equally active or engaged in distributed online collaboration applications, CVRetrieval differentiates the notions of consistency maintenance and consistency retrieval. Here, consistency maintenance implies …

Go to article

First Prev Next Last