On the public citation graph

Competitive multicast routing

https://doi.org/10.1007/bf01196262
0 signed · 36 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.4520010208openalex-snapshot
Paris: An approach to integrated high‐speed private networks
inferredcites →https://doi.org/10.1006/jagm.1995.1008openalex-snapshot
The Competitiveness of On-Line Assignments
inferredcites →https://doi.org/10.1007/3-540-57155-8_241openalex-snapshot
Online load balancing of temporary tasks
inferredcites →https://doi.org/10.1016/0169-7552(92)90114-6openalex-snapshot
The Asynchronous Transfer Mode: a tutorial
inferredcites →https://doi.org/10.1017/s0001867800015858openalex-snapshot
Blocking probabilities in large circuit-switched networks
inferredcites →https://doi.org/10.1109/35.99262openalex-snapshot
Bandwidth management and congestion control in plaNET
inferredcites →https://doi.org/10.1109/infcom.1992.263457openalex-snapshot
Call preemption in communication networks
inferredcites →https://doi.org/10.1109/istcs.1993.253460openalex-snapshot
Efficient on-line call control algorithms
inferredcites →https://doi.org/10.1109/sfcs.1992.267770openalex-snapshot
On-line load balancing
inferredcites →https://doi.org/10.1109/sfcs.1993.366884openalex-snapshot
Throughput-competitive on-line routing
inferredcites →https://doi.org/10.1145/115992.116005openalex-snapshot
A study of priority pricing in multiple service class networks
inferredcites →https://doi.org/10.1145/144179.144275openalex-snapshot
Reliability and scaling issues in multicast communication
inferredcites →https://doi.org/10.1145/166237.166246openalex-snapshot
Core based trees (CBT)
inferredcites →https://doi.org/10.1145/166237.166247openalex-snapshot
Routing reserved bandwith multi-point connections
inferredcites →https://doi.org/10.1145/167088.167248openalex-snapshot
On-line load balancing with applications to machine scheduling and virtual circuit routing
inferredcites →https://doi.org/10.1145/167954.166247openalex-snapshot
Routing reserved bandwith multi-point connections
inferredcites →https://doi.org/10.1145/93385.93412openalex-snapshot
Distributed control for PARIS
inferredcites →https://doi.org/10.3233/jhs-1993-2101openalex-snapshot
NSF Implementation Plan for Interagency Interim NREN
inferredcites →https://doi.org/10.3233/jhs-1993-2302openalex-snapshot
The plaNET/ORBIT High Speed Network
inferredcites →https://doi.org/10.5555/314464.314508openalex-snapshot
Competitive routing of virtual circuits with unknown duration

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11600930_69openalex-snapshot
Packing Trees in Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25959-3_8openalex-snapshot
Competitive and Deterministic Embeddings of Virtual Networks
inferred← citeshttps://doi.org/10.1007/bf01193330openalex-snapshot
A survey of routing techniques for mobile communications networks
inferred← citeshttps://doi.org/10.1007/bfb0029572openalex-snapshot
On-line network routing
inferred← citeshttps://doi.org/10.1007/s10878-008-9150-4openalex-snapshot
Packing trees in communication networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.036openalex-snapshot
Competitive and deterministic embeddings of virtual networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxr023openalex-snapshot
A Depth-optimal Low-complexity Distributed Wireless Multicast Algorithm
inferred← citeshttps://doi.org/10.1109/hpcs.1997.864034openalex-snapshot
Multicast routing with heterogeneous quality
inferred← citeshttps://doi.org/10.1109/ipdps.2013.30openalex-snapshot
Oversubscription Bounded Multicast Scheduling in Fat-Tree Data Center Networks
inferred← citeshttps://doi.org/10.1109/jsac.2014.140110openalex-snapshot
On-Line Multicast Scheduling with Bounded Congestion in Fat-Tree Data Center Networks
inferred← citeshttps://doi.org/10.1109/milcom.2010.5680407openalex-snapshot
A low complexity distributed algorithm for computing minimum-depth multicast trees in wireless networks
inferred← citeshttps://doi.org/10.1109/pimrc.2004.1373851openalex-snapshot
SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/1374376.1374415openalex-snapshot
Optimal hierarchical decompositions for congestion minimization in networks
inferred← citeshttps://doi.org/10.1145/258128.258201openalex-snapshot
On-line routing of virtual circuits with applications to load balancing and machine scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2075openalex-snapshot
Low congestion online routing and an improved mistake bound for online prediction of graph labeling
inferred← citeshttps://doi.org/10.5555/365411.365547openalex-snapshot
Distributed admission control, scheduling, and routing with stale information
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.