On the public citation graph
WSN18-3: Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11753810_85openalex-snapshot
Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing
inferredcites →https://doi.org/10.1016/j.comnet.2006.09.019openalex-snapshot
Disjoint multipath routing using colored trees
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/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.1997.631180openalex-snapshot
A highly adaptive distributed routing algorithm for mobile wireless networks
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.2005.1498553openalex-snapshot
Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS
inferredcites →https://doi.org/10.1109/jlt.2005.856321openalex-snapshot
Dual-homing protection in IP-over-WDM networks
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
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.1007/s11235-015-9993-9openalex-snapshot
Flow assignment (FA) and capacity and flow assignment (CFA) problems for survivable overlay multicasting in dual homing networks
inferred← citeshttps://doi.org/10.1016/j.dcan.2016.01.002openalex-snapshot
Topology control of tactical wireless sensor networks using energy efficient zone routing
inferred← citeshttps://doi.org/10.1080/01969722.2013.803894openalex-snapshot
METAHEURISTIC ALGORITHMS FOR OPTIMIZATION OF SURVIVABLE MULTICAST OVERLAY IN DUAL HOMING NETWORKS
inferred← citeshttps://doi.org/10.1109/ants.2011.6163659openalex-snapshot
Multipath routing and dual link failure recovery in IP networks using three link-independent trees
inferred← citeshttps://doi.org/10.1109/hpsr.2013.6602285openalex-snapshot
Link-coloring based scheme for multicast and unicast protection
inferred← citeshttps://doi.org/10.1109/icnp.2015.44openalex-snapshot
Scalable and Efficient Multipath Routing: Complexity and Algorithms
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.5062214openalex-snapshot
Optimal Construction of Redundant Multicast Trees in Directed Graphs
inferred← citeshttps://doi.org/10.1109/jsac.2019.2906742openalex-snapshot
Scalable and Efficient Multipath Routing via Redundant Trees
inferred← citeshttps://doi.org/10.1109/lcn.2012.6423587openalex-snapshot
Efficient construction of directed Redundant Steiner trees
inferred← citeshttps://doi.org/10.1109/tnet.2015.2440179openalex-snapshot
IP Fast Rerouting and Disjoint Multipath Routing With Three Edge-Independent Spanning Trees
inferred← citeshttps://doi.org/10.1109/tpds.2010.145openalex-snapshot
Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1109/wcnc.2010.5506330openalex-snapshot
Disjoint Multipath Routing and QoS Provisioning Under Physical Interference Constraints
inferred← citeshttps://doi.org/10.3311/pp.ee.2010-1-2.04openalex-snapshot
Finding multiple maximally redundant trees in linear time
inferred← citeshttps://doi.org/10.4018/978-1-4666-2533-4.ch002openalex-snapshot
Interference Aware Resource Allocation in Relay Enhanced Broadband Wireless Access Networks
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.