On the public citation graph

On computing Markov decision theory-based cost for routing in circuit-switched broadband networks

0 signed · 19 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.
Claim with ORCID
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.
See reference health

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.1974.tb02756.xopenalex-snapshot
Some Properties of the Erlang Loss Function
inferredcites →https://doi.org/10.1016/0305-0548(93)90046-lopenalex-snapshot
An introduction to queueing theory
inferredcites →https://doi.org/10.1057/jors.1982.147openalex-snapshot
Introduction to Queueing Theory
inferredcites →https://doi.org/10.1109/26.31166openalex-snapshot
The stochastic knapsack problem
inferredcites →https://doi.org/10.1109/26.35373openalex-snapshot
Optimal circuit access policies in an ISDN environment: a Markov decision approach
inferredcites →https://doi.org/10.1109/35.60368openalex-snapshot
Markov decision algorithms for dynamic routing (telephone networks)
inferredcites →https://doi.org/10.1109/infcom.1994.337534openalex-snapshot
Least cost routing in multiple-service networks
inferredcites →https://doi.org/10.1111/j.2517-6161.1988.tb01711.xopenalex-snapshot
Control of Stochastic Loss Networks, with Applications
inferredcites →https://doi.org/10.2307/2008519openalex-snapshot
An Introduction to Numerical Analysis

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-35522-1_13openalex-snapshot
Dynamic Programming Based Link Cost Function and Load Estimation Method for ATM Links
inferred← citeshttps://doi.org/10.1007/978-1-4471-5022-0_5openalex-snapshot
On-Line Control Methods via Simulation
inferred← citeshttps://doi.org/10.1016/s0022-247x(03)00506-7openalex-snapshot
Approximate receding horizon approach for Markov decision processes: average reward case
inferred← citeshttps://doi.org/10.1023/a:1009495023964openalex-snapshot
Multi-Service Dynamic QoS Routing Schemes with Call Admission Control: A Comparative Study
inferred← citeshttps://doi.org/10.1109/cca.1999.801212openalex-snapshot
Towards efficient call admission control for state-dependent routing in multirate networks
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184710openalex-snapshot
Receding horizon approach to Markov games for infinite horizon discounted cost
inferred← citeshttps://doi.org/10.1109/cdc.2003.1272486openalex-snapshot
A distributed algorithm for solving a class of multi-agent Markov decision problems
inferred← citeshttps://doi.org/10.1109/hpsr.2000.856655openalex-snapshot
Simulation study of dynamic cost-based routing in PNNI networks
inferred← citeshttps://doi.org/10.1109/ngi.2005.1431666openalex-snapshot
State-dependent optimal routing in MPLS-based IP networks with heterogeneous flow holding times
inferred← citeshttps://doi.org/10.20381/ruor-19810openalex-snapshot
Protection and routing over Agile All-Photonic Networks (AAPN)
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.