Maximum flow in buffer-limited delay tolerant networks. The static approach

Abstract

Delay Tolerant Networks (DTNs), such as Internet, ad hoc networks, satellite networks and sensor networks, have attracted considerable attention. The maximum flow problem has a vital importance for routing and service scheduling in networks. For delay tolerant networks there are no permanent end-to-end paths since the topology and links characteristics are time-varying. In these instances, to account properly for the evolution of the underlying system over time, we need to use dynamic network now models. When time is considered as a discrete variable, these problems can be solved by constructing an equivalent static time expanded network. This is a static approach. In this paper we study the maximum flow in a buffer-limited delay tolerant network, with static approach.