• ETRI Journal
• /
• v.39 no.3
• /
• pp.345-352
• /
• 2017

Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.917-921
• /
• 2015

We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.83-95
• /
• 2010

This paper considers a firm that operates make-to-stock and make-to-order facilities in successive stages. The make-to-stock facility produces components which are consumed by the external market demand as well as the internal make-to-order operation. The make-to-order facility processes customer orders with the option of acceptance or rejection. In this paper, we address the problem of coordinating how to allocate the capacity of the make-to-stock facility to internal and external demands and how to control incoming customer orders at the make-to-order facility so as to maximize the firm's profit subject to the system costs. To deal with this issue, we formulate the problem as a Markov decision process and characterize the structure of the optimal inventory allocation and customer order control. In a numerical experiment, we compare the performance of the optimal policy to the heuristic with static inventory allocation and admission control under different operating conditions of the system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2376-2394
• /
• 2013

In order to ensure both of the whole system capacity and users QoS requirements in heterogeneous wireless networks, admission control mechanism should be well designed. In this paper, Multi-agent Q-learning based Admission Control Mechanism (MQACM) is proposed to handle new and handoff call access problems appropriately. MQACM obtains the optimal decision policy by using an improved form of single-agent Q-learning method, Multi-agent Q-learning (MQ) method. MQ method is creatively introduced to solve the admission control problem in heterogeneous wireless networks in this paper. In addition, different priorities are allocated to multiple services aiming to make MQACM perform even well in congested network scenarios. It can be observed from both analysis and simulation results that our proposed method not only outperforms existing schemes with enhanced call blocking probability and handoff dropping probability performance, but also has better network universality and stability than other schemes.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.127-133
• /
• 2019

A callable product is one of service derivatives using options to generate demand and reduce risk. This paper compares two booking admission controls for callable products, the online and the batch admission controls. To this end, the paper computes the optimal booking policy by using the backward dynamic programming and the stochastic optimization method. Intuitively, the provider should outperform under the batch control by utilizing demand information. The contribution of the paper is to show that the two controls are equivalent in terms of the booking strategy and the expected profit, which enables the provider to keep its current control method. The paper develops the closed-form solutions for the three fare classes. The future work is to extend the result to the model with complicated fare structures.

• IE interfaces
• /
• v.24 no.4
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

• Neonatal Medicine
• /
• v.17 no.2
• /
• pp.224-231
• /
• 2010

Purpose: Hospital readmissions have recently increased due to early hospital discharge and increased trends in breast-feeding. Neonatal hyperbilirubinemia can lead to fatal permanent neurological sequelae without appropriate management. Early detection and intervention are critical. We evaluated the clinical features, risk factors, and brain MRI findings of Korean newborns with idiopathic nonhemolytic hyperbilirubinemia to determine the optimal management policy. Methods: A retrospective review of the medical records of 79 newborns with idiopathic nonhemolytic hyperbilirubinemia was performed at the NICU of the Kyungpook National University Hospital from January 2006 to September 2009. All patients were 35 or more weeks of gestation, and their peak level of serum total bilirubin was more than 20 mg/dL. Results: The mean gestational age was $38^{+3}{\pm}1^{+4}$ weeks, and the mean age on admission was 8.8$\pm$4.0 days. The mean body weight (3,105$\pm$479 g) was decreased by 2.8$\pm$6.4 percent compared to the mean birth weight (3,174$\pm$406 g). There were no statistically significant differences for the peak serum bilirubin level or the duration and effects of phototherapy between the patients with and without risk factors, which included: breastfeeding, cephalohematoma, subdural hemorrhage, and/or ABO incompatibility. Patients were grouped according to change of body weight. Group I consisted of patients that gained weight compared to birth weight, and group II of patients that lost weight compared to birth weight. There were significant differences in the peak serum total bilirubin level between the two groups. Thirty nine patients had brain MRI evaluation; 21 patients had bilateral symmetric signal intensity increases in the globus pallidus compared to adjacent corticospinal tract and putamen on T1-weighted images. Conclusion: Bilirubin encephalopathy is preventable with early screening and proper management. Parents require instruction on feeding practices and follow-up to prevent complications from idiopathic nonhemolytic hyperbilirubinemia.