On the public citation graph
Dynamic behavior of shortest path routing algorithms for communication networks
0 signed · 121 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.1049/ep.1965.0014openalex-snapshot
Theory and Application of the Z-Transform Method
inferredcites →https://doi.org/10.1109/cdc.1979.270147openalex-snapshot
Dynamic models of shortest path routing algorithms for communication networks with multiple destinations
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1109/tcom.1978.1094040openalex-snapshot
A Review of the Development and Performance of the ARPANET Routing Algorithm
inferredcites →https://doi.org/10.1109/tcom.1980.1094721openalex-snapshot
The New Routing Algorithm for the ARPANET
inferredcites →https://doi.org/10.21236/ada086338openalex-snapshot
ARPANET Routing Algorithm Improvements
inferredcites →https://doi.org/10.21236/ada097623openalex-snapshot
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.3170181openalex-extracted
Optimization of Routing in Smart Grids Using Intelligent Techniques
inferred← citeshttps://doi.org/10.1002/0470099747openalex-snapshot
Network Security: Current Status and Future Directions
inferred← citeshttps://doi.org/10.1002/1520-6424(200102)84:2<51::aid-ecja6>3.0.co;2-#openalex-snapshot
Lock‐free AntNets and their adaptability evaluations
inferred← citeshttps://doi.org/10.1002/dac.551openalex-snapshot
Multi‐hour design of survivable classical IP networks
inferred← citeshttps://doi.org/10.1002/net.21617openalex-snapshot
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures
inferred← citeshttps://doi.org/10.1007/978-1-4612-4904-7_13openalex-snapshot
The Routing Problem in Computer Networks
inferred← citeshttps://doi.org/10.1007/978-1-4899-0574-1_31openalex-snapshot
A Second bibliography on semi-Markov processes
inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_16openalex-snapshot
A Hierarchical Routing Method for Load-Balancing
inferred← citeshttps://doi.org/10.1007/978-3-642-30376-0_7openalex-snapshot
Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds
inferred← citeshttps://doi.org/10.1007/bf00940712openalex-snapshot
Effect of model uncertainty on some optimal routing problems
inferred← citeshttps://doi.org/10.1007/bf02073596openalex-snapshot
The (Δ,d, d′, Δ − 1)-problem with applications to computer networks
inferred← citeshttps://doi.org/10.1007/bfb0044418openalex-snapshot
Optimal routing and flow control methods for communication networks
inferred← citeshttps://doi.org/10.1007/s00199-005-0646-1openalex-snapshot
Topologies of social interactions
inferred← citeshttps://doi.org/10.1007/s11107-006-0016-3openalex-snapshot
Multi-tiered service survivability in next-generation SONET/SDH networks
inferred← citeshttps://doi.org/10.1016/0169-7552(92)90087-7openalex-snapshot
Single path routing with delay considerations
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.asoc.2025.113933openalex-snapshot
Optimizing supply routes in a network interdiction model with dual defense operations
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.02.018openalex-snapshot
Traffic splitting in a network: split traffic models and applications
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.comnet.2005.01.008openalex-snapshot
An analytic modelling approach for network routing algorithms that use “ant-like” mobile agents
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.03.005openalex-snapshot
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2013.09.008openalex-snapshot
Vehicular communication ad hoc routing protocols: A survey
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/s0898-1221(98)00176-xopenalex-snapshot
The average diameter of general tree structures
inferred← citeshttps://doi.org/10.1016/s1389-1286(99)00108-5openalex-snapshot
Persistent route oscillations in inter-domain routing
inferred← citeshttps://doi.org/10.1023/a:1008259508579openalex-snapshot
First and Second Derivative Estimators for Closed Jackson-Like Queueing Networks Using Perturbation Analysis Techniques
inferred← citeshttps://doi.org/10.1023/a:1019105622361openalex-snapshot
A routing architecture for mobile integrated services networks
inferred← citeshttps://doi.org/10.1049/cmu2.12253openalex-snapshot
A novel dynamic dual‐path routing for end‐to‐end communication security in wide area networks
inferred← citeshttps://doi.org/10.1088/1742-6596/1940/1/012017openalex-snapshot
Robust Counterpart Open-Capacitated Vehicle Routing Problem with Time Windows and Deadline (RCOCVRPTWD) Model in Optimization of Waste Transportation in Subdistrict Kalidoni, Palembang Using LINGO 13.0
inferred← citeshttps://doi.org/10.1097/00000539-200009000-00023openalex-snapshot
Enterprise-Wide Patient Scheduling Information Systems to Coordinate Surgical Clinic and Operating Room Scheduling Can Impair Operating Room Efficiency
inferred← citeshttps://doi.org/10.1103/dq2j-z8k6openalex-snapshot
Geometric organization and inference of shortest path nodes in soft random geometric graphs
inferred← citeshttps://doi.org/10.1109/12.55688openalex-snapshot
On job assignment for a parallel system of processor sharing queues
inferred← citeshttps://doi.org/10.1109/26.31191openalex-snapshot
Optimal dynamic routing in double ring networks
inferred← citeshttps://doi.org/10.1109/49.414637openalex-snapshot
Fundamental design issues for the future Internet
inferred← citeshttps://doi.org/10.1109/49.464712openalex-snapshot
Type-of-service routing in datagram delivery systems
inferred← citeshttps://doi.org/10.1109/9.533674openalex-snapshot
First- and second-derivative estimators for cyclic closed-queueing networks
inferred← citeshttps://doi.org/10.1109/90.649468openalex-snapshot
Iterative approach to optimizing convergence routing priorities
inferred← citeshttps://doi.org/10.1109/access.2020.3025432openalex-snapshot
QR-SDN: Towards Reinforcement Learning States, Actions, and Rewards for Direct Flow Routing in Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/apcc.1999.820465openalex-snapshot
A multipath multicast routing algorithm
inferred← citeshttps://doi.org/10.1109/ccece.2005.1556918openalex-snapshot
The adoption of dynamic weight mapping function in adaptive routing
inferred← citeshttps://doi.org/10.1109/cdc.1993.325059openalex-snapshot
First and second derivative estimators for closed Jackson-like queueing networks using perturbation analysis techniques
inferred← citeshttps://doi.org/10.1109/cdc.1996.573667openalex-snapshot
A fluid model of shortest queue routing: delayed feedback and inherent periodicity
inferred← citeshttps://doi.org/10.1109/csa.2008.34openalex-snapshot
NPASA: A Noble Path Selection Algorithm
inferred← citeshttps://doi.org/10.1109/digcom.1992.211653openalex-snapshot
Crises in network evolution: three case studies and one proposed solution
inferred← citeshttps://doi.org/10.1109/ecumn.2000.880730openalex-snapshot
Adaptive routing and load balancing of ephemeral connections
inferred← citeshttps://doi.org/10.1109/glocom.1990.116531openalex-snapshot
Performance comparison of routing algorithms in packet switched networks
inferred← citeshttps://doi.org/10.1109/hicss.1992.183208openalex-snapshot
Controlled job migration in load balanced distributed systems
inferred← citeshttps://doi.org/10.1109/icact.2014.6779101openalex-snapshot
Channel load aware routing in wireless mesh 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.2005.1494349openalex-snapshot
Dynamics of load-sensitive adaptive routing
inferred← citeshttps://doi.org/10.1109/icc.2006.254883openalex-snapshot
TCP/IP Interaction Based on Congestion Price: Stability and Optimality
inferred← citeshttps://doi.org/10.1109/icccn.1999.805578openalex-snapshot
Hierarchical load-balanced routing via bounded randomization
inferred← citeshttps://doi.org/10.1109/icfin.2009.5339589openalex-snapshot
A distributed routing algorithm based on available multi-nexthop in IP networks
inferred← citeshttps://doi.org/10.1109/icsmc.1998.726708openalex-snapshot
Q-learning for adaptive load based routing
inferred← citeshttps://doi.org/10.1109/infcom.1989.101521openalex-snapshot
Load sharing in heterogeneous queueing systems
inferred← citeshttps://doi.org/10.1109/infcom.1993.253263openalex-snapshot
Shortest path cost distribution in random graphs with positive integer edge costs
inferred← citeshttps://doi.org/10.1109/infcom.1993.253311openalex-snapshot
Stability of a class of dynamic routing protocols (IGRP)
inferred← citeshttps://doi.org/10.1109/infcom.1994.337551openalex-snapshot
Type-of-service routing in dynamic datagram networks
inferred← citeshttps://doi.org/10.1109/infcom.1996.493045openalex-snapshot
Congestion-oriented shortest multipath routing
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209226openalex-snapshot
Can shortest-path routing and TCP maximize utility
inferred← citeshttps://doi.org/10.1109/infcom.2007.56openalex-snapshot
Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461925openalex-snapshot
Demand-Oblivious Routing: Distributed vs. Centralized Approaches
inferred← citeshttps://doi.org/10.1109/isa.2008.14openalex-snapshot
A Contemporary Technique to Guarantee Quality of Service (QoS) for Heterogeneous Data Traffic
inferred← citeshttps://doi.org/10.1109/iscc.2000.860697openalex-snapshot
Load-balanced anycast routing in computer networks
inferred← citeshttps://doi.org/10.1109/itsc58415.2024.10919707openalex-snapshot
DRBO - A Simulator Calibration Framework Based on Day-to-Day Dynamic Routing and Bayesian Optimization
inferred← citeshttps://doi.org/10.1109/jproc.2006.887322openalex-snapshot
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
inferred← citeshttps://doi.org/10.1109/jsac.2007.070602openalex-snapshot
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing
inferred← citeshttps://doi.org/10.1109/jsyst.2013.2247175openalex-snapshot
Synchronization-Dependence of Path Switching in an Autonomous Flow Network
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2439679openalex-snapshot
Loop Resolution Mechanism for Flow-Aware Multi-Topology Adaptive Routing
inferred← citeshttps://doi.org/10.1109/mascot.1994.284442openalex-snapshot
On the interaction between gateway scheduling and routing
inferred← citeshttps://doi.org/10.1109/milcom.1989.103929openalex-snapshot
Performance of the revised routing metric in the ARPANET and MILNET
inferred← citeshttps://doi.org/10.1109/milcom.1991.258195openalex-snapshot
Performance of packet switched radio networks using combined parameter routing metrics
inferred← citeshttps://doi.org/10.1109/milcom.2005.1605885openalex-snapshot
Cross-Layer Protocols for Energy-Efficient Wireless Sensor Networking
inferred← citeshttps://doi.org/10.1109/mnet.2008.4476066openalex-snapshot
Toward internet-wide multipath routing
inferred← citeshttps://doi.org/10.1109/nca.2001.962525openalex-snapshot
Optimal utilization of equivalent paths in computer networks with static routing
inferred← citeshttps://doi.org/10.1109/pacrim.1993.407301openalex-snapshot
A new method for network routing:a preliminary report
inferred← citeshttps://doi.org/10.1109/pimrc.2006.254165openalex-snapshot
Adaptive Routing in Wireless Multi-Hop Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2012.090512.100570openalex-snapshot
The Shortest Path Problem on a Fuzzy Time-Dependent Network
inferred← citeshttps://doi.org/10.1109/tit.1987.1057274openalex-snapshot
Asymptotic optimality of shortest path routing algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2005.850219openalex-snapshot
Cross-layer optimization in TCP/IP networks
inferred← citeshttps://doi.org/10.1109/tnet.2018.2832020openalex-snapshot
Oblivious Routing in IP Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2016.2549698openalex-snapshot
Self-Tuning Service Provisioning for Decentralized Cloud Applications
inferred← citeshttps://doi.org/10.1109/wcnc.2019.8885550openalex-snapshot
Service-Aware Virtual Network Function placement in Software Defined Networks
inferred← citeshttps://doi.org/10.1142/s0129183117501406openalex-snapshot
Limited static and dynamic delivering capacity allocations in scale-free networks
inferred← citeshttps://doi.org/10.1145/133057.133103openalex-snapshot
Performance comparison of routing protocols using MaRS
inferred← citeshttps://doi.org/10.1145/141800.141805openalex-snapshot
Analysis of shortest-path routing algorithms in a dynamic network environment
inferred← citeshttps://doi.org/10.1145/149439.133103openalex-snapshot
Performance comparison of routing protocols using MaRS
inferred← citeshttps://doi.org/10.1145/238020.238052openalex-snapshot
Two performance tool design issues and CHITRA's solutions
inferred← citeshttps://doi.org/10.1145/263932.264024openalex-snapshot
Adaptive feedback compensation for distributed load-based routing systems in datagram packet-switched communications networks
inferred← citeshttps://doi.org/10.1145/269790.269796openalex-snapshot
Analysis methodology for simulation of distributed adaptive routing systems
inferred← citeshttps://doi.org/10.1145/2999572.2999585openalex-snapshot
Lying Your Way to Better Traffic Engineering
inferred← citeshttps://doi.org/10.1145/316188.316227openalex-snapshot
A simple approximation to minimum-delay routing
inferred← citeshttps://doi.org/10.1145/316194.316227openalex-snapshot
A simple approximation to minimum-delay routing
inferred← citeshttps://doi.org/10.1145/331697.331707openalex-snapshot
The average diameter of binary tree structures
inferred← citeshttps://doi.org/10.1145/75246.75252openalex-snapshot
The revised ARPANET routing metric
inferred← citeshttps://doi.org/10.1145/75247.75252openalex-snapshot
The revised ARPANET routing metric
inferred← citeshttps://doi.org/10.1145/99508.99548openalex-snapshot
Shortest path first with emergency exits
inferred← citeshttps://doi.org/10.1145/99517.99548openalex-snapshot
Shortest path first with emergency exits
inferred← citeshttps://doi.org/10.14288/1.0091004openalex-snapshot
Load-sensitive adaptive routing (LSAR) for computer networks
inferred← citeshttps://doi.org/10.17487/rfc2386openalex-snapshot
A Framework for QoS-based Routing in the Internet
inferred← citeshttps://doi.org/10.21236/ada459412openalex-snapshot
A Practical Framework for Minimum-Delay Routing in Computer Networks
inferred← citeshttps://doi.org/10.2172/551971openalex-snapshot
Measurements and analysis of end-to-end Internet dynamics
inferred← citeshttps://doi.org/10.23919/icact53585.2022.9728809openalex-snapshot
On the Stability of Load Adaptive Routing Over Wireless Community Mesh and Sensor Networks
inferred← citeshttps://doi.org/10.23919/ifipnetworking52078.2021.9472832openalex-snapshot
Boundaries of Flow Table Usage Reduction Algorithms Based on Elephant Flow Detection
inferred← citeshttps://doi.org/10.3390/app11209408openalex-snapshot
On the Competitiveness of Oblivious Routing: A Statistical View
inferred← citeshttps://doi.org/10.3390/smartcities8020049openalex-snapshot
DRBO—A Regional Scale Simulator Calibration Framework Based on Day-to-Day Dynamic Routing and Bayesian Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02728openalex-snapshot
Lying Your Way to Better Traffic Engineering
inferred← citeshttps://doi.org/10.5555/1345263.1345292openalex-snapshot
Decentralized control of large-scale networks as a game with local interactions: cross-layer TCP/IP optimization
inferred← citeshttps://doi.org/10.7907/4dq0-ga49.openalex-snapshot
A theoretical study of internet congestion control: equilibrium and dynamics
inferred← citeshttps://doi.org/10.9734/bjmcs/2016/27033openalex-snapshot
Solving Network Routing Problem Using Artificial Intelligent Techniques
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.