• Title/Summary/Keyword: Optimal service rate

Search Result 240, Processing Time 0.026 seconds

A New Resource Allocation with Rate Proportionality Constraints in OFDMA Systems (OFDMA 시스템에서 비율적 전송률 분배를 위한 자원 할당)

  • Han, Seung-Youp;Oh, Eun-Sung;Han, Myeong-Su;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.59-65
    • /
    • 2008
  • In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

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

Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm (최적 레이턴시 기반 공정 큐잉 알고리즘의 구현 복잡도 개선)

  • Kim, Tae-Joon;Suh, Bong-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.405-413
    • /
    • 2012
  • WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

Uniform Fractional Band CAC Scheme for QoS Provisioning in Wireless Networks

  • Rahman, Md. Asadur;Chowdhury, Mostafa Zaman;Jang, Yeong Min
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.583-600
    • /
    • 2015
  • Generally, the wireless network provides priority to handover calls instead of new calls to maintain its quality of service (QoS). Because of this QoS provisioning, a call admission control (CAC) scheme is essential for the suitable management of limited radio resources of wireless networks to uphold different factors, such as new call blocking probability, handover call dropping probability, channel utilization, etc. Designing an optimal CAC scheme is still a challenging task due to having a number of considerable factors, such as new call blocking probability, handover call dropping probability, channel utilization, traffic rate, etc. Among existing CAC schemes such as, fixed guard band (FGB), fractional guard channel (FGC), limited fractional channel (LFC), and Uniform Fractional Channel (UFC), the LFC scheme is optimal considering the new call blocking and handover call dropping probability. However, this scheme does not consider channel utilization. In this paper, a CAC scheme, which is termed by a uniform fractional band (UFB) to overcome the limitations of existing schemes, is proposed. This scheme is oriented by priority and non-priority guard channels with a set of fractional channels instead of fractionizing the total channels like FGC and UFC schemes. These fractional channels in the UFB scheme accept new calls with a predefined uniform acceptance factor and assist the network in utilizing more channels. The mathematical models, operational benefits, and the limitations of existing CAC schemes are also discussed. Subsequently, we prepared a comparative study between the existing and proposed scheme in terms of the aforementioned QoS related factors. The numerical results we have obtained so far show that the proposed UFB scheme is an optimal CAC scheme in terms of QoS and resource utilization as compared to the existing schemes.

Modeling and Simulation of Electric Vehicle Sharing System for Optimized Operation (전기차 카셰어링 시스템 최적화를 위한 모델링 및 시뮬레이션)

  • Seo, Yong Won
    • Journal of the Korea Society for Simulation
    • /
    • v.25 no.4
    • /
    • pp.93-108
    • /
    • 2016
  • Electric vehicle car sharing (EV-sharing) system is noted as an eco-friendly system of transportation in global warming crisis and has been practically implemented in some cities around the world. However, methodologies to find the efficient operation conditions of EV-sharing systems reflecting a typical characteristic 'charging' have not been fully investigated yet. In the paper a generalized model has been developed to identify optimal level of infrastructure for EV-sharing system which provides the optimum operation efficiency under service level constraints. From the simulation analysis based on the developed model the relationships between the operational variables to describe EV-sharing system have been identified and optimal capacity to maximize the operational efficiency have been found. From the analysis of simulation results it has been found that increases in the number of vehicles and chargers improve the service level until certain value beyond which increasing rate and the efficiency have been reduced. From the cost-revenue analysis the optimal numbers of vehicles and chargers have been identified which maximizes the annual operational profit.

Power Allocation Schemes For Downlink Cognitive Radio Networks With Opportunistic Sub-channel Access

  • Xu, Ding;Feng, Zhiyong;Zhang, Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1777-1791
    • /
    • 2012
  • This paper considers a downlink cognitive radio (CR) network where one secondary user (SU) and one primary user (PU) share the same base station (BS). The spectrum of interest is divided into a set of independent, orthogonal subchannels. The communication of the PU is of high priority and the quality of service (QoS) is guaranteed by the minimum rate constraint. On the other hand, the communication of the SU is of low priority and the SU opportunistically accesses the subchannels that were previously discarded by the PU during power allocation. The BS assigns fractions ?? and 1 ?? of the total available transmit power to the PU and the SU respectively. Two power allocation schemes with opportunistic subchannel access are proposed, in which the optimal values of ??'s are also obtained. The objective of one scheme is to maximize the rate of the SU, and the objective of the other scheme is to maximize the sum rate of the SU and the PU, both under the PU minimum rate constraint and the total transmit power constraint. Extensive simulation results are obtained to verify the effectiveness of the proposed schemes.

