Related papers: The max-plus algebra approach in modelling of queu…
We provide a numerical study of the macroscopic model of [3] derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodelling process is very fast, the…
We introduce a model for the dynamic self-organization of the electric grid. The model is characterized by a conserved magnitude, energy, that can travel following the links of the network to satisfy nodes' load. The load fluctuates in time…
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…
This paper studies an infinite buffer single server queueing model with exponentially distributed service times and negative arrivals. The ordinary (positive) customers arrive in batches of random size according to renewal arrival process,…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate…
This paper proposes a new approach, grounded in Satisfiability Modulo Theories (SMT), to study the transient of a Max-Plus Linear (MPL) system, that is the number of steps leading to its periodic regime. Differently from state-of-the-art…
We consider a Markovian clearing queueing system, where the customers are accumulated according to a Poisson arrival process and the server removes all present customers at the completion epochs of exponential service cycles. This system…
Many complex systems have natural representations as multi-layer networks. While these formulations retain more information than standard single-layer network models, there is not yet a fully developed theory for computing network metrics…
Networks observed in real world like social networks, collaboration networks etc., exhibit temporal dynamics, i.e. nodes and edges appear and/or disappear over time. In this paper, we propose a generative, latent space based, statistical…
Stochastic network calculus is an evolving theory which accounts for statistical multiplexing and uses an envelope approach for probabilistic delay and backlog analysis of networks. One of the key ideas of stochastic network calculus is the…
Many biological and medical questions can be modeled using time-to-event data in finite-state Markov chains, with the phase-type distribution describing intervals between events. We solve the inverse problem: given a phase-type…
This paper presents a method for calculating steady state probabilities of $M|E_r|c|K$ queueing systems. The infinitesimal generator matrix is used to define all possible states in the system and their transition probabilities. While this…
This paper introduces a statistical model for the arrival times of connection events in a computer network. Edges between nodes in a network can be interpreted and modelled as point processes where events in the process indicate information…
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service…
We consider a stationary Markov process that models certain queues with a bulk service of a fixed number $m$ of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal…
The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks, packets are lost due to either link erasures or blocking by the full…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
This paper is a short summary of the main results in the thesis [1]. Based on the P2P paradigm we construct a stochastic model for a live media streaming content delivery network. Starting from the behavior of the out degree process of each…
Next generation networks (NGN) services are assumed to be a new revenue stream for both network operators and service providers. New services especially focused on a mobile telecommunications that would be used not only as a communication…