Backend
Impact of Security Modeling Fidelity on Hyperscale Data Center Hosting Capacity Assessment
arXiv eess.SY0 views
arXiv:2610.18405v1 Announce Type: new Abstract: This paper assesses hyperscale data center hosting capacity in transmission grids. Hosting capacity (HC) analysis quantifies the maximum additional load a bus can accommodate without violating operational constraints. This paper defines data center HC as the maximum time-invariant active power demand at a single target bus over a 24-hour peak-day horizon, and evaluates it under four models of increasing fidelity (i.e., the extent to which the model enforces real-world operational security requirements) on the modified IEEE 24-bus system: (i) DC optimal power flow (DC-OPF) without unit commitment (UC), (ii) basic SCUC (security-constrained unit commitment) without reliability constraints, (iii) SCUC with spinning reserve, and (iv) N-SCUC with both reserve and branch-contingency security. Comparing these models quantifies the impact of unit commitment, reserve requirements, and N-1 security on bus-level HC estimates. The N-SCUC yields an average HC of 444 MW; omitting N-1 security raises this to 532 MW, a 19.8% overestimation. The DC-OPF and basic SCUC models further overestimate HC, indicating a trade-off between model complexity and estimation accuracy.
Source:https://arxiv.org/abs/2610.18405PreviousImpact of Data Center Load on Co-Optimized Generation and Transmission Expansion Planning with Embedded Unit CommitmentNextEvidence-Governed Deployment Readiness for Networked Agents on Industrial OT Infrastructure
Related posts
DeepSeek's Open-Source "Super-Agent" Codes Without Being Asked
0dev.to GitHub
All-in-one platform or a stack you assemble? Where do coaches and educators land?
0dev.to Discuss
I Wanted to Live on Coruscant. PAT Scared Me. Now My Alexa Lives on Mute.
0dev.to Discuss
Detect What You Can Name: PaliGemma 2 Object Detection with Transformers
0dev.to Machine Learning
When Should an LLM Router Stop Being Sticky? llm-d 1.0 Cache-Affinity Routing, Break-Even Math, and a Simulation
0dev.to Machine Learning

Understanding HackerTube: Karpathy’s Two-Hour Experiment in Better Recommendations
0dev.to Machine Learning