On the public citation graph

A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470167960.ch3openalex-snapshot
Multiuser Communications
inferredcites →https://doi.org/10.1007/978-3-7091-2900-5_4openalex-snapshot
Collision-Resolution Algorithms and Random-Access Communications
inferredcites →https://doi.org/10.1016/0166-5316(89)90045-xopenalex-snapshot
Analysis of a class of distributed queues with applications
inferredcites →https://doi.org/10.1109/18.21217openalex-snapshot
Delay analysis of the n-ary stack random-access algorithm
inferredcites →https://doi.org/10.1109/18.42234openalex-snapshot
A simple window random access algorithm with advantageous properties
inferredcites →https://doi.org/10.1109/26.225484openalex-snapshot
Bounds on the delay distribution of window random-access algorithms
inferredcites →https://doi.org/10.1109/cdc.1987.272459openalex-snapshot
Delay distribution analysis of window random-access algorithms
inferredcites →https://doi.org/10.1109/infcom.1989.101494openalex-snapshot
Performance analysis of window type random-access algorithms for packet radio networks
inferredcites →https://doi.org/10.1109/jsac.1987.1146613openalex-snapshot
A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative
inferredcites →https://doi.org/10.1109/tcom.1978.1094204openalex-snapshot
An Adaptive Technique for Local Distribution
inferredcites →https://doi.org/10.1109/tcom.1979.1094298openalex-snapshot
Generalized TDMA: The Multi-Accessing Tree Protocol
inferredcites →https://doi.org/10.1109/tcom.1985.1096261openalex-snapshot
A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels
inferredcites →https://doi.org/10.1109/tcom.1985.1096402openalex-snapshot
Virtual Time CSMA: Why Two Clocks Are Better than One
inferredcites →https://doi.org/10.1109/tcom.1986.1096639openalex-snapshot
Delay Analysis of 0.487 Contention Resolution Algorithms
inferredcites →https://doi.org/10.1109/tcom.1987.1096710openalex-snapshot
Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access
inferredcites →https://doi.org/10.1109/tit.1979.1056093openalex-snapshot
Tree algorithms for packet broadcast channels
inferredcites →https://doi.org/10.1109/tit.1985.1057013openalex-snapshot
Q-ary collision resolution algorithms in random-access systems with free or blocked channel access
inferredcites →https://doi.org/10.1109/tit.1985.1057014openalex-snapshot
Analysis of a stack algorithm for random multiple-access communication
inferredcites →https://doi.org/10.1109/tit.1985.1057016openalex-snapshot
Delay analysis of interval-searching contention resolution algorithms
inferredcites →https://doi.org/10.1109/tit.1985.1057023openalex-snapshot
Survey of USSR contributions to random multiple-access communications
inferredcites →https://doi.org/10.1109/tit.1985.1057026openalex-snapshot
Born again group testing: Multiaccess communications
inferredcites →https://doi.org/10.1145/29903.29930openalex-snapshot
Delay analysis of a window tree conflict resolution algorithm in a local area network environment
inferredcites →https://doi.org/10.1287/opre.17.6.1058openalex-snapshot
Some Conditions for Ergodicity and Recurrence of Markov Chains
inferredcites →https://doi.org/10.1287/opre.34.4.619openalex-snapshot
D/G/1 Queues with Vacations
inferredcites →https://doi.org/10.2307/1267734openalex-snapshot
The Single Server Queue
inferredcites →https://doi.org/10.2307/2981499openalex-snapshot
The Single Server Queue.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/047134608x.w5317openalex-snapshot
Multiple Access Schemes
inferred← citeshttps://doi.org/10.1002/0471654507.eme282openalex-snapshot
Multiple‐Access Schemes
inferred← citeshttps://doi.org/10.1002/0471654507.erfme230openalex-snapshot
Multiple‐Access Schemes
inferred← citeshttps://doi.org/10.1007/bf01158961openalex-snapshot
A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
inferred← citeshttps://doi.org/10.1016/s1570-8705(03)00002-7openalex-snapshot
Energy-efficient MAC in ad-hoc networks inspired by conflict resolution concepts
inferred← citeshttps://doi.org/10.1109/49.414649openalex-snapshot
A protocol for random multiple access of packets with mixed priorities in wireless networks
inferred← citeshttps://doi.org/10.1109/49.872954openalex-snapshot
Multiple access control with intelligent bandwidth allocation for wireless ATM networks
inferred← citeshttps://doi.org/10.1109/98.667945openalex-snapshot
Random multiple access of broadcast channels with Pareto distributed packet interarrival times
inferred← citeshttps://doi.org/10.1109/icc.2000.853082openalex-snapshot
A contention access protocol with dynamic bandwidth allocation for wireless ATM networks
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208700openalex-snapshot
Energy-efficient collision resolution in wireless ad-hoc networks
inferred← citeshttps://doi.org/10.1109/milcom.1995.483309openalex-snapshot
The effect of a cheater on the performance of a random-access protocol
inferred← citeshttps://doi.org/10.1109/spawc.2007.4401391openalex-snapshot
A contention binary tree algorithm assisted by source separation
inferred← citeshttps://doi.org/10.1109/vetecs.2010.5493749openalex-snapshot
Blind Collision Resolution Using Cooperative Transmission
inferred← citeshttps://doi.org/10.1109/wcnc.2009.4917663openalex-snapshot
Design and Analysis of a Splitting Algorithm for a Multi-packet Reception ALOHA System
inferred← citeshttps://doi.org/10.1109/wncmf.1994.529428openalex-snapshot
A protocol for random multiple access of packets with mixed priorities in wireless networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.