Search results for "Distributed computing"
showing 10 items of 622 documents
Throughput and energy efficiency comparison of one-hop, two-hop, virtual relay and cooperative retransmission schemes
2010
Two main types of approaches exist for implementing cooperative communications at the MAC layer: virtual-hop relay and cooperative retransmission. While the virtual-hop relay schemes employ relay nodes to forward packets when higher end-to-end throughput can be achieved compared with the direct transmission, the cooperative retransmission schemes use relays to retransmit data only after the direct transmission fails. However, the performance of the these different approaches has not been compared in the literature, especially when energy efficiency is considered. In order to find out the best transmission scheme, this paper evaluates and compares the performance of the one-hop direct transm…
Latency factor in worldwide IP routed networks
2014
Current Border Gateway Protocol (BGP) serves for worldwide internet backbone connections between different Autonomous Systems (AS) on the routing level. Continuously in real-time changing environment core routers calculate routing decisions based on path-vector database entries. AS path-vector database may contain multiple paths for various Internet Protocol (IP) prefix destinations where smallest entity in the path-vector is AS. In real world AS can be internet service operator, university or any other organization willing to participate in internet network via multi-homed uplinks. Unfortunately, internal part of AS is hidden in path-vector database thus excluding factors like latency, pac…
Language-Integrated Privacy-Aware Distributed Queries
2019
Distributed query processing is an effective means for processing large amounts of data. To abstract from the technicalities of distributed systems, algorithms for operator placement automatically distribute sequential data queries over the available processing units. However, current algorithms for operator placement focus on performance and ignore privacy concerns that arise when handling sensitive data. We present a new methodology for privacy-aware operator placement that both prevents leakage of sensitive information and improves performance. Crucially, our approach is based on an information-flow type system for data queries to reason about the sensitivity of query subcomputations. Ou…
VarySched: A Framework for Variable Scheduling in Heterogeneous Environments
2016
Despite many efforts to better utilize the potential of GPUs and CPUs, it is far from being fully exploited. Although many tasks can be easily sped up by using accelerators, most of the existing schedulers are not flexible enough to really optimize the resource usage of the complete system. The main reasons are (i) that each processing unit requires a specific program code and that this code is often not provided for every task, and (ii) that schedulers may follow the run-until-completion model and, hence, disallow resource changes during runtime. In this paper, we present VarySched, a configurable task scheduler framework tailored to efficiently utilize all available computing resources in…
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
MAC learning
2016
Cognition as a way to deal with the challenges of future wireless networks has been largely considered by the recent literature, with a main focus on physical layer adaptability and dynamic spectrum access. In this demo, we show how a simple cognition mechanism can be also applied at the MAC layer, by exploiting the emerging paradigm of programmable wireless cards. The idea is using the formal definition of simple MAC protocol components and platform-independent representation of channel events gathered from the wireless node, for emulating the behavior of protocols which are not currently running on the network, learning about their expected performance, and dynamically reconfiguring the w…
Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm
2014
We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…
Dissemination protocol for Heterogeneous Cooperative Vehicular Networks
2012
International audience; The difficulties associated with network connectivity, unreliable channels, and city environment characteristics make data dissemination task in vehicular urban networks a real challenge. Recently, some interesting solutions have been proposed to perform data dissemination in this environment. Starting from the analysis of these solutions, we present a new dissemination protocol named DHVN (Dissemination protocol for Heterogeneous Cooperative Vehicular Networks) that considers: (i) roads topology, (ii) network connectivity and possible partitioning in case of low traffic density, and (iii) heterogeneous communication capabilities of the vehicles. We compare our proto…
Efficient and Lightweight Data Integrity Check in In-Networking Storage Wireless Sensor Networks
2009
In In-networking storage Wireless Sensor Networks, sensed data are stored locally for a long term and retrieved on-demand instead of real-time. To maximize data survival, the sensed data are normally distributively stored at multiple nearby nodes. It arises a problem that how to check and grantee data integrity of distributed data storage in the context of resource constraints. In this paper, a technique called Two Granularity Linear Code (TGLC) that consists of Intra-codes and Inter-codes is presented. An efficient and lightweight data integrity check scheme based on TGLC is proposed. Data integrity can be checked by any one who holds short Inter-codes, and the checking credentials is shor…
5G Functional Architecture and Signaling Enhancements to Support Path Management for eV2X
2019
Enhanced vehicle-to-everything (eV2X) communication is one of the most challenging use cases that the fifth generation (5G) of cellular mobile communications must address. In particular, eV2X includes some 5G vehicular applications targeting fully autonomous driving which require ultra-high reliability. The usual approach to providing vehicular communication based on single-connectivity transmission, for instance, through the direct link between vehicles (PC5 interface), often fails at guaranteeing the required reliability. To solve such a problem, in this paper, we consider a scheme where the radio path followed by eV2X messages can be proactively and dynamically configured to either trans…