.png){kind=icon}
.png){kind=icon}
Return
Randomized smoothing networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2005.06.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A smoothing network is a distributed data structure that accepts tokens on input wires and routes them to output wires. It ensures that however imbalanced the traffic on input wires, the numbers of tokens emitted on output wires are approximately balanced. We study randomized smoothing networks. whose initial states are chosen at random. Randomized smoothing networks require no global initialization, and also require no global reconfiguration after faults. We show that the randomized version of the well-known block smoothing network is 2.36 root log(w)-smooth with high probability, where w is the number of input or output wires. As a direct consequence, we prove that the randomized bitonic and periodic networks are also O(root log(w))-smooth with high probability. In contrast, it is known that these networks are (log w)-smooth in the worst case. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
smoothing network
counting network
randomized balancer
load balancing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available