Listar por autoría "5f54ddef-b8f5-403b-b0f8-f80292cba403"
-
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory
Oxford University Press (2010)The paper proposes a simple protocol that ensures sequential consistency. The protocol assumes that the shared memory abstraction is supported by the local memories of nodes that can communicate only by exchanging messages ... -
A model of self-avoiding random walks for searching complex networks
John Wiley & Sons (2012)Random walks have been proven useful in several applications in networks. Some variants of the basic random walk have been devised pursuing a suitable trade-off between better performance and limited cost. A self-avoiding ... -
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
Elsevier (2008)In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it includes a parameter that allows us to choose ...
-
An Optimal Scheme to Recharge Communication Drones
IEEE (2021)The adoption and integration of drones in communication networks is becoming reality thanks to the deployment of advanced solutions for IoT and cellular communication relay schemes. However, using drones introduces new ...
-
Analysis and placement of storage capacity in large distributed video servers
Elsevier (2008)In this paper, we study how to distribute storage capacity along a hierarchical system with cache-servers located at each node. This system is intended to deliver stored video streams in a video-on-demand way, ensuring ...
-
Atomic Appends in Asynchronous Byzantine Distributed Ledgers
Elsevier (2023-12)A Distributed Ledger Object (DLO) is a concurrent object that maintains a totally ordered sequence of records. In this work we formalize a linearizable Byzantine-tolerant Distributed Ledger Object (BDLO), which is a ...
-
Bounds on Stability and Latency in Wireless Communication
IEEE (2010)In this paper, we study stability and latency of routing in wireless networks where it is assumed that no collision will occur. Our approach is inspired by the adversarial queuing theory, which is amended in order to model ...
-
Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects
Jukka Suomela (2019-10-14)
-
Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications
Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH (2021-06-26)In order to formalize Distributed Ledger Technologies and their interconnections, a recent line of research work has formulated the notion of Distributed Ledger Object (DLO), which is a concurrent object that maintains ...
-
Coverage Optimization with a Dynamic Network of Drone Relays
Institute of Electrical and Electronics Engineers (2019-07-09)The integration of aerial base stations carried by drones in cellular networks offers promising opportunities to enhance the connectivity enjoyed by ground users. In this paper, we propose an optimization framework for the ...
-
Dante: A Self-Adapting Peer-to-Peer System
Springer Verlag (2008)In this paper we introduce DANTE, an unstructured P2P system in which the topology of the underlying overlay network can be dynamically adapted to the system conditions. Such an adaption is performed by the peers in an ...
-
Effective use of congestion in complex networks
Elsevier (2018)In this paper, we introduce a congestion-aware routing protocol that selects the pathsaccording to the congestion of nodes in the network. The aim is twofold: on one hand, andin order to prevent the networks from collapsing, ...
-
Fair Cellular Throughput Optimization with the Aid of Coordinated Drones
IEEE (2019-04-29)The interest on flexible air-to-ground channels from aerial base stations to enhance users access by seeking good line-of-sight connectivity from the air has increased in the past years. In this paper, we propose a deployable ...
-
Improving resource location with locally precomputed partial random walks
Springer Vienna (2015-09)Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each ...
-
Interconnection of distributed memory models
Elsevier (2009)In this paper, we present a framework to formally describe and study the interconnection of distributed shared memory systems. Using it allows us to classify the consistency models in two groups, depending on whether they ...
-
On the interconnection of message passing systems
Elsevier (2008)One of the most important abstractions for designing distributed programs is the broadcast facility. In this paper, we study the interconnection of distributed message passing systems. We have shown that totally ordered ...
-
Optimizing fairness in cellular networks with mobile drone relays
Elsevier (2023-02-10)Aiding the ground cellular network with aerial base stations carried by drones has experienced an intensive raise of interest in the past years. Reconfigurable air-to-ground channels enable aerial stations to enhance users’ ...
-
Optimizing UAV Resupply Scheduling for Heterogeneous and Persistent Aerial Service
Institute of Electrical and Electronics Engineers (2023-08)With the current advances in unmanned aerial vehicle (UAV) technologies, aerial vehicles are becoming very attractive for many purposes. However, currently the bottleneck in their adoption is no longer due to architectural ...
-
Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels
Springer Berlin Heidelberg (2009)This paper proposes new protocols for the interconnection of FIFO- and causal-ordered broadcast systems, thus increasing their scalability. They use several interconnection links between systems, which avoids bottleneck ...
-
Performance of random walks in one-hop replication networks
Elsevier (2010)Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes ...
