vix.ing · top · new · best · stats · spec

Variability Aware Network Utility Maximization

2011/11/16 by Vinay Joseph, Joseph, Vinay, Gustavo de Veciana +1
Computer Science · Social Sciences · #Advanced Computing and Algorithms #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Network Security and Intrusion Detection #Networking and Internet Architecture (cs.NI) #Optimization and Control (math.OC) #Software System Performance and Reliability #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1111.3728

openalex publication_date 2011/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

Network Utility Maximization (NUM) provides the key conceptual framework to study resource allocation amongst a collection of users/entities across disciplines as diverse as economics, law and engineering. In network engineering, this framework has been particularly insightful towards understanding how Internet protocols allocate bandwidth, and motivated diverse research on distributed mechanisms to maximize network utility while incorporating new relevant constraints, on energy/power, storage, stability, etc., for systems ranging from communication networks to the smart-grid. However when the available resources and/or users' utilities vary over time, a user's allocations will tend to vary, which in turn may have a detrimental impact on the users' utility or quality of experience. This paper introduces a generalized NUM framework which explicitly incorporates the detrimental impact of temporal variability in a user's allocated rewards. It explicitly incorporates tradeoffs amongst the mean and variability in users' allocations. We propose an online algorithm to realize variance-sensitive NUM, which, under stationary ergodic assumptions, is shown to be asymptotically optimal, i.e., achieves a time-average equal to that of an offline algorithm with knowledge of the future variability in the system. This substantially extends work on NUM to an interesting class of relevant problems where users/entities are sensitive to temporal variability in their service or allocated rewards.

Related