Development of Stochastic Decision Model for Estimation of Optimal In-depth Inspection Period of Harbor Structures (항만 구조물의 최적 정밀점검 시기 추정을 위한 추계학적 결정모형의 개발)

  • Lee, Cheol-Eung
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.28 no.2
    • /
    • pp.63-72
    • /
    • 2016
  • An expected-discounted cost model based on RRP(Renewal Reward Process), referred to as a stochastic decision model, has been developed to estimate the optimal period of in-depth inspection which is one of critical issues in the life-cycle maintenance management of harbor structures such as rubble-mound breakwaters. A mathematical model, which is a function of the probability distribution of the service-life, has been formulated by simultaneously adopting PIM(Periodic Inspection and Maintenance) and CBIM(Condition-Based Inspection and Maintenance) policies so as to resolve limitations of other models, also all the costs in the model associated with monitoring and repair have been discounted with time. From both an analytical solution derived in this paper under the condition in which a failure rate function is a constant and the sensitivity analyses for the variety of different distribution functions and conditions, it has been confirmed that the present solution is more versatile than the existing solution suggested in a very simplified setting. Additionally, even in that case which the probability distribution of the service-life is estimated through the stochastic process, the present model is of course also well suited to interpret the nonlinearity of deterioration process. In particular, a MCS(Monte-Carlo Simulation)-based sample path method has been used to evaluate the parameters of a damage intensity function in stochastic process. Finally, the present stochastic decision model can satisfactorily be applied to armor units of rubble mound breakwaters. The optimal periods of in-depth inspection of rubble-mound breakwaters can be determined by minimizing the expected total cost rate with respect to the behavioral feature of damage process, the level of serviceability limit, and the consequence of that structure.

Optimal Server Allocation to Parallel Queueing Systems by Computer Simulation (컴퓨터 시뮬레이션을 이용한 병렬 대기행렬 시스템의 최적 서버 배치 방안)

  • Park, Jin-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.3
    • /
    • pp.37-44
    • /
    • 2015
  • A queueing system with 2 parallel workstations is common in the field. Typically, the workstations have different features in terms of the inter arrival times of customers and the service times for the customers. Computer simulation study on the optimal server allocation for parallel heterogeneous queueing systems with fixed number of identical servers is presented in this paper. The queueing system is optimized with respect to minimizing the weighted system time of the customers served by 2 parallel workstations. The system time formula for the M/M/c systems in Kendall's notation is known. Thus, we first compute the optimal allocation for parallel M/M/c systems, comparing the results with those from the computer simulation experiments, and have the same results. The CETI rule is devised through optimizing M/M/c cases, which allocates the servers based on Close or Equal Traffic Intensities between workstations. Traffic intensity is defined as the arrival rate divided by the service rate times the number of servers. The CETI rule is shown to work for M/G/c, G/M/c queueing systems by numerous computer simulation experiments, even if the rule cannot be proven analytically. However, the CETI rule is shown not to work for some of G/G/c systems.

A Study on Non-smoking Education status through School Health Care Services (학교보건간호를 통한 금연 교육의 실태에 관한 연구)

  • Chung, Yeon Kang;Chang, Young Mee
    • Journal of the Korean Society of School Health
    • /
    • v.7 no.2
    • /
    • pp.135-143
    • /
    • 1994
  • This study is aimed at providing basic information necessary to set up education program and strategies to prevent high school students from smoking by school health care service. The main groups of study are 814 third-grade male students, 557 parents and 362 teachers, who were randomly chosen at 8 high schools in Seoul. Date analysis consisted of Chi-square test and percentage. The findings of the study are as follows: 1. The less interesting family life is, the more increasing current smoking rate is, (ex-smoking rate 53.5%, re-smoking rate 40.3%, current smoking rate 24.3%) 2. According th the results of $x^2$-test for the school life and the smoking, the students above ranking 41 showed th increase as 48.7% for continuous smoking, 18.9% for re-smoking, 67.6% for the present smoker. But it turned out that the students belonged to ranking 10 were not experienced the smoking. So it showed that there was a correlation between score and smoking. 3. It is noted that 93.3% of students, 93.3% of parents and 96.1% of teachers recognize harmful effect of smoking. But less than 70% those have recognized only half of all smoking knowledge. 4. There is a significant difference in the contends and types of education between parents and teachers. 5. For the time of home education and school health education to prevent the smoking, it turned out that 44.9% of students, 42.4% of parents, and 47.4% of teachers considered the optimal time as a high school' days. In addition it appeared that 40.5% of students, 33.4% of parents, and 54.6% of teachers recognized the necessity of the early education before the elementart school. For the optimal time to begin school health education, it showed that the middle school days were indicated from 56.6% of students, 52.7% of parents, the elementary school days were 54.6% of parents, the elementary school days were 54.6% of teachers.

  • PDF

Traffic Offloading Algorithm Using Social Context in MEC Environment (MEC 환경에서의 Social Context를 이용한 트래픽 오프로딩 알고리즘)

  • Cheon, Hye-Rim;Lee, Seung-Que;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.514-522
    • /
    • 2017
  • Traffic offloading is a promising solution to solve the explosive growth of mobile traffic. One of offloading schemes, in LIPA/SIPTO(Local IP Access and Selected IP Traffic Offload) offloading, we can offload mobile traffic that can satisfy QoS requirement for application. In addition, it is necessary for traffic offloading using social context due to large traffic from SNS. Thus, we propose the LIPA/SIPTO offloading algorithm using social context. We define the application selection probability using social context, the application popularity. Then, we find the optimal offloading weighting factor to maximize the QoS(Quality of Service) of small cell users in term of effective data rate. Finally, we determine the offloading ratio by this application selection probability and optimal offloading weighting factor. By performance analysis, the effective data rate achievement ratio of the proposed algorithm is similar with the conventional one although the total offloading ratio of the proposed algorithm is about 46 percent of the conventional one.