A Dormant Multi-Controller Model for Software Defined Networking

In order to improve the scalability and reliability of Software Defined Networking(SDN),many studies use multiple controllers to constitute logically centralized control plane to provide load balancing and fail over.In this paper,we develop a flexible dormant multi-controller model based on the centralized multi-controller architecture.The dormant multi-controller model allows part of controllers to enter the dormant state under light traffic condition for saving system cost.Meanwhile,through queueing analysis,various performance measures of the system can be obtained.Moreover,we analyze the real traffic of China Education Network and use the results as the parameters of computer simulation and verify the effects of parameters on the system characteristics.Finally,a total expected cost function is established,and genetic algorithm is employed to find the optimal values of various parameters to minimize system cost for the deployment decision making.

Appointment scheduling with customer impatience based on operating cost model

An appointment scheduling problem is studied with the consideration of customer impatience.On the assumption that both the time of leaving queue and the time of service are exponentially distributed,in order to minimize the joint cost,the optimal appointment schedule of the fixed number of customers is studied.The joint cost function is composed of customers expected delay time and service availability time.The expected delay time of each customer in the queue is recursively computed in terms of customer interarrival time.Furthermore,the effect of impatience on the optimal schedule as well as the total operating cost is studied.The results show that as the impatience rate increases,the optimal interarrival time becomes shorter and the interarrival time of the last few customers gradually approaches that of the customers in the middle.In addition,impatient behaviors can increase the joint cost.

Ergodicity of the IP P＋M/M/c Queue

The IP P＋M/M/c queueing system has been extensively used in the modern communication system.The existence and uniqueness of stationary distribution of the queue length L（t）for IP P＋M/M/1 queue has been proved in[10].In this paper,we shall give the su？cient and necessary conditions of l-ergodicity,geometric ergodicity,and prove that they are neither uniformly polynomial ergodicity nor strong ergodicity.

Intercepts allocation for layered defense

One important mission of the strategic defense is to develop an integrated, layered ballistic missile defense system（BMDS）. Considering the problem of assigning limited defense weapons to incoming ballistic missiles, we illustrate how defense weapons, ballistic missiles, kill probability and effectiveness of defense（ED） are interrelated and how to understand this relationship for achieving the best allocation plan. Motivated by the queueing theory, in which the available resources are not sufficient to satisfy the demands placed upon them at all times, the layered deployed defense weapon is modeled as a queueing system to shoot Poisson arrived targets. Simultaneously, examples, of optimum intercepts allocation problems under different constraints are presented. The four theorems determine the allocation rules of intercepts to targets that maximize ED or minimize the cost to achieve a required ED.

Optimizing QoS performance of service requests in grid

Workload of each service class varies dynamically in the grid environment, making the static service pool size allocation scheme unable to guarantee the QoS requirement of each service class. In this paper, we link the issue of dynamical service pool size allocation scheme with QoS requirement under the varying workload, and formulate the QoS performance of service requests in the grid environment by queue theory. Combined Lagrangian optimization with a bisearch approach, the problem of optimally allocating service pool size scheme is resolved. Simulation results show efficiency of the optimal service pool size allocation scheme.

Traffic analysis on carrier accessing for WLAN indoor positioning system

Currently,the WLAN indoor positioning system attracts a lot of interests,not only because of the cheap implementation but also because of the high positioning accuracy comparing with other indoor positioning systems.The WLAN indoor positioning system contains two phases,which are offline phase and online phase.In the online phase,the WLAN equipment user(UE) has to access to the WLAN for the latest radio map and positioning software.Due to during the network allocation vector(NAV) duration,the WLAN channel is only reserved for one WLAN UE,others UEs' carrier accessing will be blocked.In addition,the blocked UE will make a retrial accessing,which will definitely introduce more traffic blocking to the WLAN.So In this paper,based on the analysis of the WLAN indoor positioning system architecture,a proper queuing model by using of the Extended Erlang B formula is proposed,which takes the retrial calling percentage into consideration in the proposed model.The simulation results show that the proposed method is more accurate and performs well to predict the blocking probability.

THE MATCHED QUEUEING SYSTEM GI。PH/PH/1

We study the matched queueing system GIoPH/PH/1, where the type-I input is a renewal process, the type-II input is a PH renewal process, and the service times are i. i. d. random variables with PH-distributions. First, a condition is given for the stationarity of the system. Then the distributions of the number of type-I customers at the arrival epoches of type-I customers and the number of type-I customers at an arbitrary epoch are derived. We also discuss the occupation time and the waiting time. Their L. S. transforms are derived. Finally, we discuss some problems in numerical computation.

Determining exact survival probability by setting discrete random variables in E. Sparre Andersen’s model

