Congestion Minimization for Service Chain Routing Problems With Path Length Considerations

Network function virtualization (NFV), with its perceived potential to accelerate service deployment and to introduce flexibility in service provisioning, has drawn a growing interest from industry and academia alike over the past few years. One of the key challenges in realizing NFV is the service chain routing problem, whereby traffic must be routed so as to traverse the various components of a network service that have been mapped onto the underlying network. In this work, we consider the online service chain routing problem. We route the service chain with the goal of jointly minimizing the maximum network congestion and the number of hops from the source to the destination. To this end, we present a simple yet effective online algorithm in which the routing decision is irrevocably made without prior knowledge of future requests. We prove that our algorithm is <inline-formula> <tex-math notation="LaTeX">$O(\log m)$ </tex-math></inline-formula>-competitive in terms of congestion minimization, where <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> is the number of edges of the underlying network topology, and we show that this ratio is asymptotically optimal.