On the public citation graph
A system for priority routing and capacity assignment in packet switched networks
0 signed · 31 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.1981.tb00295.xopenalex-snapshot
Priority Queuing Networks
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1007/bfb0120690openalex-snapshot
Lagrangean relaxation for integer programming
inferredcites →https://doi.org/10.1016/0169-7552(86)90017-6openalex-snapshot
Priorities and performance in packet-switching Networks
inferredcites →https://doi.org/10.1080/03155986.1990.11732137openalex-snapshot
Class Dependent Routing In Backbone Computer Networks
inferredcites →https://doi.org/10.1109/26.20116openalex-snapshot
A system for routing and capacity assignment in computer communication networks
inferredcites →https://doi.org/10.1109/tcom.1979.1094531openalex-snapshot
A Queueing Network Analysis of Computer Communication Networks with Window Flow Control
inferredcites →https://doi.org/10.1145/1013879.802665openalex-snapshot
A versatile queueing model for data switching
inferredcites →https://doi.org/10.1145/800081.802665openalex-snapshot
A versatile queueing model for data switching
inferredcites →https://doi.org/10.1145/800103.803336openalex-snapshot
Delay analysis for Datapac - a packet switched network with two priority classes
inferredcites →https://doi.org/10.1147/rd.214.0360openalex-snapshot
Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets
inferredcites →https://doi.org/10.1147/sj.182.0298openalex-snapshot
Routing and flow control in Systems Network Architecture
inferredcites →https://doi.org/10.1287/ijoc.2.3.236openalex-snapshot
Backbone Network Design Tools with Economic Tradeoffs
inferredcites →https://doi.org/10.1287/mnsc.30.2.222openalex-snapshot
Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.21236/ad0755118openalex-snapshot
Lagrangean Relaxation and Its Uses in Integer Programming
inferredcites →https://doi.org/10.2307/2004303openalex-snapshot
Communication Nets: Stochastic Message Flow and Delay
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-30165-5_17openalex-snapshot
Optimization Issues in Quality of Service
inferred← citeshttps://doi.org/10.1007/bf01783514openalex-snapshot
Configuring wide area computer networks
inferred← citeshttps://doi.org/10.1007/bf02995505openalex-snapshot
Une méthode heuristique de dimensionnement de réseaux téléinformatiques
inferred← citeshttps://doi.org/10.1016/0954-1810(95)00022-4openalex-snapshot
An evolutionary approach for configuring economical packet switched computer networks
inferred← citeshttps://doi.org/10.1016/j.apm.2012.03.027openalex-snapshot
Design of computer network topologies: A Vroom Inspired Psychoclonal Algorithm
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00234-5openalex-snapshot
Asynchronous transfer mode networks with parallel links and multiple service classes
inferred← citeshttps://doi.org/10.1016/s0952-1976(00)00059-2openalex-snapshot
An artificial neural network approach for routing in distributed computer networks
inferred← citeshttps://doi.org/10.1016/s0954-1810(00)00014-5openalex-snapshot
Routing in computer networks using artificial neural networks
inferred← citeshttps://doi.org/10.1023/a:1015546212618openalex-snapshot
Planning Models for Wide-Area Communication Network Design with Response-Time-Dependent Offered Traffic
inferred← citeshttps://doi.org/10.1023/a:1019193417664openalex-snapshot
A heuristic method for self‐healing ring design in a single‐homing cluster
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602307openalex-snapshot
The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
inferred← citeshttps://doi.org/10.1109/3477.662766openalex-snapshot
A genetic algorithm for designing distributed computer network topologies
inferred← citeshttps://doi.org/10.1109/icnds.2010.5479351openalex-snapshot
Data flow monitoring and control of LAN based on strategy
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.188openalex-snapshot
Packet Routing in Telecommunication Networks with Path and Flow Restrictions
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.