A Distributed Routing Algorithm for Networks with Data-Path Services

Title: A Distributed Routing Algorithm for Networks with Data-Path Services

Authors: Xin Huang, Sivakumar Ganapathy and Tilman Wolf

Abstract: Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.

Published: Xin Huang, Sivakumar Ganapathy, and Tilman Wolf, “A distributed algorithm for network service placement,” in Proc. of Seventeenth IEEE International Conference on Computer Communications and Networks (ICCCN), St. Thomas, USVI, Aug. 2008.

Download: PDF

BibTeX:
@inproceedings{Huang:DAN08,
  author = {Huang, Xin and Ganapathy, Sivakumar and Wolf, Tilman},
  title = {A Distributed Algorithm for Network Service Placement},
  booktitle = {Proc. of Seventeenth IEEE International Conference on Computer Communications and Networks (ICCCN)},
  year = 2008,
  pages = {},
  address = {St. Thomas, USVI},
  month = aug
}

Copyright: © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.