Optimal broadcasting with universal lists based on competitive analysis
✍ Scribed by Jae-Hoon Kim; Kyung-Yong Chwa
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 151 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this article we study a variant of broadcasting: each node has a predetermined ordered list of neighbors regardless of the node, called the source, from which the originating message is transmitted to all nodes in a network. Each node transmits a received message to its neighbors in order of the list. We propose a new measure of the efficiency of a Broadcasting scheme, which is obtained from competitive analysis, and we design new broadcasting schemes for lines, complete k‐ary trees, grids, complete graphs, and hypercubes. In particular, we provide optimal broadcasting schemes for lines and grids. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(4), 224–231 2005
📜 SIMILAR VOLUMES
## Abstract In this communication we propose a new exponential‐based integration algorithm for associative von‐Mises plasticity with linear isotropic and kinematic hardening, which follows the ones presented by the authors in previous papers. In the first part of the work we develop a theoretical a