Publication at Faculty of Mathematics and Physics |
2010
Abstract
This paper describes formal models for various networking problems with the focus on data networks. In particular we describe how to model the path placement problems where the task is to select a path for each demand starting at some source node and finishing at the destination node.
The demands can be instantaneous, for example in data streaming, or spread in time in the so called bandwidth on demand problems.