On the public citation graph

On the queueing behavior of inter-flow asynchronous network coding

0 signed · 50 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/dac.998openalex-snapshot
On the characteristics of queueing and scheduling at encoding nodes for network coding
inferredcites →https://doi.org/10.1007/978-1-4899-2215-1openalex-snapshot
Telecommunications Switching
inferredcites →https://doi.org/10.1007/bf01149328openalex-snapshot
Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
inferredcites →https://doi.org/10.1007/bf01149329openalex-snapshot
Finite capacity assembly-like queues
inferredcites →https://doi.org/10.1007/bf01149540openalex-snapshot
An approximate analysis for a class of assembly-like queues
inferredcites →https://doi.org/10.1007/bf01158549openalex-snapshot
Bounds and heuristics for assembly-like queues
inferredcites →https://doi.org/10.1016/s0167-2789(02)00431-1openalex-snapshot
On the log-normal distribution of network traffic
inferredcites →https://doi.org/10.1017/s0021900200095358openalex-snapshot
Assembly-like queues
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/infcom.2005.1498511openalex-snapshot
Network coding for large scale content distribution
inferredcites →https://doi.org/10.1109/infocom.2008.83openalex-snapshot
How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding
inferredcites →https://doi.org/10.1109/iscit.2005.1566811openalex-snapshot
Queuing model and delay analysis on network coding
inferredcites →https://doi.org/10.1109/isit.2003.1228459openalex-snapshot
The benefits of coding over routing in a randomized setting
inferredcites →https://doi.org/10.1109/isit.2006.261656openalex-snapshot
Network Coding for Multiple Unicasts: An Approach based on Linear Optimization
inferredcites →https://doi.org/10.1109/isit.2008.4595268openalex-snapshot
ARQ for network coding
inferredcites →https://doi.org/10.1109/itw.2006.322852openalex-snapshot
On the queueing delay of a multicast erasure channel
inferredcites →https://doi.org/10.1109/itw2.2006.323834openalex-snapshot
On the queueing delay of a multicast erasure channel
inferredcites →https://doi.org/10.1109/itwitwn.2007.4318066openalex-snapshot
On queueing in coded networks ¿ queue size follows degrees of freedom
inferredcites →https://doi.org/10.1109/itwnit.2009.5158557openalex-snapshot
Queueing performance under Network Coding
inferredcites →https://doi.org/10.1109/iwqos.2009.5201386openalex-snapshot
A calculus for information-driven networks
inferredcites →https://doi.org/10.1109/jsac.2007.071205openalex-snapshot
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
inferredcites →https://doi.org/10.1109/jsac.2009.090606openalex-snapshot
Is rate adaptation beneficial for inter-session network coding?
inferredcites →https://doi.org/10.1109/milcom.2007.4454988openalex-snapshot
Wireless Network Coding: Opportunities & Challenges
inferredcites →https://doi.org/10.1109/netcod.2009.5191386openalex-snapshot
Performance modeling of stochastic networks with network coding
inferredcites →https://doi.org/10.1109/netcod.2009.5191390openalex-snapshot
Energy consumption in coded queues for wireless information exchange
inferredcites →https://doi.org/10.1109/netcod.2010.5487663openalex-snapshot
An Analytical Study of Network Coding in the Presence of Real-Time Messages
inferredcites →https://doi.org/10.1109/netcod.2010.5487689openalex-snapshot
Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks
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.2007.904980openalex-snapshot
On Joint MAC and Network Coding in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/tit.2010.2040862openalex-snapshot
Queueing Analysis of a Butterfly Network for Comparing Network Coding to Classical Routing
inferredcites →https://doi.org/10.1109/tit.2011.2171516openalex-snapshot
Queueing Delay Analysis for Multicast With Random Linear Coding
inferredcites →https://doi.org/10.1109/tmc.2009.160openalex-snapshot
DCAR: Distributed Coding-Aware Routing in Wireless Networks
inferredcites →https://doi.org/10.1109/tnet.2002.801399openalex-snapshot
The BLUE active queue management algorithms
inferredcites →https://doi.org/10.1109/tnet.2003.818197openalex-snapshot
An algebraic approach to network coding
inferredcites →https://doi.org/10.1109/tnet.2008.923722openalex-snapshot
XORs in the Air: Practical Wireless Network Coding
inferredcites →https://doi.org/10.1109/wiopt.2006.1666502openalex-snapshot
An Analysis of Finite-Memory Random Linear Coding on Packet Streams
inferredcites →https://doi.org/10.1145/1159913.1159942openalex-snapshot
XORs in the air
inferredcites →https://doi.org/10.1145/1514274.1514292openalex-snapshot
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
inferredcites →https://doi.org/10.1145/347057.347421openalex-snapshot
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
inferredcites →https://doi.org/10.1145/347059.347421openalex-snapshot
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.5135023openalex-extracted
To-send-or-not-to-send: An optimal stopping approach to network coding in multi-hop wireless networks
inferred← citeshttps://doi.org/10.1002/dac.3438openalex-snapshot
To‐send‐or‐not‐to‐send: An optimal stopping approach to network coding in multi‐hop wireless 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.2015.05.001openalex-snapshot
On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.peva.2013.08.002openalex-snapshot
Energy–delay tradeoff in a two-way relay with network coding
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/access.2017.2736879openalex-snapshot
PACE: Redundancy Engineering in RLNC for Low-Latency Communication
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/icc.2015.7249304openalex-snapshot
Optimized network coding efficiency under QoS constraints in two-way relay networks with timeouts
inferred← citeshttps://doi.org/10.3837/tiis.2015.08.007openalex-snapshot
OQMCAR: An Enhanced Network Coding-aware Routing Algorithm Based on Queue State and Local Topology
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.