This paper proposes a new Multiobjective Genetic Algorithm (MOGA) approach for Bicriteria Network Design (BND) Problem. The objectives are to maximize flow and minimize cost. The proposed method adopts priority-based encoding method to represent a path in the network. Different from other encoding methods, such as path oriented encoding method, priority-based encoding method can be applied for ...

This paper is dedicated to network synthesis problems with non-simultaneous single commodity ow requirements. An analysis of the complexity of these problems is presented, and new results are proposed. We mainly study the line restoration application since the multi-hour application was already widely covered in the literature. We concentrate on a particular case with uniform costs and requirem...

Network traffic control is the process of managing, prioritizing, controlling or reducing the network traffic by the network scheduler. High utilization of link bandwidth is very significant for network control and maintenance in Software-Defined Networking (SDN). When we get the accurate link bandwidth predictions for T time periods of the future in a specific network topology, the residual li...

This paper presents an algorithm to obtain near optimal solutions for the Steiner tree problem in graphs. It is based on a Lagrangian relaxation of a multi-commodity flow formulation of the problem. An extension of the subgradient algorithm, the volume algorithm, has been used to obtain lower bounds and to estimate primal solutions. It was possible to solve several difficult instances from the ...

VPN service providers (VSP) and IP-VPN customers have traditionally maintained service demarcation boundaries between their routing and signaling entities. This has resulted in the VPNs viewing the VSP network as an opaque entity and therefore limiting any meaningful interaction between the VSP and the VPNs. A key challenge is to expose each VPN to information about available network resources ...

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity i ∈ {1,2} can be split into a bounded number ki of equally-sized chunks that can be routed on different paths. We show that in contrast to the single-commodity case this problem is NP-hard, and hard to approximate to within a factor of α > 1/2. We present a polynomial ti...

The archiving of Internet traffic is an essential function for retrospective network event analysis and forensic computer communication. The state-of-the-art approach for network monitoring and analysis involves storage and analysis of network flow statistic. However, this approach loses much valuable information within the Internet traffic. With the advancement of commodity hardware, in partic...

Network design problems arise in a wide range of applied areas including telecommunications, computer networks, and transportation. In this paper, we address the following discrete capacitated multi-terminal network design problem. Given a connected digraph G = (V,A), a set of L potential facilities to be installed on each arc, and a set ofKmulti-terminal (non-simultaneous) commodity flow requi...

A common challenge in current and future communication networks is to exploit path diversity to increase performance and reliability. This problem can be modeled as a multi-commodity flow problem [1]. Given a number of concurrent source-destination flows, the problem is to assign these flows to network paths, while respecting capacity constraints and optimizing a performance metric. Our goal is...