Conference
Network Computing and Applications
About: Network Computing and Applications is an academic conference. The conference publishes majorly in the area(s): Computer science & Cloud computing. Over the lifetime, 989 publications have been published by the conference receiving 12736 citations.
Papers published on a yearly basis
Papers
24 Jul 2006
TL;DR: This paper presents an improvement to Cauchy Reed-Solomon coding that is based on optimizing theCauchy distribution matrix, and details an algorithm for generating good matrices and evaluates the performance of encoding using all implementations Reed- Solomon codes, plus the best MDS codes from the literature.
Abstract: In the past few years, all manner of storage applications, ranging from disk array systems to distributed and wide-area systems, have started to grapple with the reality of tolerating multiple simultaneous failures of storage nodes. Unlike the single failure case, which is optimally handled with RAID Level-5 parity, the multiple failure case is more difficult because optimal general purpose strategies are not yet known. Erasure Coding is the field of research that deals with these strategies, and this field has blossomed in recent years. Despite this research, the decades-old Reed- Solomon erasure code remains the only space-optimal (MDS) code for all but the smallest storage systems. The best performing implementations of Reed-Solomon coding employ a variant called Cauchy Reed-Solomon coding, developed in the mid 1990s [4]. In this paper, we present an improvement to Cauchy Reed-Solomon coding that is based on optimizing the Cauchy distribution matrix. We detail an algorithm for generating good matrices and then evaluate the performance of encoding using all implementations Reed- Solomon codes, plus the best MDS codes from the literature. The improvements over the original Cauchy Reed-Solomon codes are as much as 83% in realistic scenarios, and average roughly 10% over all cases that we tested.
287 citations
1 Nov 2018
TL;DR: This paper presents a new leaderless Byzantine consensus called the Democratic Byzantine Fault Tolerance (DBFT) for blockchains, which can terminate even when its coordinator is faulty and an optimized reduction from multivalue consensus to binary consensus whose fast path terminates in 4 message delays.
Abstract: This paper introduces a new leaderless Byzantine consensus called the Democratic Byzantine Fault Tolerance (DBFT) for blockchains. While most blockchain consensus protocols rely on a correct leader or coordinator to terminate, our algorithm can terminate even when its coordinator is faulty. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow. The resulting decentralization is particularly appealing for blockchains for two reasons: (i) each node plays a similar role in the execution of the consensus, hence making the decision inherently “democratic” (ii) decentralization avoids bottlenecks by balancing the load, making the solution scalable. DBFT is deterministic, assumes partial synchrony, is resilience optimal, time optimal and does not need signatures. We first present a simple safe binary Byzantine consensus algorithm, modify it to ensure termination, and finally present an optimized reduction from multivalue consensus to binary consensus whose fast path terminates in 4 message delays.
206 citations
30 Aug 2004
TL;DR: This work proposes a game theoretic framework for defensing nodes in a sensor network as a two-player, nonzero-sum, non-cooperative game between an attacker and a sensor networks, and applies three different schemes for defense.
Abstract: Insufficiency of memory and battery power of sensors makes the security of sensor networks a hard task to do. This insufficiency also makes applying the existing methods of securing other type of networks on the sensor networks unsuitable. We propose a game theoretic framework for defensing nodes in a sensor network. We apply three different schemes for defense. Our main concern in all three schemes is finding the most vulnerable node in a sensor network and protecting it. In the first scheme we formulate attack-defense problem as a two-player, nonzero-sum, non-cooperative game between an attacker and a sensor network. We show that this game achieves Nash equilibrium and thus leading to a defense strategy for the network. In the second scheme we use Markov decision process to predict the most vulnerable sensor node. In the third scheme we use an intuitive metric (node's traffic) and protect the node with the highest value of this metric. We evaluate the performance of each of these three schemes, and show that the proposed game framework significantly increases the chance of success in defense strategy for sensor network.
203 citations
27 Jul 2005
TL;DR: This paper assumes that the sensors in a wireless sensor network are deployed as either a Poisson point process or a uniform point process in a square or disk region, and studies how the probability of the k-coverage changes with the sensing radius or the number of sensors.
Abstract: One of the main applications of wireless sensor networks is to provide proper coverage of their deployment regions. A wireless sensor network k-covers its deployment region if every point in its deployment region is within the coverage ranges of at least k sensors. In this paper, we assume that the sensors are deployed as either a Poisson point process or a uniform point process in a square or disk region, and study how the probability of the k-coverage changes with the sensing radius or the number of sensors. Our results take the complicated boundary effect into account, rather than avoiding it by assuming the toroidal metric as done in the literature
159 citations
28 Sep 2015
TL;DR: The goal of this work is to compare the performance of CPU and network running benchmarks in the two aforementioned models of micro services architecture to provide a benchmark analysis guidance for system designers.
Abstract: Micro services architecture has started a new trend for application development for a number of reasons: (1) to reduce complexity by using tiny services, (2) to scale, remove and deploy parts of the system easily, (3) to improve flexibility to use different frameworks and tools, (4) to increase the overall scalability, and (5) to improve the resilience of the system. Containers have empowered the usage of micro services architectures by being lightweight, providing fast start-up times, and having a low overhead. Containers can be used to develop applications based on monolithic architectures where the whole system runs inside a single container or inside a micro services architecture where one or few processes run inside the containers. Two models can be used to implement a micro services architecture using containers: master-slave, or nested-container. The goal of this work is to compare the performance of CPU and network running benchmarks in the two aforementioned models of micro services architecture hence provide a benchmark analysis guidance for system designers.
158 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 2 |
| 2020 | 53 |
| 2019 | 62 |
| 2018 | 63 |
| 2017 | 75 |
| 2016 | 72 |