This paper introduces a new class of Bayesian dynamic models for inference and forecasting in high-dimensional time series observed on networks. The new model, called the dynamic chain graph model, is suitable for multivariate time series which exhibit symmetries within subsets of series and a causal drive mechanism between these subsets. The model can accommodate high-dimensional, non-linear a...

FCS networks are presented with a new transport layer mechanism that, for transmitting multimedia, is markedly superior to transmission over UDP or TCP. SCTP's multistreaming provides an aggregation mechanism for transferring different objects belonging to the same logical application session; however, sharing the congestion state among the streams precludes efficient stream prioritization. We ...

In this paper, we propose an efficiency/performance measure for dynamic networks, which have been modeled as evolutionary variational inequalities. Such applications include the Internet. The measure, which captures demands, flows, and costs/latencies over time, allows for the identification of the importance of the nodes and links and their rankings. We provide both continuous time and discret...

We study capacitated network flow problems with demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets, because these are equivalent to the problem of finding a shortest path in an infinite directed network. We derive necessary and suffi...

We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets since these are equivalent to the problem of finding a shortest infinite path in an infinite directed network. We derive ...

We present a dynamic and self-organized flow monitoring framework in Wireless Mesh Networks. An algorithmic mechanism that allows for an autonomic organization of the probes plane is investigated, with the goal of monitoring all the flows in the backbone of the mesh network accurately and robustly, while minimizing the overhead introduced by the monitoring architecture. The architecture of the ...

We consider the following issues related to robust network routing in a highly dynamic and changing traffic environment: What network routing should an Internet Service Provider use so as to (i) accommodate users demanding “good” service while being unpredictable in the traffic that they would like to send to different destinations, (ii) minimize the amount of “overprovisioning” that needs to b...

Recent progress in communication technologies leads to new networks architectures and new developments of distributed multimedia applications. Multimedia data are characterised by high throughputs, continuous flows with temporal constraints and synchronisation requirements to ensure their presentation coherence. Actual communication networks can not provide all of these services together (high ...