Asymptotically Optimal Cross-Layer Schemes for Relay Networks with Short-Term and Long-Term Constraints

摘要: Convex optimization and dual decomposition have been successfully used to design cross-layer resource allocation algorithms for cellular access networks. However, less effort has devoted optimal systems equipped with relay stations. Presence of stations renders the schemes more difficult requires consideration additional constraints. The present paper relies on a sum-utility constrained maximization framework that guarantee diverse quality service (QoS) consider different forwarding strategies at One main challenges in is joint both long-term (elastic) short-term (real-time) Such constraints account delay QoS requirements strategies. A two-step methodology proposed efficiently deal this challenge. Specifically, each time instant it applies: a) an approximate online method estimate multipliers corresponding primal variables (resources), b) classical iterative calculate variables. Our approach incurs arbitrarily small loss optimality, can accommodate static fading channels.