Results 151 to 160 of about 2,151,378 (190)
Adversarial Contention Resolution Games [PDF]
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023 We study contention resolution (CR) on a shared channel modelled as a game with selfish players. There are n agents and the adversary chooses some k smaller than n of them as players. Each participating player in a CR game has a packet to transmit. A transmission is successful if it is performed as the only one at a round.
Giorgos Chionas +3 more
openaire +3 more sources
Contention Resolution under Selfishness
Algorithmica, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001 +2 more
openaire +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Contention resolution with message deadlines
Distributed Computing, 2020In the contention-resolution problem, multiple players contend for access to a shared resource. Contention resolution is used in wireless networks, where messages must be transmitted on a shared communication channel. When two or more messages are transmitted at the same time, a collision occurs, and none of the transmissions succeed.
Kunal Agrawal 0001 +4 more
openaire +3 more sources
A Unified Study of Contention-Resolution Schemes in Optical Packet-Switched Networks
Journal of Lightwave Technology, 2003 This paper presents a comprehensive study of contention-resolution schemes in a multi-wavelength optical packet-switched network. This investigation aims to provide a unified study of a network of optical routers, which include contention resolution in ...
S J B Yoo, S Dixit
exaly +1 more source
Contention Resolution on a Fading Channel
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeremy T. Fineman +3 more
openaire +4 more sources
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing, 1998 We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable ...
Prabhakar Raghavan, Eli Upfal
exaly +1 more source
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing, 1995We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable and the expected delay of a request from arrival to service.
Prabhakar Raghavan, Eli Upfal
openaire +3 more sources
Deterministic Contention Resolution on a Shared Channel
2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019A shared communication channel (also known as a multiple access channel) is among the most popular and widely studied models of communication and distributed computing. In this model, stations are able to communicate by transmitting and listening to a shared channel.
De Marco G. +2 more
openaire +3 more sources
Ant-Based Contention Resolution in Slotted WDM Optical Packet Switched Networks
IEICE Electronics Express, 2006 This paper proposed an Ant-based contention resolution scheme for the slotted optical packets switched (OPS) networks. The proposed contention resolution schemes are shown to be effective to resolve packet contention and to achieve good performance by ...
Tan, Saw Chin +2 more
exaly +2 more sources
CSMA/CD with Deterministic Contention Resolution
IEEE Journal on Selected Areas in Communications, 1983This paper presents a novel media access protocol CSMA/CD with deterministic contention resolution (DCR) for a local area network. It usually operates as CSMA/CD, but once a collision occurs it resolves the collision using a kind of implicit token passing.
Akihiro Takagi +2 more
openaire +2 more sources