This work proposes a new modeling framework for jointly optimizing the charging network design and the logistic mobility planning for an electric vehicle fleet. Existing literature commonly assumes the existence of a single entity – the social planner, as a powerful decision maker who manages all resources. However, this is often not the case in practice. Instead of making this assumption, we specifically examine the innate non-cooperative nature of two different entities involved in the planning problem. Namely, they are the charging service provider (CSP) and the fleet operator (FO). To address the strategic interaction between entities, a bi-level mixed integer program is formulated, with the CSP/FO’s problem expressed in the upper/lower levels respectively, in a joint decision making process. These decisions involve the CSP’s infrastructure siting, sizing, substation capacity upgrades, the FO’s fleet composition, vehicle routing, charging, and delivery assignment. To solve the problem, an iterative fashion is adopted to solve and reach optimality. We conduct detailed numerical studies on a synthesized small network and the simulation results reveal the unique aspects of this two-entity framework. This modeling perspective can be generalized to other system design problems with two interacting agents planning and operating resources across networks.

The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large-scale settings with hundreds of nodes and thousands of flows. In this context, we propose a distributed algorithm based on the alternating direction method of multipliers (ADMM) that tackles the multi-path fair resource allocation problem in a distributed SDN control architecture. Our ADMM-based algorithm continuously generates a sequence of resource allocation solutions converging to the fair allocation while always remaining feasible, a property that standard primal-dual decomposition methods often lack. Thanks to the distribution of all computer intensive operations, we demonstrate that we can handle large instances at scale.

Software‐Defined Networking and Network Function Virtualization are two paradigms that offer flexible software‐based network management. Service providers are instantiating Virtualized Network Functions, for example, firewalls, DPIs, gateways—to highly facilitate the deployment and reconfiguration of network services with reduced time‐to‐value. They use Service Function Chaining technologies to dynamically reconfigure network paths traversing physical and virtual network functions. Providing a cost‐efficient virtual function deployment over the network for a set of service chains is a key technical challenge for service providers, and this problem has recently caught much attention from both Industry and Academia. In this article, we propose a formulation of this problem as an Integer Linear Program that allows one to find the best feasible paths and virtual function placement for a set of services with respect to a total financial cost, while taking into account the (total or partial) order constraints for Service Function Chains of each service and other constraints such as end‐to‐end latency, anti‐affinity rules between network functions on the same physical node and resource limitations in terms of network and processing capacities. Furthermore, we propose a heuristic algorithm based on a linear relaxation of the problem that performs close to optimum for large scale instances. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(2), 97–106 2018