On the public citation graph

Scalable QoS-Based Resource Allocation in Hierarchical Networked Environment

https://doi.org/10.1109/rtas.2005.47
0 signed · 29 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.1109/35.587723openalex-snapshot
Modeling Internet topology
inferredcites →https://doi.org/10.1109/65.238150openalex-snapshot
RSVP: a new resource ReSerVation Protocol
inferredcites →https://doi.org/10.1109/65.752646openalex-snapshot
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
inferredcites →https://doi.org/10.1109/90.234856openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.779203openalex-snapshot
QoS routing in networks with inaccurate information: theory and algorithms
inferredcites →https://doi.org/10.1109/glocom.2001.965863openalex-snapshot
A simple conceptual model for the Internet topology
inferredcites →https://doi.org/10.1109/icdcs.2003.1203464openalex-snapshot
Scalable resource allocation for multi-processor QoS optimization
inferredcites →https://doi.org/10.1109/icnp.1997.643714openalex-snapshot
On path selection for traffic with bandwidth guarantees
inferredcites →https://doi.org/10.1109/infcom.1997.635116openalex-snapshot
QoS based routing in networks with inaccurate information: theory and algorithms
inferredcites →https://doi.org/10.1109/ipdps.2002.1016476openalex-snapshot
Quantized EDF scheduling in a stochastic environment
inferredcites →https://doi.org/10.1109/lcn.1998.727649openalex-snapshot
Distributed quality-of-service routing in high-speed networks based on selective probing
inferredcites →https://doi.org/10.1109/lcn.2000.891103openalex-snapshot
Hierarchical QoS routing in delay-bandwidth sensitive networks
inferredcites →https://doi.org/10.1109/mascot.2001.948886openalex-snapshot
BRITE: an approach to universal topology generation
inferredcites →https://doi.org/10.1117/12.538820openalex-snapshot
Size matters: size-based scheduling for MPEG-4 over wireless channels
inferredcites →https://doi.org/10.1145/285237.285273openalex-snapshot
Core -stateless fair queueing

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-642-16256-5_13openalex-snapshot
On the Schedulability Analysis for Dynamic QoS Management in Distributed Embedded Systems
inferred← citeshttps://doi.org/10.1007/s11241-006-6881-0openalex-snapshot
Integrated QoS-aware resource management and scheduling with multi-resource constraints
inferred← citeshttps://doi.org/10.1007/s12083-008-0020-8openalex-snapshot
Adaptive component composition and load balancing for distributed stream processing applications
inferred← citeshttps://doi.org/10.1109/access.2022.3201823openalex-snapshot
Modeling and Control of Priority Queueing in Software Defined Networks via Machine Learning
inferred← citeshttps://doi.org/10.1109/aiact.2019.8847749openalex-snapshot
Improvement of Method of Balanced Queue Management on Routers Interfaces of Telecommunication Networks
inferred← citeshttps://doi.org/10.1109/cadsm.2019.8779246openalex-snapshot
Development of the Balanced Queue Management Scheme with Optimal Aggregation of Flows and Bandwidth Allocation
inferred← citeshttps://doi.org/10.1109/etfa.2010.5641360openalex-snapshot
Utilization-based schedulability analysis for switched Ethernet aiming dynamic QoS management
inferred← citeshttps://doi.org/10.1109/icdcs.2010.91openalex-snapshot
Resource Allocation in Distributed Mixed-Criticality Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00010openalex-snapshot
Processor and Bus Co-scheduling Strategies for Real-time Tasks with Multiple Service-levels
inferred← citeshttps://doi.org/10.1109/rtss.2012.68openalex-snapshot
QoS-Based Resource Allocation for Next-Generation Spacecraft Networks
inferred← citeshttps://doi.org/10.1109/tcset.2018.8336366openalex-snapshot
Hierarchical method of routing and resource allocation in DiffServ-TE network
inferred← citeshttps://doi.org/10.1109/ukrcon.2017.8100393openalex-snapshot
Method of hierarchical QoS routing based on network resource reservation
inferred← citeshttps://doi.org/10.1109/wicom.2008.1009openalex-snapshot
Research on Stratification and Grouping in Hierarchical Network
inferred← citeshttps://doi.org/10.30837/rt.2018.1.192.11openalex-snapshot
Two-level method of hierarchical-coordination QoS routing based on resource reservation
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.