On the public citation graph
Link‐disjoint paths for reliable QoS routing
0 signed · 123 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.1002/net.3230140209openalex-snapshot
A quick method for finding shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1016/0166-218x(90)90024-7openalex-snapshot
The complexity of finding two disjoint paths with min-max objective function
inferredcites →https://doi.org/10.1016/s0140-3664(99)00225-xopenalex-snapshot
TAMCRA: a tunable accuracy multiple constraints routing algorithm
inferredcites →https://doi.org/10.1016/s1389-1286(01)00222-5openalex-snapshot
Hop-by-hop quality of service routing
inferredcites →https://doi.org/10.1109/18.212275openalex-snapshot
Distributed algorithms for computing shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/7.18692openalex-snapshot
Finding the best set of K paths through a trellis with application to multitarget tracking
inferredcites →https://doi.org/10.1109/7.53448openalex-snapshot
Efficient algorithms for finding the K best paths through a trellis
inferredcites →https://doi.org/10.1109/icccn.2001.956220openalex-snapshot
Issues on diverse routing for WDM mesh networks with survivability
inferredcites →https://doi.org/10.1109/infcom.1994.337532openalex-snapshot
Optimal diverse routing in telecommunication fiber networks
inferredcites →https://doi.org/10.1109/infcom.2000.832265openalex-snapshot
Dynamic routing of bandwidth guaranteed tunnels with restoration
inferredcites →https://doi.org/10.1109/infcom.2002.1019252openalex-snapshot
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
inferredcites →https://doi.org/10.1109/infcom.2002.1019254openalex-snapshot
Restoration algorithms for virtual private networks in the hose model
inferredcites →https://doi.org/10.1109/infcom.2003.1208979openalex-snapshot
Algorithms for computing QoS paths with restoration
inferredcites →https://doi.org/10.1109/ipdps.2001.924946openalex-snapshot
Robust routing in wide-area WDM networks
inferredcites →https://doi.org/10.1109/iwqos.1999.766485openalex-snapshot
Quality-of-service routing using maximally disjoint paths
inferredcites →https://doi.org/10.1109/mcom.2002.1007411openalex-snapshot
Restorable dynamic quality of service routing
inferredcites →https://doi.org/10.1109/mcom.2003.1186559openalex-snapshot
A novel approach of backup path reservation for survivable high-speed networks
inferredcites →https://doi.org/10.1109/scac.1995.523657openalex-snapshot
Span-disjoint paths for physical diversity in networks
inferredcites →https://doi.org/10.1109/tnet.2002.808405openalex-snapshot
An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks
inferredcites →https://doi.org/10.1109/tnet.2003.818191openalex-snapshot
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
inferredcites →https://doi.org/10.1109/tnet.2005.850217openalex-snapshot
Algorithms for computing QoS paths with restoration
inferredcites →https://doi.org/10.1145/115992.115998openalex-snapshot
Finding disjoint paths in networks
inferredcites →https://doi.org/10.1145/115994.115998openalex-snapshot
Finding disjoint paths in networks
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.3233/hsn-2001-208openalex-snapshot
Survivability of lightwave networks – path lengths in WDM protection scheme
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119819264.ch16openalex-snapshot
Protection, Restoration, and Improvement
inferred← citeshttps://doi.org/10.1002/cpe.4799openalex-snapshot
An efficient Manhattan‐distance‐constrained disjoint paths algorithm for incomplete mesh network
inferred← citeshttps://doi.org/10.1002/cpe.5509openalex-snapshot
Sensitive medical data transmission and maintaining data quality using bacterial bee swarm–based hybrid lifetime maximization large‐scale ad hoc routing protocol
inferred← citeshttps://doi.org/10.1002/cpe.6793openalex-snapshot
Flow splitting scheme over link‐disjoint multiple paths in software‐defined networking
inferred← citeshttps://doi.org/10.1002/dac.2519openalex-snapshot
Concurrent multipath traffic impersonating for enhancing communication privacy
inferred← citeshttps://doi.org/10.1007/978-1-4020-6264-3_89openalex-snapshot
On Path Selection for Multipath Connection
inferred← citeshttps://doi.org/10.1007/978-3-031-23141-4_7openalex-snapshot
A Service Protection Mechanism of Deterministic Networking Based on Segment Routing
inferred← citeshttps://doi.org/10.1007/978-3-319-08991-1_61openalex-snapshot
QoS Multi-path Routing Scheme Based on ACR Algorithm in Industrial Ethernet
inferred← citeshttps://doi.org/10.1007/978-3-540-30573-6_10openalex-snapshot
Implementation of Virtual Path Hopping (VPH) as a Solution for Control Plane Failures in Connection Oriented Networks and an Analysis of Traffic Distribution of VPH
inferred← citeshttps://doi.org/10.1007/978-3-540-45190-7_3openalex-snapshot
Quality of Service Routing
inferred← citeshttps://doi.org/10.1007/978-981-10-6005-2_8openalex-snapshot
Optimized QoS-Based Node Disjoint Routing for Wireless Multimedia Sensor Networks
inferred← citeshttps://doi.org/10.1007/s10922-007-9095-4openalex-snapshot
A Network Architecture with High Availability for Real-time Premium Traffic over the Internet
inferred← citeshttps://doi.org/10.1007/s11235-011-9577-2openalex-snapshot
Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection
inferred← citeshttps://doi.org/10.1007/s11235-011-9580-7openalex-snapshot
Some more aspects of resilience
inferred← citeshttps://doi.org/10.1007/s11235-013-9827-6openalex-snapshot
Methods for physical impairment constrained routing with selected protection in all-optical networks
inferred← citeshttps://doi.org/10.1007/s11235-014-9964-6openalex-snapshot
Toggling dual label: an exact algorithm for finding the optimal pair of link-disjoint paths in $$\alpha +1$$ α + 1 path protection
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.06.008openalex-snapshot
Research challenges in QoS routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.08.018openalex-snapshot
Energy-balanced cross layer traffic and coding optimality in battery-powered wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.09.007openalex-snapshot
A connection-oriented network architecture with guaranteed QoS for future real-time applications over the Internet
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.01.015openalex-snapshot
Energy aware routing with link disjoint backup paths
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.04.004openalex-snapshot
Energy Aware Two Disjoint Paths Routing
inferred← citeshttps://doi.org/10.1016/j.osn.2012.04.006openalex-snapshot
Topological optimization for spare-sharing-based wavelength-routed all-optical networks
inferred← citeshttps://doi.org/10.1051/ro/2022215openalex-snapshot
The widestk-set of disjoint paths problem
inferred← citeshttps://doi.org/10.1109/access.2021.3093899openalex-snapshot
Multi-Path Routing in Green Multi-Stage Upgrade for Bundled-Links SDN/OSPF-ECMP Networks
inferred← citeshttps://doi.org/10.1109/aina.2009.24openalex-snapshot
An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints
inferred← citeshttps://doi.org/10.1109/aina.2010.107openalex-snapshot
Maximizing Bandwidth Using Disjoint Paths
inferred← citeshttps://doi.org/10.1109/apcc.2005.1554150openalex-snapshot
A Network Architecture with Virtual Path Hopping and Dynamic Virtual Path Allocation Algorithm
inferred← citeshttps://doi.org/10.1109/apcc.2006.255823openalex-snapshot
A Novel Path Protection Scheme with FEC Path in Connection Oriented Networks
inferred← citeshttps://doi.org/10.1109/apcc.2009.5375519openalex-snapshot
Edge disjoint paths with minimum delay subject to reliability constraint
inferred← citeshttps://doi.org/10.1109/apcc.2012.6388283openalex-snapshot
Evaluating tradeoff between PDP and k-FDP algorithms under sharing reliable links
inferred← citeshttps://doi.org/10.1109/ccnc.2007.31openalex-snapshot
Seamless Failure Recovery for Real-time Premium Traffic in MPLS Networks
inferred← citeshttps://doi.org/10.1109/cisp-bmei51763.2020.9263694openalex-snapshot
Intelligent trust path search
inferred← citeshttps://doi.org/10.1109/comsnets.2009.4808839openalex-snapshot
Genetic Algorithm approach to Dynamic Multi Constraint Multi Path QoS Routing Algorithm for IP networks (GA-DMCMPRA)
inferred← citeshttps://doi.org/10.1109/comst.2015.2453941openalex-snapshot
Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath
inferred← citeshttps://doi.org/10.1109/comst.2015.2460222openalex-snapshot
A Survey on Internet Multipath Routing and Provisioning
inferred← citeshttps://doi.org/10.1109/cso.2011.145openalex-snapshot
Heuristic Algorithm for K-disjoint QoS Routing Problem
inferred← citeshttps://doi.org/10.1109/cyberc.2015.45openalex-snapshot
k -Maximally Disjoint Path Routing Algorithms for SDN
inferred← citeshttps://doi.org/10.1109/dsn.2018.00069openalex-snapshot
Divide and Conquer for Fast SRLG Disjoint Routing
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.153openalex-snapshot
Research on QoS Routing in the Internet
inferred← citeshttps://doi.org/10.1109/hpsr.2013.6602298openalex-snapshot
Energy-Aware Two Link-Disjoint Paths Routing
inferred← citeshttps://doi.org/10.1109/icc.2011.5962477openalex-snapshot
Scheme to Find k Disjoint Paths in Multi-Cost
inferred← citeshttps://doi.org/10.1109/icc.2014.6883901openalex-snapshot
Reliable green routing using two disjoint paths
inferred← citeshttps://doi.org/10.1109/icccas.2009.5250496openalex-snapshot
Link-disjoint QoS routing algorithm
inferred← citeshttps://doi.org/10.1109/iccnc.2014.6785387openalex-snapshot
Lowering power consumption in dedicated tributary protection schemes using Digital Subcarrier Optical Networks
inferred← citeshttps://doi.org/10.1109/icfcc.2010.5497616openalex-snapshot
The third kind of communication network
inferred← citeshttps://doi.org/10.1109/icicse.2012.29openalex-snapshot
A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints
inferred← citeshttps://doi.org/10.1109/icmew.2015.7169758openalex-snapshot
QoS-driven multipath routing for on-demand video streaming in a Publish-Subscribe Internet
inferred← citeshttps://doi.org/10.1109/icroit.2014.6798336openalex-snapshot
A dependable routing framework for seamless traffic flow over the computer network
inferred← citeshttps://doi.org/10.1109/icumt.2010.5676586openalex-snapshot
An optimum paths-finding algorithm for ±+1 path protection
inferred← citeshttps://doi.org/10.1109/iisa.2015.7387971openalex-snapshot
Exploiting path diversity for networked music performance in the Publish Subscribe Internet
inferred← citeshttps://doi.org/10.1109/imcom60618.2024.10418401openalex-snapshot
Planning of Primary and Alternative Path Using Deep Learning Model for Traffic Engineering in Small Networks
inferred← citeshttps://doi.org/10.1109/infcom.2007.149openalex-snapshot
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing
inferred← citeshttps://doi.org/10.1109/infocom.2006.155openalex-snapshot
Session Privacy Enhancement by Traffic Dispersion
inferred← citeshttps://doi.org/10.1109/infocom.2008.95openalex-snapshot
Area Avoidance Routing in Distance-Vector Networks
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00124openalex-snapshot
Multi-Path Routing in the Jellyfish Network
inferred← citeshttps://doi.org/10.1109/itre.2005.1503145openalex-snapshot
An efficient network architecture with guaranteed QoS and very high availability for real-time on-line learning
inferred← citeshttps://doi.org/10.1109/iwcmc.2017.7986474openalex-snapshot
Finding most reliable paths for software defined networks
inferred← citeshttps://doi.org/10.1109/iwcmc.2018.8450413openalex-snapshot
Multi-Path Routing for Maximum Bandwidth with K Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1109/jlt.2013.2289925openalex-snapshot
Performance Analysis of Circuit Switched Multi-Service Multi-Rate Networks With Alternative Routing
inferred← citeshttps://doi.org/10.1109/lcn.2018.8638130openalex-snapshot
Iterative Discovery of Multiple Disjoint Paths in Switched Networks with Multicast Frames
inferred← citeshttps://doi.org/10.1109/netsys.2017.7903946openalex-snapshot
Performance comparison of node-redundant multicast distribution trees in SDN networks
inferred← citeshttps://doi.org/10.1109/netwks.2006.300414openalex-snapshot
QoS Guaranteed and Reliable Network Architecture for Real-Time Applications over the Connection Oriented Internet
inferred← citeshttps://doi.org/10.1109/netwks.2010.5624951openalex-snapshot
Shared protection of demands with Physical Impairment Constrained Routing
inferred← citeshttps://doi.org/10.1109/paccs.2009.146openalex-snapshot
A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints
inferred← citeshttps://doi.org/10.1109/prdc.2008.16openalex-snapshot
A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network
inferred← citeshttps://doi.org/10.1109/rndm.2014.7014952openalex-snapshot
Cost-Efficient network improvement to achieve maximum path diversity
inferred← citeshttps://doi.org/10.1109/srds.2009.10openalex-snapshot
The Blocking Option in Routing Protocols
inferred← citeshttps://doi.org/10.1109/telfor.2018.8611961openalex-snapshot
Finding Disjoint Paths in Boolean-Valued Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2043538openalex-snapshot
Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks
inferred← citeshttps://doi.org/10.1109/tnet.2014.2309253openalex-snapshot
Finding Critical Regions and Region-Disjoint Paths in a Network
inferred← citeshttps://doi.org/10.1109/tnse.2022.3169691openalex-snapshot
On Searching Multiple Disjoint Shortest Paths in Scale-Free Networks With Hyperbolic Geometry
inferred← citeshttps://doi.org/10.1109/tr.2010.2103592openalex-snapshot
Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925832openalex-snapshot
A Practical Data Forwarding Path Selecting Method for Software-Defined 5G Networking
inferred← citeshttps://doi.org/10.1145/1384117.1384132openalex-snapshot
Design and implementation of a scalable constraint-based routing module for QoS path computation
inferred← citeshttps://doi.org/10.1145/2069216.2069225openalex-snapshot
An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint
inferred← citeshttps://doi.org/10.1145/2968448openalex-snapshot
2-Edge Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1145/3281411.3281424openalex-snapshot
Robustly disjoint paths with segment routing
inferred← citeshttps://doi.org/10.1155/2013/489149openalex-snapshot
An Efficient Approximate Algorithm for Disjoint QoS Routing
inferred← citeshttps://doi.org/10.12720/jcm.10.8.551-561openalex-snapshot
Restorable Energy Aware Routing with Backup Sharing in Software Defined Networks
inferred← citeshttps://doi.org/10.1504/ijcnds.2010.035557openalex-snapshot
Genetic algorithm approach to dynamic multiconstraint multipath QoS routing algorithm for IP networks
inferred← citeshttps://doi.org/10.1587/transinf.2013thp0015openalex-snapshot
On Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network
inferred← citeshttps://doi.org/10.18419/opus-2631openalex-snapshot
Key distribution schemes for resource-constrained devices in wireless sensor networks
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.452openalex-snapshot
Concept of Virtual Path Hopping to Improve QoS and Reliability of Connection-oriented Networks
inferred← citeshttps://doi.org/10.2197/ipsjdc.3.779openalex-snapshot
Seamless Failure Recovery for Real-time Multimedia Applications in MPLS Networks
inferred← citeshttps://doi.org/10.22215/etd/2009-06484openalex-snapshot
Policy-enabled traffic engineering in maritime tactical networks
inferred← citeshttps://doi.org/10.23919/inm.2017.7987284openalex-snapshot
Performance comparison of resilience mechanisms for stateless multicast using BIER
inferred← citeshttps://doi.org/10.3390/photonics5040035openalex-snapshot
Disaster-Resilient Optical Network Survivability: A Comprehensive Survey
inferred← citeshttps://doi.org/10.4218/etrij.09.0108.0531openalex-snapshot
Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02131openalex-snapshot
Multi-Path Routing on the Jellyfish Networks
inferred← citeshttps://doi.org/10.5402/2012/932456openalex-snapshot
An Overview of Algorithms for Network Survivability
inferred← citeshttps://doi.org/10.5555/2722129.2722261openalex-snapshot
2-edge connectivity in directed graphs
inferred← citeshttps://doi.org/10.5815/ijcnis.2016.03.07openalex-snapshot
An Analysis of Link Disjoint and Node Disjoint Multipath Routing for Mobile Ad Hoc Network
inferred← citeshttps://doi.org/10.70675/c619e110z3db5z47e7zadffze08b3796871eopenalex-snapshot
optimizing routing and resource allocation in sdn-based server only data center networks for private cloud architectures
inferred← citeshttps://doi.org/10.7763/ijcee.2009.v1.46openalex-snapshot
QoS ROUTING USING GENETIC ALGORITHM (QOSGA)
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.