Results 1 - 10 of 35,341

Search and replication in unstructured peer-to-peer networks

by Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker , 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract - Cited by 692 (6 self) - Add to MetaCart
propose a query algorithm based on multiple random walks that resolves queries almost as quickly as gnutella's flooding method while reducing the network traffic by two orders of mag-nitude in many cases. We also present a distributed replication strategy that yields close-to-optimal performance

M.R.: A distributed replication strategy evaluation and selection framework for fault tolerant web services

by Zibin Zheng, Michael R. Lyu - In: IEEE ICWS , 2008
"... Redundancy-based fault tolerance strategies are pro-posed for building reliable Service-Oriented Architec-tures/Applications (SOA), which are usually developed on the unpredictable remote Web services. This paper proposes and implements a distributed replication strategy evalua-tion and selection fr ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
Redundancy-based fault tolerance strategies are pro-posed for building reliable Service-Oriented Architec-tures/Applications (SOA), which are usually developed on the unpredictable remote Web services. This paper proposes and implements a distributed replication strategy evalua-tion and selection

Accessing Nearby Copies of Replicated Objects in a Distributed Environment

by C. Greg Plaxton , Rajmohan Rajaraman, Andrea W. Richa
"... Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "clos ..."
Abstract - Cited by 549 (8 self) - Add to MetaCart
;quot;close " to the requesting node. Unfortunately, it is not clear how to efficiently achieve this goal in a dynamic, distributed environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper

Lifetime prevalence and age-of-onset distributions of DSM-IV disorders in the National Comorbidity Survey Replication.

by PhD; Ronald C Kessler , MBA; Patricia Berglund , Olga Demler , MS; Robert Ma , M A Jin , PhD; Kathleen R Merikangas , MS Ellen E Walters - Archives of General Psychiatry, , 2005
"... ..."
Abstract - Cited by 784 (3 self) - Add to MetaCart
Abstract not found

Distributed Database Systems

by M. Tamer Özsu
"... this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability, and replica ..."
Abstract - Cited by 588 (26 self) - Add to MetaCart
this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability

Completely Derandomized Self-Adaptation in Evolution Strategies

by Nikolaus Hansen, Andreas Ostermeier - Evolutionary Computation , 2001
"... This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adapta ..."
Abstract - Cited by 549 (58 self) - Add to MetaCart
This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self

Cooperative strategies and capacity theorems for relay networks

by Gerhard Kramer, Michael Gastpar, Piyush Gupta - IEEE TRANS. INFORM. THEORY , 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract - Cited by 739 (19 self) - Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant

Coda: A Highly Available File System for a Distributed Workstation Environment

by Mahadev Satyanarayanan, James J. Kistler, Puneet Kumar, Maria E. Okasaki, Ellen H. Siegel, David C. Steere - IN IEEE TRANSACTIONS ON COMPUTERS , 1990
"... Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple servers ..."
Abstract - Cited by 530 (45 self) - Add to MetaCart
Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple

Freenet: A Distributed Anonymous Information Storage and Retrieval System

by Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong - INTERNATIONAL WORKSHOP ON DESIGNING PRIVACY ENHANCING TECHNOLOGIES: DESIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY , 2001
"... We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data ..."
Abstract - Cited by 1064 (12 self) - Add to MetaCart
We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store

Grid Information Services for Distributed Resource Sharing

by Karl Czajkowski , Steven Fitzgerald, Ian Foster, Carl Kesselman , 2001
"... Grid technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or institutions: what are sometimes called virtual organizations. In these settings, the discovery, characterization, and monitoring of resources, services, and computations are challengi ..."
Abstract - Cited by 712 (52 self) - Add to MetaCart
are challenging problems due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Consequently, information services are a vital part of any Grid software infrastructure, providing fundamental mechanisms for discovery
Results 1 - 10 of 35,341