In the design of wire-based networks, the implementation of infrastructure is a major cost component. One way to obtain cost savings is to coordinate trenching activities of different network operators, e.g., telecommunication providers may join forces with local communities when digging roads or pavements. In this work, the Multi-Commodity Cable Trench Problem (MC-CTP) is introduced that aims ...

This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logar...

We propose a new type of optical fiber called homogeneous multi-core fiber (MCF) to drastically increase the transmission capacity of single fiber using the mode-division multiplexing. In this MCF, identical cores are closely arranged so that the cores are strongly coupled to each other to form coupled modes, each of which corresponds to a transmission channel. A novel mode multi/demultiplexer ...

The Internet has seen a proliferation of specialized middlebox devices that carry out crucial network functionality such as load balancing, packet inspection or intrusion detection, amongst others. Traditionally, high performance network devices have been built on custom multi-core, specialized memory hierarchies, architectures which are well suited to packet processing. Recently, commodity PC ...

Abstract. We address the two-commodity maximum flow problem on undirected networks. As a result of a change of variables, we introduce a new formulation that solves the problem through classical maximum flow techniques with only one-commodity. Therefore, a general strategy, based on this change of variables, is defined to deal with other undirected multi-commodity problems. Finally, we extend t...

We consider the problem of trajectory-based road pricing with the objective of reducing congestion on a road network. It is well-known that traffic conditions resulting from typical non-cooperative behavior of selfish drivers do not minimize total travel time spent on the road network. In the context of real-time GPS data collection from all vehicles, drivers can be charged differently based on...

In this study, we have concerned with a hierarchical logistic network design problem from two aspects that have been scarcely considered previously though they are very common in real-world. That is, to cope with a multi-commodity problem and a problem with stair-wised discount cost of transportation effectively as well as practically, we have developed the extended hybrid tabu search method fo...

The Multi-Commodity Capacitated Multi-facility Weber Problem (MCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers for K commodities with the minimum total transportation cost. The MCMWP is a non-convex optimization problem. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which de...