Related papers: Algebraic modelling and performance evaluation of …
We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{\mathcal{D}}{=}\max\{0, B-A+YW\}$, where $\mathbb{P}[Y=1]=p$ and $\mathbb{P}[Y=-1]=1-p$. For $p=1$ this model reduces to the classical Lindley…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent Internet traffic. Approximate performance measures are known from large deviations theory for single queuing systems with fBm through…
New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and…
We formulate general rules for a coarse-graining of the dynamics, which we term `symbolic dynamics', of feedback networks with monotone interactions, such as most biological modules. Networks which are more complex than simple cyclic…
We propose a general framework for modelling network data that is designed to describe aspects of non-exchangeable networks. Conditional on latent (unobserved) variables, the edges of the network are generated by their finite growth history…
Congestion is an important issue which researchers focus on in the Transmission Control Protocol (TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue…
In route selection problems, the driver's personal preferences will determine whether she prefers a route with a travel time that has a relatively low mean and high variance over one that has relatively high mean and low variance. In…
For a class of large closed Jackson networks submitted to capacity constraints, asymptotic independence of the nodes in normal traffic phase is proved at stationarity under mild assumptions, using a Local Limit Theorem. The limiting…
We present a Markov Chain Monte Carlo method for sampling cycle length in large graphs. Cycles are treated as microstates of a system with many degrees of freedom. Cycle length corresponds to energy such that the length histogram is…
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters.…
Network inference approaches are now widely used in biological applications to probe regulatory relationships between molecular components such as genes or proteins. Many methods have been proposed for this setting, but the connections and…
We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources,…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
This paper proposes models of learning process in teams of individuals who collectively execute a sequence of tasks and whose actions are determined by individual skill levels and networks of interpersonal appraisals and influence. The…
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…
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…
The co-authorship network of scientists represents a prototype of complex evolving networks. By mapping the electronic database containing all relevant journals in mathematics and neuro-science for an eight-year period (1991-98), we infer…
Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical…
We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…