Results 1  10
of
4,229
Chord: A Scalable PeertoPeer Lookup Protocol for Internet Applications
 ACM SIGCOMM
, 2001
"... A fundamental problem that confronts peertopeer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto ..."
Abstract

Cited by 809 (15 self)
 Add to MetaCart
A fundamental problem that confronts peertopeer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key
Chord: A Scalable PeertoPeer Lookup Service for Internet Applications
 SIGCOMM'01
, 2001
"... A fundamental problem that confronts peertopeer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto ..."
Abstract

Cited by 4469 (69 self)
 Add to MetaCart
A fundamental problem that confronts peertopeer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto
Secure Group Communications Using Key Graphs
 SIGCOMM '98
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 556 (17 self)
 Add to MetaCart
of authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join
Secure routing for structured peertopeer overlay networks
, 2002
"... Structured peertopeer overlay networks provide a substrate for the construction of largescale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fract ..."
Abstract

Cited by 473 (12 self)
 Add to MetaCart
fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This problem is particularly serious in open peertopeer systems, where many diverse, autonomous parties
SPADE: An efficient algorithm for mining frequent sequences
 Machine Learning
, 2001
"... Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original proble ..."
Abstract

Cited by 437 (16 self)
 Add to MetaCart
problem into smaller subproblems, that can be independently solved in mainmemory using efficient lattice search techniques, and using simple join operations. All sequences are discovered in only three database scans. Experiments show that SPADE outperforms the best previous algorithm by a factor of two
The Tjoin Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout?
"... Abstract. Given a graph G with weighted edges, and a subset of nodes T,theTjoin problem asks for a minimum weight edgesetA such thata node u is incident to an odd number of edges of A i u 2 T.We describe the applications of the Tjoin problem in sparse graphs to the phase assignment problem in VLSI ..."
Abstract
 Add to MetaCart
Abstract. Given a graph G with weighted edges, and a subset of nodes T,theTjoin problem asks for a minimum weight edgesetA such thata node u is incident to an odd number of edges of A i u 2 T.We describe the applications of the Tjoin problem in sparse graphs to the phase assignment problem
Recognising Panoramas
, 2003
"... The problem considered in this paper is the fully automatic construction of panoramas. Fundamentally, this problem requires recognition, as we need to know which parts of the panorama join up. Previous approaches have used human input or restrictions on the image sequence for the matching step. In t ..."
Abstract

Cited by 293 (2 self)
 Add to MetaCart
The problem considered in this paper is the fully automatic construction of panoramas. Fundamentally, this problem requires recognition, as we need to know which parts of the panorama join up. Previous approaches have used human input or restrictions on the image sequence for the matching step
Join synopses for approximate query answering
 In SIGMOD
, 1999
"... In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data. In this paper, we demonstrate the difficulty of providing good approximate answers for joinqueries using only statistic ..."
Abstract

Cited by 169 (9 self)
 Add to MetaCart
statistics (in particular, samples) from the base relations. We propose join synopses (join samples) as an effective solution for this problem and show how precomputing just one join synopsis for each relation suffices to significantly improve the quality of approximate answers for arbitrary queries
A Calculus of Mobile Agents
, 1996
"... . We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile ag ..."
Abstract

Cited by 281 (13 self)
 Add to MetaCart
physical sites. If we do not locate channels, we quickly face a global consensus problem for nearly every communication which uses the interconnection network. In a previous work [6], we introduced the joincalculus, an asynchronous variant of Milner's ßcalculus with better locality and better static
Results 1  10
of
4,229