Network Optimization with Dynamic Demands and Link Prices

Loading...
Thumbnail Image

Date

2012

Journal Title

Journal ISSN

Volume Title

Publisher

Allerton Conference

Abstract

We present Overlapping Cluster Decomposition (OCD), a novel distributed algorithm for network optimization targeted for networks with dynamic demands and link prices. OCD uses a dual decomposition of the global problem into local optimization problems in each node’s neighborhood. The local solutions are then reconciled to find the global optimal solution. While OCD is a descent method and thus may converge slowly in a static network, we show that OCD can more rapidly adapt to changing network conditions than previously proposed first-order and Newton-like network optimization algorithms. Therefore, OCD yields better solutions over time than previously proposed methods at a comparable communication cost.

Description

Keywords

Computer Science

Citation

Stacy Patterson, Mike P. Wittie, Kevin Almeroth, and Bassam Bamieh. "Network Optimization with Dynamic Demands and Link Prices," in Allerton Conference Technical Program, 2012
Copyright (c) 2002-2022, LYRASIS. All rights reserved.