skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Queues with Updating Information: Finding the Amplitude of Oscillations
Many service systems provide customers with information about the system so that customers can make an informed decision about whether to join or not. Many of these systems provide information in the form of an update. Thus, the information about the system is updated periodically in increments of size [Formula: see text]. It is known that these updates can cause oscillations in the resulting dynamics. However, it is an open problem to explicitly characterize the size of these oscillations when they occur. In this paper, we solve this open problem and show how to exactly calculate the amplitude of these oscillations via a fixed point equation. We also calculate closed form approximations via Taylor expansions of the fixed point equation and show that these approximations are very accurate, especially when [Formula: see text] is large. Our analysis provides new insight for systems that use updates as a way of disseminating information to customers.  more » « less
Award ID(s):
1751975
PAR ID:
10335427
Author(s) / Creator(s):
;
Date Published:
Journal Name:
International Journal of Bifurcation and Chaos
Volume:
32
Issue:
03
ISSN:
0218-1274
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Operations Research)
    Queueing models that are used to capture various service settings typically assume that customers require a single unit of resource (server) to be processed. However, there are many service settings where such an assumption may fail to capture the heterogeneity in resource requirements of different customers. We propose a multiserver queueing model with multiple customer classes in which customers from different classes may require different amounts of resources to be served. We study the optimal scheduling policy for such systems. To balance holding costs, service rates, resource requirement, and priority-induced idleness, we develop an index-based policy that we refer to as the idle-avoid [Formula: see text] rule. For a two-class two-server model, where policy-induced idleness can have a big impact on system performance, we characterize cases where the idle-avoid [Formula: see text] rule is optimal. In other cases, we establish a uniform performance bound on the amount of suboptimality incurred by the idle-avoid [Formula: see text] rule. For general multiclass multiserver queues, we establish the asymptotic optimality of the idle-avoid [Formula: see text] rule in the many-server regime. For long-time horizons, we show that the idle-avoid [Formula: see text] is throughput optimal. Our theoretical results, along with numerical experiments, provide support for the good and robust performance of the proposed policy. 
    more » « less
  2. ; ; (, Stochastic Systems)
    We consider a long-term average profit–maximizing admission control problem in an M/M/1 queuing system with unknown service and arrival rates. With a fixed reward collected upon service completion and a cost per unit of time enforced on customers waiting in the queue, a dispatcher decides upon arrivals whether to admit the arriving customer or not based on the full history of observations of the queue length of the system. Naor [Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24] shows that, if all the parameters of the model are known, then it is optimal to use a static threshold policy: admit if the queue length is less than a predetermined threshold and otherwise not. We propose a learning-based dispatching algorithm and characterize its regret with respect to optimal dispatch policies for the full-information model of Naor [Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24]. We show that the algorithm achieves an O(1) regret when all optimal thresholds with full information are nonzero and achieves an [Formula: see text] regret for any specified [Formula: see text] in the case that an optimal threshold with full information is 0 (i.e., an optimal policy is to reject all arrivals), where N is the number of arrivals. 
    more » « less
  3. (, Fractals)
    We collect from several sources some of the most important results on the forward and backward limits of points under real and complex rational functions, and in particular real and complex Newton maps, in one variable and we provide numerical evidence that the dynamics of Newton maps [Formula: see text] associated to real polynomial maps [Formula: see text] with no complex roots has a complexity comparable with that of complex Newton maps in one variable. In particular such a map [Formula: see text] has no wandering domain, almost every point under [Formula: see text] is asymptotic to a fixed point and there is some non-empty open set of points whose [Formula: see text]-limit equals the set of non-regular points of the Julia set of [Formula: see text]. The first two points were proved by B. Barna in the real one-dimensional case. 
    more » « less
  4. ; ; ; (, International Journal of Modern Physics A)
    An approach to the properties of the [Formula: see text] system developed to solve the famous [Formula: see text] problem is used to calculate the partial widths ratios to [Formula: see text] and [Formula: see text] in the [Formula: see text] and [Formula: see text] decays. We obtain the results in agreement with the experimental data. 
    more » « less
  5. ; ; ; (, Journal of Applied Physics)
    Magneto-intersubband resistance oscillations (MISOs) of highly mobile 2D electrons in symmetric GaAs quantum wells with two populated subbands are studied in magnetic fields [Formula: see text] tilted from the normal to the 2D electron layer at different temperatures [Formula: see text]. The in-plane component ([Formula: see text]) of the field [Formula: see text] induces magnetic entanglement between subbands, leading to beating in oscillating density of states (DOS) and to MISO suppression. Model of the MISO suppression is proposed. Within the model, a comparison of MISO amplitude in the entangled and disentangled ([Formula: see text]) 2D systems yields both difference frequency of DOS oscillations, [Formula: see text], and strength of the electron–electron interaction, described by parameter [Formula: see text], in the 2D system. These properties are analyzed using two methods, yielding consistent but not identical results for both [Formula: see text] and [Formula: see text]. The analysis reveals an additional angular dependent factor of MISO suppression. The factor is related to spin splitting of quantum levels in magnetic fields. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email