Titlebook: Distributed Algorithms; 10th International W Özalp Babaoğlu,Keith Marzullo Conference proceedings 1996 Springer-Verlag Berlin Heidelberg 19

弄碎

书目名称Distributed Algorithms影响因子(影响力)




书目名称Distributed Algorithms影响因子(影响力)学科排名




书目名称Distributed Algorithms网络公开度




书目名称Distributed Algorithms网络公开度学科排名




书目名称Distributed Algorithms被引频次




书目名称Distributed Algorithms被引频次学科排名




书目名称Distributed Algorithms年度引用




书目名称Distributed Algorithms年度引用学科排名




书目名称Distributed Algorithms读者反馈




书目名称Distributed Algorithms读者反馈学科排名

ILEUM

Levels of authentication in distributed agreement, outside the system (e.g., trusted servers which never fail), it is useful to consider lower levels of key distribution which need as few assumptions as possible..In this paper, we identify several levels of key distribution and describe their properties with regard to the achievable fault tolerance in two agreement problems.

Physiatrist

Plausible clocks: Constant size logical clocks for Distributed Systems,to combine plausible clocks to produce more accurate clocks. Several examples of plausible clocks and their combination are presented. Using a simulation model, we evaluate the performance of these clocks.

sebaceous-gland

DEAF

一小块

A framework for the analysis of non-deterministic clock synchronisation algorithms,simple local conditions that guarantee that the desired precision will be attained with the desired probability..The results are then used to estimate the communication burden imposed by the synchronisation algorithm and provide us with some guidelines to compare the different NDCSA.

一小块

Optimal time broadcasting in faulty star networks, broadcasting in star networks. We analyze the reliability of the broadcasting scheme in the case where faults are randomly distributed in the .-star network. The broadcasting scheme in the .-star network can tolerate (.!). random faults with a high probability, where . is any constant less than 1.

Defense

A lower bound for Linear Interval Routing,are 2. and 1.75. — 1, respectively, where . is the diameter of the network. We prove a lower bound of .(D.) on the length of a path a message traverses under Linear Interval Routing. We further extend the result by showing a connection between the efficiency of Linear Interval Routing and the bi-diameter of the network.

mosque

ETHER

0302-9743 computing paradigm and an industrial technology. Among the topics covered are all current aspects of distributed algorithms ranging from theory to applications such as distributed intelligent agents.978-3-540-61769-3978-3-540-70679-3Series ISSN 0302-9743 Series E-ISSN 1611-3349