Related papers: On a loss storage network with finite capacity
We study how network structure affects the dynamics of collateral in presence of rehypothecation. We build a simple model wherein banks interact via chains of repo contracts and use their proprietary collateral or re-use the collateral…
Many emerging Web services, such as email, photo sharing, and web site archives, need to preserve large amounts of quickly-accessible data indefinitely into the future. In this paper, we make the case that these applications' demands on…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…
The problem of high-dimensional and large-scale representation of visual data is addressed from an unsupervised learning perspective. The emphasis is put on discrete representations, where the description length can be measured in bits and…
A potential framework to estimate the volume of water stored in a porous storage reservoir from seismic data is neural networks. In this study, the man-made groundwater reservoir is modeled as a coupled poroviscoelastic-viscoelastic medium,…
In this work, we provide two novel approaches to show that incompressible fluid flow in a finite domain contains at most a finite number vortices. We use a recently developed geometric theory of incompressible viscous flows along with an…
We use a theoretical model to explore how fluid dynamics, in particular, the pressure gradient and wall shear stress in a channel, affect the deposition of particles flowing in a microfluidic network. Experiments on transport of colloidal…
We investigate fluid scaling of single server queueing systems under the shortest job first with aging (SJFA) scheduling policy. We use the measure-valued Skorokhod map to characterize the fluid limit for SJFA queues with a general aging…
We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate independently, but want to help each other respond to…
In future content-centric networks, content is identified independently of its location. From an end-user's perspective, individual storage systems dissolve into a seemingly omnipresent structureless `storage fog'. Content should be…
Although density functional theory provides reliable predictions for the static properties of simple fluids under confinement, a theory of comparative accuracy for the transport coefficients has yet to emerge. Nonetheless, there is evidence…
Many networked systems such as electric networks, the brain, and social networks of opinion dynamics are known to obey conservation laws. Examples of this phenomenon include the Kirchoff laws in electric networks and opinion consensus in…
It has been shown that it is impossible to achieve both stringent end-to-end deadline and reliability guarantees in a large network without having complete information of all future packet arrivals. In order to maintain desirable…
The terminal backup problems (Anshelevich and Karagiozova (2011)) form a class of network design problems: Given an undirected graph with a requirement on terminals, the goal is to find a minimum cost subgraph satisfying the connectivity…
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in…
We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are…
Nowadays, data caching is being used as a high-speed data storage layer in mobile edge computing networks employing flow control methodologies at an exponential rate. This study shows how to discover the best architecture for backhaul…
The system reconfiguration task is considered for existing power distribution systems and microgrids, in the presence of renewable-based generation and load foresting errors. The system topology is obtained by solving a chance-constrained…
Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control…