On the public citation graph
Adaptive quality of service‐based routing approaches: development of neuro‐dynamic state‐dependent reinforcement learning algorithms
0 signed · 30 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/nem.470openalex-snapshot
Resource allocation in the new fixed and mobile Internet generation
inferredcites →https://doi.org/10.1007/978-1-4613-0251-3_23openalex-snapshot
Optimal Solution of Integer Multicommodity Flow Problems With Application in Optical Networks
inferredcites →https://doi.org/10.1007/978-1-4615-0519-8openalex-snapshot
Scalable Performance Signalling and Congestion Avoidance
inferredcites →https://doi.org/10.1007/978-3-540-25969-5_32openalex-snapshot
Neural Net Based Approach for Adaptive Routing Policy in Telecommunication Networks
inferredcites →https://doi.org/10.1007/978-3-540-31957-3_25openalex-snapshot
Quality of Service Routing Network and Performance Evaluation
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/jsac.2003.818782openalex-snapshot
QRON: QoS-Aware Routing in Overlay Networks
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferredcites →https://doi.org/10.7551/mitpress/1290.001.0001openalex-snapshot
Ant Colony Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.2814openalex-snapshot
Delay constraint multipath routing for wireless multimedia ad hoc networks
inferred← citeshttps://doi.org/10.1007/978-3-319-46687-3_46openalex-snapshot
Joint Routing and Bitrate Adjustment for DASH Video via Neuro-Dynamic Programming in SDN
inferred← citeshttps://doi.org/10.1007/s11235-009-9184-7openalex-snapshot
State-dependent packet scheduling for QoS routing in a dynamically changing environment
inferred← citeshttps://doi.org/10.1007/s12243-012-0309-8openalex-snapshot
Swarm intelligence routing approach in networked robots
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.03.010openalex-snapshot
Reinforcing probabilistic selective Quality of Service routes in dynamic irregular networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.05.002openalex-snapshot
Design and performance analysis of an inductive QoS routing algorithm
inferred← citeshttps://doi.org/10.1109/glocom.2010.5684253openalex-snapshot
Inductive Routing System Based on QoS Bandwidth Optimization
inferred← citeshttps://doi.org/10.1109/icc.2008.581openalex-snapshot
Inductive QoS Packet Scheduling for Adaptive Dynamic Networks
inferred← citeshttps://doi.org/10.1109/icc.2009.5199379openalex-snapshot
QoS Swarm State Dependent Routing for Irregular Traffic in Telecommunication Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.108openalex-snapshot
Factoring IPv6 Device Mobility and Ad-hoc Interactions into the Service Location Protocol
inferred← citeshttps://doi.org/10.1109/lcn.2007.154openalex-snapshot
N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.70openalex-snapshot
Cluster-based Forwarding in Delay Tolerant Public Transport Networks
inferred← citeshttps://doi.org/10.1109/tmm.2016.2629280openalex-snapshot
Joint Admission Control and Routing Via Approximate Dynamic Programming for Streaming Video Over Software-Defined Networking
inferred← citeshttps://doi.org/10.1145/1298091.1298115openalex-snapshot
Reinforcement learning in multi-agent environment and ant colony for packet scheduling in routers
inferred← citeshttps://doi.org/10.5772/5289openalex-snapshot
Inductive Approaches Based on Trial/Error Paradigm for Communications Network
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.