17 January 2025 in IEEE Transactions on Wireless Communications
Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments wherein establishing an optical fiber infrastructure is challenging and costly. However, FSO-based QNs require a clear line-of-sight (LoS) between users, which is challenging due to blockages and natural obstacles. In this paper, a reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual LoS between users for entanglement distribution. A novel modeling of the quantum noise and losses experienced by quantum states over FSO channels defined by atmospheric losses, turbulence, and pointing errors is derived. Then, the joint optimization of entanglement distribution and RIS placement problem is formulated, under heterogeneous entanglement rate and fidelity constraints. This problem is solved using a simulated annealing metaheuristic algorithm. Simulation results show that the proposed framework effectively meets the minimum fidelity requirements of all users’ quantum applications. This is in stark contrast to baseline algorithms that lead to a drop of at least 84% in users’ end-to-end fidelities. The proposed framework also achieves a 63% enhancement in the fairness level between users compared to baseline rate maximizing frameworks. Finally, the weather conditions, e.g., rain, are observed to have a more significant effect than pointing errors and turbulence.
22 December 2017 in IEEE Transactions on Vehicular Technology
With increasing popularity of wireless local area network (WLAN) and emerging real-time applications, seamless mobility has become one of the primary concerns. Hence, the choice of a proper handover algorithm is of utmost importance. Various performance evaluation metrics for handover algorithms have been proposed in this regard. We argue that in a multiple access point (AP) scenario, the load on each of the APs, the requested data rate of the mobile terminal, and the soft handover have significant impact on these metrics. In this paper, we present an analytical framework to measure various handover performance evaluation metrics under both load condition and soft handover for a specific data rate request. Our approach is based on finding the circular region centered around an AP within which the requested data rate can be satisfied. We have considered WLAN usage efficiency, handover failure probability, and unnecessary handover probability as evaluation metrics. We have analyzed the impact of load and soft handover on these metrics. The impact of velocity on these metrics has also been analyzed. We also have derived lower bounds on both handover failure probability and unnecessary handover probability by formulating the problem into three circle intersection problem. The circular coverage assumption used in the framework is also validated through simulation.
12 May 2025 in IEEE Network
Designing an operational architecture for the Quantum Internet is challenging in light of both fundamental limits imposed by physics laws and technological constraints. Here, we propose a method to abstract away most of the quantumspecific elements and formulate a best-effort quantum network architecture based on packet switching, akin to that of the classical Internet. This reframing provides an opportunity to exploit the many available and well-understood protocols within the Internet context. As an illustration, we tailor and adapt classical congestion control and active queue management protocols to quantum networks, employing an architecture wherein quantum end and intermediate nodes effectively regulate demand and resource utilization, respectively. Results show that these classical networking tools can be effective in managing quantum memory decoherence and maintaining end-to-end fidelity around a target value.
26 November 2022 in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
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 cache, also known as the cache hit probability . Many caching policies have been proposed and implemented to improve the hit probability. In this work, we propose a new method to compute an upper bound on hit probability for all non-anticipative caching policies and for policies that have no knowledge of future requests. Our key insight is to order the objects according to the ratio of their
Hazard Rate
(HR) function values to their sizes, and place in the cache the objects with the largest ratios till the cache capacity is exhausted. When object request processes are conditionally independent, we prove that this cache allocation based on the HR-to-size ratio rule guarantees the maximum achievable expected number of object hits across all non-anticipative caching policies. Further, the HR ordering rule serves as an upper bound on cache hit probability when object request processes follow either independent delayed renewal process or a Markov modulated Poisson process. We also derive closed form expressions for the upper bound under some specific object request arrival processes. We provide simulation results to validate its correctness and to compare it to the state-of-the-art upper bounds, such as produced by Bélády’s algorithm. We find it to be tighter than state-of-the-art upper bounds for some specific object request arrival processes such as independent renewal, Markov modulated, and shot noise processes.
26 November 2022 in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. The static interpretation of distributed load balancing leads to formulating the load-balancing problem as a classical balls-and-bins problem with jobs (balls) never leaving the system and accumulating at the servers (bins). While most of the previous work in the static setting focus on studying the maximum number of jobs allocated to a server or maximum load , little importance has been given to the implementation cost , or the cost of moving a job/data to/from its allocated server, for such policies. This article designs and evaluates server proximity aware static load-balancing policies with a goal to reduce the implementation cost . We consider a class of proximity aware Power of Two (POT) choice-based assignment policies for allocating jobs to servers, where both jobs and servers are located on a two-dimensional Euclidean plane. In this framework, we investigate the tradeoff between the implementation cost and load-balancing performance of different allocation policies. To this end, we first design and evaluate a Spatial Power of two (sPOT) policy in which each job is allocated to the least loaded server among its two geographically nearest servers. We provide expressions for the lower bound on the asymptotic expected maximum load on the servers and prove that sPOT does not achieve classical POT load-balancing benefits. However, experimental results suggest the efficacy of sPOT with respect to expected implementation cost. We also propose two non-uniform server sampling-based POT policies that achieve the best of both implementation cost and load-balancing performance. We then extend our analysis to the case where servers are interconnected as an n -vertex graph G(S, E) . We assume each job arrives at one of the servers, u, chosen uniformly at random from the vertex set S. We then assign each job to the server with minimum load among servers u and v where v is chosen according to one of the following two policies: (i) Unif-POT( k ): Sample a server v uniformly at random from k -hop neighborhood of u; (ii) InvSq-POT( k ): Sample a server v from k -hop neighborhood of u with probability proportional to the inverse square of the distance between u and v . An extensive simulation over a wide range of topologies validates the efficacy of both the policies. Our simulation results show that both policies consistently produce a load distribution that is much similar to that of a classical POT. Depending on topology, we observe the total variation distance to be of the order of 0.002–0.08 for both the policies while achieving a 8%–99% decrease in implementation cost as compared to the classical POT.
12 January 2026 in IEEE Internet Computing
Scaling quantum computing beyond a single device requires networking many quantum processing units (QPUs) into a coherent distributed system. However, most quantum network proposals focus on physical link technologies or point-to-point entanglement generation, leaving the adaptive orchestration of entanglement as a shared resource largely unexplored. We introduce the Modular Entanglement Hub (ModEn-Hub), a hub-and-spoke photonic interconnect paired with a real-time orchestrator that centralizes entanglement generation, routing, and caching across heterogeneous QPUs. ModEn-Hub manages the full Bell-pair lifecycle—deciding which links to entangle, when to schedule teleportation-based non-local gates, and how to allocate a limited cache of stored ebits under loss and decoherence constraints. To illustrate the potential benefits, we perform a lightweight, reproducible Monte Carlo study based on simple but realistic models of photon loss, finite memory lifetime, and bounded time budgets, comparing a naïve sequential strategy to an orchestrated policy with limited parallel attempts and opportunistic reuse of cached entanglement. In our experiments across small-to-moderate network sizes, ModEn-Hub-style orchestration maintains substantially higher teleportation success probabilities than the baseline, albeit at the cost of more entanglement generation attempts. These results provide high-level evidence that adaptive, centrally coordinated resource management is a promising architectural pattern for scalable, near-term distributed quantum computing.