On the public citation graph

Delay analysis of the n-ary stack random-access algorithm

0 signed · 35 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.1007/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/978-3-642-95281-4openalex-snapshot
On Regenerative Processes in Queueing Theory
inferredcites →https://doi.org/10.1016/0029-5582(59)90087-2openalex-snapshot
Approximate methods of higher analysis
inferredcites →https://doi.org/10.1017/s0001867800038581openalex-snapshot
Regenerative processes in the theory of queues, with applications to the alternating-priority queue
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.1985.1096261openalex-snapshot
A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels
inferredcites →https://doi.org/10.1109/tcom.1986.1096539openalex-snapshot
On the Throughput of Channel Access Algorithms with Limited Sensing
inferredcites →https://doi.org/10.1109/tcom.1986.1096635openalex-snapshot
Some Remarks on the Asymptotic Behavior of the Lengths of a Collision Resolution Interval
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.1987.1057278openalex-snapshot
A 0.487 throughput limited sensing algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-387-35378-4_7openalex-snapshot
Request Contention and Request Polling for the Upstream Media Access Control in ATM Access Networks
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/s0140-3664(96)01121-8openalex-snapshot
ms START: A random access algorithm for the IEEE 802.14 HFC network
inferred← citeshttps://doi.org/10.1016/s0140-3664(98)00237-0openalex-snapshot
ATM traffic control in hybrid fiber–coax networks – problems and solutions
inferred← citeshttps://doi.org/10.1016/s0166-5316(03)00061-0openalex-snapshot
Delay models for contention trees in closed populations
inferred← citeshttps://doi.org/10.1023/a:1013260028354openalex-snapshot
The n‐ary stack algorithm for the wireless random access channel
inferred← citeshttps://doi.org/10.1023/a:1018833722435openalex-snapshot
A Scheduling Technique Wireless Personal for Bandwidth Communication Allocation in Networks
inferred← citeshttps://doi.org/10.1023/a:1019137101888openalex-snapshot
MAC protocol and traffic scheduling for wireless ATM networks
inferred← citeshttps://doi.org/10.1023/a:1019156125474openalex-snapshot
Enhanced throughput efficiency by use of dynamically variable request minislots in MAC protocols for HFC and wireless access networks
inferred← citeshttps://doi.org/10.1109/18.259641openalex-snapshot
The analysis of the expected successful operation time of slotted ALOHA
inferred← citeshttps://doi.org/10.1109/18.265498openalex-snapshot
A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm
inferred← citeshttps://doi.org/10.1109/26.135725openalex-snapshot
Stability analysis of interconnected single-hop random-access networks
inferred← citeshttps://doi.org/10.1109/26.142795openalex-snapshot
Performance analysis of a stack random access algorithm for CSMA and CSMA/CD channels
inferred← citeshttps://doi.org/10.1109/35.486811openalex-snapshot
MLAP: a MAC level access protocol for the HFC 802.14 network
inferred← citeshttps://doi.org/10.1109/49.872946openalex-snapshot
Activity polling and activity contention in media access control protocols
inferred← citeshttps://doi.org/10.1109/49.872962openalex-snapshot
Statistically optimized minislot allocation for initial and collision resolution in hybrid fiber coaxial networks
inferred← citeshttps://doi.org/10.1109/glocom.1997.632588openalex-snapshot
Improving the effectiveness of ATM traffic control over hybrid fiber-coax networks
inferred← citeshttps://doi.org/10.1109/icupc.1998.733026openalex-snapshot
Performance of ATM and variable length packet access in broadband HFC and wireless networks
inferred← citeshttps://doi.org/10.1109/isce.2006.1689519openalex-snapshot
Distributed Queue Random Multiple Access Algorithm for Centralized Data Networks
inferred← citeshttps://doi.org/10.1109/lcn.1995.527374openalex-snapshot
Throughput behavior of the n-ary stack algorithm in mobile networks with capture
inferred← citeshttps://doi.org/10.1109/tc.2003.1204829openalex-snapshot
Performance of ip-based services over GPRS
inferred← citeshttps://doi.org/10.1109/tnet.2003.815298openalex-snapshot
Analysis of packet networks having contention-based reservation with application to GPRS
inferred← citeshttps://doi.org/10.1109/weconf.2018.8604328openalex-snapshot
Throughput Analysis of the System of Random Multiple Access with Separation by Signal Power
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.