Configuring sessions in programmable networks

Authors:
Sumi Choi;Jonathan Turner;Tilman Wolf
Affiliations:
Department of Computer Science and Engineering, Campus Box 1045, Washington University, St. Louis, MO;Department of Computer Science and Engineering, Campus Box 1045, Washington University, St. Louis, MO;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 6
Cited 5

Steiner problem in networks: a survey

Networks
Introduction to algorithms

Introduction to algorithms
A survey of programmable networks

ACM SIGCOMM Computer Communication Review
Darwin: Customizable Resource Management for Value-Added Network Services

ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
A survey of active network research

IEEE Communications Magazine
A scalable high-performance active network node

IEEE Network: The Magazine of Global Internetworking

Adaptive content networking

ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Exploiting distributed object technology for the design of net-centric services

ICCOM'05 Proceedings of the 9th WSEAS International Conference on Communications
Evaluating algorithms for composable service placement in computer networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments

Journal of Parallel and Distributed Computing
Can Future Internet be based on constrained networks design principles?

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

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 study both a capacity-constrained version of the problem and an unconstrained version and show, through a series of examples, that the method can be applied to a wide variety of different situations. Particularly, we show how to extend Dijkstra's shortest path algorithm for use on the constrained version, and show that this approach can make significantly better use of network resources.