On the public citation graph
Loop-free routing using diffusing computations
0 signed · 289 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.3230140303openalex-snapshot
Updating routing tables after resource failure in a distributed computer network
inferredcites →https://doi.org/10.1007/springerreference_27387openalex-snapshot
Transmission Control Protocol
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1016/0169-7552(89)90011-1openalex-snapshot
A minimum-hop routing algorithm based on distributed information
inferredcites →https://doi.org/10.1109/infcom.1988.13032openalex-snapshot
A distributed, loop-free, shortest-path routing algorithm
inferredcites →https://doi.org/10.1109/milcom.1986.4805715openalex-snapshot
Reducing Routing Overhead in a Growing DDN
inferredcites →https://doi.org/10.1109/tc.1987.1676875openalex-snapshot
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
inferredcites →https://doi.org/10.1109/tcom.1979.1094552openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.1109/tcom.1980.1094721openalex-snapshot
The New Routing Algorithm for the ARPANET
inferredcites →https://doi.org/10.1109/tcom.1982.1095632openalex-snapshot
A Responsive Distributed Routing Algorithm for Computer Networks
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/115992.115997openalex-snapshot
Dynamics of distributed shortest-path routing algorithms
inferredcites →https://doi.org/10.1145/115994.115997openalex-snapshot
Dynamics of distributed shortest-path routing algorithms
inferredcites →https://doi.org/10.1145/358690.358717openalex-snapshot
Distributed computation on graphs
inferredcites →https://doi.org/10.1145/359636.359701openalex-snapshot
A correctness proof of a topology information maintenance protocol for a distributed computer network
inferredcites →https://doi.org/10.1145/75246.75268openalex-snapshot
A unified approach to loop-free routing using distance vectors or link states
inferredcites →https://doi.org/10.1145/75247.75268openalex-snapshot
A unified approach to loop-free routing using distance vectors or link states
inferredcites →https://doi.org/10.17487/rfc0904openalex-snapshot
Exterior Gateway Protocol formal specification
inferredcites →https://doi.org/10.1787/sti_scoreboard-2009-20-enopenalex-snapshot
Telecommunication networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470396360.ch6openalex-snapshot
A Taxonomy of Routing Protocols in Sensor Networks
inferred← citeshttps://doi.org/10.1002/9780470396384.ch5openalex-snapshot
A Taxonomy of Routing Protocols for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1002/wcm.432openalex-snapshot
Ad hoc on‐demand multipath distance vector routing
inferred← citeshttps://doi.org/10.1002/wcm.71openalex-snapshot
Internet connectivity for mobile ad hoc networks
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1830openalex-snapshot
Stabilization of General Loop-Free Routing
inferred← citeshttps://doi.org/10.1007/0-306-47046-2_19openalex-snapshot
Evaluation of the Ad-Hoc Connectivity with the Zone Routing Protocols
inferred← citeshttps://doi.org/10.1007/0-387-22690-7_3openalex-snapshot
Routing in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/0-387-27727-7_10openalex-snapshot
Policy-Based Resource Sharing in Streaming Overlay Networks
inferred← citeshttps://doi.org/10.1007/11576235_38openalex-snapshot
Load Balancing Based on Similarity Multi-paths Routing
inferred← citeshttps://doi.org/10.1007/11802372_24openalex-snapshot
Parameter Evolution for Quality of Service in Multimedia Networking
inferred← citeshttps://doi.org/10.1007/3-540-44843-8_73openalex-snapshot
Distributed Multiple-Path Searching Algorithm for Fault Detection
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_13openalex-snapshot
A Stabilizing Solution to the Stable Path Problem
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_4openalex-snapshot
Stabilization of Routing in Directed Networks
inferred← citeshttps://doi.org/10.1007/3-540-47728-4_65openalex-snapshot
Avoiding Counting to Infinity in Distance Vector Routing
inferred← citeshttps://doi.org/10.1007/978-0-387-35565-8_16openalex-snapshot
Scenario-Driven Design Considerations for MANET Protocols
inferred← citeshttps://doi.org/10.1007/978-1-4613-0223-0_14openalex-snapshot
Hybrid Routing: The Pursuit of an Adaptable and Scalable Routing Framework for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-0373-9_32openalex-snapshot
A Visual Application for Teaching and Learning the Advanced Concepts of the Diffusing Update Algorithm for EIGRP
inferred← citeshttps://doi.org/10.1007/978-3-030-24296-1_8openalex-snapshot
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-030-66471-8_14openalex-snapshot
On the Algebraic Theory of Loop Free Routing
inferred← citeshttps://doi.org/10.1007/978-3-319-07491-7_3openalex-snapshot
Improved Performance of Computer Networks by Embedded Pattern Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-26470-7_4openalex-snapshot
Enhanced Interior Gateway Routing Protocol with IPv4 and IPv6 Support for OMNeT++
inferred← citeshttps://doi.org/10.1007/978-3-319-77510-4_4openalex-snapshot
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-31957-3_8openalex-snapshot
A Fast Path Recovery Mechanism for MPLS Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72990-7_13openalex-snapshot
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_14openalex-snapshot
Stabilization of Loop-Free Redundant Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-00909-9_22openalex-snapshot
Decentralized Real-Time Control Algorithms for an AGV System
inferred← citeshttps://doi.org/10.1007/978-3-642-02742-0_43openalex-snapshot
Unicast QoS Routing in Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_43openalex-snapshot
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
inferred← citeshttps://doi.org/10.1007/978-3-642-12963-6_16openalex-snapshot
Efficient Recovery from False State in Distributed Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_6openalex-snapshot
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_7openalex-snapshot
Loop-Free Super-Stabilizing Spanning Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-21887-3_44openalex-snapshot
A Speed-Up Technique for Distributed Shortest Paths Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-30045-5_17openalex-snapshot
Permutation Routing for Increased Robustness in IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_12openalex-snapshot
Engineering a New Loop-Free Shortest Paths Routing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_11openalex-snapshot
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks
inferred← citeshttps://doi.org/10.1007/bf01193336openalex-snapshot
An efficient routing protocol for wireless networks
inferred← citeshttps://doi.org/10.1007/bf01196259openalex-snapshot
A distributed routing algorithm for mobile wireless networks
inferred← citeshttps://doi.org/10.1007/s00224-015-9608-6openalex-snapshot
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
inferred← citeshttps://doi.org/10.1007/s00224-015-9665-xopenalex-snapshot
Distance Vector-based Advance Reservation with Delay Performance Guarantees
inferred← citeshttps://doi.org/10.1007/s00446-019-00365-zopenalex-snapshot
Preserving stabilization while practically bounding state space using incorruptible partially synchronized clocks
inferred← citeshttps://doi.org/10.1007/s00453-012-9623-9openalex-snapshot
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s11276-010-0271-1openalex-snapshot
Collaborative routing, scheduling and frequency assignment for wireless Ad Hoc networks using spectrum-agile radios
inferred← citeshttps://doi.org/10.1007/s13369-021-05841-yopenalex-snapshot
Cuckoo Energy-Efficient Load-Balancing On-Demand Multipath Routing Protocol
inferred← citeshttps://doi.org/10.1016/b978-0-12-800737-2.00004-1openalex-snapshot
Routing Protocols: Framework and Principles
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.05.014openalex-snapshot
Sensing clouds: A distributed cooperative target tracking with tiny binary noisy sensors
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.01.018openalex-snapshot
Distributed joint channel assignment, routing and scheduling for wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.12.002openalex-snapshot
Distributed flow detection over multi-path sessions
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.01.009openalex-snapshot
Testbed results of an opportunistic routing for multi-robot wireless networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.10.029openalex-snapshot
Testing implementation of FAMTAR: Adaptive multipath routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2024.107966openalex-snapshot
RIPPLE-WiN: An efficient protocol for loop-free multipath routing in wireless networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.01.017openalex-snapshot
Inter-domain routing: Algorithms for QoS guarantees
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.09.022openalex-snapshot
A new approach to on-demand loop-free routing in networks using sequence numbers
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.01.020openalex-snapshot
Loop-free constrained path computation for hop-by-hop QoS routing
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.05.010openalex-snapshot
Routing protocols in ad hoc networks: A survey
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.06.011openalex-snapshot
FIB Aplasia through probabilistic routing and autoforwarding
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.11.004openalex-snapshot
Bounded latency spanning tree reconfiguration
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.12.001openalex-snapshot
A survey on methods to provide multipath transmission in wired packet networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.08.015openalex-snapshot
Non-isotonic routing metrics solvable to optimality via shortest path
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.023openalex-snapshot
Implementing and analyzing in Maude the Enhanced Interior Gateway Routing Protocol
inferred← citeshttps://doi.org/10.1016/j.jnca.2017.09.006openalex-snapshot
A validation model for non-lexical routing protocols
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.01.007openalex-snapshot
A distributed multicast routing algorithm for real-time applications in wide area networks
inferred← citeshttps://doi.org/10.1016/j.procs.2018.04.022openalex-snapshot
On the effectiveness of using network device state information for network path selection
inferred← citeshttps://doi.org/10.1016/j.softx.2021.100929openalex-snapshot
flow-models: A framework for analysis and modeling of IP network flows
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.001openalex-snapshot
A loop-free shortest-path routing algorithm for dynamic networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(00)00276-0openalex-snapshot
Schemes for scheduling control messages by hierarchical protocols
inferred← citeshttps://doi.org/10.1016/s0141-9331(00)00086-7openalex-snapshot
MPATH: a loop-free multipath routing algorithm
inferred← citeshttps://doi.org/10.1023/a:1013858909535openalex-snapshot
Avoiding Counting to Infinity in Distance Vector Routing
inferred← citeshttps://doi.org/10.1023/a:1019105622361openalex-snapshot
A routing architecture for mobile integrated services networks
inferred← citeshttps://doi.org/10.1049/ntw2.12081openalex-snapshot
HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol
inferred← citeshttps://doi.org/10.1055/b-0034-92962openalex-snapshot
References and Recommended Reading
inferred← citeshttps://doi.org/10.1055/b-0034-93007openalex-snapshot
References and Recommended Reading
inferred← citeshttps://doi.org/10.1088/1742-6596/1361/1/012058openalex-snapshot
Preventing Routing Loop in Routing Distance Vector Protocol using Destination Sequence Distance Vector (DS-DV) Method)
inferred← citeshttps://doi.org/10.1093/comjnl/bxv110openalex-snapshot
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property
inferred← citeshttps://doi.org/10.1109/35.809387openalex-snapshot
Issues on loop prevention in MPLS networks
inferred← citeshttps://doi.org/10.1109/49.464710openalex-snapshot
Distributed, scalable routing based on vectors of link states
inferred← citeshttps://doi.org/10.1109/49.564131openalex-snapshot
A protocol for scalable loop-free multicast routing
inferred← citeshttps://doi.org/10.1109/49.779922openalex-snapshot
Determining the optimal configuration for the zone routing protocol
inferred← citeshttps://doi.org/10.1109/90.554729openalex-snapshot
A path-finding algorithm for loop-free routing
inferred← citeshttps://doi.org/10.1109/90.929852openalex-snapshot
Delayed Internet routing convergence
inferred← citeshttps://doi.org/10.1109/90.944341openalex-snapshot
The performance of query control schemes for the zone routing protocol
inferred← citeshttps://doi.org/10.1109/access.2019.2901801openalex-snapshot
Is DNS Ready for Ubiquitous Internet of Things?
inferred← citeshttps://doi.org/10.1109/aict.2010.20openalex-snapshot
Issues of QoS Multipath Routing Protocol for SEN's Data Networks
inferred← citeshttps://doi.org/10.1109/comst.2000.5340719openalex-snapshot
Intra- and inter-domain multicast routing protocols: A survey and taxonomy
inferred← citeshttps://doi.org/10.1109/comst.2015.2460222openalex-snapshot
A Survey on Internet Multipath Routing and Provisioning
inferred← citeshttps://doi.org/10.1109/drcn.2005.1563891openalex-snapshot
Uncertain metrics applied to QoS multipath routing
inferred← citeshttps://doi.org/10.1109/drcn.2009.5340030openalex-snapshot
Folklore of robust network routing
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209925openalex-snapshot
LSRP: local stabilization in shortest path routing
inferred← citeshttps://doi.org/10.1109/fnwf55208.2022.00042openalex-snapshot
BGP-ELF: Enhancing BGP To Eliminate Routing Loops and Oscillations without Path Vectors
inferred← citeshttps://doi.org/10.1109/fnwf55208.2022.00112openalex-snapshot
RIPPLE: Loop-Free Multi-Path Routing with Minimum Blocking during Convergence
inferred← citeshttps://doi.org/10.1109/glocom.1992.276442openalex-snapshot
Reliable broadcast of routing information using diffusing computations
inferred← citeshttps://doi.org/10.1109/glocom.1992.276633openalex-snapshot
LIBRA: a distributed routing algorithm for large internets
inferred← citeshttps://doi.org/10.1109/glocom.1995.502622openalex-snapshot
Dynamics of a loop-free path-finding algorithm
inferred← citeshttps://doi.org/10.1109/glocom.1999.832451openalex-snapshot
A distributed algorithm for multipath computation
inferred← citeshttps://doi.org/10.1109/glocom.2010.5684056openalex-snapshot
Reducing Routing Loops under Dynamic Metrics in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/glocomw.2014.7063439openalex-snapshot
Scaling the number of DNS root servers with Internet
inferred← citeshttps://doi.org/10.1109/glocomw.2018.8644346openalex-snapshot
Towards a Distributed Routing Protocol for In-Band Control Channel with Elastic Controller Clusters
inferred← citeshttps://doi.org/10.1109/icc.1997.595015openalex-snapshot
Hybrid routing in dynamic networks
inferred← citeshttps://doi.org/10.1109/icc.1997.605303openalex-snapshot
Routing in ad-hoc networks using minimum connected dominating sets
inferred← citeshttps://doi.org/10.1109/icc.1998.682608openalex-snapshot
The performance of a new routing protocol for the reconfigurable wireless networks
inferred← citeshttps://doi.org/10.1109/icc.1999.767986openalex-snapshot
A practical approach to minimizing delays in Internet routing
inferred← citeshttps://doi.org/10.1109/icc.2009.5199146openalex-snapshot
Loop-Free Forwarding Table Updates with Minimal Link Overflow
inferred← citeshttps://doi.org/10.1109/icc.2009.5199147openalex-snapshot
Loop-Free Link Stability Metrics for Proactive Routing in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icccn.1995.540115openalex-snapshot
Scalable Internet multicast routing
inferred← citeshttps://doi.org/10.1109/icccn.1999.805568openalex-snapshot
A new approach to on-demand loop-free multipath routing
inferred← citeshttps://doi.org/10.1109/icccn.1999.805570openalex-snapshot
An algorithm for multipath computation using distance-vectors with predecessor information
inferred← citeshttps://doi.org/10.1109/icccn.2000.885549openalex-snapshot
Systematic testing of multicast routing protocols: analysis of forward and backward search techniques
inferred← citeshttps://doi.org/10.1109/icccn.2007.4317933openalex-snapshot
Loop-Free Link-State Routing
inferred← citeshttps://doi.org/10.1109/icccn.2008.ecp.110openalex-snapshot
Collaborative Routing, Scheduling and Frequency Assignment for Wireless Ad Hoc Networks Using Spectrum-Agile Radios
inferred← citeshttps://doi.org/10.1109/icccn65249.2025.11133867openalex-snapshot
Attaining Loop-Free Routing with Coordinated Updates Carrying Minimum Link-State Information
inferred← citeshttps://doi.org/10.1109/iccet.2010.5485743openalex-snapshot
A new survey of routing algorithms in ad hoc networks
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876163openalex-snapshot
Herding packets: Properties needed of metrics for loop-free & best forwarding paths
inferred← citeshttps://doi.org/10.1109/iccr56254.2022.9995972openalex-snapshot
Implementation of EIGRP Using Packet Tracer
inferred← citeshttps://doi.org/10.1109/icdcs.2004.1281603openalex-snapshot
Loop-free routing using a dense label set in wireless networks
inferred← citeshttps://doi.org/10.1109/icdcsw.2014.28openalex-snapshot
Preserving Routes during Fast Convergence
inferred← citeshttps://doi.org/10.1109/iceta.2018.8572112openalex-snapshot
Testing of the Current Open-Source EIGRP Implementations
inferred← citeshttps://doi.org/10.1109/iceta.2018.8572146openalex-snapshot
A Survey of the EIGRP Standard and Following Open-Source Implementations
inferred← citeshttps://doi.org/10.1109/icitcs.2016.7740380openalex-snapshot
Will an Emerging Standard Take Over the Routing Realm? An Evaluative Analysis of DUAL and SPF
inferred← citeshttps://doi.org/10.1109/icn.2008.58openalex-snapshot
RIP-MTI: A New Way to Cope with Routing Loops
inferred← citeshttps://doi.org/10.1109/icnidc.2009.5360975openalex-snapshot
RD: Reducing message overhead in DUAL
inferred← citeshttps://doi.org/10.1109/icnp.1998.723725openalex-snapshot
Scalable link-state Internet routing
inferred← citeshttps://doi.org/10.1109/icnp.2000.896311openalex-snapshot
Convergent multi-path routing
inferred← citeshttps://doi.org/10.1109/icnp59255.2023.10355631openalex-snapshot
Correctness of EIGRP Generalized for Arbitrary Routing Metrics and Policies
inferred← citeshttps://doi.org/10.1109/infcom.1992.263467openalex-snapshot
Distributed routing with labeled distances
inferred← citeshttps://doi.org/10.1109/infcom.1994.337590openalex-snapshot
Area-based, loop-free internet routing
inferred← citeshttps://doi.org/10.1109/infcom.1995.515998openalex-snapshot
A loop-free path-finding algorithm: specification, verification and complexity
inferred← citeshttps://doi.org/10.1109/infcom.1996.493045openalex-snapshot
Congestion-oriented shortest multipath routing
inferred← citeshttps://doi.org/10.1109/infcom.1996.493383openalex-snapshot
An efficient signaling structure for ATM networks
inferred← citeshttps://doi.org/10.1109/infcom.1997.631180openalex-snapshot
A highly adaptive distributed routing algorithm for mobile wireless networks
inferred← citeshttps://doi.org/10.1109/infcom.1998.662958openalex-snapshot
Loop-free multipath routing using generalized diffusing computations
inferred← citeshttps://doi.org/10.1109/infcom.1999.749255openalex-snapshot
Hop-by-hop routing with node-dependent topology information
inferred← citeshttps://doi.org/10.1109/infcom.2001.916261openalex-snapshot
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
inferred← citeshttps://doi.org/10.1109/infcom.2001.916775openalex-snapshot
The impact of Internet policy and topology on delayed routing convergence
inferred← citeshttps://doi.org/10.1109/infcom.2001.916780openalex-snapshot
MDVA: a distance-vector multipath routing protocol
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208678openalex-snapshot
Cooperative packet caching and shortest multipath routing in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208930openalex-snapshot
Improved BGP convergence via ghost flushing
inferred← citeshttps://doi.org/10.1109/infcom.2007.19openalex-snapshot
Disruption Free Topology Reconfiguration in OSPF Networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461987openalex-snapshot
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.200openalex-snapshot
Ad Hoc Routing with Distributed Ordered Sequences
inferred← citeshttps://doi.org/10.1109/infocom.2006.229openalex-snapshot
On Count-to-Infinity Induced Forwarding Loops Ethernet Networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.53openalex-snapshot
Tunnel Vector: A New Routing Algorithm with Scalability
inferred← citeshttps://doi.org/10.1109/ipccc59868.2024.10850473openalex-snapshot
Spreading Computations for Loop-Free Multipath Routing in Computer Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470435openalex-snapshot
Distributed advance network reservation with delay guarantees
inferred← citeshttps://doi.org/10.1109/ipom.2002.1045773openalex-snapshot
Estimating the performance of a large enterprise network for the updating of routing information
inferred← citeshttps://doi.org/10.1109/iscc.1998.702600openalex-snapshot
A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358402openalex-snapshot
Achieving loop-free incremental routing in ad hoc networks
inferred← citeshttps://doi.org/10.1109/iscc.2014.6912454openalex-snapshot
Loop detection and automated route aggregation in distance vector routing
inferred← citeshttps://doi.org/10.1109/isncc66965.2025.11250471openalex-snapshot
Distance-Based Loop-Free Routing with Positive and Negative Link Weights
inferred← citeshttps://doi.org/10.1109/iwqos54832.2022.9812900openalex-snapshot
QoS Routing Using Dominant-Distance Vectors
inferred← citeshttps://doi.org/10.1109/jsac.2004.836002openalex-snapshot
Improved BGP Convergence via Ghost Flushing
inferred← citeshttps://doi.org/10.1109/lanman54755.2022.9820398openalex-snapshot
THORP: Choosing Ordered Neighbors To Attain Efficient Loop-Free Minimum-Hop Routing
inferred← citeshttps://doi.org/10.1109/lcn.2006.322096openalex-snapshot
An Interior Path Vector Routing Protocol
inferred← citeshttps://doi.org/10.1109/lcn53696.2022.9843624openalex-snapshot
Safe, Fast, and Cycle-Free Multi-Path Routing Using Vouchers
inferred← citeshttps://doi.org/10.1109/lcn53696.2022.9843706openalex-snapshot
Eliminating Routing Loops and Oscillations in BGP Using Total Ordering
inferred← citeshttps://doi.org/10.1109/lnet.2019.2913951openalex-snapshot
Fundamental Differences Among Vectoring Routing Protocols on Non-Isotonic Metrics
inferred← citeshttps://doi.org/10.1109/mahss.2004.1392170openalex-snapshot
Shortest Multipath Routing using Labeled Distances
inferred← citeshttps://doi.org/10.1109/mec.2013.6885131openalex-snapshot
Route information piggybacking in multihop wireless networks
inferred← citeshttps://doi.org/10.1109/milcom.1997.646766openalex-snapshot
A more efficient distance vector routing algorithm
inferred← citeshttps://doi.org/10.1109/milcom55135.2022.10017739openalex-snapshot
SCRIP: Safe and Cycle-Free Multi-Path Routing
inferred← citeshttps://doi.org/10.1109/mnet.2005.1541718openalex-snapshot
An overview of solutions to avoid persistent BPG divergence
inferred← citeshttps://doi.org/10.1109/nctm.2017.7872855openalex-snapshot
Effective use of network device state information for network path selection
inferred← citeshttps://doi.org/10.1109/nof66640.2025.11223326openalex-snapshot
Using Path Identifiers for Efficient Loop-Free Routing in Computer Networks
inferred← citeshttps://doi.org/10.1109/noms.2004.1317643openalex-snapshot
Patterns for routing and self-stabilization
inferred← citeshttps://doi.org/10.1109/pads.2004.1301298openalex-snapshot
Space-parallel network simulations using ghosts
inferred← citeshttps://doi.org/10.1109/pads.2005.28openalex-snapshot
Simulating Realistic Packet Routing without Routing Protocols
inferred← citeshttps://doi.org/10.1109/pccc.1992.200568openalex-snapshot
Steady-state response of shortest-path routing algorithms
inferred← citeshttps://doi.org/10.1109/pccc.1999.749462openalex-snapshot
A hierarchical routing protocol for large scale ad hoc network
inferred← citeshttps://doi.org/10.1109/pdcat.2009.75openalex-snapshot
Stabilization of Maximal-Metric Routing without Knowledge of Network Size
inferred← citeshttps://doi.org/10.1109/sahcn.2004.1381946openalex-snapshot
NASCENT: network layer service for vicinity ad-hoc groups
inferred← citeshttps://doi.org/10.1109/tc.2012.36openalex-snapshot
Least-Latency Routing over Time-Dependent Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2002.801397openalex-snapshot
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
inferred← citeshttps://doi.org/10.1109/tnet.2006.876179openalex-snapshot
LSRP: local stabilization in shortest path routing
inferred← citeshttps://doi.org/10.1109/tnet.2008.920874openalex-snapshot
Understanding and Mitigating the Effects of Count to Infinity in Ethernet Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2025374openalex-snapshot
Always Acyclic Distributed Path Computation
inferred← citeshttps://doi.org/10.1109/tnet.2016.2642586openalex-snapshot
Safe Update of Hybrid SDN Networks
inferred← citeshttps://doi.org/10.1109/tro.2018.2883829openalex-snapshot
Path Planning for Minimizing the Expected Cost Until Success
inferred← citeshttps://doi.org/10.1109/wcnc.2011.5779266openalex-snapshot
An interest-driven approach for unicast routing in MANETs with labeled paths and proactive path maintenance
inferred← citeshttps://doi.org/10.1109/wicom.2009.5302468openalex-snapshot
A More Efficient Diffusing Update Algorithm For Loop-Free Routing
inferred← citeshttps://doi.org/10.1109/wimob.2009.31openalex-snapshot
A Genetic-Based QoS Aware Routing for Ubiquitous Sensor Networks
inferred← citeshttps://doi.org/10.1109/wimob50308.2020.9253404openalex-snapshot
Robustness and Scalability Improvements for Distance Vector Routing in Large WMNs
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2006.00543.xopenalex-snapshot
On the Internet routing protocol Enhanced Interior Gateway Routing Protocol: is it optimal?
inferred← citeshttps://doi.org/10.1145/1013329.1013357openalex-snapshot
Space-parallel network simulations using ghosts
inferred← citeshttps://doi.org/10.1145/1185373.1185420openalex-snapshot
A distributed approach for multi-constrained path selection and routing optimization
inferred← citeshttps://doi.org/10.1145/1282380.1282408openalex-snapshot
Achieving convergence-free routing using failure-carrying packets
inferred← citeshttps://doi.org/10.1145/1282427.1282408openalex-snapshot
Achieving convergence-free routing using failure-carrying packets
inferred← citeshttps://doi.org/10.1145/1384609.1384616openalex-snapshot
Message-efficient dissemination for loop-free centralized routing
inferred← citeshttps://doi.org/10.1145/1391289.1391292openalex-snapshot
Optimal maintenance of a spanning tree
inferred← citeshttps://doi.org/10.1145/190809.190327openalex-snapshot
Distributed, scalable routing based on link-state vectors
inferred← citeshttps://doi.org/10.1145/2079296.2079303openalex-snapshot
On the interaction of multiple routing algorithms
inferred← citeshttps://doi.org/10.1145/215530.215560openalex-snapshot
A routing protocol for packet radio networks
inferred← citeshttps://doi.org/10.1145/263876.263885openalex-snapshot
A cluster-based approach for routing in dynamic networks
showing the first 200 of 265 · page through all 265
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.