Capacity Assignment Problems
Pablo Pavón‐Mariño · 2016
This chapter is devoted to capacity assignment problems in two contexts: (i) long-term capacity planning where link capacities are upgraded, for example every 6 months to match a forecasted traffic growth, (ii) fast capacity allocation in wireless networks, where capacities are updated at a subsecond rate to adapt to varying network conditions by adjusting transmission power or access probabilities in medium access control. Several case studies are analyzed. In the long-term planning we provide a closed formula for the minimum congestion capacities with concave link costs; thanks to a previous problem convexification, the minimum cost planning under modular capacities and the joint routing and capacity optimization exploiting forecasts spanning multiple upgrade periods. In the fast capacity adjustment scope, we model with convex programs the persistence probability optimization in Aloha-like random access networks, the backoff window sizes in CSMA medium access controls, and the transmission power adjustment in cellular networks.