On the public citation graph
A delay-constrained least-cost path routing protocol and the synthesis method
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.
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.1109/12.88466openalex-snapshot
Synthesis of communication protocols: survey and assessment
inferredcites →https://doi.org/10.1109/35.592102openalex-snapshot
RSVP and integrated services in the Internet: a tutorial
inferredcites →https://doi.org/10.1109/glocom.1996.586131openalex-snapshot
A better model for generating test networks
inferredcites →https://doi.org/10.1109/iceccs.1997.622301openalex-snapshot
A synthesis method for fault-tolerant and flexible multipath routing protocols
inferredcites →https://doi.org/10.1109/icnp.1994.344365openalex-snapshot
On the construction of multiphase communication protocols
inferredcites →https://doi.org/10.17487/rfc2205openalex-snapshot
Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification
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-3-031-24866-5_29openalex-snapshot
Constrained Shortest Path and Hierarchical Structures
inferred← citeshttps://doi.org/10.1007/s12083-021-01185-4openalex-snapshot
A deep learning-based constrained intelligent routing method
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.07.016openalex-snapshot
An efficient quality of service routing algorithm for delay-sensitive applications
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00358-9openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
inferred← citeshttps://doi.org/10.1016/s1389-1286(00)00209-7openalex-snapshot
A randomized algorithm for finding a path subject to multiple QoS requirements
inferred← citeshttps://doi.org/10.1109/comst.2017.2749760openalex-snapshot
Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation
inferred← citeshttps://doi.org/10.1109/infcom.2001.916274openalex-snapshot
Multi-constrained optimal path selection
inferred← citeshttps://doi.org/10.1109/infcom.2001.916277openalex-snapshot
Lagrange relaxation based method for the QoS routing problem
inferred← citeshttps://doi.org/10.1109/tmm.2003.811627openalex-snapshot
Routing multimedia traffic with qos guarantees
inferred← citeshttps://doi.org/10.1145/339331.339427openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
inferred← citeshttps://doi.org/10.3182/20071107-3-fr-3907.00003openalex-snapshot
CENTRALIZED CONTROL OF WIRELESS SENSOR NETWORKS FOR REAL-TIME APPLICATIONS
inferred← citeshttps://doi.org/10.48550/arxiv.1903.00436openalex-snapshot
Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines
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.