FiFiQueues: Fixed-Point Analysis of Queueing Networks with Finite-Buffer Stations

2000 ◽  
pp. 324-327 ◽  
Author(s):  
Ramin Sadre ◽  
Boudewijn R. Haverkort
Keyword(s):  
Fixed Point ◽  
Queueing Networks ◽  
Finite Buffer ◽  
Point Analysis

PANS Turbulence Model for Seamless Transition Between RANS and LES: Fixed-Point Analysis and Preliminary Results

2003 ◽  
Author(s):  
Sharath S. Girimaji ◽  
Ravi Srinivasan ◽  
Euhwan Jeong
Keyword(s):  
Fixed Point ◽  
Navier Stokes ◽  
Control Parameters ◽  
Preliminary Results ◽  
Point Analysis ◽  
Large Eddy ◽  
Seamless Transition ◽  
Bridging Model ◽  
Reynolds Averaged Navier Stokes ◽  
Initial Results

Partially-averaged Navier-Stokes (PANS) approach has been recently developed as a possible bridging model between Reynolds-averaged Navier-Stokes (RANS) method and large-eddy simulations (LES). The resolution control parameters in PANS are the fractions of unresolved kinetic energy (fk) and unresolved dissipation (fε). We investigate the fixed-point behavior of PANS and present some preliminary results obtained using this model. By comparing the fixed-point behavior of PANS and URANS (unsteady Reynolds-averaged Navier-Stokes) methods, the possible advantage of the former over the latter is explained. Initial results from two-dimensional simulations of flow past square results are also presented.

scholarly journals Existence results for differential equations with reflection of the argument

1994 ◽  
Vol 57 (2) ◽  
pp. 237-260 ◽  
Author(s):  
Donal O'Regan
Keyword(s):  
Fixed Point ◽  
Differential Equations ◽  
Existence Results ◽  
Second Order ◽  
Systems Of Differential Equations ◽  
Nonlinear Alternative ◽  
Point Analysis ◽  
Second Order Equations

AbstractExistence principles are given for systems of differential equations with reflection of the argument. These are derived using fixed point analysis, specifically the Nonlinear Alternative. Then existence results are deduced for certain classes of first and second order equations with reflection of the argument.

scholarly journals New Insights From a Fixed-Point Analysis of Single Cell IEEE 802.11 WLANs

2007 ◽  
Vol 15 (3) ◽  
pp. 588-601 ◽  
Author(s):  
Anurag Kumar ◽  
Eitan Altman ◽  
Daniele Miorandi ◽  
Munish Goyal
Keyword(s):  
Fixed Point ◽  
Single Cell ◽  
Ieee 802.11 ◽  
Point Analysis ◽  
802.11 Wlans

CELL-TO-SITE RENORMALIZATION GROUP STUDY OF A SANDPILE

2008 ◽  
Vol 19 (11) ◽  
pp. 1695-1703 ◽  
Author(s):  
AN-CHUNG CHENG ◽  
CHIEN-FU CHEN ◽  
CHAI-YU LIN
Keyword(s):  
Exact Solution ◽  
Fixed Point ◽  
Renormalization Group ◽  
Sampling Algorithm ◽  
Point Analysis ◽  
Fundamental Difficulty ◽  
Simple Sampling

This study investigates the Bak–Tang–Wiesenfeld sandpile using a renormalization group (RG) approach based on the similarity of L × L RG cells of different scales. The fundamental difficulty of this approach arises from the lack of full enumeration of all relaxations inside a RG cell as L ≥ 3. This study develops a simple sampling algorithm to sample the relaxations and applies this algorithm to the RG calculations for L = 3, 4, and 8. As the fixed point analysis shows, increasing L does not lead the resultant height probabilities toward the exact solution.

Calculation of sensitivities of throughputs and realization probabilities in closed queueing networks with finite buffer capacities

1989 ◽  
Vol 21 (1) ◽  
pp. 181-206 ◽  
Author(s):  
Xi-Ren Cao
Keyword(s):  
Perturbation Analysis ◽  
Queueing Networks ◽  
Queueing Network ◽  
Theoretical Background ◽  
System Throughput ◽  
Single Server ◽  
Finite Buffer ◽  
Closed Queueing Networks ◽  
Steady State Probability ◽  
Single Class

Perturbation analysis is an efficient approach to estimating the sensitivities of the performance measures of a queueing network. A new notion, called the realization probability, provides an alternative way of calculating the sensitivity of the system throughput with respect to mean service times in closed Jackson networks with single class customers and single server nodes (Cao (1987a)). This paper extends the above results to systems with finite buffer sizes. It is proved that in an indecomposable network with finite buffer sizes a perturbation will, with probability 1, be realized or lost. For systems in which no server can directly block more than one server simultaneously, the elasticity of the expected throughput can be expressed in terms of the steady state probability and the realization probability in a simple manner. The elasticity of the throughput when each customer’s service time changes by the same amount can also be calculated. These results provide some theoretical background for perturbation analysis and clarify some important issues in this area.

MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW

2007 ◽  
Vol 24 (04) ◽  
pp. 435-461 ◽  
Author(s):  
TOM VAN WOENSEL ◽  
NICO VANDAELE
Keyword(s):  
Queueing Networks ◽  
Road Networks ◽  
Queueing Network ◽  
Analytical Application ◽  
Buffer Size ◽  
Queueing Models ◽  
Finite Buffer ◽  
Traffic Flows ◽  
Single Node ◽  
The Impact

In this paper, an overview of different analytic queueing models for traffic on road networks is presented. In the literature, it has been shown that queueing models can be used to adequately model uninterrupted traffic flows. This paper gives a broad review on this literature. Moreover, it is shown that the developed published methodologies (which are mainly single node oriented) can be extended towards queueing networks. First, an extension towards queueing networks with infinite buffer sizes is evaluated. Secondly, the assumption of infinite buffer sizes is dropped leading to queueing networks with finite buffer sizes. The impact of the buffer size when comparing the different queueing network methodologies is studied in detail. The paper ends with an analytical application tool to facilitate the optimal positioning of the counting points on a highway.

Sign in / Sign up

Export Citation Format

Share Document