Based on the previous research, a virtual network mapping algorithm with repeatable embedding over substrate nodes is summarized, in which, the virtual nodes in the same virtual network may be assigned to the same substrate node so that some virtual links don’t need to be mapped to reduce the substrate link costs and improve the mapping effectively. Additionally, in the link mapping process, pa...

In the concurrent multi-commodity flow problem, we are given a capacitated network G = (V,E) of switches V connected by links E, and a set of commodities K = {(si, ti, di)}. The objective is to maximize the minimum fraction λ of any demand di that is routed from source si to target ti. This problem has been studied extensively by the theory community in the sequential model (e.g., [4]) and in d...

In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method on several examples of NMNF problem and obtained...

This paper studies the single-path multicommodity network flow problem (SMNF), in which the flow of each commodity can only use one path linking its origin and destination in the network. We study two versions of this problem based on two different objectives. The first version is to minimize network congestion, an issue of concern in traffic grooming over wavelength division multiplexing (WDM)...

Two special and important network flow problems are the maximal flow problem and the shortest path problem. Both of these problems can be solved by either the network simplex method of Chapter 9 or the out-of-kilter algorithm of Chapter 11. However, their frequent occurrence in practice and the specialized, more efficient procedures that can be developed for handling these two problems provide ...

The Virtual Network (VN) concept has been studied as a useful mean in supporting rapid service creation and deployment. In this research paper, we propose a scheme for allocating resource to VNs with the objective of maximizing the number of VNs that can be accommodated into the network. In our scheme, a set of resource is pre-allocated for each pair of edge nodes, according to the solution of ...

We consider a two-commodity multiroute maximum flow problem in an undirected network— a generalization of the standard two-commodity maximum flow problem. An efficient combinatorial algorithm, which always guarantees a quarter-integer solution when the capacities are integers, is devised to solve a special case based on a novel extension of the augmentingpath technique. Partial results are repo...

In this paper we introduce a new approach for controlling the topology of networks under interface constraints, along with routing the given traffic demands. Our approach is applicable to the situations in which each network node can form links with several potential neighbors. We formulate the routing problem as a multi-commodity flow problem for maximizing the throughput. We extend the multi-...

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

In classical network flow theory, flow being sent from a source to a destination may be split into a large number of chunks traveling on different paths through the network. This effect is undesired or even forbidden in many applications. Kleinberg introduced the unsplittable flow problem where all flow traveling from a source to a destination must be sent on only one path. This is a generaliza...