On the public citation graph

Replicated Server Placement with QoS Constraints

0 signed · 78 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.1002/net.10080openalex-snapshot
The facility location problem with general cost functions
inferredcites →https://doi.org/10.1006/jagm.2000.1100openalex-snapshot
Analysis of a Local Search Heuristic for Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-45748-8_29openalex-snapshot
Dynamic Replica Placement for Scalable Content Delivery
inferredcites →https://doi.org/10.1007/3-540-45866-2_22openalex-snapshot
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network
inferredcites →https://doi.org/10.1007/3-540-48777-8_8openalex-snapshot
Improved Approximation Algorithms for Capacitated Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1007/978-0-387-35388-3_28openalex-snapshot
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
inferredcites →https://doi.org/10.1007/978-3-540-24777-7openalex-snapshot
Knapsack Problems
inferredcites →https://doi.org/10.1007/978-3-540-30573-6_16openalex-snapshot
Replicated Server Placement with QoS Constraints
inferredcites →https://doi.org/10.1007/978-3-662-04245-8openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1016/s0167-6377(01)00069-4openalex-snapshot
A simple efficient approximation scheme for the restricted shortest path problem
inferredcites →https://doi.org/10.1016/s1389-1286(01)00222-5openalex-snapshot
Hop-by-hop quality of service routing
inferredcites →https://doi.org/10.1016/s1389-1286(03)00286-xopenalex-snapshot
Efficient QoS routing
inferredcites →https://doi.org/10.1093/comjnl/44.5.329openalex-snapshot
Optimal Placement of Web Proxies for Replicated Web Servers in the Internet
inferredcites →https://doi.org/10.1093/comjnl/46.4.378openalex-snapshot
Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
inferredcites →https://doi.org/10.1109/90.879344openalex-snapshot
The cache location problem
inferredcites →https://doi.org/10.1109/asap.1994.331794openalex-snapshot
A sparse knapsack algo-tech-cuit and its synthesis
inferredcites →https://doi.org/10.1109/infcom.1999.752146openalex-snapshot
On the optimal placement of web proxies in the Internet
inferredcites →https://doi.org/10.1109/infcom.2001.916655openalex-snapshot
On the placement of Web server replicas
inferredcites →https://doi.org/10.1109/infcom.2001.916684openalex-snapshot
Constrained mirror placement on the Internet
inferredcites →https://doi.org/10.1109/infcom.2004.1356969openalex-snapshot
On replica placement for QoS-aware content distribution
inferredcites →https://doi.org/10.1109/sfcs.2001.959907openalex-snapshot
Facility location with nonuniform hard capacities
inferredcites →https://doi.org/10.1109/tpds.2004.1264807openalex-snapshot
The minimal cost distribution tree problem for recursive expiration-based consistency management
inferredcites →https://doi.org/10.1109/tpds.2004.1278100openalex-snapshot
Minimal cost replication of dynamic web contents under flat update delivery
inferredcites →https://doi.org/10.1109/tpds.2006.145openalex-snapshot
Replicated Server Placement with QoS Constraints
inferredcites →https://doi.org/10.1137/s0097539703405754openalex-snapshot
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
inferredcites →https://doi.org/10.1145/306225.306238openalex-snapshot
Selection algorithms for replicated Web servers
inferredcites →https://doi.org/10.1145/375827.375845openalex-snapshot
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
inferredcites →https://doi.org/10.1145/380752.380755openalex-snapshot
Local search heuristic for k-median and facility location problems
inferredcites →https://doi.org/10.1145/633025.633043openalex-snapshot
Replication strategies in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/950620.950621openalex-snapshot
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
inferredcites →https://doi.org/10.1145/964725.633043openalex-snapshot
Replication strategies in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1201/9781420035179-54openalex-snapshot
LEDA, a Platform for Combinatorial and Geometric Computing
inferredcites →https://doi.org/10.1287/moor.17.1.36openalex-snapshot
Approximation Schemes for the Restricted Shortest Path Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11753810_61openalex-snapshot
Managing Traffic Demand Uncertainty in Replica Server Placement with Robust Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-3296-8_13openalex-snapshot
Improving Cloud Performance with Router-Based Filtering
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_26openalex-snapshot
Comparison of Access Policies for Replica Placement in Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04125-9_57openalex-snapshot
Networks Consolidation through Soft Computing
inferred← citeshttps://doi.org/10.1007/s10479-013-1330-7openalex-snapshot
Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
inferred← citeshttps://doi.org/10.1007/s10922-020-09521-4openalex-snapshot
A GRASP-Based Approach for Dynamic Cache Resources Placement in Future Networks
inferred← citeshttps://doi.org/10.1007/s11276-012-0430-7openalex-snapshot
Proactive data dissemination to mission sites
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2017.06.011openalex-snapshot
Towards an improved heuristic genetic algorithm for static content delivery in cloud storage
inferred← citeshttps://doi.org/10.1016/j.eswa.2008.06.023openalex-snapshot
A parallel dual-type algorithm for a class of quadratic programming problems and applications
inferred← citeshttps://doi.org/10.1093/comjnl/bxx074openalex-snapshot
Algorithms for Replica Placement and Update in Tree Network
inferred← citeshttps://doi.org/10.1109/.2006.1629446openalex-snapshot
Monitor Placement for Stepping Stone Analysis
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.40openalex-snapshot
Fast Replica Placement and Update Strategies in Tree Networks
inferred← citeshttps://doi.org/10.1109/comst.2016.2626384openalex-snapshot
A Survey on Replica Server Placement Algorithms for Content Delivery Networks
inferred← citeshttps://doi.org/10.1109/cssim.2009.12openalex-snapshot
Computer Network Redesign through Clusters Consolidation and OPNET Modeler
inferred← citeshttps://doi.org/10.1109/fit.2012.67openalex-snapshot
Server Replication in Multicast Networks
inferred← citeshttps://doi.org/10.1109/icadiwt.2009.5273883openalex-snapshot
Modeling and simulation of network redesign through clusters consolidation
inferred← citeshttps://doi.org/10.1109/icc.2014.6883582openalex-snapshot
Joint optimization of cache server deployment and request routing with cooperative content replication
inferred← citeshttps://doi.org/10.1109/icc40277.2020.9149318openalex-snapshot
On the Optimization of Multi-Cloud Virtualized Radio Access Networks
inferred← citeshttps://doi.org/10.1109/iccaie.2010.5735044openalex-snapshot
Optimized capacity planning and performance measurement through OPNET Modeler
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195782openalex-snapshot
Intra-cloud lightning: Building CDNs in the cloud
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524535openalex-snapshot
TailCutter: Wisely cutting tail latency in cloud CDN under cost constraints
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486243openalex-snapshot
FluidRAN: Optimized vRAN/MEC Orchestration
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370331openalex-snapshot
Strategies for Replica Placement in Tree Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2012.95openalex-snapshot
Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks
inferred← citeshttps://doi.org/10.1109/sahcn.2009.5168964openalex-snapshot
Proactive Data Dissemination to Mission Sites
inferred← citeshttps://doi.org/10.1109/tcc.2020.2974948openalex-snapshot
A Dynamic Deep-Learning-Based Virtual Edge Node Placement Scheme for Edge Cloud Systems in Mobile Environment
inferred← citeshttps://doi.org/10.1109/tdsc.2013.12openalex-snapshot
A Cloud-Oriented Content Delivery Network Paradigm: Modeling and Assessment
inferred← citeshttps://doi.org/10.1109/tmm.2008.2004930openalex-snapshot
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
inferred← citeshttps://doi.org/10.1109/tnet.2019.2926142openalex-snapshot
TailCutter: Wisely Cutting Tail Latency in Cloud CDNs Under Cost Constraints
inferred← citeshttps://doi.org/10.1109/tnsm.2014.2346956openalex-snapshot
Energy Management in Cross-Domain Content Delivery Networks: A Theoretical Perspective
inferred← citeshttps://doi.org/10.1109/tpds.2008.25openalex-snapshot
Replica Placement and Access Policies in Tree Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.287openalex-snapshot
Practical Resource Provisioning and Caching with Dynamic Resilience for Cloud-Based Content Distribution Networks
inferred← citeshttps://doi.org/10.1109/tpds.2019.2960018openalex-snapshot
Decentralized Utility- and Locality-Aware Replication for Heterogeneous DHT-Based P2P Cloud Storage Systems
inferred← citeshttps://doi.org/10.1109/tr.2026.3730404openalex-snapshot
Resource Placement With Maximal Vertex-Disjoint Path Connectivity
inferred← citeshttps://doi.org/10.1109/twc.2020.3040791openalex-snapshot
An Optimal Deployment Framework for Multi-Cloud Virtualized Radio Access Networks
inferred← citeshttps://doi.org/10.1145/3148149openalex-snapshot
Auto-Scaling Web Applications in Clouds
inferred← citeshttps://doi.org/10.1287/mnsc.2023.4835openalex-snapshot
Shipment Consolidation with Multiple Shipping Methods Under Nonlinear Cost Structures
inferred← citeshttps://doi.org/10.1561/0100000104openalex-snapshot
Cache Optimization Models and Algorithms
inferred← citeshttps://doi.org/10.26686/wgtn.20099645openalex-snapshot
Location-Aware Application Deployment in Multi-Cloud
inferred← citeshttps://doi.org/10.31274/rtd-180813-16789openalex-snapshot
Techniques in placing network monitors
inferred← citeshttps://doi.org/10.4108/eai.13-7-2017.2270269openalex-snapshot
Software-Defined Live Video Delivery Networks with Device-to-Device Communications
inferred← citeshttps://doi.org/10.48550/arxiv.1609.09224openalex-snapshot
Auto-scaling Web Applications in Clouds: A Taxonomy and Survey
inferred← citeshttps://doi.org/10.70675/a0ae87f7z066ez42ffzb79bzd73a142d4c07openalex-snapshot
On models for performance evaluation and cache resources placement in multi-cache networks
showing the first 43 of 44 · page through all 44
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.