Search
Now showing items 1-10 of 17
Universal bufferless routing
(2005)
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...
Strength of counting networks
(1996)
This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...
On constructing internet-scale P2P information retrieval systems
(2005)
We initiate a study on the effect of the network topology on the performance of Peer-to-Peer (P2P) information retrieval systems. The emerging P2P model has become a very powerful and attractive paradigm for developing ...
Information retrieval techniques for peer-to-peer networks
(2004)
An important challenge in peer-to-peer (P2P) networks is to efficiently search the contents of other peers. The authors survey existing search techniques for information retrieval in P2P networks, including recent techniques ...
Computing on a partially eponymous ring
(2006)
We study the partially eponymous model of distributed computation, which simultaneously generalizes the anonymous and the eponymous models. In this model, processors have identities, which are neither necessarily all ...
Hybrid CAC for MBMS-enabled 3G UMTS networks
(2006)
In this paper, a novel hybrid Connection Admission Control (CAC) scheme combining downlink transmission power and aggregate throughput in the case of dedicated and shared connection setup respectively, is presented ("DPTCAC: ...
Work-competitive scheduling for cooperative computing with dynamic groups
(2005)
The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
Work-competitive scheduling for cooperative computing with dynamic groups
(2003)
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...
Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups
(2002)
The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
Developing a consistent domain-oriented distributed object service
(2005)
This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. This service is ...