• Title/Summary/Keyword: queueing discipline

Search Result 22, Processing Time 0.023 seconds

QUEUEING ANALYSIS OF GATED POLLING SYSTEM FOR DYNAMIC BANDWIDTH ALLOCATION SCHEME IN AN EPON

  • Park, Chul-Geun;Kim, Ba-Ra;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.469-481
    • /
    • 2004
  • In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

Service Deployment and Priority Optimization for Multiple Service-Oriented Applications in the Cloud (클라우드에서 서비스 지향 응용을 위한 최적 서비스 배치와 우선순위 결정 기법)

  • Kim, Kilhwan;Keum, Changsup;Bae, Hyun Joo
    • Journal of Information Technology Services
    • /
    • v.13 no.3
    • /
    • pp.201-219
    • /
    • 2014
  • This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.

A Simulation Model for the Elevator Queueing System (승강기 대기시스템의 시뮤레이션 모델)

  • O Hyeong-Jae;Min Eun-Gi
    • Journal of the military operations research society of Korea
    • /
    • v.12 no.1
    • /
    • pp.87-105
    • /
    • 1986
  • Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

  • PDF

The Threshold Policy in the M/M/2 Queue with Server Vacation (휴가가 존재하는 M/M/2 대기 시스템의 한계치를 이용한 제어정책)

  • 이효성
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.2
    • /
    • pp.1-10
    • /
    • 1995
  • In this study, a threshold policy is considered for the M/M/2 queueing system with server vacations. The probability generating function for the number of customers present in the system is derived using an embedded Markov chain approach. Then, assuming a linear cost structure, an efficient procedure to find an optimal threshold policy is presented. The Laplace-Stieltjes transofrm for th waiting time of an arbitrary customer under a "FIFO" discipline is also derived.o derived.

  • PDF

A Call Admission Control Scheme to Guarantee a Required Delay in the Wireless Mesh Networks (무선메쉬네트워크에서 지연 성능 보장을 위한 호 접속 제어 방안)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1174-1185
    • /
    • 2012
  • This paper proposes a call admission control scheme for delay guarantee in the wireless mesh networks. The admission of a new call is determined based on the expected delay inferred from the class level available bandwidth at nodes on the path. All nodes under the effects of the new call are considered in designing the call admission control scheme to maintain the delay guarantee of the pre-existing traffic. An effective technique for estimating the available bandwidth of the neighbor nodes is proposed with no addition of message interchanges. The class-level delay control is mainly performed by the queueing discipline while keeping the MAC operation simple. Simulations are performed to show the validity of the proposals. We observe acceptable performances in delay expectation with the addition of new calls. We also show that the proposed call admission control is helpful in guaranteeing the delay performances.

A Study on the Performance of BITBUS Network as a Field Bus (Field Bus로서의 BITBUS Network에 대한 성능 연구)

  • 성백문;임동민;이황수;은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1947-1955
    • /
    • 1989
  • With the increasing complexity of cabling at sensory level in process control and manufacturing automation, field buses were introduced to replace the traditional point to point links from each sensor or acruator to its controlling equipments by a single link on which all information is transmitted seriall and multiplexed in time. In this papr, we introduce the BITBUS network as a field bus. For the service discipline of the BITBUS network, two service strategies are proposed to obtain the performance of the network. They are the equal priority cyclic service strategy and the non-equal priority cyclic service strategy. The former assigns equal priority to each node for polling and the latter assumes non-equal priority. The BITBUS network was modeled as a cyclic queueing model and it is analyzed by two methods: the Kuehn's and the Boxma's. Computer simulation was also done for the cyclic queueing model and simulation results were compared with those. Under mathematically non-analyzable environment, only the computer simulation was done. From the simulation result, in order to meet the response time requirement of 5 msec imposed by International Electrotechnical Commission when each node has the average traffic of 5000 messages/sec in manufacturing automation the number of slave nodes should be smaller than 10 at the transmission rate of 2.5 Mbps.

  • PDF

On the QoS Behavior of Self-Similar Traffic in a Converged ONU-BS Under Custom Queueing

  • Obele, Brownson Obaridoa;Iftikhar, Mohsin;Kang, Min-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.286-297
    • /
    • 2011
  • A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

Sojourn Times in a Multiclass Priority Queue with Random Feedback

  • Hong, Sung-Jo;Hirayama, Tetsuji
    • Management Science and Financial Engineering
    • /
    • v.2 no.1
    • /
    • pp.123-145
    • /
    • 1996
  • We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

  • PDF

Queue Length Analysis of Discrete-time Queueing System under Workload Control and Single Vacation (일량제어정책과 단수휴가를 갖는 이산시간 대기행렬의 고객수 분석)

  • Lee, Se Won
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.1
    • /
    • pp.89-99
    • /
    • 2020
  • In this paper, we consider a dyadic server control policy that combines workload control and single vacation. Customer arrives at the system with Bernoulli process, waits until his or her turn, and then receives service on FCFS(First come first served) discipline. If there is no customer to serve in the system, the idle single server spends a vacation of discrete random variable V. If the total service times of the waiting customers at the end of vacation exceeds predetermined workload threshold D, the server starts service immediately, and if the total workload of the system at the end of the vacation is less than or equal to D, the server stands by until the workload exceeds threshold and becomes busy. For the discrete-time Geo/G/1 queueing system operated under this dyadic server control policy, an idle period is analyzed and the steady-state queue length distribution is derived in a form of generating function.

