On the public citation graph

A route pre-computation algorithm for integrated services networks

0 signed · 42 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/net.3230100403openalex-snapshot
A dual algorithm for the constrained shortest path problem
inferredcites →https://doi.org/10.1002/net.3230140109openalex-snapshot
Algorithms for finding paths with multiple constraints
inferredcites →https://doi.org/10.1006/jagm.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferredcites →https://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-247x(66)90020-5openalex-snapshot
The shortest route problem with constraints
inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferredcites →https://doi.org/10.1057/jors.1976.202openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.1109/35.56239openalex-snapshot
Signaling System No.7: a tutorial
inferredcites →https://doi.org/10.1109/35.99262openalex-snapshot
Bandwidth management and congestion control in plaNET
inferredcites →https://doi.org/10.1109/65.238150openalex-snapshot
RSVP: a new resource ReSerVation Protocol
inferredcites →https://doi.org/10.1109/infcom.1992.263412openalex-snapshot
A unified approach to bandwidth allocation and access control in fast packet-switched networks
inferredcites →https://doi.org/10.1137/0205051openalex-snapshot
Finding Minimum Spanning Trees
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1145/166237.166246openalex-snapshot
Core based trees (CBT)
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.17487/rfc1190openalex-snapshot
Experimental Internet Stream Protocol: Version 2 (ST-II)
inferredcites →https://doi.org/10.17487/rfc1247openalex-snapshot
OSPF Version 2
inferredcites →https://doi.org/10.17487/rfc1476openalex-snapshot
RAP: Internet Route Access Protocol
inferredcites →https://doi.org/10.21236/ada086338openalex-snapshot
ARPANET Routing Algorithm Improvements

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-1-4613-1339-7_2openalex-snapshot
Reduce Connection Awareness
inferred← citeshttps://doi.org/10.1007/bfb0022213openalex-snapshot
A path selection method in ATM using pre-computation
inferred← citeshttps://doi.org/10.1007/bfb0022215openalex-snapshot
Scalability enhancements for connection-oriented networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00055-5openalex-snapshot
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00154-1openalex-snapshot
New methods for shortest path selection for multimedia traffic with two delay constraints
inferred← citeshttps://doi.org/10.1023/a:1011319226517openalex-snapshot
On the Design of Link-State Routing Protocol for Connection-Oriented Networks
inferred← citeshttps://doi.org/10.1023/a:1018732808994openalex-snapshot
Impact of Multimedia Traffic Characteristics on ATM Network Configuration
inferred← citeshttps://doi.org/10.1023/a:1021108104572openalex-snapshot
Efficient Internet Multicast Routing Using Anycast Path Selection
inferred← citeshttps://doi.org/10.1109/65.752646openalex-snapshot
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
inferred← citeshttps://doi.org/10.1109/glocom.2001.966167openalex-snapshot
Server based QoS routing with implicit network state updates
inferred← citeshttps://doi.org/10.1109/icnp.1998.723728openalex-snapshot
On reducing the processing cost of on-demand QoS path computation
inferred← citeshttps://doi.org/10.1109/icon.2001.962394openalex-snapshot
Server based QoS routing with implicit network state updates
inferred← citeshttps://doi.org/10.1109/infcom.1999.751454openalex-snapshot
Implementation and performance measurements of QoS routing extensions to OSPF
inferred← citeshttps://doi.org/10.1109/infcom.2000.832181openalex-snapshot
QoS routing: the precomputation perspective
inferred← citeshttps://doi.org/10.1109/iwqos.1999.766495openalex-snapshot
Resource allocation in multiservice MPLS
inferred← citeshttps://doi.org/10.1109/tnet.2003.815299openalex-snapshot
Precomputation schemes for QoS routing
inferred← citeshttps://doi.org/10.1504/ijise.2010.032963openalex-snapshot
An object-oriented approach to data routing in a network
inferred← citeshttps://doi.org/10.26021/6225openalex-snapshot
A distributed cache architecture for quality-of-service routing in communication networks
inferred← citeshttps://doi.org/10.3745/kipstc.2003.10c.2.217openalex-snapshot
A Server Based Routing Mechanism Providing QoS Routing with Efficient Support of Best Effort Traffic
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.