The geometry of big queues
From MaRDI portal
Publication:2190913
Abstract: We use Hamilton equations to find optimal paths to big queues in Jackson networks. They are shown to be given by fluid trajectories of the dual network. The fluid equations are shown to be dual to the Hamilton equations. Thus, a version of the extended Onzager-Machlup principle is proved: a fluctuation trajectory is the time reversal of a relaxation trajectory of the dual dynamic. The case of a two-node network is given a geometric treatment.
Recommendations
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 4034749 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 847278 (Why is no real title available?)
- Induced rare events: analysis via large deviations and time reversal
- Langevin dynamics, large deviations and instantons for the quasi-geostrophic model and two-dimensional Euler equations
- Large deviations and queueing networks: Methods for rate function identification
- Large deviations of Jackson networks.
- Optimal control
- Optimization and nonsmooth analysis
- Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
- The action functional for the Jackson network
This page was built for publication: The geometry of big queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190913)