• Korean Journal of Computational Design and Engineering
• /
• v.19 no.3
• /
• pp.236-244
• /
• 2014

Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.38-49
• /
• 2017

In general, railroad operation companies sell tickets to maximize their profits by applying the ticketing release time (when selling any tickets regardless of trip distances). This study is to analyze the effect of the release time on KTX ticket reservation behavior. The reservation behavior in this study means the reservation time calculated by difference between ticketing time and departure time. The data come from KTX ticket sales data of Gyeongbu-line for a week including Saturday and Sunday. The results show that the factors to affect the reservation time are day of the week, trip distance and operation direction, in addition to the release time. Furthermore, most of tickets were reserved three hours before their departure time, and most of the up line weekend users reserved their tickets a day before the departure time. Before the release time, reservation time was affected by up line and long distance travel. On the other hand, after the release time, it was affected by long distance travel and Sunday.

• Quality Improvement in Health Care
• /
• v.19 no.1
• /
• pp.64-72
• /
• 2013

Objective: To improve customer satisfaction through accurate information using computerized automation of the test reservation system and by performing all fasting tests on the same day with one fasting. Methods: Quality improvement activities of the test reservation system of Seoul National University Bundang Hospital improves internal and external customer satisfaction at the time of test scheduling by having the reservation system reflect test order and test time automatically and making the system to increase the same day test reservation rate. Results: Test process was smooth due to accurate test reservation and information based on test priority due to the introduction of the computerized test reservation system. Internal and external customer satisfaction improved due to the marked reduction in time required for making a reservation thanks to the improvement of work process. Conclusion: Building a computerized test reservation system was an effective measure to improve external and internal customer satisfaction.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.107-115
• /
• 2005

For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.27-31
• /
• 1998

The growing usage of multimedia communication applications with specific bandwidth and real-time delivery requirements has created the needs for quality of service(QoS). In response to the growing demand for an integrated services, the Reservation Protocol(RSVP) has been designed to exchange resource reservation among routers in the internet. RSVP protocol provides the quality of service for real-time applications but the network efficiency is reduced because of the limited bandwidth. In order to use network resources efficiently. We compare the resource efficiency of traditional reservation methods with that of the proposed method and evaluate the performance of the internet phone.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.405-410
• /
• 2011

In this paper, a conflict-avoided resource reservation scheme for UWB (Ultra Wide Band) WPAN (Wireless Personal Area Network) with D-MAC (Distributed Medium Access Control) is proposed. Since distributed characteristic of the WiMedia D-MAC supporting DRP (Distributed Reservation Protocol) scheme may cause lots of conflicts, overall performances of the WiMedia D-MAC can be deteriorated. In addition, once a DRP conflict occurs, only one of the DRP reservations involved in that DRP conflict maintains the reserved MASs, while the other DRP reservation must be terminated and DRP negotiations for them have to be re-started. Such DRP termination and renegotiation time delays due to the DRP conflicts can be a critical problem to the mobile devices transceiving real-time QoS traffic streams. Therefore, we propose a mechanism to avoid DRP conflicts by providing a kind of path diversity using relay transmission scheme and demonstrate its performance improvements via simulation results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.111-113
• /
• 2000

We discuss the problem of resource reservation, such as bandwidth, for delay sensitive application in wireless networking environment. As multimedia application is becoming a critical role of the current mobile network, the resource reservation become very important to support the real-time service. In this paper, we propose and evaluate a new resource reservation protocol, called Split Reservation Protocol, in wireless network. The simulation results show that our proposed protocol outperforms an existing protocol called MPSVP in terms of network overhead.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2159-2166
• /
• 2016

In the IEEE 802.11 DCF (Distributed Coordination Function) protocol, the binary exponential backoff algorithm is used to avoid data collisions. However, as the number of stations increases of, the collision probability tends to grow and the overall network performance is reduced. To solve this problem, this paper proposes a data transmission scheme based on the channel reservation method. In the proposed scheme, channel time is divided into reservation period and contention period. During the reservation period, stations succeeded in channel reservation transmit their own data packets in sequence without contention. During the contention period, each station sends its data packets through contentions as in DCF. During both the reservation period and the contention period, each station sends a request for channel reservation for the next reservation period to an AP (Access Point). After receiving such a channel reservation request from each station, the AP decides whether the reservation is succeeded and sends the result via a beacon frame to each station. Performance of the proposed scheme is analyzed through simulations. The simulation results show that the proposed scheme tends to reduce the collision probability of DCF and to improve the overall network performance.