With the advent of Network Function Virtualization (NFV), Physical Network Functions (PNFs) are gradually being replaced by Virtual Network Functions (VNFs) that are hosted on general purpose servers. Depending on the call flows for specific services, the packets need to pass through an ordered set of network functions (physical or virtual) called Service Function Chains (SFC) before reaching t...

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

In the Canadian Traveler Problem (CTP), a traveler seeks a shortest path to a destination through a road network, but unknown to the traveler, some roads may be blocked. This paper studies the Bayesian CTP (BCTP), in which road states are correlated with known prior probabilities and the traveler can infer the states of an unseen road from past observations of other correlated roads. As general...

Given a network modeled as a graph G with each link associated with a cost and k weights, the Constrained Shortest Path (CSP(k)) problem asks for computing a minimum cost path from a source node s to a target node t satisfying pre-specified bounds on path weights. This problem is NP-hard. In this paper we propose a new approximation algorithm called GEN-LARAC for CSP(k) problem based on Lagrang...

We study the generalized minimum Manhattan network (GMMN) problem: given a set $$P$$ of pairs points in Euclidean plane $${\mathbb{R}}^2$$ , we are required to find minimum-length geometric which consists axis-aligned segments and contains shortest path $$L_1$$ metric (a so-called path) for each pair . This problem commonly generalizes several NP-hard design problems that admit constant-factor ...