• Health Policy and Management
• /
• v.3 no.1
• /
• pp.1-24
• /
• 1993

This study is designed to find clues to make a plan for efficient hospital bed utilization. Author has tried to estimate the level of appropriateness and to find out factors affecting intra-hospital variation of inappropriate bed utilization using modified Appropriateness Evaluation Protocol of which criteria are based on service intensity and patients' conditions. Systematic random sampling was done from the population of inpatients during one month in on university hospital. Data were collected by concurrent and retrospective medical record review and analysed by multiple logistic regression. In medical services, 83.5% of admission reveals appropriate and the level of inappropriate admission shows significant differences by patients' residence, type of department admitted to, admission 개\ulcorner, and length of stay. In surgical services, 97.3% and 34.7% are appropriate in location and timing of surgery respectively. Inappropriate timing of surgery differs significantly depending on patients' age, type of department admitted to, admission route, and length of stay. Sixty two percent of hospital days shows appropriate and the level of inappropriateness show marked differences by patients'age, type of services, admission routes, part of the month, part of the stay, and length of stay. Inappropriate hospital days are due to inappropriate level of care, premature admission, improper scheduling of diagnostic or therapeutic procedures, and problems in scheduling surgery in sequence. In conclusion, substantially high proportion of inappropriate hospital bed utilization was confirmed. To reduce it, it is necessary to develop alternative services with which can replace inpatient services, and to introduce utilization management system which may include internal peer review.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.595-602
• /
• 2003

In this paper, we proposed new buffer management and cell scheduling scheme of GFR service for improving fairness of TCP/IP traffic in ATM networks. The proposed algorithm used untagged cell, which came to ATM switch, to decide the policy for discard of frame and what kind of VC cell it would serve. Performance analysis through the simulation present that proposed scheme can meet fairness 2 (MCR Plus equal share), which are not met by conventional scheduling mechanism such as WRR. Also, proposed scheme is superior to WRR about 30% in throughput and more efficiency in fairness criteria.

• The Korean Journal of Applied Statistics
• /
• v.22 no.3
• /
• pp.541-551
• /
• 2009

Generalized processor sharing(GPS) service policy is a scheduling algorithm to allocate the bandwidth of a queueing system with multi-class input traffic. In a queueing system with single-class traffic, the stationary queue length becomes larger stochastically when the bandwidth (i.e. the service rate) of the system decreases. For a given GPS server, we consider the similar problem to this. We define the monotonicity for the head of the line processor sharing(HLPS) servers in which the units in the heads of the queues are served simultaneously and the bandwidth allocated to each queue are determined by the numbers of units in the queues. GPS is a type of monotonic HLPS. We obtain the HLPS server whose queue length of a class stochastically bounds upper that of corresponding class in the given monotonic HLPS server for all classes. The queue lengths process of all classes in the obtained HLPS server has the stationary distribution of product form. When the given monotonic HLPS server is GPS server, we obtain the explicit form of the stationary queue lengths distribution of the bounding HLPS server. Numerical result shows how tight the stochastic bound is.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.233-241
• /
• 2008

The overlay multicast that has been recently presented as an alternative for the IP multicast needs scheduling method that can apply the system resource and the network bandwidth for the many users. We propose a efficient overlay multicasting network policy for multimedia services with composite stream service topology. And in order to evaluate the ability of the proposed scheme's performance, We test the performance of multi_casting nodes with RTT values, the bandwidth attrition rate for building the network topology and MOR effects with Overcast[5] The result of simulation shows improves about $8{\sim}20%$ of performance.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.251-256
• /
• 2012

In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.12
• /
• pp.1163-1168
• /
• 2006

Manufacturing technology for the production of high value-added fine chemical products is emphasized and getting more attention as the diversified interests of customers and the demand of high quality products are getting bigger and bigger everyday. Thus, the development of advanced batch processes, which is the preferred and most appropriate way of producing these types of products, and the related technologies are becoming more important. Therefore, high-precision batch distillation is one of the important elements in the successful manufacturing of fine chemicals, and the importance of the process operation strategy with quality assurance cannot be overemphasized. Accordingly, proposing a process structure explanation and operation strategy of such processes including batch processes and batch distillation would be of great value. We investigate optimal operation strategy and production planning of multi-purpose plants consisting of batch processes and batch distillation for the manufacturing of fine chemical products. For the short-term scheduling of a sequential multi-purpose batch plant consisting of batch distillation under MPC and UIS policy, we proposed a MILP model based on a priori time slot allocation. Also, we consider that the waste product of being produced on batch distillation is recycled to the batch distillation unit for the saving of raw materials. The developed methodology will be especially useful for the design and optimal operations of multi-purpose and multiproduct plants that is suitable for fine chemical production.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1614-1620
• /
• 2009

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.217-226
• /
• 2006

Intensive studies have been made in the area of N-VOD server Multimedia files in the N-VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient VCR-LIKE operations and buffer, disk scheduling policy for multimedia services with management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about 18% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.193-204
• /
• 2006

In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.