On the public citation graph
Routing heuristics for load-balanced transmission in TSN-based networks
0 signed · 59 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.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferredcites →https://doi.org/10.1049/iet-cps.2016.0021openalex-snapshot
Design optimisation of cyber‐physical distributed systems using IEEE time‐sensitive networks
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/65.819168openalex-snapshot
Multicast routing and its QoS extension: problems, algorithms, and protocols
inferredcites →https://doi.org/10.1109/infocommst.2016.7905383openalex-snapshot
Load balancing routing in Time-Sensitive Networks
inferredcites →https://doi.org/10.1145/2997465.2997494openalex-snapshot
No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN)
inferredcites →https://doi.org/10.1145/3139258.3139284openalex-snapshot
Fault-tolerant topology and routing synthesis for IEEE time-sensitive networking
inferredcites →https://doi.org/10.1145/3267419.3267421openalex-snapshot
Routing algorithms for IEEE802.1Qbv networks
inferredcites →https://doi.org/10.1214/11-aop734openalex-snapshot
Spectral statistics of Erdős–Rényi graphs I: Local semicircle law
inferredcites →https://doi.org/10.18419/opus-9482openalex-snapshot
Routing algorithms for time sensitive networks
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.70562openalex-snapshot
Multi‐Criteria Decision Making Based Routing Optimization for IEEE 802.1 Time‐Sensitive Networking
inferred← citeshttps://doi.org/10.1002/nem.70001openalex-snapshot
SDOG: Scalable Scheduling of Flows Based on Dynamic Online Grouping in Industrial Time‐Sensitive Networks
inferred← citeshttps://doi.org/10.1007/978-981-95-1941-5_24openalex-snapshot
Optimizing Multimedia Transmission in Time-Sensitive Networking with Delay-Based Routing for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-981-96-4963-1_10openalex-snapshot
Reliable Offline Service Routing and Scheduling Algorithm with Redundant Paths in Time Sensitive Networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2024.103741openalex-snapshot
A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107317openalex-snapshot
Constraint programming approaches to joint routing and scheduling in time-sensitive networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.109516openalex-snapshot
An efficient scheduling approach for multi-level industrial chain flows in time-sensitive networking
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.110117openalex-snapshot
Reuse-based online joint routing and scheduling optimization mechanism in deterministic networks
inferred← citeshttps://doi.org/10.1016/j.osn.2022.100709openalex-snapshot
Segment frame replication and elimination for redundant routing provision in the FlexE-over-WDM networks
inferred← citeshttps://doi.org/10.1016/j.simpat.2023.102859openalex-snapshot
Research on flow scheduling of train communication based on time-sensitive network
inferred← citeshttps://doi.org/10.1049/cps2.12030openalex-snapshot
Dependability‐aware routing and scheduling for Time‐Sensitive Networking
inferred← citeshttps://doi.org/10.1109/access.2021.3120769openalex-snapshot
Timely Survey of Time-Sensitive Networking: Past and Future Directions
inferred← citeshttps://doi.org/10.1109/access.2022.3214007openalex-snapshot
Configuration and Evaluation of Multi-CQF Shapers in IEEE 802.1 Time-Sensitive Networking (TSN)
inferred← citeshttps://doi.org/10.1109/access.2023.3243286openalex-snapshot
Data Flow Control for Network Load Balancing in IEEE Time Sensitive Networks for Automation
inferred← citeshttps://doi.org/10.1109/aim52237.2022.9863382openalex-snapshot
Topology Design of Time Sensitive Networks in A Smart Factory
inferred← citeshttps://doi.org/10.1109/csndsp54353.2022.9907983openalex-snapshot
A Two-Stage Routing Algorithm for Time-Triggered Flows in Time Sensitive Networks
inferred← citeshttps://doi.org/10.1109/drcn51631.2021.9477352openalex-snapshot
Redundant Routing Provision in a FlexE-over-WDM Network based on Segment Frame Replication and Elimination
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00293openalex-snapshot
Optimized Scheduling for Guard Bands Reduction in Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/iccci65070.2025.11158704openalex-snapshot
A Joint Routing and Scheduling Algorithm with Load Balancing for CQF of Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/icccn65249.2025.11133725openalex-snapshot
Achieving Adaptive Multi-Path Routing and Order-Preserving Time Slot Planning in TSN
inferred← citeshttps://doi.org/10.1109/iccsn57992.2023.10297357openalex-snapshot
Incompatibility-Aware Joint Routing and Partitioned Scheduling Mechanism in Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/icet61945.2024.10673375openalex-snapshot
Reliability-aware Segmented Redundant Routing and Scheduling Mechanism in Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/icnlp60986.2024.10692589openalex-snapshot
Research on Routing Algorithm for Time-Sensitive Networks Based on Ant Colony Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/imcec55388.2022.10019900openalex-snapshot
A Low-latency Access Control Algorithm based on Terminal Resource Scheduling for New Electric Power Services
inferred← citeshttps://doi.org/10.1109/jiot.2023.3328626openalex-snapshot
Effective Routing and Scheduling Strategies for Fault-Tolerant Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/jiot.2026.3687203openalex-snapshot
A Deep Reinforcement Learning-Based Fast Scheduling Approach for Dynamic Incremental Flows in Time Sensitive Networking
inferred← citeshttps://doi.org/10.1109/jiot.2026.3687225openalex-snapshot
Joint Robust Routing, Scheduling, and Load Balancing in Deterministic UAV Rescue Networks: A DFS-PPO Method
inferred← citeshttps://doi.org/10.1109/mnet.007.2100444openalex-snapshot
TC-Flow: Chain Flow Scheduling for Advanced Industrial Applications in Time-Sensitive Networks
inferred← citeshttps://doi.org/10.1109/tce.2025.3540890openalex-snapshot
A Joint Routing and Time-Slot Scheduling Load Balancing Algorithm for In-Vehicle TSN
inferred← citeshttps://doi.org/10.1109/tetc.2026.3667727openalex-snapshot
Online Scheduling With Incremental Reconfiguration in IEEE 802.1Qch-Based TSN for IIoT
inferred← citeshttps://doi.org/10.1109/ticps.2026.3696600openalex-snapshot
Enhancing End-to-End Delay Satisfiability for IEEE 802.1Qav
inferred← citeshttps://doi.org/10.1109/tnse.2025.3546100openalex-snapshot
Reliable Routing and Scheduling in Time Sensitive Networks Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/ton.2026.3712024openalex-snapshot
End-to-End Routing for Jointly Ultra-Service and Regular-Service Flows in TSN: An Evolutionary Transformer-Based DRL Approach
inferred← citeshttps://doi.org/10.1117/12.2641264openalex-snapshot
Research on multipath scheduling algorithm in time sensitive networks
inferred← citeshttps://doi.org/10.1117/12.2667698openalex-snapshot
Meta-heuristic-based multipath joint routing and scheduling of time-triggered traffic for time-sensitive networking in IIoT
inferred← citeshttps://doi.org/10.1145/3501294openalex-snapshot
Constructive or Optimized: An Overview of Strategies to Design Networks for Time-Critical Applications
inferred← citeshttps://doi.org/10.1145/3687307openalex-snapshot
Load-balanced Routing Heuristics for Bandwidth Allocation of AVB Flow in TSN
inferred← citeshttps://doi.org/10.23919/ofc49934.2023.10116122openalex-snapshot
Towards Optimized Demand Routing in QKD Networks
inferred← citeshttps://doi.org/10.31590/ejosat.araconf42openalex-snapshot
IEEE 802.1 Time-Sensitive Networking Standardının Yazılım Tanımlı Ağ Yaklaşımıyla Değerlendirilmesi
inferred← citeshttps://doi.org/10.3390/app12094448openalex-snapshot
An Enhanced Routing and Scheduling Mechanism for Time-Triggered Traffic with Large Period Differences in Time-Sensitive Networking
inferred← citeshttps://doi.org/10.3390/biomimetics10050333openalex-snapshot
Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms
inferred← citeshttps://doi.org/10.3390/electronics10010058openalex-snapshot
A Period-Aware Routing Method for IEEE 802.1Qbv TSN Networks
inferred← citeshttps://doi.org/10.3390/electronics10020125openalex-snapshot
Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks
inferred← citeshttps://doi.org/10.3390/electronics12194101openalex-snapshot
Research on Global Deterministic Direct Forwarding and Scheduling of Mixed Flow Based on Time-Sensitive Network in Substation
inferred← citeshttps://doi.org/10.3390/s20216400openalex-snapshot
A Novel Routing Algorithm for the Acceleration of Flow Scheduling in Time-Sensitive Networks
inferred← citeshttps://doi.org/10.3390/s22114153openalex-snapshot
Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories
inferred← citeshttps://doi.org/10.52953/sivv2522openalex-snapshot
Reconfiguration algorithms for high precision communications in time sensitive networks: Time-aware shaper configuration with IEEE 802.1Qcc
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.