Configuring Sessions in Programmable Networks

Title: Configuring Sessions in Programmable Networks

Authors: Sumi Choi, Jonathan Turner, and Tilman Wolf

Abstract: The provision of advanced computational services within networks is rapidly becoming both feasible and economical. We present a general approach to the problem of configuring application sessions that require intermediate processing by showing how the session configuration problem can be transformed to a conventional shortest path problem for unicast sessions or to a conventional Steiner tree problem for multicast sessions. We show, through a series of examples, that the method can be applied to a wide variety of different situations.

Published: Sumi Y. Choi, Jonathan S. Turner, and Tilman Wolf, "Configuring sessions in programmable networks," in Proc. of the Twentieth IEEE Conference on Computer Communications (INFOCOM), Anchorage, AK, Apr. 2001, pp. 60-66.

Download: PDF

BibTeX:
@inproceedings{Choi:CSP01,
   author    = {Choi, Sumi Y. and Turner, Jonathan S. and Wolf, Tilman},
   title     = {Configuring Sessions in Programmable Networks},
   booktitle = {Proc. of the Twentieth IEEE Conference on Computer Communications (INFOCOM)},
   year      = 2001,
   month     = apr,
   address   = {Anchorage, AK},
   pages     = {60--66}
}

Copyright: © 2001 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.