Results 21 to 30 of about 239,561 (285)
HaTS: Hardware-Assisted Transaction Scheduler [PDF]
, 2020 In this paper we present HaTS, a Hardware-assisted Transaction Scheduler. HaTS improves performance of concurrent applications by classifying the executions of their atomic blocks (or in-memory transactions) into scheduling queues, according to their so ...
Chen, Zhanhao +4 more
core +1 more source
Oblivious Online Contention Resolution Schemes [PDF]
, 2022 Contention resolution schemes (CRSs) are powerful tools for obtaining "ex post feasible" solutions from candidates that are drawn from "ex ante feasible" distributions. Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing.
Hu Fu 0001 +6 more
openaire +2 more sources
Performance Enhancements for Asynchronous Random Access Protocols over Satellite [PDF]
, 2011 In this paper, a novel enhancement of the well known ALOHA random access mechanism is presented which largely extends the achievable throughput compared to traditional ALOHA and provides significantly lower packet loss rates. The novel mechanism, called
Kissling, Christian
core +1 more source
Multi-Hop-Enabled Energy-Efficient MAC Protocol for Underwater Acoustic Sensor Networks
Journal of Sensor and Actuator Networks, 2015 In multi-hop underwater acoustic sensor networks (UWASNs), packet collisions due to hidden and local nodes adversely affect throughput, energy efficiency and end-to-end delay.
Khaja Shazzad +2 more
doaj +1 more source
On the Stability of Contention Resolution Diversity Slotted ALOHA [PDF]
, 2011 In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of Contention Resolution ...
Kissling, Christian
core +2 more sources
Random Access Game and Medium Access Control Design [PDF]
, 2010 Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model, called random access game, for contention control. We characterize Nash equilibria of random access games, study their dynamics, and propose distributed algorithms (
Chen, Lijun +2 more
core +3 more sources
Matroid Secretary Is Equivalent to Contention Resolution
CoRR, 2021 We show that the matroid secretary problem is equivalent to correlated contention resolution in the online random-order model. Specifically, the matroid secretary conjecture is true if and only if every matroid admits an online random-order contention resolution scheme which, given an arbitrary (possibly correlated) prior distribution over subsets of ...
openaire +4 more sources
Multi-slot Coded ALOHA with Irregular Degree Distribution [PDF]
, 2012 This paper proposes an improvement of the random multiple access scheme for satellite communication named Multislot coded ALOHA (MuSCA). MuSCA is a generalization of Contention Resolution Diversity Slotted ALOHA (CRDSA).
Boucheret, Marie-Laure +2 more
core +2 more sources
An Efficient Contention Resolution Scheme for Massive IoT Devices in Random Access to LTE-A Networks
IEEE Access, 2018 Long-Term Evolution-Advanced (LTE-A) networks have been regarded as having great potential to support the Internet of Things (IoT). However, the high probability of preamble collisions when massive numbers of IoT devices try to access the network within ...
Kyungjun Lee, Ju Wook Jang
doaj +1 more source
The Contention Resolution in OBS Network
Elektronika ir Elektrotechnika, 2014 Burst contention occurs when attempting to transmit several optical bursts at the time into the same core router output port. This is a shortcoming of the Optical Burst Switching (OBS) networks and for this reason it has been challenging to implement the OBS mode into the transport networks so far. This problem can be solved applying various contention
Jankuniene, R. +2 more
openaire +2 more sources