Multi-commodity variable upper bound flow models

Designing Multi - Commodity Flow

The traditional multi-commodity ow problem assumes a given ow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity ow network-design problem: given a set of multi-commodity ow demands, nd a network subject to certain constraints such that the commodities can be maximally routed. This paper focuses on the case whe...

Polyhedral results on single node variable upper-bound flow models with allowed configurations

In this paper we investigate the convex hull of single node variable upper-bound flow models with allowed configurations. Such a model is defined by a set Xρ(Z) = {(x, z) ∈ Rn × Z | ∑n j=1 x jρd, 0 6 x j 6 u j z j , j = 1, . . . , n}, where ρ is one of 6, = or >, and Z ⊂ {0, 1}n consists of the allowed configurations. We consider the case when Z consists of affinely independent vectors. Under t...

Designing Multi-Commodity Flow Trees

Convex Multi-commodity Flow Routing

There are many problems related to the design of networks and accommodate demands from different users subject to some constraints on users’ quality of service (QoS) and fairness through the network. The problem of resource allocation and message routing plays a determinant role in the optimization of networks performance. Our work emphasizes the message routing problem in data networks, but it...

Designing Multi-Commodity Flow Trees

The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-desigu problem: given a set of multi-commodity flow demands, find a network subject to certain constraints such that the commodities can be maximally routed. This paper focuses on th...