Work

Centralized network utility maximization over aggregate flows

Year: 2016

Type: conference-paper

Abstract: We study a network utility maximization (NUM) decomposition in which the set of flow rates is grouped by source-destination pairs. We develop theorems for both single-path and multipath cases, which relate an arbitrary NUM problem involving all flow rates to a simpler problem involving only the aggregate rates for each source-destination pair. The optimal aggregate flows are then apportioned among the constituent flows of each pair. This apportionment is simple for the case of a-fair utility functions. We also show how the decomposition can be implemented with the alternating direction method of multipliers (ADMM) algorithm.

Source: International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

DOI: 10.1109/wiopt.2016.7492926

Authors: Riten Gupta, Lieven Vandenberghe, Mario Gerla

Institutions: UtopiaCompression (United States), University of California, Los Angeles

Language: English

Topic: Network Traffic and Congestion Control

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2423722777

FWCI: 1.424

Cites: 24

Cited by: 9

Related to: 10