Publication

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Thomas Rothvoss, Laura Sanità
2011
Journal paper

Abstract

The virtual private network problem (VPN) models scenarios in which traffic is uncertain or rapidly changing. The goal is supporting at minimum cost a given family of traffic matrices, which are implicitly given by upper bounds on the ingoing and outgoing traffic at each node. Costs are classically defined by a linear function (linear VPN), but we consider here also the more general case of concave increasing costs (concave VPN).

Official source

https://infoscience.epfl.ch/record/171405?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Graph Chatbot

Chat with Graph Search

Matrix recovery from bilinear and quadratic measurements

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction

The VPN problem with concave costs

Matrix recovery from bilinear and quadratic measurements

The VPN problem with concave costs

Cooperative Data Exchange with Weighted Cost based on d-Basis Construction