• 한국CDE학회논문집
• /
• 제19권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.

• 한국ITS학회 논문지
• /
• 제16권1호
• /
• pp.38-49
• /
• 2017

일반적으로 철도운영기관에서는 수익성 극대화를 위해 티켓팅 해제시간을 적용하여 티켓을 판매하고 있다. 본 연구에서는 이같은 해제시간이 KTX 예매행태에 어떻게 영향을 미치는지를 분석하였다. 예매행태는 예매시간을 의미하며 예매시각과 출발시각의 차이로 계산하였다. 분석자료는 KTX 경부선 매표자료이며, 요일별 차이를 보기위해 평일(목요일)과 토요일, 일요일의 자료를 이용하였다. 예매시간에 미치는 요인으로 해제시각이외에 요일, 운행거리, 운행방향 등을 고려하였다. 분석결과, 대부분 출발 3시간 전에 티켓을 예매하는 것으로 나타났으며, 주말 상행노선 이용객의 경우 대부분이 출발 하루 전에 예매를 하는 것으로 나타났다. 또한 해제시간 전에는 상행노선, 장거리 구간, 일요일인 경우에 예매시간이 길게 나타났으며, 반면에 해제시간 이후에는 일요일인 경우와 장거리 구간인 경우에 예매시간이 짧게 나타났다.

• 한국의료질향상학회지
• /
• 제19권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
• /
• 제22권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.

• 한국ITS학회 논문지
• /
• 제4권1호
• /
• 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.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• 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.

• 한국정보처리학회논문지
• /
• 제6권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
• /
• 제9권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (3)
• /
• 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.

• 전기학회논문지
• /
• 제65권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.