• Title/Summary/Keyword: Optimal service rate

Search Result 240, Processing Time 0.028 seconds

Power Allocation and Subcarrier Assignment for Joint Delivery of Unicast and Broadcast Transmissions in OFDM Systems

  • Lee, Deokhui;So, Jaewoo;Lee, Seong Ro
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.375-386
    • /
    • 2016
  • Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

Disaggregate Demand Forecasting and Estimation of the Optimal Price for VTIS (부가교통정보시스템(VTIS) 이용수요예측 및 적정이용료 산정에 관한 연구)

  • 정헌영;진재업;손태민
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.4
    • /
    • pp.27-38
    • /
    • 2002
  • VTIS(Value-added Traffic Information System), among the sub-systems of ATIS, is an Advanced Traffic System which innovates efficiency and safety. And this system, having marketability and publicness, is very important. Moreover, This system offers definite traffic information according to the demand of specified users. And it is expected to produce additional spread effects because of high participation rate of private sector. However, the VTIS service media are varied and there are varied optimal Prices and payment methods according to each medium. Because of that, there needs the study on these problems or optimal criteria. But because existing studies were devoted to estimate the optimal route, the study toward the optimal price which was considered part of user and service use demand do not exist. Accordingly, we surveyed under imaginary alternative pricing scenarios and forecasted the use demand of VTIS by using Binary Logit model. Also, for the users who answered that they would use VTIS service in survey, we classified their use's behaviors as four categories and estimated the use ratio to each category by using Ordered Probit model. Last, using sensitivity analysis for results form above, we derived the optimal price that is 2800won in monthly. 145won in payment per call. Then, VTIS service use rate is respectively 65%, 75%.

The Propose of Optimal Flow Data Acquisition by Error Rate Analysis of Flow Data (유량 데이터 오차율 분석을 통한 최적의 유량데이터 취득방안 제안)

  • Kim, Yunha;Choi, Hyunju
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.31 no.3
    • /
    • pp.249-256
    • /
    • 2017
  • Recently, application areas based on M2M (Machine-to-Machine communications) and IoT (Internet of Things) technologies are expanding rapidly. Accordingly, water flow and water quality management improvements are being pursued by applying this technology to water and sewage facilities. Especially, water management will collect and store accurate data based on various ICT technologies, and then will expand its service range to remote meter-reading service using smart metering system. For this, the error in flow rate data transmitting should be minimized to obtain credibility on related additional service system such as real time water flow rate analysis and billing. In this study, we have identified the structural problems in transmitting process and protocol to minimize errors in flow rate data transmission and its handling process which is essential to water supply pipeline management. The result confirmed that data acquisition via communication system is better than via analogue current values and pulse, and for communication method case, applying the industrial standard protocol is better for minimizing errors during data acquisition versus applying user assigned method.

Capacity of Spectrum Sharing Cognitive Radio with MRC Diversity under Delay Quality-of-Service Constraints in Nakagami Fading Environments

  • Zhang, Ping;Xu, Ding;Feng, Zhiyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.632-650
    • /
    • 2013
  • The paper considers a spectrum sharing cognitive radio (CR) network coexisting with a primary network under the average interference power constraint. In particular, the secondary user (SU) is assumed to carry delay-sensitive services and thus shall satisfy a given delay quality-of-service (QoS) constraint. The secondary receiver is also assumed to be equipped with multiple antennas to perform maximal ratio combining (MRC) to enhance SU performance. We investigate the effective capacity of the SU with MRC diversity under aforementioned constraints in Nakagami fading environments. Particularly, we derive the optimal power allocation to achieve the maximum effective capacity of the SU, and further derive the effective capacity in closed-form. In addition, we further obtain the closed-form expressions for the effective capacities under three widely used power and rate adaptive transmission schemes, namely, optimal simultaneous power and rate adaptation (opra), truncated channel inversion with fixed rate (tifr) and channel inversion with fixed rate without truncation (cifr). Numerical results supported by simulations are presented to consolidate our studies. The impacts on the effective capacity of various system parameters such as the number of antennas, the average interference power constraint and the delay QoS constraint are investigated in detail. It is shown that MRC diversity can significantly improve the effective capacity of the SU especially for cifr transmission scheme.

