On the public citation graph

Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing

0 signed · 30 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/j.comnet.2006.09.019openalex-snapshot
Disjoint multipath routing using colored trees
inferredcites →https://doi.org/10.1016/s0898-1221(99)90155-4openalex-snapshot
Survivable networks: Algorithms for diverse routing
inferredcites →https://doi.org/10.1109/49.12889openalex-snapshot
Routing of multipoint connections
inferredcites →https://doi.org/10.1109/90.803380openalex-snapshot
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
inferredcites →https://doi.org/10.1109/hicss.2002.994517openalex-snapshot
An extended dynamic source routing scheme in ad hoc wireless networks
inferredcites →https://doi.org/10.1109/icc.2001.937262openalex-snapshot
Split multipath routing with maximally disjoint paths in ad hoc networks
inferredcites →https://doi.org/10.1109/icc.2003.1203869openalex-snapshot
Multi-path selection for multiple description encoded video streaming
inferredcites →https://doi.org/10.1109/icccn.1999.805497openalex-snapshot
On-demand multipath routing for mobile ad hoc networks
inferredcites →https://doi.org/10.1109/icccn.1999.805568openalex-snapshot
A new approach to on-demand loop-free multipath routing
inferredcites →https://doi.org/10.1109/icnp.2001.992756openalex-snapshot
On-demand multipath distance vector routing in ad hoc networks
inferredcites →https://doi.org/10.1109/infcom.1996.493045openalex-snapshot
Congestion-oriented shortest multipath routing
inferredcites →https://doi.org/10.1109/infcom.1997.631180openalex-snapshot
A highly adaptive distributed routing algorithm for mobile wireless networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208677openalex-snapshot
Performance analysis of reactive shortest path and multipath routing mechanism with load balance
inferredcites →https://doi.org/10.1109/infcom.2003.1208678openalex-snapshot
Cooperative packet caching and shortest multipath routing in mobile ad hoc networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208679openalex-snapshot
A framework for reliable routing in mobile ad hoc networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498553openalex-snapshot
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
inferredcites →https://doi.org/10.1109/jsac.2003.816597openalex-snapshot
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees
inferredcites →https://doi.org/10.1109/wcnc.2000.904822openalex-snapshot
AODV-BR: backup routing in ad hoc networks
inferredcites →https://doi.org/10.1145/509506.509514openalex-snapshot
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

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-3-642-25905-0_52openalex-snapshot
Load-Balanced and Link-Disjoint Multipath Routing for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.11.029openalex-snapshot
Linear time distributed construction of colored trees for disjoint multipath routing
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.01.017openalex-snapshot
All-to-all disjoint multipath routing using cycle embedding
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.02.009openalex-snapshot
Fast reroute from single link and single node failures for IP multicast
inferred← citeshttps://doi.org/10.1109/glocom.2006.996openalex-snapshot
WSN18-3: Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
inferred← citeshttps://doi.org/10.1109/icccn.2006.286270openalex-snapshot
Minimizing Average Path Cost in Colored Trees for Disjoint Multipath Routing
inferred← citeshttps://doi.org/10.1109/infcom.2007.81openalex-snapshot
Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062052openalex-snapshot
Fast Recovery from Dual Link Failures in IP Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2055887openalex-snapshot
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
inferred← citeshttps://doi.org/10.1109/tnet.2011.2161329openalex-snapshot
Independent Directed Acyclic Graphs for Resilient Multipath Routing
inferred← citeshttps://doi.org/10.26708/ijmsc.2013.3.3.01openalex-snapshot
Weighted Independent Directed Acyclic Graphs for Resilient and Efficient Multipath Routing
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.