On the public citation graph
Markov decision algorithms for dynamic routing (telephone networks)
0 signed · 37 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/j.1538-7305.1966.tb01703.xopenalex-snapshot
Programming and Control Problems Arising from Optimal Routing in Telephone Networks*
inferredcites →https://doi.org/10.1002/j.1538-7305.1981.tb00297.xopenalex-snapshot
Design and Optimization of Networks With Dynamic Routing
inferredcites →https://doi.org/10.1016/0169-7552(86)90035-8openalex-snapshot
Analysis and control of traffic routing in circuit-switched networks
inferredcites →https://doi.org/10.1093/imamci/7.1.77openalex-snapshot
Dynamic Routing in Fully Connected Networks
inferredcites →https://doi.org/10.1109/cdc.1986.267437openalex-snapshot
State-dependent routing for telephone traffic: Theory and results
inferredcites →https://doi.org/10.2307/2004252openalex-snapshot
Dynamic Programming and Markov Processes.
inferredcites →https://doi.org/10.2307/2282268openalex-snapshot
Dynamic Programming and Markov Processes.
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-0-387-34987-9_25openalex-snapshot
Window based estimation of the intensity of a doubly stochastic Poisson process
inferred← citeshttps://doi.org/10.1007/978-1-4615-2734-3_18openalex-snapshot
A Neurocomputing Approach to Optimizing the Performance of a Satellite Communication Network
inferred← citeshttps://doi.org/10.1007/978-3-540-30573-6_24openalex-snapshot
Optimal Load Balancing in Insensitive Data Networks
inferred← citeshttps://doi.org/10.1007/978-3-7091-7533-0_47openalex-snapshot
Performance Evaluation of Neural Networks Applied to Queueing Allocation Problem
inferred← citeshttps://doi.org/10.1007/bf02139532openalex-snapshot
On computing Markov decision theory-based cost for routing in circuit-switched broadband networks
inferred← citeshttps://doi.org/10.1016/0140-3664(95)94377-nopenalex-snapshot
Computational analysis of an optimal routing strategy in a hierarchical computer communication network
inferred← citeshttps://doi.org/10.1016/0925-2312(95)00040-dopenalex-snapshot
The performance evaluation of a new neural network-based traffic management scheme for a satellite communication network
inferred← citeshttps://doi.org/10.1016/j.osn.2016.10.001openalex-snapshot
Adaptive routing and spectrum allocation in elastic optical networks
inferred← citeshttps://doi.org/10.1016/j.peva.2011.07.011openalex-snapshot
M/M/1-PS queue and size-aware task assignment
inferred← citeshttps://doi.org/10.1016/j.peva.2013.08.018openalex-snapshot
Lookahead actions in dispatching to parallel queues
inferred← citeshttps://doi.org/10.1023/a:1017924227920openalex-snapshot
Reinforcement Learning for Call Admission Control and Routing under Quality of Service Constraints in Multimedia Networks
inferred← citeshttps://doi.org/10.1109/3468.983417openalex-snapshot
Simulation-based policy generation using large-scale Markov decision processes
inferred← citeshttps://doi.org/10.1109/49.824799openalex-snapshot
Adaptive call admission control under quality of service constraints: a reinforcement learning solution
inferred← citeshttps://doi.org/10.1109/glocom.1991.188366openalex-snapshot
The performance evaluation of a new neural network based traffic management scheme for a satellite communication network
inferred← citeshttps://doi.org/10.1109/icbc.1996.887802openalex-snapshot
Window based estimation of the intensity of a doubly stochastic poisson process
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876249openalex-snapshot
Analyzing the relative cost concept in elastic optical networks
inferred← citeshttps://doi.org/10.1109/icme.2004.1394604openalex-snapshot
Resource allocation and adaptive routing in multimedia low Earth orbit satellite mobile networks
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725111openalex-snapshot
An application of simulation for large-scale Markov decision processes to a problem in telephone network routing
inferred← citeshttps://doi.org/10.1109/infcom.1995.515887openalex-snapshot
Least cost routing in multi-service networks. II
inferred← citeshttps://doi.org/10.1109/infcom.1995.515925openalex-snapshot
LLR routing in homogeneous VP-based ATM networks
inferred← citeshttps://doi.org/10.1109/infcom.1996.493385openalex-snapshot
A management system for load balancing through adaptive routing in multi-service ATM networks
inferred← citeshttps://doi.org/10.1109/itc3249928.2020.00023openalex-snapshot
Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs
inferred← citeshttps://doi.org/10.1109/mcom.2002.1007410openalex-snapshot
A localized adaptive proportioning approach to QoS routing
inferred← citeshttps://doi.org/10.1109/milcom64451.2025.11310633openalex-snapshot
Threat-aware Aerial Network Control
inferred← citeshttps://doi.org/10.1109/pccc.2011.6108077openalex-snapshot
Energy-aware dispatching in parallel queues with on-off energy consumption
inferred← citeshttps://doi.org/10.1109/tccn.2021.3136221openalex-snapshot
Intelligent Joint Network Slicing and Routing via GCN-Powered Multi-Task Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/wsc.1999.823135openalex-snapshot
SMG: a new simulation/optimization approach for large-scale problems
inferred← citeshttps://doi.org/10.1364/jocn.379585openalex-snapshot
Relative cost routing and spectrum allocation in elastic optical networks
inferred← citeshttps://doi.org/10.18576/isl/120830openalex-snapshot
Finding the Optimal Shortest Path in Stochastic Networks Using the Markov Decision Process (MDP)
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.