Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic to...

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a netwo...

The contribution of this paper is to analyse the role of network interdependencies in a dynamic panel data model for German internal migration fl ows since re-unifi cation. So far, a capacious account of spatial patterns in German migration data is still missing in the empirical literature. In the context of this paper, network dependencies are associated with correlations of migration fl ows s...

The present paper surveys important results in the theory of network flows which are not included in the book "Flows in Networks" by Ford and Fulkerson. The survey is divided into three areas: 1. Shortest paths and minimal cost flows, 2. Multi-terminal flows, 3. Multi-commodity flows.

Network throughput increase is usually associated with replacement of communication links and appropriate network devices. However it is necessary to bear in mind that effective and less intrusive increase of network throughput can be achieved via the improvement of existing protocol stack, mostly at network and transport layer. In this paper we propose an advanced notification system for TCP c...

Next-generation Grids will require flexible and adaptive network infrastructures that would be able to provide the requisite quality of service for computational flows. We discuss a mechanism where network flows are tagged with network context information, triggering dynamic network services, including QoS and adaptation services. An incremental deployment strategy and some initial results are ...

Congestion management (avoidance and control) is a set of mechanisms used to prevent network congestion and assist in the recovery from it. The constant growth of the Internet many congestion control mechanisms have been proposed and some of them implemented on the global Net. Most modifications to the original TCP protocol have faired rather well and have preserved the scalability and the stab...

——This paper presents ongoing results on the combination of ad-hoc network routing algorithms along with network coding to optimize the throughputs of multi-flows. After the presentation of the principle of the multi-flows route codetermination, the paper describes an optimization in terms of delegated nodes to extend the topologies the optimization may be applied to. Results on specific and ra...