On the public citation graph

On the characteristics of queueing and scheduling at encoding nodes for network coding

0 signed · 21 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.1016/0166-218x(94)90171-6openalex-snapshot
Network flows: Theory, algorithms and applications
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/tit.2002.807285openalex-snapshot
Linear network coding
inferredcites →https://doi.org/10.1109/tit.2005.847712openalex-snapshot
Polynomial Time Algorithms for Multicast Network Code Construction
inferredcites →https://doi.org/10.1109/tit.2005.864435openalex-snapshot
Information flow decomposition for network coding
inferredcites →https://doi.org/10.1109/tit.2006.874434openalex-snapshot
The encoding complexity of network coding
inferredcites →https://doi.org/10.1109/tnet.2003.818197openalex-snapshot
An algebraic approach to network coding

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.3180openalex-snapshot
An efficient network‐coding based back‐pressure scheduling algorithm for wireless multi‐hop networks
inferred← citeshttps://doi.org/10.1007/s11277-021-08469-1openalex-snapshot
A Perspective on Network Coding Based on Packet Length
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.04.020openalex-snapshot
On the queueing behavior of inter-flow asynchronous network coding
inferred← citeshttps://doi.org/10.1063/1.5033760openalex-snapshot
The queueing perspective of asynchronous network coding in two-way relay network
inferred← citeshttps://doi.org/10.1109/access.2016.2611619openalex-snapshot
Queueing Characteristics of the Best Effort Network Coding Strategy
inferred← citeshttps://doi.org/10.1109/ccoms.2018.8463313openalex-snapshot
The Probability Density Function for Network Coding with Three Input Flows
inferred← citeshttps://doi.org/10.1109/csndsp.2014.6923973openalex-snapshot
Performance of a network coding queuing model with deterministic service
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683947openalex-snapshot
Optimal Scheduling for Network Coding: Delay v.s. Efficiency
inferred← citeshttps://doi.org/10.1109/iccnc.2013.6504227openalex-snapshot
A queueing theoretic model for opportunistic network coding
inferred← citeshttps://doi.org/10.1109/itnec.2017.8284988openalex-snapshot
A new strategy of network coding based on packet length
inferred← citeshttps://doi.org/10.1109/milcom.2011.6127683openalex-snapshot
Systematic design of network coding-aware buffering strategies
inferred← citeshttps://doi.org/10.1109/msn.2009.32openalex-snapshot
Optimal Data Rate and Opportunistic Scheme on Network Coding over Rayleigh Fading Channels
inferred← citeshttps://doi.org/10.1109/tvt.2010.2053947openalex-snapshot
Network Coding for Two-Way Relaying Networks Over Rayleigh Fading Channels
inferred← citeshttps://doi.org/10.1109/wicom.2011.6040390openalex-snapshot
Opportunistic and Fairness Scheduling Mechanism for Wireless Network Coding
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.