In this work,we propose an alternative to the Pollaczek-Khinchine formula for the ultimate time survival(or ruin)probability calculation in exchange for a few assumptions on the random variables that generate the renewal risk model.More precisely,we demonstrate the expressibility of the distribution function n P(sup n≥1^(n)∑_(i=1)(X_(i)-cθ_(i))<u),u∈N_(0)using the roots of the probability-generating function,expectation E(X-cθ)X-cθ,and probability mass function of.We assume that the random X_(1),X_(2),...cθ_(1),cθ_(2),...variables of the mutually independent sequences and are cθc>0 X cθindependent copies of X and respectively,wherein,and are independent,θnonnegative,and integer.We also assume that the support of is finite.To illustrate the applicability of the proven theoretical statements we present a few numerical outputs when the mentioned random variables adopt some particular distributions.

The GI/M/1 Queue in a Multi-phase Service Environment with Working Vacations and Bernoulli Vacation Interruption

In this paper,we consider a GI/M/1 queue operating in a multi-phase service environment with working vacations and Bernoulli vacation interruption.Whenever the queue becomes empty,the server begins a working vacation of random length,causing the system to move to vacation phase 0.During phase 0,the server takes service for the customers at a lower rate rather than stopping completely.When a vacation ends,if the queue is non-empty,the system switches from the phase 0 to some normal service phase i with probability qi,i=1,2,⋯,N.Moreover,we assume Bernoulli vacation interruption can happen.At a service completion instant,if there are customers in a working vacation period,vacation interruption happens with probability p,then the system switches from the phase 0 to some normal service phase i with probability qi,i=1,2,⋯,N,or the server continues the vacation with probability 1−p.Using the matrix geometric solution method,we obtain the stationary distributions for queue length at both arrival epochs and arbitrary epochs.The waiting time of an arbitrary customer is also derived.Finally,several numerical examples are presented.

Exponential and Strong Ergodicity for Markov Processes with an Application to Queues

For an ergodic continuous-time Markov process with a particular state in its space,the authors provide the necessary and sufficient conditions for exponential and strong ergodicity in terms of the moments of the first hitting time on the state.An application to the queue length process of M/G/1 queue with multiple vacations is given.

BOTTLENECKS IN PRODUCTION NETWORKS: AN OVERVIEW

Bottlenecks, the key ingredients for improving the performances of the production networks, have been profoundly studied during the last decade. Yet, because of the complexity of the research results, there is still a significant gap between theory and practice. In this paper, we review various bottleneck definitions, detection methods and the asymptotic results and provide a practical guidance for recognizing and utilizing the bottlenecks in production networks. Queueing theory works as the mathematical foundation in our study. Various definitions of the bottlenecks are classified as either Performance in Processing （PIP） based or sensitivity based definitions, which reflect the preferences of the managers. Detection methods are surveyed closely based on the definitions. These methods are used to recognize the bottlenecks and to provide diagnosis results to managers. Comparisons show that different detection methods may lead to vastly different conclusions. The recognition of the bottlenecks has another advantage： the ultimate phenomena of the bottlenecks can greatly reduce the computation complexity in calculating the system performances. Bottlenecks based approximation and asymptotic results are studied to exhibit the contribution of bottlenecks in performance estimation and theoretical analysis.

THE POINT PROCESS OF STATETRANSITIONS IN AREGULAR MARKOV CHAIN

In this paper, we study the point process of state transitions in a regular Markov chain.Under a weaker condition, we prove that the point process is a 1-memory self-exciting point process and again obtain four useful formulas of the transition frequency, the absorbing distribution,the renewal distribution and the entering probability. As an applicstion, using these formulas we derive the LS transform of the busy period for the M/M/∞ queue.

The Optimizing QoS Miss Rate Scheme for the Data Centers

In this paper, we discuss quality of service requirements and impacts of different workloads of each service class on the resource proportion allocation scheme, and formulize the problem of minimizing the quality of service miss rate of service requests by using the queuing theory. The optimally allocating resource proportion scheme is obtained by the Lagrangian optimization approach. Our simulation results show that our scheme is efficient.

A Bandwidth Control Method Providing Entrance QoS for Multimedia Communication

With the development of wideband IP network, many new IP-Based multimedia applications appear ceaselessly. The real-time multimedia application requires that the IP network provides QoS. To the end-to-end real-time multimedia communication, the QoS service includes the trunk QoS and the entrance QoS. The trunk QoS has some feasible technologies, such as RSVP and DiffServ. But, the entrance QoS has few technologies at the moment. So, this paper introduces the entrance bandwidth control to get the end-to-end QoS. The design and scheme of bandwidth controller applying to the usual Internet application and real-time media communication is provided in this paper. It distinguishes between the usual 1nternet applications, such as HTTP and FTP, and the real-time multimedia applications, such as Internet telephony and videoconferencing. Then they will be dealt with in different ways in order to satisfy the QoS requirements of different types of services. In this paper, we propose a new bandwidth control method for real-time multimedia communication. The principle, the implementing flow, the control policy and the application scheme are discussed.