On the public citation graph
Routing with end-to-end QoS guarantees in broadband networks
0 signed · 158 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.1007/978-0-387-35170-4_12openalex-snapshot
Quality-of-Service Routing for Traffic with Performance Guarantees
inferredcites →https://doi.org/10.1109/4236.769425openalex-snapshot
An architecture for residential Internet telephony service
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/5.469298openalex-snapshot
Service disciplines for guaranteed performance service in packet-switching networks
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.298432openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
inferredcites →https://doi.org/10.1109/90.532860openalex-snapshot
Efficient network QoS provisioning based on per node traffic shaping
inferredcites →https://doi.org/10.1109/90.748088openalex-snapshot
QoS routing in networks with uncertain parameters
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.1997.644603openalex-snapshot
QoS routing mechanisms and OSPF extensions
inferredcites →https://doi.org/10.1109/icnp.1997.643711openalex-snapshot
QoS based routing algorithm in integrated services packet networks
inferredcites →https://doi.org/10.1109/icnp.1997.643713openalex-snapshot
Load profiling for efficient route selection in multi-class networks
inferredcites →https://doi.org/10.1145/210613.210625openalex-snapshot
Topology aggregation for hierarchical routing in ATM networks
inferredcites →https://doi.org/10.1145/285237.285251openalex-snapshot
Quality of service based routing
inferredcites →https://doi.org/10.1145/285243.285251openalex-snapshot
Quality of service based routing
inferredcites →https://doi.org/10.1287/moor.17.1.36openalex-snapshot
Approximation Schemes for the Restricted Shortest Path Problem
inferredcites →https://doi.org/10.17487/rfc2212openalex-snapshot
Specification of Guaranteed Quality of Service
inferredcites →https://doi.org/10.17487/rfc2386openalex-snapshot
A Framework for QoS-based Routing in the Internet
inferredcites →https://doi.org/10.17487/rfc2676openalex-snapshot
QoS Routing Mechanisms and OSPF Extensions
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.3570openalex-snapshot
A resource‐tuned QoS multicast routing protocol
inferred← citeshttps://doi.org/10.1002/nem.485openalex-snapshot
A dynamic multicast routing satisfying multiple QoS constraints
inferred← citeshttps://doi.org/10.1007/0-387-23081-5_22openalex-snapshot
Multicriteria Analysis in Telecommunication Network Planning and Design — Problems and Issues
inferred← citeshttps://doi.org/10.1007/11753810_17openalex-snapshot
A Comparison of Exact and ε -Approximation Algorithms for Constrained Routing
inferred← citeshttps://doi.org/10.1007/3-540-36228-2_118openalex-snapshot
Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem
inferred← citeshttps://doi.org/10.1007/3-540-36480-3_43openalex-snapshot
Virtual Flow Deviation: Dynamic Routing of Bandwidth Guaranteed Connections
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_35openalex-snapshot
Algorithms for the Multi-constrained Routing Problem
inferred← citeshttps://doi.org/10.1007/3-540-47728-4_54openalex-snapshot
Bandwidth Reallocation Techniques for Admitting High Priority Real-Time Calls in ATM Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-09703-9_16openalex-snapshot
Blocking Probabilities of Multiple Classes in IP Networks with QoS Routing
inferred← citeshttps://doi.org/10.1007/978-0-387-77780-1_12openalex-snapshot
Optimal Survivable Routing with a Small Number of Hops
inferred← citeshttps://doi.org/10.1007/978-1-4419-7393-1_3openalex-snapshot
Distributed Optimal Delay Robustness and Network Throughput Tradeoff in Control-Communication Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-2155-8_5openalex-snapshot
Heuristic Algorithms for Real-Time Unsplittable Data Dissemination Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_26openalex-snapshot
Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey
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/978-3-031-37717-4_66openalex-snapshot
An Improved WRR Scheduling Algorithm for MANETs
inferred← citeshttps://doi.org/10.1007/978-3-540-30573-6_36openalex-snapshot
On the Performance of Dynamic Online QoS Routing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-45190-7_3openalex-snapshot
Quality of Service Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-16558-0_19openalex-snapshot
Towards Resource-Optimal Routing Plans for Real-Time Traffic
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_27openalex-snapshot
Lexicographical Minimization of Routing Hops in Telecommunication Networks
inferred← citeshttps://doi.org/10.1007/978-3-7091-6247-7_8openalex-snapshot
References and Further Reading
inferred← citeshttps://doi.org/10.1007/bf02949823openalex-snapshot
An effective randomized QoS routing algorithm on networks with inaccurate parameters
inferred← citeshttps://doi.org/10.1007/s10957-014-0624-5openalex-snapshot
Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models
inferred← citeshttps://doi.org/10.1007/s11047-011-9252-2openalex-snapshot
Evolutionary high-dimensional QoS optimization for safety-critical utility communication networks
inferred← citeshttps://doi.org/10.1007/s11235-009-9217-2openalex-snapshot
Maximum bandwidth routing and maximum flow routing in wireless mesh networks
inferred← citeshttps://doi.org/10.1007/s11265-005-4964-0openalex-snapshot
Reducing Encoder Bit-Rate Variation in MPEG Video
inferred← citeshttps://doi.org/10.1016/j.amc.2006.07.153openalex-snapshot
A generalized broadcasting schema for the mesh structures
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.10.043openalex-snapshot
Fast and efficient routing algorithms for delay-bounded and dependable channels
inferred← citeshttps://doi.org/10.1016/j.comcom.2016.09.006openalex-snapshot
QoS routing with worst-case delay constraints: Models, algorithms and performance analysis
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.11.002openalex-snapshot
Precomputation for intra-domain QoS routing
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.06.007openalex-snapshot
Dynamic online QoS routing schemes: Performance and bounds
inferred← citeshttps://doi.org/10.1016/j.cor.2016.12.009openalex-snapshot
Delay-constrained routing problems: Accurate scheduling models and admission control
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.07.020openalex-snapshot
A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
inferred← citeshttps://doi.org/10.1016/j.future.2009.02.002openalex-snapshot
A study on performance of dynamic file replication algorithms for real-time file access in Data Grids
inferred← citeshttps://doi.org/10.1016/j.jnca.2003.10.003openalex-snapshot
A comparison of two optimal approaches for the MCOP problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.10.005openalex-snapshot
Topology control for minimizing interference with delay constraints in an ad hoc network
inferred← citeshttps://doi.org/10.1016/j.peva.2003.11.002openalex-snapshot
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints
inferred← citeshttps://doi.org/10.1016/j.peva.2008.04.008openalex-snapshot
Optimal routing for end-to-end guarantees using Network Calculus
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00323-4openalex-snapshot
A note on practical construction of maximum bandwidth paths
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/s0140-3664(99)00225-xopenalex-snapshot
TAMCRA: a tunable accuracy multiple constraints routing algorithm
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00264-xopenalex-snapshot
The calculation of average distance in mesh structures
inferred← citeshttps://doi.org/10.1016/s1389-1286(00)00119-5openalex-snapshot
Hierarchical source routing using implied costs
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.1023/a:1024113813535openalex-snapshot
Dynamic Routing in the ATM-Networks: Problems and Solutions
inferred← citeshttps://doi.org/10.1023/a:1026127232312openalex-snapshot
Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic
inferred← citeshttps://doi.org/10.1023/b:nets.0000015655.31348.1bopenalex-snapshot
Incentive Compatible Pricing Strategies for QoS Routing
inferred← citeshttps://doi.org/10.1049/iet-com:20050457openalex-snapshot
Mobile agent based approach for QoS routing
inferred← citeshttps://doi.org/10.1080/03772063.2004.11665524openalex-snapshot
Unified Approach for QoS Management with Adaptation and Renegotiation
inferred← citeshttps://doi.org/10.1093/comjnl/bxu053openalex-snapshot
Optimal Joint Path Computation and Rate Allocation for Real-time Traffic
inferred← citeshttps://doi.org/10.1109/3pgcic.2011.34openalex-snapshot
Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes
inferred← citeshttps://doi.org/10.1109/49.898740openalex-snapshot
A hierarchical multilayer QoS routing system with dynamic SLA management
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/90.779203openalex-snapshot
QoS routing in networks with inaccurate information: theory and algorithms
inferred← citeshttps://doi.org/10.1109/90.993305openalex-snapshot
Heuristic algorithms for multiconstrained quality-of-service routing
inferred← citeshttps://doi.org/10.1109/apcc.2014.7091598openalex-snapshot
Integrated access selection considering wired and wireless resources
inferred← citeshttps://doi.org/10.1109/bcn.2006.1662280openalex-snapshot
Broadband quality regulation - perspectives from UK users
inferred← citeshttps://doi.org/10.1109/ccnc.2007.100openalex-snapshot
Using Advertised Rate for Multi-Path Relative Maxmin Routing
inferred← citeshttps://doi.org/10.1109/cdc.2003.1272513openalex-snapshot
Continuous path planning with multiple constraints
inferred← citeshttps://doi.org/10.1109/cdc.2005.1583364openalex-snapshot
A Neural Network Solution to QoS-IP Team-Optimal Dynamic Routing
inferred← citeshttps://doi.org/10.1109/cmcsn.2016.44openalex-snapshot
A Real-Time Routing Algorithm for End-to-End Communication Networks with QoS Requirements
inferred← citeshttps://doi.org/10.1109/glocom.2000.892087openalex-snapshot
Scalability of routing advertisement for QoS routing in an IP network with guaranteed QoS
inferred← citeshttps://doi.org/10.1109/glocom.2003.1258715openalex-snapshot
Novel algorithms for dynamic connection provisioning with guaranteed service level agreements in IP-over-optical networks
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378164openalex-snapshot
A-Serv: a novel architecture providing scalable quality of service
inferred← citeshttps://doi.org/10.1109/hpsr.2002.1024251openalex-snapshot
Maximal reservable bandwidth tree - a new approach to reduce the storage of state information
inferred← citeshttps://doi.org/10.1109/icc.2003.1203892openalex-snapshot
Distributed load-sensitive routing for computationally-constrained flows
inferred← citeshttps://doi.org/10.1109/icccas.2004.1346268openalex-snapshot
An enhanced algorithm for multiple constraints optimal path calculation
inferred← citeshttps://doi.org/10.1109/icccn.2007.4317985openalex-snapshot
Two-Phase Modeling of QoS Routing in Communication Networks
inferred← citeshttps://doi.org/10.1109/iccda.2010.5541168openalex-snapshot
Research of QoS routing algorithm suitable for IPv6
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876239openalex-snapshot
An efficient binary-search based heuristic for extended Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876255openalex-snapshot
Routing algorithm for multiple unsplittable flows between two cloud sites with QoS guarantees
inferred← citeshttps://doi.org/10.1109/icct.2000.890970openalex-snapshot
A randomized QoS routing algorithm on networks with inaccurate link-state information
inferred← citeshttps://doi.org/10.1109/icct.2006.341748openalex-snapshot
A New Network Improvement Algorithm Based on QoS system
inferred← citeshttps://doi.org/10.1109/icnp.2000.896314openalex-snapshot
Generalized load sharing for packet-switching networks
inferred← citeshttps://doi.org/10.1109/icnsc.2010.5461515openalex-snapshot
A dynamic QoS routing mechanism based on Steiner trees for LEO satellite networks
inferred← citeshttps://doi.org/10.1109/icoin.2001.905543openalex-snapshot
Performance analysis of QoS routing with network dependant delay cost
inferred← citeshttps://doi.org/10.1109/icon.2000.875821openalex-snapshot
QoS-based routing methods for multi-hop LEO satellite networks
inferred← citeshttps://doi.org/10.1109/icws53863.2021.00080openalex-snapshot
Incentive-driven Edge Cooperation for Service Provision
inferred← citeshttps://doi.org/10.1109/infcom.1999.751478openalex-snapshot
Incentive compatible pricing strategies for QoS routing
inferred← citeshttps://doi.org/10.1109/infcom.2000.832180openalex-snapshot
Networks with advance reservations: the routing perspective
inferred← citeshttps://doi.org/10.1109/infcom.2000.832181openalex-snapshot
QoS routing: the precomputation perspective
inferred← citeshttps://doi.org/10.1109/infcom.2000.832182openalex-snapshot
QoS routing with performance-dependent costs
inferred← citeshttps://doi.org/10.1109/infcom.2001.916274openalex-snapshot
Multi-constrained optimal path selection
inferred← citeshttps://doi.org/10.1109/infcom.2001.916275openalex-snapshot
Heuristic algorithms for multi-constrained quality of service routing
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019329openalex-snapshot
Constraint-based path selection methods for on-demand provisioning in WDM networks
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208977openalex-snapshot
Precomputation for multiconstrained QoS routing in high-speed networks
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208979openalex-snapshot
Algorithms for computing QoS paths with restoration
inferred← citeshttps://doi.org/10.1109/interact.2010.5706184openalex-snapshot
An efficient routing algorithm for improving the QoS in Internet
inferred← citeshttps://doi.org/10.1109/iscc.1999.780782openalex-snapshot
Signaling in IP cell-switching
inferred← citeshttps://doi.org/10.1109/iscc.2001.935394openalex-snapshot
Efficient routing with quality-of-service requirements
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358650openalex-snapshot
A limited path unicast QoS routing algorithm
inferred← citeshttps://doi.org/10.1109/iscc.2005.60openalex-snapshot
Efficient QoS Routing for Differentiated Services EF Flows
inferred← citeshttps://doi.org/10.1109/iscis.2008.4717957openalex-snapshot
Impact of peer-to-peer communication on real-time performance of file replication algorithms
inferred← citeshttps://doi.org/10.1109/itng.2013.78openalex-snapshot
Localized QoS Routing with End-to-End Delay Guarantees
inferred← citeshttps://doi.org/10.1109/izsbc.2002.991755openalex-snapshot
Efficient techniques for QoS based path computation and selection in differentiated service networks
inferred← citeshttps://doi.org/10.1109/jsac.2004.839423openalex-snapshot
Generalized quality-of-service routing with resource allocation
inferred← citeshttps://doi.org/10.1109/lcn.2002.1181772openalex-snapshot
Solving the MCOP problem optimally
inferred← citeshttps://doi.org/10.1109/mwscas.2002.1187025openalex-snapshot
Traffic engineering optimal routing for LSP setup in MPLS
inferred← citeshttps://doi.org/10.1109/ngi.2006.1678252openalex-snapshot
A fast and efficient backup routing scheme with bounded delay guarantees
inferred← citeshttps://doi.org/10.1109/pccc.2000.830328openalex-snapshot
Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees
inferred← citeshttps://doi.org/10.1109/pccc.2003.1203693openalex-snapshot
Adjustable multi-constrained routing with a novel evaluation method
inferred← citeshttps://doi.org/10.1109/qshine.2004.44openalex-snapshot
QoS provision and routing with stochastic guarantees
inferred← citeshttps://doi.org/10.1109/real.2000.896014openalex-snapshot
Admission of high priority real-time calls in an ATM network via bandwidth reallocation and dynamic rerouting of active channels
inferred← citeshttps://doi.org/10.1109/tc.2003.1204827openalex-snapshot
A new scheme for reducing link and signaling costs in mobile ip
inferred← citeshttps://doi.org/10.1109/tcomm.2003.811420openalex-snapshot
Minimum-cost QoS multicast and unicast routing in communication networks
inferred← citeshttps://doi.org/10.1109/tmm.2003.811627openalex-snapshot
Routing multimedia traffic with qos guarantees
inferred← citeshttps://doi.org/10.1109/tnet.2002.803917openalex-snapshot
Computing shortest paths for any number of hops
inferred← citeshttps://doi.org/10.1109/tnet.2003.815299openalex-snapshot
Precomputation schemes for QoS routing
inferred← citeshttps://doi.org/10.1109/tnet.2004.826248openalex-snapshot
Fixed Point Approximation for Multirate Multihop Loss Networks With State-Dependent Routing
inferred← citeshttps://doi.org/10.1109/tnet.2004.836112openalex-snapshot
Concepts of Exact QoS Routing Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2005.850217openalex-snapshot
Algorithms for computing QoS paths with restoration
inferred← citeshttps://doi.org/10.1109/tnet.2006.890089openalex-snapshot
Finding a Path Subject to Many Additive QoS Constraints
inferred← citeshttps://doi.org/10.1109/tnet.2007.900712openalex-snapshot
Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing
inferred← citeshttps://doi.org/10.1109/tpds.2006.90openalex-snapshot
Generalized load sharing for packet-switching networks. I. Theory and packet-based algorithm
inferred← citeshttps://doi.org/10.1109/tsmcc.2003.817354openalex-snapshot
Optimizing qos routing in hierarchical atm networks using computational intelligence techniques
inferred← citeshttps://doi.org/10.1109/wcica.2000.862439openalex-snapshot
A tunable QoS routing algorithm
inferred← citeshttps://doi.org/10.1109/wcnc.1999.797812openalex-snapshot
Quality of service support for broadband satellite multimedia service
inferred← citeshttps://doi.org/10.1109/wimob.2005.1512928openalex-snapshot
Fully distributed cluster based routing architecture for mobile ad hoc networks
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00766.xopenalex-snapshot
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
inferred← citeshttps://doi.org/10.1142/s0218843008001865openalex-snapshot
EFFICIENT APPROACH FOR WEB SERVICES SELECTION WITH MULTI-QoS CONSTRAINTS
inferred← citeshttps://doi.org/10.1145/2890955.2890960openalex-snapshot
Stitching Inter-Domain Paths over IXPs
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.1145/345063.339427openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
inferred← citeshttps://doi.org/10.1145/774749.774760openalex-snapshot
Hop-by-hop routing algorithms for premium traffic
inferred← citeshttps://doi.org/10.1145/952532.952732openalex-snapshot
An optimal broadcasting schema for multidimensional mesh structures
inferred← citeshttps://doi.org/10.1155/2012/374961openalex-snapshot
Analytical Model of a Weighted Round Robin Service System
inferred← citeshttps://doi.org/10.1360/jos161352openalex-snapshot
A New Network Improvement Algorithm in QoS Providing System
inferred← citeshttps://doi.org/10.1360/jos161484openalex-snapshot
A QoS Routing Algorithm Based on Pareto Optimal
inferred← citeshttps://doi.org/10.1504/ijhpcn.2004.008905openalex-snapshot
Minimal broadcasting schemas for the mesh structures
inferred← citeshttps://doi.org/10.3233/hsn-2004-241openalex-snapshot
Path selection under multiple QoS constraints – a practical approach
inferred← citeshttps://doi.org/10.4018/978-1-59904-783-6.ch010openalex-snapshot
Broadband Quality Regulation
inferred← citeshttps://doi.org/10.4018/ijismd.2020070106openalex-snapshot
Construction of Lightweight Big Data Experimental Platform Based on Dockers Container
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.443.487openalex-snapshot
An Improved QoS Routing Algorithm in Internet
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5253openalex-snapshot
Reachability Under Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02642openalex-snapshot
Stitching Inter-Domain Paths over IXPs
inferred← citeshttps://doi.org/10.5281/zenodo.1085783openalex-snapshot
Coerced Delay And Multi Additive Constraints Qos Routing Schemes
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.