An Optimal Algorithm for Repairable-Item Inventory System with Depot Spares (중앙창 재고가 있는 수리가능시스템을 위한 해법)

  • 김종수;신규철
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.3
    • /
    • pp.1-11
    • /
    • 1999
  • We consider the problem of determining the spare inventory level for a multiechelon repairable-item inventory system. Our model extends the previous results to the system which has an inventory at the central depot as well as bases. We develop an optimal algorithm to find spare inventory leveis, which minimize the total expected cost and simultaneously satisfy a specified minimum service rate. The algorithm is tested using problems of various sizes to verify the efficiency and accuracy.

  • PDF

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

  • Liao, Dan;Li, Lemin
    • ETRI Journal
    • /
    • v.29 no.2
    • /
    • pp.201-211
    • /
    • 2007
  • This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

  • PDF

-A study on Optimal Cost Model of Combined ESS and Burn-in under Warranty Policy- (품질보증정책하에 ESS와 Burn-in을 결합한 최적비 용모형 의 설정$^{1)}$)

  • 송서일;조영찬;박현규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.24 no.62
    • /
    • pp.1-10
    • /
    • 2001
  • The electronics industry is fast growing segment of manufacturing and service industries. It is important that the manufacturer develops a product with adequate life cycle, high quality, and low failure rate in the specified time period. Environmental Stress Screening(ESS) and burn-in are widely used in the electronic industry to assist in the elimination of early failure. In this research, we construct optimal cost model of combined ESS and burn-in under various warranty policy and establish optimal testing times for given environments. Also we conduct sensitivity analysis on various parameter. The results of this study are summarized as follows. Comparing free warranty policy to rebate warranty policy, optimal ESS time is longer under free warranty policy, and optimal burn-in time is longer under rebate warranty policy. Free warranty policy higher than rebate warranty policy in total cost.

  • PDF

A Study on M / M (a, b ; ${\mu}_k$) / 1 Batch Service Queueing Model (M/M(a, b ; ${\mu}_k$)/1 배치 서비스 대기모델에 대한 연구)

  • Lee, Hwa-Ki;Chung, Kyung-Il
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.3
    • /
    • pp.345-356
    • /
    • 1995
  • The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.

  • PDF

A Simulation Analysis for Selecting In/Out Port Ratio in FAX Network System Operation (팩스 통신망 입출력회선 비율 설정에 관한 시뮬레이션 분석)

  • 나윤균
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.2
    • /
    • pp.101-109
    • /
    • 1999
  • In a commercial facsimile network system, a simulation analysis has been performed using ARENA due to the unavailability of theoretical models. The effect of a priority is compared with that of the current FCFS rule on the arriving call blocking rate and transmission time delay. The result shows that the priority rule reduces more service time delay as the arrival rate increases. A simulation analysis procedure is proposed to select optimal in/out port ratio at various hourly arrival rates with a given multiple-place transmission requests ratio.

  • PDF

Variance Reductin via Adaptive Control Variates(ACV) (Variance Reduction via Adaptive Control Variates (ACV))

  • Lee, Jae-Yeong
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.1
    • /
    • pp.91-106
    • /
    • 1996
  • Control Variate (CV) is very useful technique for variance reduction in a wide class of queueing network simulations. However, the loss in variance reduction caused by the estimation of the optimum control coefficients is an increasing function of the number of control variables. Therefore, in some situations, it is required to select an optimal set of control variables to maximize the variance reduction . In this paper, we develop the Adaptive Control Variates (ACV) method which selects an optimal set of control variates during the simulation adatively. ACV is useful to maximize the simulation efficiency when we need iterated simulations to find an optimal solution. One such an example is the Simulated Annealing (SA) because, in SA algorithm, we have to repeat in calculating the objective function values at each temperature, The ACV can also be applied to the queueing network optimization problems to find an optimal input parameters (such as service rates) to maximize the throughput rate with a certain cost constraint.

  • PDF