Randomized load balancing greatly improves the sharing of resources while being simple to implement. In one such model, jobs arrive according to a rate-αN Poisson process, with α < 1, in a system of N rate-1 exponential server queues. In Vvedenskaya et al. [19], it was shown that when each arriving job is assigned to the shortest of D, D ≥ 2, randomly chosen queues, the equilibrium queue sizes decay doubly exponentially in the limit as N → ∞. This is a substantial improvement over the case D = 1, where queue sizes decay exponentially.The reasoning in [19] does not easily generalize to jobs with nonexponential service time distributions. A modularized program for treating randomized load balancing problems with general service time distributions was introduced in Bramson et al. [5]. The program relies on an ansatz that asserts that, for a randomized load balancing scheme in equilibrium, any fixed number of queues become independent of one another as N → ∞. This allows computation of queue size distributions and other performance measures of interest.In this article, we demonstrate the ansatz in several settings. We consider the least loaded balancing problem, where an arriving job is assigned to the queue with the smallest workload. We also consider the more difficult prob- lem, where an arriving job is assigned to the queue with the fewest jobs, and demonstrate the ansatz when the service discipline is FIFO and the service time distribution has a decreasing hazard rate. Last, we show the ansatz always holds for a sufficiently small arrival rate, as long as the service distribution has 2 moments.
Randomized load balancing greatly improves the sharing of resources in a number of applications while being simple to implement. One model that has been extensively used to study randomized load balancing schemes is the supermarket model. In this model, jobs arrive according to a rate-nλ Poisson process at a bank of n rate-1 exponential server queues. A notable result, due to Vvedenskaya et.al. (1996), showed that when each arriving job is assigned to the shortest of d ≥ 2 randomly chosen queues, the equilibrium queue sizes decay doubly exponentially in the limit as n → ∞. This is a substantial improvement over the case d = 1, where queue sizes decay exponentially.The method of analysis used in the above paper and in the subsequent literature applies to jobs with exponential service time distributions and does not easily generalize. It is desirable to study load balancing models with more general, especially heavy-tailed, service time distributions since such service times occur widely in practice.This paper describes a modularized program for treating randomized load balancing problems with general service time distributions and service disciplines. The program relies on an ansatz which asserts that any finite set of queues in a randomized load balancing scheme becomes independent as n → ∞. This allows one to derive queue size distributions and other performance measures of interest. We establish the ansatz when the service discipline is FIFO and the service time distribution has a decreasing hazard rate (this includes heavy-tailed service times). Assuming the ansatz, we also obtain the following results: (i) as n → ∞, the process of job arrivals at any fixed queue tends to a Poisson process whose rate depends on the size of the queue, (ii) when the service discipline at each server is processor sharing or LIFO with preemptive resume, the distribution of the number of jobs is insensitive to the service distribution, and (iii) the tail behavior of the queue-size distribution in terms of the service distribution for the FIFO service discipline.
Background: Racial inequities for patients with heart failure (HF) have been widely documented. HF patients who receive cardiology care during a hospital admission have better outcomes. It is unknown whether there are differences in admission to a cardiology or general medicine service by race. This study examined the relationship between race and admission service, and its effect on 30-day readmission and mortality Methods: We performed a retrospective cohort study from September 2008 to November 2017 at a single large urban academic referral center of all patients self-referred to the emergency department and admitted to either the cardiology or general medicine service with a principal diagnosis of HF, who self-identified as white, black, or Latinx. We used multivariable generalized estimating equation models to assess the relationship between race and admission to the cardiology service. We used Cox regression to assess the association between race, admission service, and 30-day readmission and mortality. Results: Among 1967 unique patients (66.7% white, 23.6% black, and 9.7% Latinx), black and Latinx patients had lower rates of admission to the cardiology service than white patients (adjusted rate ratio, 0.91; 95% CI, 0.84–0.98, for black; adjusted rate ratio, 0.83; 95% CI, 0.72–0.97 for Latinx). Female sex and age >75 years were also independently associated with lower rates of admission to the cardiology service. Admission to the cardiology service was independently associated with decreased readmission within 30 days, independent of race. Conclusions: Black and Latinx patients were less likely to be admitted to cardiology for HF care. This inequity may, in part, drive racial inequities in HF outcomes.
Abstract. We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correlations is formulated by a recursive expression, which makes it easier to calculate correlations of the finite state machine output sequences up to 26 bits for E0 and allows us to verify the two known correlations to be the largest for the first time. Second, we apply the concept of convolution to the analysis of the distinguisher based on all correlations, and propose an efficient distinguisher due to the linear dependency of the largest correlations. Last, we propose a novel maximum likelihood decoding algorithm based on fast Walsh transform to recover the closest codeword for any linear code of dimension L and length n. It requires time O(n + L · 2 L ) and memory min(n, 2 L ). This can speed up many attacks such as fast correlation attacks. We apply it to E0, and our best key-recovery attack works in 2 39 time given 2 39 consecutive bits after O(2 37 ) precomputation. This is the best known attack against E0 so far. BackgroundCorrelation properties play an important role in the security of nonlinear LFSRbased combination generators in stream ciphers. As name implies, the word correlation in stream ciphers is frequently referred to as the intrinsic relation between the keystream and a subset of the LFSR subsequences. The earliest studies dated back to [21,25,27] in the 80's and the concept of correlation immunity was proposed as a security criterion. In the 90's Meier-Staffelbach [22] analyzed correlation properties of combiners with one memory bit, followed by Golić [12] focusing on correlation properties of a general combiner with m-bit memory. Recently, a series of fast correlation attacks sprang up, to name but a few [5-7, 16, 24]. Thereupon we dedicate this paper to the generalized correlation attacks against E0, a combiner with 4-bit memory used in the short-range wireless technology Bluetooth. Prior to our work, existed various attacks [1, 8, 10, 11, 13-15, 17, 26] against E0. The best key-recovery attacks are algebraic attacks [1,8], whose basic approach is to use the polynomial canceling all memory bits and involving only key bits, instead of considering the multiple polynomial to cancel the key bits in the distinguishing attack; besides, [9,13,14] discussed correlations of E0. In [14], Hermelin-Nyberg for the first time presented a rough computation method to compute the correlation (called bias for our purpose), but neither did they formalize the computation systematically, nor did they attempt to find a larger correlation. In [9,13], two larger correlations for a short sequence of up to 6 bits were exposed. However, due to the limit of the computation method, no one was certain about the existence of a larger correlation for a longer sequence, which is critical to the security of E0.
In join the shortest queue networks, incoming jobs are assigned to the
shortest queue from among a randomly chosen subset of $D$ queues, in a system
of $N$ queues; after completion of service at its queue, a job leaves the
network. We also assume that jobs arrive into the system according to a
rate-$\alpha N$ Poisson process, $\alpha<1$, with rate-1 service at each queue.
When the service at queues is exponentially distributed, it was shown in
Vvedenskaya et al. [Probl. Inf. Transm. 32 (1996) 15-29] that the tail of the
equilibrium queue size decays doubly exponentially in the limit as
$N\rightarrow\infty$. This is a substantial improvement over the case D=1,
where the queue size decays exponentially. The reasoning in [Probl. Inf.
Transm. 32 (1996) 15-29] does not easily generalize to jobs with nonexponential
service time distributions. A modularized program for treating general service
time distributions was introduced in Bramson et al. [In Proc. ACM SIGMETRICS
(2010) 275-286]. The program relies on an ansatz that asserts, in equilibrium,
any fixed number of queues become independent of one another as
$N\rightarrow\infty$. This ansatz was demonstrated in several settings in
Bramson et al. [Queueing Syst. 71 (2012) 247-292], including for networks where
the service discipline is FIFO and the service time distribution has a
decreasing hazard rate. In this article, we investigate the limiting behavior,
as $N\rightarrow \infty$, of the equilibrium at a queue when the service
discipline is FIFO and the service time distribution has a power law with a
given exponent $-\beta$, for $\beta>1$. We show under the above ansatz that, as
$N\rightarrow\infty$, the tail of the equilibrium queue size exhibits a wide
range of behavior depending on the relationship between $\beta$ and $D$. In
particular, if $\beta>D/(D-1)$, the tail is doubly exponential and, if
$\beta
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.