A combinatorial treatment of balancing networks
Date
1996Source
Journal of the ACMVolume
43Issue
5Pages
794-839Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures suitable for solving many fundamental multi-processor coordination problems that can be expressed as balancing problems. In this work, we present a mathematical study of the combinatorial structure of balancing networks, and a variety of its applications. Our study identifies important combinatorial transfer parameters of balancing networks. In turn, necessary and sufficient combinatorial conditions are established, expressed in terms of transfer parameters, which precisely characterize many important and well studied classes of balancing networks such as counting networks and smoothing networks. We propose these combinatorial conditions to be "balancing analogs" of the well known Zero-One principle holding for sorting networks. Within the combinatorial framework we develop, our first application is in deriving combinatorial conditions, involving the transfer parameters, which precisely delimit the boundary between counting networks and sorting networks.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
A network-aware framework for energy-efficient data acquisition in wireless sensor networks
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Samaras, George S.; Chrysanthis, Panos K. (2014)Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization ...
-
Conference Object
Survivable and Secure Elastic Optical Networks using Network Coding
Savva, Giannis; Manousakis, Konstantinos; Ellinas, Georgios (2019)In this work, the concept of network coding (NC) is used in conjunction with the routing and spectrum allocation (RSA) problem to jointly provide security and protection in elastic optical networks (EONs). Specifically, ...
-
Article
A Network Intervention to Locate Newly HIV Infected Persons Within MSM Networks in Chicago
Morgan, Ethan; Skaathun, Britt; Nikolopoulos, Georgios K.; Paraskevis, Dimitrios; Williams, Leslie D.; Smyrnov, Pavlo; Friedman, Samuel R.; Schneider, John A. (2019)Individuals with recent/acute HIV-infection have an increased likelihood of disease transmission. To evaluate effectiveness of identifying recent infections, we compared networks of recently and long-term HIV-infected ...