Formally verified Byzantine agreement in presence of link faults - Trang 608-616
U. Schmid, B. Weiss, J. Rushby
This paper shows that deterministic consensus in synchronous distributed systems
with link faults is possible, despite the impossibility result of Gray (1978).
Instead of using randomization, we overcome this impossibility by moderately
restricting the inconsistency that link faults may cause system-wide. Relying
upon a novel hybrid fault model that provides different classes of faults for
both no... hiện toàn bộ
#Algorithm design and analysis #Formal verification #Fault tolerant systems #Automation #Computer science #Laboratories #Broadcasting #Failure analysis #Distributed algorithms #Field buses
Anthill: a framework for the development of agent-based peer-to-peer systems - Trang 15-22
O. Babaoglu, H. Meling, A. Montresor
Recent peer-to-peer (P2P) systems are characterized by decentralized control,
large scale and extreme dynamism of their operating environment. As such, they
can be seen as instances of complex adaptive systems (CAS) typically found in
biological and social sciences. We describe Anthill, a framework to support the
design, implementation and evaluation of P2P applications based on ideas such as
mult... hiện toàn bộ
#Peer to peer computing #Content addressable storage #Distributed computing #Grid computing #Adaptive systems #Centralized control #Distributed control #Large-scale systems #Biology #Resource management
ADAPTLOAD: effective balancing in clustered web servers under transient load conditions - Trang 104-111
A. Riska, Wei Sun, E. Smirni, G. Ciardo
We focus on adaptive policies for load balancing in clustered web servers, based
on the size distribution of the requested documents. The proposed scheduling
policy, ADAPTLOAD, adapts its balancing parameters on-the-fly, according to
changes in the behavior of the customer population such as fluctuations in the
intensity of arrivals or document popularity. Detailed performance comparisons
via simu... hiện toàn bộ
#Web server #Load management #Fluctuations #Robustness #Exponential distribution #Sun #Computer science #Educational institutions #Processor scheduling #Scalability
Dynamic behaviour of the distributed tree quorum algorithm - Trang 517-524
N. Kafri, J. Janecek
Mechanisms that ensure mutual access, replication and resilience to failures in
large distributed systems can be based on quorum consensus. Effectiveness and
scalability of the method selected are crucial. The aim of this paper is to
present a message/time cost analysis of a distributed algorithm based on the
tree quorum, which needs no global information, and has message complexity
independent of... hiện toàn bộ
#Costs #Scalability #Distributed algorithms #Delay #Computer science #Resilience #Information analysis #Algorithm design and analysis #Middleware #Availability
A new document placement scheme for cooperative caching on the Internet - Trang 95-103
L. Ramaswamy, Ling Liu
Most existing work on cooperative caching has been-focused on serving misses
collaboratively. Very few have studied the effect of cooperation on document
placement schemes and its potential enhancements on cache hit ratio and latency
reduction. In this paper we propose a new document placement scheme, called the
Expiration Age based scheme (EA scheme), which takes into account the
contentions at i... hiện toàn bộ
#Cooperative caching #Internet #Delay #Aggregates #Protocols #Educational institutions #Collaborative work #Telecommunication traffic #Distributed computing
On peer-to-peer media streaming - Trang 363-371
Dongyan Xu, M. Hefeeda, S. Hambrusch, B. Bhargava
In this paper, we study a peer-to-peer media streaming system with the following
characteristics: (1) its streaming capacity grows dynamically; (2) peers do not
exhibit server-like behavior; (3) peers are heterogeneous in their bandwidth
contribution; and (4) each streaming session may involve multiple supplying
peers. Based on these characteristics, we investigate two problems: (1) how to
assign ... hiện toàn bộ
#Streaming media #Peer to peer computing #Bandwidth #Nonhomogeneous media #Admission control #Protocols #Delay effects #Joining processes #Distributed computing
Version stamps-decentralized version vectors - Trang 544-551
P.S. Almeida, C. Baquero, V. Fonte
Version vectors and their variants play a central role in update tracking in
optimistic distributed systems. Existing mechanisms for a variable number of
participants use a mapping from identities to integers, and rely on some form of
global configuration or distributed naming protocol to assign unique identifiers
to each participant. These approaches are incompatible with replica creation
under a... hiện toàn bộ
#Clocks #Counting circuits #Protocols #Distributed computing #Mobile computing #Synchronization #Message passing
ControlWare: a middleware architecture for feedback control of software performance - Trang 301-310
Ronghua Zhang, Chenyang Lu, T.F. Abdelzaher, J.A. Stankovic
Attainment of software performance assurances in open, largely unpredictable
environments has recently become an important focus for real-time research.
Unlike closed embedded systems, many contemporary distributed real-time
applications operate in environments where offered load and available resources
suffer considerable random fluctuations, thereby complicating the performance
assurance problem... hiện toàn bộ
#Middleware #Computer architecture #Feedback control #Software performance #Embedded system #Real time systems #Application software #Fluctuations #Control system analysis #Performance analysis
Geometric spanners for wireless ad hoc networks - Trang 171-178 - 2002
Yu Wang, Xiang-Yang Li
We propose a new geometric spanner, for wireless ad hoc networks, which can be
constructed efficiently in a distributed manner. It combines the connected
dominating set and the local Delaunay graph to form the backbone of a wireless
network. This new spanner has the following attractive properties: (1) the
backbone is a planar graph; (2) the node degree of the backbone is bounded from
above by a p... hiện toàn bộ
#Ad hoc networks #Routing #Spine #Network topology #Mobile ad hoc networks #Floods #Information geometry #Clustering algorithms #Computer science #Wireless networks
Reasoning about joint administration of access policies for coalition resources - Trang 429-438
H. Khurana, V. Gligor, J. Linn
We argue that joint administration of access policies for a dynamic coalition
formed by autonomous domains requires that these domains set up a coalition
authority that distributes attribute certificates authorizing access to policy
objects (e.g., ACLs). Control over the issuance of such certificates is retained
by member domains separately holding shares of the joint coalition authority's
private... hiện toàn bộ
#Public key #Web server #Access control #Logic #Access protocols #Resource management #Diseases #Protection #File servers #Authorization