On the public citation graph
Heuristic algorithms for multiconstrained quality-of-service routing
0 signed · 212 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/net.3230140109openalex-snapshot
Algorithms for finding paths with multiple constraints
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/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
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.779205openalex-snapshot
Routing with end-to-end QoS guarantees in broadband networks
inferredcites →https://doi.org/10.1109/icc.1998.685137openalex-snapshot
On finding multi-constrained paths
inferredcites →https://doi.org/10.1109/infcom.1997.635117openalex-snapshot
A distributed algorithm for delay-constrained unicast routing
inferredcites →https://doi.org/10.1145/339331.339427openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
inferredcites →https://doi.org/10.1145/345063.339427openalex-snapshot
An efficient algorithm for finding a path subject to two additive constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470823941.ch10openalex-snapshot
Flexible QoS Multicast Routing in Next‐Generation Internet
inferred← citeshttps://doi.org/10.1002/nem.757openalex-snapshot
Jitter‐minimized reliability‐maximized management of networks
inferred← citeshttps://doi.org/10.1002/wcm.1112openalex-snapshot
Multi‐cost routing for energy and capacity constrained wireless mesh networks
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/0-387-31173-4_13openalex-snapshot
Unified Support for Quality of Service Metrics Management in Mobile Ad Hoc Networks Using OLSR
inferred← citeshttps://doi.org/10.1007/11534310_64openalex-snapshot
An End-to-End QoS Provisioning Architecture in IPv6 Networks
inferred← citeshttps://doi.org/10.1007/11602613_11openalex-snapshot
GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_476openalex-snapshot
Optimization in Ad Hoc Networks
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-4614-0278-7_7openalex-snapshot
Temperature- and Energy-Constrained Scheduling
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-030-89543-3_40openalex-snapshot
Finding Cheapest Deadline Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_70openalex-snapshot
A Comparison Study of Metaheuristic Techniques for Providing QoS to Avatars in DVE Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-25969-5_3openalex-snapshot
Enhancing Delay Differentiation Semantics of Class-Based IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30501-9_37openalex-snapshot
Improved Limited Path Heuristic Algorithm for Multi-constrained QoS Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-39404-4_6openalex-snapshot
A Heuristic Algorithm for the Multi-constrained Multicast Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-39425-9_46openalex-snapshot
An Overview of Research on QoS Routing
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-540-76848-7_39openalex-snapshot
Minimal Traffic-Constrained Similarity-Based SOAP Multicast Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-03700-9_3openalex-snapshot
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
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-642-21762-3_119openalex-snapshot
Reliable and Delay-Efficient Routing Algorithm in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31003-4_2openalex-snapshot
Adjacency List Based Multicast QoS Routing Problem Optimization with Advanced Immune Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-33427-6_2openalex-snapshot
Reactive Service Selection in Dynamic Service Environments
inferred← citeshttps://doi.org/10.1007/s00453-004-1119-9openalex-snapshot
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
inferred← citeshttps://doi.org/10.1007/s00779-011-0366-4openalex-snapshot
Stability routing with constrained path length for improved routability in dynamic MANETs
inferred← citeshttps://doi.org/10.1007/s11042-022-12388-zopenalex-snapshot
Performance analysis of hybrid coders in multi-constraints pruned environment
inferred← citeshttps://doi.org/10.1007/s11107-012-0385-8openalex-snapshot
Cross-layer routing in clustered optical networks
inferred← citeshttps://doi.org/10.1007/s11276-006-0731-9openalex-snapshot
Multiconstrained QoS multipath routing in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11276-006-7528-8openalex-snapshot
Finding multi-constrained feasible paths by using depth-first search
inferred← citeshttps://doi.org/10.1007/s11276-010-0257-zopenalex-snapshot
Joint multi-cost routing and power control in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11277-006-9149-zopenalex-snapshot
Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks
inferred← citeshttps://doi.org/10.1007/s11277-009-9756-6openalex-snapshot
Cross-Layer Design for QoS in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1007/s11460-011-0118-2openalex-snapshot
A novel and effective multi-constrained QoS routing scheme in WMNs
inferred← citeshttps://doi.org/10.1007/s11761-013-0149-zopenalex-snapshot
Efficient adaptive QoS-based service selection
inferred← citeshttps://doi.org/10.1007/s11767-005-0086-xopenalex-snapshot
Simulated annealing based polynomial time QoS routing algorithm for MANETs
inferred← citeshttps://doi.org/10.1016/j.adhoc.2021.102633openalex-snapshot
Swarm intelligence inspired meta-heuristics for solving multi-constraint QoS path problem in vehicular ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.01.052openalex-snapshot
A multi-objective routing algorithm for Wireless Multimedia Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.05.009openalex-snapshot
Finding a least hop(s) path subject to multiple additive constraints
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.12.005openalex-snapshot
A case for tree evolution in QoS multicasting
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.05.011openalex-snapshot
Construction of an optimal multicast tree for group communication in a cellular network using genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.06.001openalex-snapshot
On selecting the cost function for source routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.06.004openalex-snapshot
An iterative distributed algorithm for multi-constraint multicast routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.08.015openalex-snapshot
A genetic approach for adding QoS to distributed virtual environments
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.12.022openalex-snapshot
Routing and admission control with multiconstrained end-to-end quality of service in MPLS networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.02.019openalex-snapshot
Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
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.07.016openalex-snapshot
An efficient quality of service routing algorithm for delay-sensitive applications
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.2007.01.020openalex-snapshot
Loop-free constrained path computation for hop-by-hop QoS routing
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.06.016openalex-snapshot
Routing and scheduling connections in networks that support advance reservations
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.05.017openalex-snapshot
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.03.011openalex-snapshot
Energy efficient online routing of flows with additive constraints
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.future.2016.12.003openalex-snapshot
Adaptive composition in dynamic service environments
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2012.01.002openalex-snapshot
Multi-postpath-based lookahead multiconstraint QoS routing
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.jnca.2011.09.009openalex-snapshot
Routing with multiple quality-of-services constraints: An approximation perspective
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.10.005openalex-snapshot
A survey on green routing protocols using sleep-scheduling in wired networks
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/s0140-3664(02)00055-5openalex-snapshot
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)31965-1openalex-snapshot
Shared experiences in intelligent transportation systems
inferred← citeshttps://doi.org/10.1049/iet-com:20070471openalex-snapshot
Flooding-limited for multi-constrained quality-of-service routing protocol in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1049/ip-com:20045059openalex-snapshot
Multiconstrained QoS routing using optimal supervisory control
inferred← citeshttps://doi.org/10.1080/10798587.2011.10643216openalex-snapshot
Reliable Multi-Path Routing With Bandwidth and Delay Constraints
inferred← citeshttps://doi.org/10.1109/access.2023.3235828openalex-snapshot
LEAF: Let’s Efficiently Make Adaptive Forwarding in Payment Channel Networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2006.205090openalex-snapshot
Restricted Shortest Path Routing with Concave Costs
inferred← citeshttps://doi.org/10.1109/ams.2010.40openalex-snapshot
QoS Parameter Optimization Using Multi-Objective Genetic Algorithm in MANETs
inferred← citeshttps://doi.org/10.1109/apnoms.2012.6356046openalex-snapshot
QoS-aware service selection in virtualization-based Cloud computing
inferred← citeshttps://doi.org/10.1109/broadnets.2008.4769139openalex-snapshot
Routing and scheduling connections in networks that support advance reservations
inferred← citeshttps://doi.org/10.1109/ccece.2003.1226095openalex-snapshot
A novel genetic algorithm searching approach for dynamic constrained multicast routing
inferred← citeshttps://doi.org/10.1109/ccece.2004.1347721openalex-snapshot
Multicast routing with delay and delay variation constraints using genetic algorithm
inferred← citeshttps://doi.org/10.1109/ccece.2007.91openalex-snapshot
End-to-End Packet Loss Constrained Routing and Admission Control for MPLS Networks
inferred← citeshttps://doi.org/10.1109/chinacom.2006.344859openalex-snapshot
A Multiobjective Optimization Algorithm for LSP Setup in Diffserv and MPLS Networks
inferred← citeshttps://doi.org/10.1109/cis.2014.84openalex-snapshot
An Efficient Approximation Scheme for the Multiple QoS Constraints Routing
inferred← citeshttps://doi.org/10.1109/cmc.2010.96openalex-snapshot
Ant-Based Multi-constrained Anycast Algorithm for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/comst.2016.2561078openalex-snapshot
QoS Provisioning in Converged Satellite and Terrestrial Networks: A Survey of the State-of-the-Art
inferred← citeshttps://doi.org/10.1109/comst.2021.3058573openalex-snapshot
Federated Machine Learning: Survey, Multi-Level Classification, Desirable Criteria and Future Directions in Communication and Networking Systems
inferred← citeshttps://doi.org/10.1109/cris.2010.5617562openalex-snapshot
Use of traffic engineering techniques to increase resilience of SCADA networks
inferred← citeshttps://doi.org/10.1109/cscwd.2006.253085openalex-snapshot
ALMSC: An Application layer multicast based SIP conference model
inferred← citeshttps://doi.org/10.1109/cso.2011.57openalex-snapshot
A Simple and Fast Algorithm for Restricted Shortest Path Problem
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378134openalex-snapshot
Traffic routing in MPLS networks based on QoS estimation and forecast
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/glocom.2004.1378234openalex-snapshot
Achieving 100% success ratio in finding the delay constrained least cost path
inferred← citeshttps://doi.org/10.1109/glocom.2007.359openalex-snapshot
Multiconstrained QoS Routing: Greedy is Good
inferred← citeshttps://doi.org/10.1109/his.2009.125openalex-snapshot
Approach for Multiple Constraints Based Qos Routing Problem of Network
inferred← citeshttps://doi.org/10.1109/icac.2004.1301358openalex-snapshot
On identifying stable ways to con .gure systems
inferred← citeshttps://doi.org/10.1109/icc.2009.5198760openalex-snapshot
Approximation Algorithm for QoS Routing with Multiple Additive Constraints
inferred← citeshttps://doi.org/10.1109/icccn.2001.956226openalex-snapshot
Path selection methods for localized quality of service routing
inferred← citeshttps://doi.org/10.1109/iccs.2006.301418openalex-snapshot
A Fuzzy QOS Routing Algorithm for Communication Networks
inferred← citeshttps://doi.org/10.1109/icct.2003.1209121openalex-snapshot
A simulated-annealing-based QoS multicasting algorithm
inferred← citeshttps://doi.org/10.1109/icct.2003.1209127openalex-snapshot
An Internet routing emulation system: research and development
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5365465openalex-snapshot
Research of Multi-Constrained Multicast Routing Qos Using Heuristic Algorithm
inferred← citeshttps://doi.org/10.1109/icis.2010.50openalex-snapshot
Solving Multicast QoS Routing Problem in the Context V2I Communication Services Using DCA
inferred← citeshttps://doi.org/10.1109/icmult.2010.5630338openalex-snapshot
A Method Based on Penalty Function and Integer Programming for QoS Routing Problem
inferred← citeshttps://doi.org/10.1109/icmult.2010.5630525openalex-snapshot
Reliable Multi-Path Routing with Bandwidth and Delay Constraints
inferred← citeshttps://doi.org/10.1109/icniconsmcl.2006.10openalex-snapshot
A Delay-Constrained QoS Routing Algorithm Based on Fanos Method
inferred← citeshttps://doi.org/10.1109/icnp.2008.4697051openalex-snapshot
An approximation algorithm for QoS routing with two additive constraints
inferred← citeshttps://doi.org/10.1109/icnp.2011.6089067openalex-snapshot
PhD Forum: On the scalability of source routing architectures
inferred← citeshttps://doi.org/10.1109/icns.2006.96openalex-snapshot
Scalable BGP QoS Extension with Multiple Metrics
inferred← citeshttps://doi.org/10.1109/icnsc.2004.1297418openalex-snapshot
Evaluation of heuristic path selection algorithms for multi-constrained QoS routing
inferred← citeshttps://doi.org/10.1109/icoin.2008.4472759openalex-snapshot
A Novel Cross-Layer QoS Routing Algorithm for Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/icon.2005.1635446openalex-snapshot
QoS Routing for Multiple Additive QoS Parameters using Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191578openalex-snapshot
Internet routing emulation system and stress testing
inferred← citeshttps://doi.org/10.1109/ictmicc.2007.4448579openalex-snapshot
Finding multi-constrained path using genetic algorithm
inferred← citeshttps://doi.org/10.1109/icws.2007.148openalex-snapshot
QoS-aware Service Composition in Service Overlay Networks
inferred← citeshttps://doi.org/10.1109/icws.2011.25openalex-snapshot
Efficient Multi-granularity Service Composition
inferred← citeshttps://doi.org/10.1109/icws.2012.62openalex-snapshot
Efficient Correlation-Aware Service Selection
inferred← citeshttps://doi.org/10.1109/infcom.2009.5061962openalex-snapshot
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
inferred← citeshttps://doi.org/10.1109/ipdps.2005.67openalex-snapshot
A Sexual Elitist Genetic Algorithm for Providing QoS in Distributed Virtual Environment Systems
inferred← citeshttps://doi.org/10.1109/isahuc.2006.4290653openalex-snapshot
Multicast Tree Computation for Group Communication in Mobile Networks using Optimization Techniques
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358647openalex-snapshot
Integrating path computation and precomputation for quality-of-service provisioning
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358650openalex-snapshot
A limited path unicast QoS routing algorithm
inferred← citeshttps://doi.org/10.1109/iscc.2007.4381503openalex-snapshot
On the setting of QoS link weights to provide per-flow QoS guarantees
inferred← citeshttps://doi.org/10.1109/itc-28.2016.312openalex-snapshot
Application-Aware Infrastructure Clustering for Cloud Service Placement to Enhance User QoE
inferred← citeshttps://doi.org/10.1109/iwqos.2008.37openalex-snapshot
Flexible QoS Route Selection with Diverse Objectives and Constraints
inferred← citeshttps://doi.org/10.1109/iwqos.2009.5201401openalex-snapshot
Supporting application network flows with multiple QoS constraints
inferred← citeshttps://doi.org/10.1109/iwqos.2018.8624137openalex-snapshot
How Would you Like Your Packets Delivered? An SDN-Enabled Open Platform for QoS Routing
inferred← citeshttps://doi.org/10.1109/iwqos54832.2022.9812900openalex-snapshot
QoS Routing Using Dominant-Distance Vectors
inferred← citeshttps://doi.org/10.1109/jcn.2009.6391334openalex-snapshot
End-to-end quality of service constrained routing and admission control for MPLS networks
inferred← citeshttps://doi.org/10.1109/jlt.2012.2187324openalex-snapshot
PLI-Aware Routing in Regenerated Mesh Topology Optical 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/jsac.2005.857212openalex-snapshot
QoS-aware service composition and adaptation in autonomic communication
inferred← citeshttps://doi.org/10.1109/jsac.2016.2615184openalex-snapshot
Near-Optimal Routing Protection for In-Band Software-Defined Heterogeneous Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.66openalex-snapshot
Joint Congestion and Power Control in UWB Based Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2007.061618openalex-snapshot
A New Routing-Based Admission Control for MPLS Networks
inferred← citeshttps://doi.org/10.1109/mcom.2002.1106159openalex-snapshot
An overview of constraint-based path selection algorithms for QoS routing
inferred← citeshttps://doi.org/10.1109/milcom.2008.4753405openalex-snapshot
Network design approaches and tradeoffs in QoS route selection with diverse objectives and constraints
inferred← citeshttps://doi.org/10.1109/milcom.2018.8599828openalex-snapshot
Loop-Free Integrated Forwarding and Routing with Gradients
inferred← citeshttps://doi.org/10.1109/mnet.2004.1337731openalex-snapshot
Performance evaluation of constraint-based path selection algorithms
inferred← citeshttps://doi.org/10.1109/niss.2009.174openalex-snapshot
Distraction-Free Service in Pervasive Environments Based on Multi-constrained QoS Routing
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/pimrc.2004.1370851openalex-snapshot
QoS routing using lower layer information in ad hoc networks
inferred← citeshttps://doi.org/10.1109/qshine.2005.57openalex-snapshot
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
inferred← citeshttps://doi.org/10.1109/secon.2010.5508266openalex-snapshot
Multi-Constrained Anypath Routing in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/sibcon.2016.7491669openalex-snapshot
About one of the methods for solving problems in QoS routing
inferred← citeshttps://doi.org/10.1109/skg.2005.94openalex-snapshot
Multi-Phenotype Genetic Algorithm for Multi-Constrained QoS Routing
inferred← citeshttps://doi.org/10.1109/snpd.2011.43openalex-snapshot
Reliable and Delay-Efficient Routing Algorithm in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tbc.2012.2198970openalex-snapshot
Novel End-to-End Quality of Service Provisioning Algorithms for Multimedia Services in Virtualization-Based Future Internet
inferred← citeshttps://doi.org/10.1109/tc.2006.109openalex-snapshot
QoS routing in communication networks: approximation algorithms based on the primal simplex method of linear programming
inferred← citeshttps://doi.org/10.1109/tc.2006.67openalex-snapshot
Approximation algorithms for multiconstrained quality-of-service routing
inferred← citeshttps://doi.org/10.1109/tc.2007.1016openalex-snapshot
Multiconstrained QoS Routing: A Norm Approach
inferred← citeshttps://doi.org/10.1109/tc.2013.54openalex-snapshot
Bidirectional Multi-Constrained Routing Algorithms
inferred← citeshttps://doi.org/10.1109/tcc.2017.2721401openalex-snapshot
Service Chaining for Hybrid Network Function
inferred← citeshttps://doi.org/10.1109/tcomm.2006.878832openalex-snapshot
Enhancing /spl epsiv/-approximation algorithms with the optimal linear scaling factor
inferred← citeshttps://doi.org/10.1109/tetc.2015.2428654openalex-snapshot
QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm
inferred← citeshttps://doi.org/10.1109/tmc.2010.148openalex-snapshot
Distributed Fault-Tolerant Quality of Wireless Networks
inferred← citeshttps://doi.org/10.1109/tmc.2012.158openalex-snapshot
MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/tnet.2004.836112openalex-snapshot
Concepts of Exact QoS Routing Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2005.850222openalex-snapshot
Reliability constrained routing in QoS networks
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/tnsm.2018.2865204openalex-snapshot
A Constrained Shortest Path Scheme for Virtual Network Service Management
inferred← citeshttps://doi.org/10.1109/tnsm.2020.3036926openalex-snapshot
Necklace: An Architecture for Distributed and Robust Service Function Chains With Guarantees
inferred← citeshttps://doi.org/10.1109/tpds.2007.1055openalex-snapshot
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
inferred← citeshttps://doi.org/10.1109/tpwrd.2008.2002966openalex-snapshot
Quality-of-Service Considerations in Utility Communication Networks
inferred← citeshttps://doi.org/10.1109/vetecf.2002.1040429openalex-snapshot
An efficient heuristic algorithm for multi-constrained path problems
inferred← citeshttps://doi.org/10.1109/wicom.2009.5301853openalex-snapshot
A Multi-Constrained Quality of Service Routing Algorithm Based on Vector Converting
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.1117/12.571720openalex-snapshot
A novel bandwidth allocation scheme for QoS routing in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1142/s0218843008001865openalex-snapshot
EFFICIENT APPROACH FOR WEB SERVICES SELECTION WITH MULTI-QoS CONSTRAINTS
inferred← citeshttps://doi.org/10.1145/1185373.1185392openalex-snapshot
Multi-constrained soft-QoS provisioning in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1185373.1185420openalex-snapshot
A distributed approach for multi-constrained path selection and routing optimization
inferred← citeshttps://doi.org/10.1145/2393216.2393245openalex-snapshot
Exploring routing with multiple Quality of Service parameters in High-Speed Networks
inferred← citeshttps://doi.org/10.1145/2656864.2656865openalex-snapshot
Guaranteeing end-to-end quality-of-service with a generic routing approach
inferred← citeshttps://doi.org/10.1145/2692385.2692390openalex-snapshot
Re-configuration in SOA-based adaptive driver assistance systems
inferred← citeshttps://doi.org/10.1145/3274284openalex-snapshot
Designing Green Communication Systems for Smart and Connected Communities via Dynamic Spectrum Access
inferred← citeshttps://doi.org/10.11591/ijece.v7i4.pp2261-2277openalex-snapshot
A Proposal for End-to-End QoS Provisioning in Software-Defined Networks
inferred← citeshttps://doi.org/10.1186/1687-1499-2014-78openalex-snapshot
EigenTrust-based non-cooperative game model assisting ACO look-ahead secure routing against selfishness
inferred← citeshttps://doi.org/10.12720/jcm.11.2.126-131openalex-snapshot
A Fast Algorithm for the Optimal Constrained Path Routing in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.12720/jcm.11.8.733-739openalex-snapshot
A Fast Algorithm for Multicast Routing Subject to Multiple QoS Constrains in WMNs
inferred← citeshttps://doi.org/10.14257/ijfgcn.2016.9.9.09openalex-snapshot
An Approximation Scheme for Optimal Multicast Routing with Multiple QoS Constrains
inferred← citeshttps://doi.org/10.14257/ijsh.2016.10.10.09openalex-snapshot
A Multicast Routing Algorithm Based on Prior Objective Nodes
inferred← citeshttps://doi.org/10.2139/ssrn.5499250openalex-snapshot
Fully Polynomial Time Approximation Schemes for Finding Cheapest Deadline Paths
inferred← citeshttps://doi.org/10.25439/rmt.27354087openalex-snapshot
Enhanced SOAP Performance for low bandwidth environments
inferred← citeshttps://doi.org/10.25560/5870openalex-snapshot
Cross-layer design of multi-hop wireless networks
inferred← citeshttps://doi.org/10.2991/iccasm.2012.190openalex-snapshot
Genetic Simulated Annealing Algorithm for QoS Routing
inferred← citeshttps://doi.org/10.32657/10356/4120openalex-snapshot
Preemption and re-routing control strategy for resource provisioning and path selection in connection oriented networks
inferred← citeshttps://doi.org/10.3390/buildings14010213openalex-snapshot
Integrating Minimum Spanning Tree and MILP in Urban Planning: A Novel Algorithmic Perspective
inferred← citeshttps://doi.org/10.3390/fi8030038openalex-snapshot
A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs
inferred← citeshttps://doi.org/10.3390/s19040847openalex-snapshot
Minimum-Cost Offloading for Collaborative Task Execution of MEC-Assisted Platooning
inferred← citeshttps://doi.org/10.4018/978-1-4666-2136-7.ch029openalex-snapshot
QoS and Energy Saving Routing and MAC Mechanisms for Wireless Networks
inferred← citeshttps://doi.org/10.4018/978-1-59904-808-6.ch073openalex-snapshot
The Future of Digital Game-Based Learning
inferred← citeshttps://doi.org/10.4018/978-1-59904-885-7.ch175openalex-snapshot
The Quality of Service Issue in Virtual Environments
inferred← citeshttps://doi.org/10.4018/978-1-60960-195-9.ch118openalex-snapshot
The Quality of Service Issue in Virtual Environments
inferred← citeshttps://doi.org/10.4018/978-1-60960-195-9.ch807openalex-snapshot
The Future of Digital Game-Based Learning
inferred← citeshttps://doi.org/10.4018/978-1-61520-771-8.ch007openalex-snapshot
QoS and Energy Saving Routing and MAC Mechanisms for Wireless Networks
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.197.649openalex-snapshot
Rechargeable Sensor Energy Maintenance Scheme in the Internet of Things
inferred← citeshttps://doi.org/10.4108/simutools.2009.5664openalex-snapshot
Efficient Cross-Layer Simulator for Performance Evaluation of Wireless Mesh Networks
inferred← citeshttps://doi.org/10.4156/jnit.vol1.issue2.4openalex-snapshot
Multi-Constrained QoS Routing for Distraction-free Service in Pervasive Environment
inferred← citeshttps://doi.org/10.4304/jcp.5.9.1322-1334openalex-snapshot
A Robust GA-based QoS Routing Algorithm for Solving Multi-constrained Path Problem
inferred← citeshttps://doi.org/10.4304/jnw.7.1.73-80openalex-snapshot
Performance Evaluation of Efficient Solutions for the QoS Unicast Routing
inferred← citeshttps://doi.org/10.48550/arxiv.1603.01708openalex-snapshot
Technique Report: Near-Optimal Routing Protection for SDN Networks Using Distributed Markov Approximation
showing the first 200 of 202 · page through all 202
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.