Related papers: Algebraic modelling and performance evaluation of …
We demonstrate the modelling of opportunistic networks using the process algebra stochastic HYPE. Network traffic is modelled as continuous flows, contact between nodes in the network is modelled stochastically, and instantaneous decisions…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…
In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal…
Communities are a common and widely studied structure in networks, typically under the assumption that the network is fully and correctly observed. In practice, network data are often collected by querying nodes about their connections. In…
This paper studies theory and inference related to a class of time series models that incorporates nonlinear dynamics. It is assumed that the observations follow a one-parameter exponential family of distributions given an accompanying…
An abstract network approach is proposed for the description of the dynamics in reactive processes. The phase space of the variables (concentrations in reactive systems) is partitioned into a finite number of segments, which constitute the…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are…
In this paper, we consider first-order logic over unary functions and study the complexity of the evaluation problem for conjunctive queries described by such kind of formulas. A natural notion of query acyclicity for this language is…
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling…
We develop a probabilistic framework for global modeling of the traffic over a computer network. This model integrates existing single-link (-flow) traffic models with the routing over the network to capture the global traffic behavior. It…
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for…
The paper addresses the problem of calculating the noise-induced switching rates in systems with delay-distributed kernels and Gaussian noise. A general variational formulation for the switching rate is derived for any distribution kernel,…
Stochastic network calculus is the probabilistic version of the network calculus, which uses envelopes to perform probabilistic analysis of queueing networks. The accuracy of probabilistic end-to-end delay or backlog bounds computed using…
There are proposed models of contracts, technological equipment and gas networks and methods of their optimization. The flow in network undergoes restrictions of contracts and equipment to be operated. The values of sources and sinks are…
We perform network analysis of a system described by the master equation to estimate the lower bound of the steady-state current noise, starting from the level 2.5 large deviation function and using the graph theory approach. When the…
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…
Approximations for the mean performance indices for the M/G/c queue rely on the approximate computation of the probability that an arriving request has to wait for service and of the minimum of residual service times if all servers are…
We give a new approach to the study of statistical mechanical systems: algebraic topology is used to investigate the statistical distributions of stochastic currents generated in graphs. In the adiabatic and low temperature limits we will…
A network of agents interacting both with competitive and/or cooperative mechanisms is modeled by using fermionic ladder operators. The time evolution of the network is assumed to be governed by a Hermitian time-independent Hamiltonian…