There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the cont...

This study proposes a framework for the empirical research of cross-border innovation networks dealing with network characteristics, resource and information flows, and decision-making concerning technological innovations. The authors develop a conceptual model that relates network properties, flows of knowledge, and tangible resources with the likelihood of a decision on open innovation, close...

A large class of networks is able to provide some guarantees in terms of quality of service, end-to-end delays and throughput to data flows. In return, the data flows must verify constraints of burstiness and throughput. The aim of this work is to introduce and evaluate the network coding for independent flows in such networks. First, we present efficient coding nodes strategies allowing the bu...

Wireless network performance is much restricted by the unreliability of the wireless channel and the competition among different flows for the shared network resources such as the bandwidth. Network coding is a technique that exploits the broadcast of the wireless channel and can effectively address these two restrictions to improve network performance. For example, with network coding, an inte...

Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-commodity setting: Given a directed network with flows of different commodities, how can the capacity of some commodities be increased, without re...

In both transportation and communication networks we are faced with “selfish flows”, where every agent sending flow over the network desires to get it to its destination as soon as possible. Such flows have been well studied in time-invariant networks in the last few years. A key observation that must be taken into account in defining and studying selfish flow, however, is that a flow can take ...

Recently, mobile networks have been overloaded with a considerable amount of data traffic. The current paper proposes a management service for mobile environments, using policies and quality metrics, which ensure a better usage of network resources with a more fine-grained management based on flows with different classes of service and transmission rates. This management of flows is supported t...

We develop an end-to-end model for packet inter-arrival times of flows in the Internet. Our model illustrates that under asymptotic conditions of high network utilization, (1) packet inter-arrival times of flows become heavy-tailed after they traverse a large number of hops, and (2) the aggregate of such flows is a long-range dependent self-similar process. We validate our model through extensi...