Journal of Industrial and Management Optimization
July 2010 , Volume 6 , Issue 3
Select all articles
We formulate a network equilibrium model with a unilateral constraint based on Wardrop's principle and establish that the model is equivalent to a quasi-variational inequality. For the case with vector cost functions, we use Gerstewitz's function to derive two equivalence relations between the vector network equilibrium model with a unilateral constraint and quasi-variational inequalities without any convexity assumptions.
In this paper, we study the Levitin-Polyak type well-posedness of variational inequalities and optimization problems with variational inequality constraints in Banach spaces. We derive some criteria and characterizations for these Levitin-Polyak well-posedness. We also investigate conditions under which the existence and uniqueness of solution is equivalent to the Levitin-Polyak well-posedness of the problem.
This paper investigates a benchmark and a mean-variance portfolio selection problems for insurers under the model assumptions of Yang and Zhang . Closed-form expressions for the value functions, the optimal investment strategies and the mean-variance efficient frontier are achieved by using the stochastic maximum principle. The optimal strategies are expressed directly in terms of the insurer's wealth process and hence can be easily applied in practice. And a numerical example is given to illustrate our results.
In this note, we establish a mixed type converse duality for a class of multiobjective programming programs. This clarifies several omissions in an earlier work by Yang et al. [Mixed type converse duality in multiobjective programming problems, J. Math. Anal. Appl. 304 (2005) 394-398].
In this paper, we study a two-server Markovian network system with balking and a Bernoulli schedule under a single vacation policy, where servers have different service rates. After every service, only one server may take a vacation or continue to stay in the system. The vacation time follows an exponential distribution. An arriving customer finding both servers free will choose the faster server. If the customer finds only one server is free, this customer chooses this free server. If the customer finds both servers are not free, then this customer may join the system or balk. For this system, we obtain the steady state condition, the stationary distribution of the number of customers in the system, and the mean system size by using a matrix-geometric method. Some special cases are deduced, which match with earlier exiting results. Extensive numerical illustrations are provided. Motivation for this system model also comes from some computer communication networks with different types of traffic such as real-time traffic and non-real-time traffic, where messages can be processed by two channels (servers) with different transmission rates. The behavior of abandoning messages can be equated with the balking of customers in this system model.
This paper considers a state-dependent M/M/$c$/$c+r$ retrial queue with Bernoulli abandonment, where the number of servers is equal to $c$, the capacity of the buffer is equal to $r$ and that of the virtual waiting room (called orbit) for the retrial customers is infinite. We assume that the arrival, service and retrial rates depend on the number of customers in the system (the servers and buffer). In this paper, we first present the ergodic condition for our retrial queue. Then, by a continued fraction approach, we derive analytical solutions for the stationary joint distribution of the queue lengths in the system and in the orbit, assuming that the capacity of the system is less than or equal to 4. We further show that our analytical solutions can be computed with any desired accuracy. Finally, we present some numerical results to show the impact of the parameters on the performance of the system.
In this paper, we investigate mean sojourn times in multiclass queues with feedback and their application to packet scheduling in communication networks.
We first analyze the feedback queues with $J$ groups of customers and a single server. The server selects a group (station) in a priority order and admits its customers into the service facility according to one of the following rules: 1-limited, gated, or exhaustive. Since there are multiple classes of customers in each group, they are served in either the (local) priority order or the first-come-first-served order. We derive the mean sojourn times for all service stages of customers circulating the system.
Then we consider their application to a packet scheduling problem in communication networks where a mission-critical traffic is given some preferential treatment over other normal traffic. Packets belonging to normal traffic are allocated the resource capacity in proportion to their assigned weights in a round-robin manner, which we call the "discriminatory round robin (DRR)." We construct some composite scheduling algorithms and compare their performance.
Providing a photonic alternative to the current electronic switching in the backbone, optical packet switching (OPS) and optical burst switching (OBS) require optical buffering. Optical buffering exploits delays in long optical fibers; an optical buffer is implemented by routing packets through a set of fiber delay lines (FDLs). Previous studies pointed out that, in comparison with electronic buffers, optical buffering suffers from an additional performance degradation. This contribution builds on this observation by studying optical buffer performance under more general traffic assumptions. Features of the optical buffer model under consideration include a Markovian arrival process, general burst sizes and a finite set of fiber delay lines of arbitrary length. Our algorithmic approach yields instant analytic results for important performance measures such as the burst loss ratio and the mean delay.
This paper studies a single-server non-preemptive priority queue with two traffic classes in order to model Expedited Forwarding Per-Hop Behavior in the Differentiated Services (DiffServ) architecture. Generally, queueing models assume infinite queue capacity but in a DiffServ router the capacity for high priority traffic is typically small to prevent this traffic from monopolizing the output link and hence causing starvation of low-priority traffic. The presented model takes the exact (finite) high-priority queue capacity into account. Analytical formulas for the system content of each class are determined as well as the high-priority packet loss ratio. For each class, service of a packet takes a (different) general independent distribution. The issues this causes are resolved by using spectral decomposition. Numerical examples indicate the considerable impact of the finite capacity on system performance.
In this paper, we formulate and analyze a model of the resequencing buffer at the receiver's side for the Selective Repeat protocol over a general class of transmission channels. Thanks to its efficiency, Selective Repeat is a ubiquitous error control mechanism in many different settings, in particular in wireless protocols such as WiMax and WiFi.
In view of the correlated nature of transmission errors over wireless channels, the receiver buffer model considers a general Markovian error process. We provide both an exact mathematical analysis of the receiver buffer behavior as well as a computationally efficient large-deviations result. An asymptotic analysis of the delay is also given. Numerical examples show that the correlation of the error process has an important influence on the performance of the receiver buffer.
In wireless networks, guard channel based Call Admission Control (CAC) schemes are widely used to protect handoff calls for seamless wireless services. However, the introduction of guard channels in wireless networks results in the increase in the new call blocking probability. This general situation also occurs in a 3G-WLAN integrated network. To solve this problem in a 3G-WLAN integrated network for QoS support, we propose an adaptive guard channel based CAC scheme in this paper. The main objective of our guard channel based CAC scheme is to alleviate the increase in the new call blocking probability due to guard channels while it can still protect handoff calls. For the design of our adaptive guard channel based CAC scheme, we first develop and analyze a performance model for a general guard channel based CAC scheme based on a level-dependent quasi birth and death model. The analytic results are used to design our adaptive guard channel based CAC scheme. Numerical studies show that our adaptive guard channel based CAC scheme can achieve its objective and its performance is near optimal.
The extended real time polling service (ertPS) algorithm is added to IEEE 802.16e-2005 standards so that voice over internet protocol (VoIP) service could use resources efficiently by considering on/off characteristic of voice source. The IEEE 802.16e standard employs adaptive modulation and coding (AMC) to maximize transmission rate by assigning variable rate in accordance with the user's time-varying channel conditions determined mainly by distance from base station (BS) to mobile subscriber station (MSS). In order to apply AMC, we divide a cell into two zones with different average signal-to-noise ratio (SNR) where each zone uses its own one transmission mode. In this paper, we construct 3-dimensional Markov process of M/G/1 type whose steady state probability is obtained by the matrix analytic method. By using the steady state probability of Markov process, we obtain the probability distribution of queueing delay and find the admissible region of VoIP users with the required constraint on delay bound. Next, we propose a call admission control (CAC) scheme by considering two admissible regions for handoff calls and new calls satisfying constraints on delay bound and dropping probability of handoff call. In order to find dropping probability of handoff call and blocking probability of new call, we construct Markov chain model of proposed CAC scheme at call-level. By the mathematical results of packet-level and call-level, we obtain admissible region to admit new call and admissible region to admit handoff call satisfying the required constraints on delay bound and dropping probability of handoff call.
The paper deals with the continuous-time BM AP/G/1 queue with multiple vacations and with its application to IEEE 802.16e sleep mode. The lengths of the vacation periods have general distribution and they depend on the number of preceding vacations (dependent multiple vacation). We give the expressions for the vector generating function of the stationary number of customers and its mean. Moreover we obtain new formulas for the vector Laplace-Stieljes transform of the stationary virtual waiting time and for its first two moments in case of First-Come First-Serve scheduling.
We apply this vacation model to the IEEE 802.16e sleep mode mechanism, and we evaluate its performance as a function of the traffic intensity and the traffic correlation parameter. We give an example for determining the best sleep mode parameters for a simple optimization criteria and we also develop a cost model for the more general case. For traffic modeling we use a two-phase Markovian Arrival Process, which is appropriate to model a fairly general correlated traffic.
In this paper, we present an enhanced power saving class (PSC) type III by introducing a sleep-delay mechanism into the conventional PSC type III in the IEEE 802.16e network. Two multiple vacation queueing models: without sleep-delay and with sleep-delay, are built to capture the working principles of the conventional PSC type III and the enhanced PSC type III, respectively. Then, using the boundary state variable theory method, we analyze these queueing models and give the performance measures in terms of the switch ratio, the power saving ratio, the average response time and the system utility for both the conventional and the enhanced power saving schemes. Next, numerical results are given to demonstrate the dependency relationships between the performance measures and the sleep window size. Moreover, we compare the performance of the both systems without sleep-delay (the conventional PSC type III) and with sleep-delay (the enhanced PSC type III) to validate the effect of the sleep-delay mechanism in the enhanced PSC type III proposed in this paper. Finally, we also construct a cost function to determine the optimal time length of the sleep-delay timer for minimizing the cost function.
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]