Zobrazeno 1 - 10
of 216
pro vyhledávání: '"Nain, Philippe"'
We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the switch; an
Externí odkaz:
http://arxiv.org/abs/2212.01784
Caching systems have long been crucial for improving the performance of a wide variety of network and web based online applications. In such systems, end-to-end application performance heavily depends on the fraction of objects transferred from the c
Externí odkaz:
http://arxiv.org/abs/2106.06457
Autor:
Panigrahy, Nitish K., Basu, Prithwish, Nain, Philippe, Towsley, Don, Swami, Ananthram, Chan, Kevin S., Leung, Kin K.
We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment policies that allocate resources only to users located to their left.
Externí odkaz:
http://arxiv.org/abs/2011.04893
Consider a setting where Willie generates a Poisson stream of jobs and routes them to a single server that follows the first-in first-out discipline. Suppose there is an adversary Alice, who desires to receive service without being detected. We ask t
Externí odkaz:
http://arxiv.org/abs/2003.05135
Publikováno v:
IEEE Transactions on Quantum Engineering 2021
We study a quantum entanglement switch that serves $k$ users in a star topology. We model variants of the system using Markov chains and standard queueing theory and obtain expressions for switch capacity and the expected number of qubits stored in m
Externí odkaz:
http://arxiv.org/abs/1903.04420
We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances.
Externí odkaz:
http://arxiv.org/abs/1901.06786
Autor:
Panigrahy, Nitish K., Basu, Prithwish, Nain, Philippe, Towsley, Don, Swami, Ananthram, Chan, Kevin S., Leung, Kin K.
We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment policies that allocate resources only to users located to their left.
Externí odkaz:
http://arxiv.org/abs/1901.02414
In this paper, we introduce a new class of stochastic multilayer networks. A stochastic multilayer network is the aggregation of $M$ networks (one per layer) where each is a subgraph of a foundational network $G$. Each layer network is the result of
Externí odkaz:
http://arxiv.org/abs/1807.03650
The modeling and analysis of an LRU cache is extremely challenging as exact results for the main performance metrics (e.g. hit rate) are either lacking or cannot be used because of their high computational complexity for large caches. As a result, va
Externí odkaz:
http://arxiv.org/abs/1707.06204
In this paper, we consider the problem of allocating cache resources among multiple content providers. The cache can be partitioned into slices and each partition can be dedicated to a particular content provider, or shared among a number of them. It
Externí odkaz:
http://arxiv.org/abs/1702.01823