A Stochastic Study for the Emergency Treatment of Carbon Monoxide Poisoning in Korea (일산화탄소중독(一酸化炭素中毒)의 진료대책(診療對策) 수립(樹立)을 위한 추계학적(推計學的) 연구(硏究))

  • Kim, Yong-Ik;Yun, Dork-Ro;Shin, Young-Soo
    • Journal of Preventive Medicine and Public Health
    • /
    • v.16 no.1
    • /
    • pp.135-152
    • /
    • 1983
  • Emergency medical service is an important part of the health care delivery system, and the optimal allocation of resources and their efficient utilization are essentially demanded. Since these conditions are the prerequisite to prompt treatment which, in turn, will be crucial for life saving and in reducing the undesirable sequelae of the event. This study, taking the hyperbaric chamber for carbon monoxide poisoning as an example, is to develop a stochastic approach for solving the problems of optimal allocation of such emergency medical facility in Korea. The hyperbaric chamber, in Korea, is used almost exclusively for the treatment of acute carbon monoxide poisoning, most of which occur at home, since the coal briquette is used as domestic fuel by 69.6 per cent of the Korean population. The annual incidence rate of the comatous and fatal carbon monoxide poisoning is estimated at 45.5 per 10,000 of coal briquette-using population. It offers a serious public health problem and occupies a large portion of the emergency outpatients, especially in the winter season. The requirement of hyperbaric chambers can be calculated by setting the level of the annual queueing rate, which is here defined as the proportion of the annual number of the queued patients among the annual number of the total patients. The rate is determined by the size of the coal briquette-using population which generate a certain number of carbon monoxide poisoning patients in terms of the annual incidence rate, and the number of hyperbaric chambers per hospital to which the patients are sent, assuming that there is no referral of the patients among hospitals. The queueing occurs due to the conflicting events of the 'arrival' of the patients and the 'service' of the hyperbaric chambers. Here, we can assume that the length of the service time of hyperbaric chambers is fixed at sixty minutes, and the service discipline is based on 'first come, first served'. The arrival pattern of the carbon monoxide poisoning is relatively unique, because it usually occurs while the people are in bed. Diurnal variation of the carbon monoxide poisoning can hardly be formulated mathematically, so empirical cumulative distribution of the probability of the hourly arrival of the patients was used for Monte Carlo simulation to calculate the probability of queueing by the number of the patients per day, for the cases of one, two or three hyperbaric chambers assumed to be available per hospital. Incidence of the carbon monoxide poisoning also has strong seasonal variation, because of the four distinctive seasons in Korea. So the number of the patients per day could not be assumed to be distributed according to the Poisson distribution. Testing the fitness of various distributions of rare event, it turned out to be that the daily distribution of the carbon monoxide poisoning fits well to the Polya-Eggenberger distribution. With this model, we could forecast the number of the poisonings per day by the size of the coal-briquette using population. By combining the probability of queueing by the number of patients per day, and the probability of the number of patients per day in a year, we can estimate the number of the queued patients and the number of the patients in a year by the number of hyperbaric chamber per hospital and by the size of coal briquette-using population. Setting 5 per cent as the annual queueing rate, the required number of hyperbaric chambers was calculated for each province and for the whole country, in the cases of 25, 50, 75 and 100 per cent of the treatment rate which stand for the rate of the patients treated by hyperbaric chamber among the patients who are to be treated. Findings of the study were as follows. 1. Probability of the number of patients per day follows Polya-Eggenberger distribution. $$P(X=\gamma)=\frac{\Pi\limits_{k=1}^\gamma[m+(K-1)\times10.86]}{\gamma!}\times11.86^{-{(\frac{m}{10.86}+\gamma)}}$$ when$${\gamma}=1,2,...,n$$$$P(X=0)=11.86^{-(m/10.86)}$$ when $${\gamma}=0$$ Hourly arrival pattern of the patients turned out to be bimodal, the large peak was observed in $7 : 00{\sim}8 : 00$ a.m., and the small peak in $11 : 00{\sim}12 : 00$ p.m. 2. In the cases of only one or two hyperbaric chambers installed per hospital, the annual queueing rate will be at the level of more than 5 per cent. Only in case of three chambers, however, the rate will reach 5 per cent when the average number of the patients per day is 0.481. 3. According to the results above, a hospital equipped with three hyperbaric chambers will be able to serve 166,485, 83,242, 55,495 and 41,620 of population, when the treatmet rate are 25, 50, 75 and 100 per cent. 4. The required number of hyperbaric chambers are estimated at 483, 963, 1,441 and 1,923 when the treatment rate are taken as 25, 50, 75 and 100 per cent. Therefore, the shortage are respectively turned out to be 312, 791. 1,270 and 1,752. The author believes that the methodology developed in this study will also be applicable to the problems of resource allocation for the other kinds of the emergency medical facilities.

  • PDF