Scheduling mechanisms and admission control policies for DQPB and ATM

1995 ◽  
Author(s):  
Kris Steenhaut ◽  
Kurt Degieter ◽  
Wouter Brissinck
Keyword(s):  
Admission Control ◽  
Control Policies ◽  
Scheduling Mechanisms

Admission Control for Multidimensional Workload input with Heavy Tails and Fractional Ornstein-Uhlenbeck Process

2015 ◽  
Vol 47 (2) ◽  
pp. 476-505
Author(s):  
Amarjit Budhiraja ◽  
Vladas Pipiras ◽  
Xiaoming Song
Keyword(s):  
Differential Equation ◽  
Brownian Motion ◽  
Stochastic Differential Equation ◽  
Fractional Brownian Motion ◽  
Admission Control ◽  
Control Policy ◽  
Uhlenbeck Process ◽  
Control Policies ◽  
Ornstein Uhlenbeck Process ◽  
Admission Control Policy

The infinite source Poisson arrival model with heavy-tailed workload distributions has attracted much attention, especially in the modeling of data packet traffic in communication networks. In particular, it is well known that under suitable assumptions on the source arrival rate, the centered and scaled cumulative workload input process for the underlying processing system can be approximated by fractional Brownian motion. In many applications one is interested in the stabilization of the work inflow to the system by modifying the net input rate, using an appropriate admission control policy. In this paper we study a natural family of admission control policies which keep the associated scaled cumulative workload input asymptotically close to a prespecified linear trajectory, uniformly over time. Under such admission control policies and with natural assumptions on arrival distributions, suitably scaled and centered cumulative workload input processes are shown to converge weakly in the path space to the solution of a d-dimensional stochastic differential equation driven by a Gaussian process. It is shown that the admission control policy achieves moment stabilization in that the second moment of the solution to the stochastic differential equation (averaged over the d-stations) is bounded uniformly for all times. In one special case of control policies, as time approaches ∞, we obtain a fractional version of a stationary Ornstein-Uhlenbeck process that is driven by fractional Brownian motion with Hurst parameter H > ½.

Admission-control policies for multihop wireless networks

1995 ◽  
Vol 1 (4) ◽  
pp. 373-387 ◽  
Author(s):  
Craig M. Barnhart ◽  
Jeffrey E. Wieselthier ◽  
Anthony Ephremides
Keyword(s):  
Wireless Networks ◽  
Admission Control ◽  
Multihop Wireless Networks ◽  
Control Policies ◽  
Multihop Wireless

Admission Control for Multidimensional Workload input with Heavy Tails and Fractional Ornstein-Uhlenbeck Process

2015 ◽  
Vol 47 (02) ◽  
pp. 476-505
Author(s):  
Amarjit Budhiraja ◽  
Vladas Pipiras ◽  
Xiaoming Song
Keyword(s):  
Differential Equation ◽  
Brownian Motion ◽  
Stochastic Differential Equation ◽  
Fractional Brownian Motion ◽  
Admission Control ◽  
Control Policy ◽  
Uhlenbeck Process ◽  
Control Policies ◽  
Ornstein Uhlenbeck Process ◽  
Admission Control Policy

The infinite source Poisson arrival model with heavy-tailed workload distributions has attracted much attention, especially in the modeling of data packet traffic in communication networks. In particular, it is well known that under suitable assumptions on the source arrival rate, the centered and scaled cumulative workload input process for the underlying processing system can be approximated by fractional Brownian motion. In many applications one is interested in the stabilization of the work inflow to the system by modifying the net input rate, using an appropriate admission control policy. In this paper we study a natural family of admission control policies which keep the associated scaled cumulative workload input asymptotically close to a prespecified linear trajectory, uniformly over time. Under such admission control policies and with natural assumptions on arrival distributions, suitably scaled and centered cumulative workload input processes are shown to converge weakly in the path space to the solution of a d-dimensional stochastic differential equation driven by a Gaussian process. It is shown that the admission control policy achieves moment stabilization in that the second moment of the solution to the stochastic differential equation (averaged over the d-stations) is bounded uniformly for all times. In one special case of control policies, as time approaches ∞, we obtain a fractional version of a stationary Ornstein-Uhlenbeck process that is driven by fractional Brownian motion with Hurst parameter H > ½.

scholarly journals Optimal Switching Strategy between Admission Control and Pricing Control Policies with Two Types of Customers and Search Costs

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jae-Dong Son
Keyword(s):  
Admission Control ◽  
Queueing System ◽  
Search Costs ◽  
Optimal Switching ◽  
Search Cost ◽  
Control Policies ◽  
Switching Strategy ◽  
Net Profit ◽  
Search Option ◽  
Pricing Control

This paper presents a switching strategy between the admission control and the pricing control policies in a queueing system with two types of customers. For an arriving first-type customer, the decision maker has an option on which policy to choose between the two control policies; that is, one determines whether or not to admit the customer’s request for the service (admission control) or decides a price of the customer’s request and offers it to the customer (pricing control). The second-type customers are only served when no first-type customers are present in the system in order to prevent the system from being idle. This would yield an extra income, which we refer to as the sideline profit. The so-called search cost, which is a cost paid to search for customers, creates the search option on whether to continue the search or not. We clarify the properties of the optimal switching strategy as well as the optimal search policy in relation to the sideline profit in order to maximize the total expected net profit. In particular, we show that when the sideline profit is sufficiently large, the two optimal switching thresholds exist with respect to the number of first-type customers in the system.

Admission control policies in flow-aware networks

2009 ◽  
Author(s):  
Jerzy Domzal ◽  
Robert Wojcik ◽  
Andrzej Jajszczyk ◽  
Victor Lopez ◽  
Jose Alberto Hernandez ◽  
...  
Keyword(s):  
Admission Control ◽  
Control Policies
Sign in / Sign up

Export Citation Format

Share Document