This dissertation also studies a load balancing algorithm, the so called power-of-two-choices(Po2), for many-server systems (with N servers) and focuses on the convergence of stationary distribution of Po2 in the both light and heavy traffic regimes to the solution of mean-field system. The framework of Stein’s method and state space collapse (SSC) are used to analyze both regimes.
In both regimes, the thesis first uses the argument of state space collapse to show that the probability of the state being far from the mean-field solution is small enough. By a simple Markov inequality, it is able to show that the probability is indeed very small with a proper choice of parameters.
Then, for the state space close to the solution of mean-field model, the thesis uses Stein’s method to show that the stochastic system is close to a linear mean-field model. By characterizing the generator difference, it is able to characterize the dominant terms in both regimes. Note that for heavy traffic case, the lower and upper bound analysis of a tridiagonal matrix, which arises from the linear mean-field model, is needed. From the dominant term, it allows to calculate the coefficient of the convergence rate.
In the end, comparisons between the theoretical predictions and numerical simulations are presented.
For the co-located wireless network, a time-slotted system is considered. A cycle of planning horizon is called a frame, which consists of a fixed number of time slots. The size of the frame is determined by the upper-layer applications. Packets with deadlines arrive at the beginning of each frame and will be discarded if missing their deadlines, which are in the same frame. Each link of the network is associated with a quality of service constraint and an average transmit power constraint. For this system, a MaxWeight-type problem for which the solutions achieve the throughput optimality is formulated. Since the computational complexity of solving the MaxWeight-type problem with exhaustive search is exponential even for a single-link system, a greedy algorithm with complexity O(nlog(n)) is proposed, which is also throughput optimal.
The outpatient healthcare network is modeled as a discrete-time queueing network, in which patients receive diagnosis and treatment planning that involves collaboration between multiple service stations. For each patient, only the root (first) appointment can be scheduled as the following appointments evolve stochastically. The cyclic planing horizon is a week. The root appointment is optimized to maximize the proportion of patients that can complete their care by a class-dependent deadline. In the optimization algorithm, the sojourn time of patients in the healthcare network is approximated with a doubly-stochastic phase-type distribution. To address the computational intractability, a mean-field model with convergence guarantees is proposed. A linear programming-based policy improvement framework is developed, which can approximately solve the original large-scale stochastic optimization in queueing networks of realistic sizes.
Nonhyperbolicity, as characterized by the coexistence of Kolmogorov-Arnold-Moser (KAM) tori and chaos in the phase space, is generic in classical Hamiltonian systems. An open but fundamental question in physics concerns the relativistic quantum manifestations of nonhyperbolic dynamics. We choose the mushroom billiard that has been mathematically proven to be nonhyperbolic, and study the resonant tunneling dynamics of a massless Dirac fermion. We find that the tunneling rate as a function of the energy exhibits a striking "clustering" phenomenon, where the majority of the values of the rate concentrate on a narrow region, as a result of the chaos component in the classical phase space. Relatively few values of the tunneling rate, however, spread outside the clustering region due to the integrable component. Resonant tunneling of electrons in nonhyperbolic chaotic graphene systems exhibits a similar behavior. To understand these numerical results, we develop a theoretical framework by combining analytic solutions of the Dirac equation in certain integrable domains and physical intuitions gained from current understanding of the quantum manifestations of chaos. In particular, we employ a theoretical formalism based on the concept of self-energies to calculate the tunneling rate and analytically solve the Dirac equation in one dimension as well as in two dimensions for a circular-ring-type of tunneling systems exhibiting integrable dynamics in the classical limit. Because relatively few and distinct classical periodic orbits are present in the integrable component, the corresponding relativistic quantum states can have drastically different behaviors, leading to a wide spread in the values of the tunneling rate in the energy-rate plane. In contrast, the chaotic component has embedded within itself an infinite number of unstable periodic orbits, which provide far more quantum states for tunneling. Due to the nature of chaos, these states are characteristically similar, leading to clustering of the values of the tunneling rate in a narrow band. The appealing characteristic of our work is a demonstration and physical understanding of the "mixed" role played by chaos and regular dynamics in shaping relativistic quantum tunneling dynamics.
An outstanding and fundamental problem in contemporary physics is to include and probe the many-body effect in the study of relativistic quantum manifestations of classical chaos. We address this problem using graphene systems described by the Hubbard Hamiltonian in the setting of resonant tunneling. Such a system consists of two symmetric potential wells separated by a potential barrier, and the geometric shape of the whole domain can be chosen to generate integrable or chaotic dynamics in the classical limit. Employing a standard mean-field approach to calculating a large number of eigenenergies and eigenstates, we uncover a class of localized states with near-zero tunneling in the integrable systems. These states are not the edge states typically seen in graphene systems, and as such they are the consequence of many-body interactions. The physical origin of the non-edge-state type of localized states can be understood by the one-dimensional relativistic quantum tunneling dynamics through the solutions of the Dirac equation with appropriate boundary conditions. We demonstrate that, when the geometry of the system is modified to one with chaos, the localized states are effectively removed, implying that in realistic situations where many-body interactions are present, classical chaos is capable of facilitating greatly quantum tunneling. This result, besides its fundamental importance, can be useful for the development of nanoscale devices such as graphene-based resonant-tunneling diodes.