• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.61-64
• /
• 2003

GPRS is designed for transmitting packet data and supposed to take its radio resource form the pool of channels unused by GSM voice services. In this paper, The GPRS and GSM circuit switched services share the same radio resource. Whenever a channel is not used by circuit switched services, it may be utilized by GPRS. In this paper, the main aim is performance and comparison resource management policies with channel de-allocation in GPRS network. Three resource management policies is voice priority, R-reservation, dynamic reservation.

• Korean Journal of Environment and Ecology
• /
• v.17 no.1
• /
• pp.92-100
• /
• 2003

The purpose of this study is to survey and analyze of the visitor's cognition of Visitor-Reservation System in Soraksan National Park. To accomplish the purpose, a questionnaire survey was employed in Soraksan National Park. The contents of questionnaire consist of the socioeconomic characteristics and the types of visiting, the activity, the cognition of Visitor-Reservation System. 166 samples of total 170 respondents were used for final analysis. As a result of the analysis, the socioeconomic characteristics and the type of visiting were showed similar trends with results from other National Park visitor survey Most of respondents recognized the enforcement Visitor-Reservation System and A majority of respondents affirmatively recognized the introduction Visitor-Reservation System. Most of respondents wanted an easy method reservation and cancel in enforcement Visitor-Reservation System. Besides Most of respondents recognized negative conception on regulation(nature-rest system, facility-reservation system etc) of National Park Authority(N.P.A). About expanding enforcement Visitor-Reservation System of National Park's preservation, 'Agree Group' was almost equal with 'Disagree Group'. About more effect operate the Visitor-Reservation System Most of respondents were agree to introduce penalty.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.299-310
• /
• 2002

This paper describes an integrated network management framework for providing point-to-multipoint reservation service (PMRS) in an ATM network. There are two major issues confronting the network service provider in relation to this service: one is to rapidly confirm the acceptability of the subscriber's reservation at subscription time, and the other is to punctually activate the reserved point-to-multipoint service. To meet these requirements, we developed a service provision model (SPM) and a network resource model of a bandwidth allocation timetable (BATT). We propose a point-to-multipoint routing algorithm composed of ordering and backtracking procedures, which can find the best branch point under the complex network topology and can add more destinations to the existing point-to-multipoint route. We demonstrate the feasibility of the SPM, the BATT, and the point-to-multipoint routing algorithm by implementing our schemes and analyzing their performance under the operational ATM network of KT(Korea Telecom).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.105-115
• /
• 2005

By committing to a long-term replenishment contract, buyers can purchase a product at a lower price from a supplier who is less pressured to find new customers due to the long-term contract and can charge a discounted price. We develop an analytical model from the buyer's perspective to investigate a capacity reservation contract. We are considering the system with a single supplier and a buyer. The buyer can purchases any desired amount from a spot market at a higher price in addition to the contracted amount. For such a system, we propose an algorithm to derive the optimal contract terms. The result of computational experiments shows that the algorithm finds the global optimum solution in a resonable amount of time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.115-135
• /
• 2008

An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.165-181
• /
• 1991

This paper presents a developmental approach undertaken by Asiana Airlines to implement computerized reservation system (CRS), Asiana Airlines is a new entrant into the once monopolized airline business in Korea. As a new entrant, it was absolutely necessary to develop CRS fast to begin the business in a relatively short period of time. By taking the risk of choosing Airline Control System which no airlines has yet implemented CRS with, Asiana Airlines was able to shorten development time considerably as well as integrate CRS with internal management information systems. This enhances system flexibility greatly. It is initially viewed that developing CRS is not to get competitive advantage but to overcome competitive disadvantage at Asiana Airlines. The paper also surveys the changing environment of CRS in general and the future implementation plan for ARTIS(Asiana Airline Reservation and Travel Information System) to be more of a competitive weapon in increasingly competitive international air travel market.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5174-5190
• /
• 2016

Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.209-222
• /
• 1997

In this paper, we study a bargaining order problem where one buyer sequentially bargains with two sellers whose reservation prices are unknown to the buyer but correlated. Our main question is who the buyer should bargain first with to maximize his expected payoff. This type of problem is widely applicable to business and political situations where one party negotiates with multiple parties sequentially. One of the most important element in a sequential bargaining is "linkage effect" which exists when the aggreement of the previous bargaining affects the outcome of the following bargaining. To examine "linkage effect", we assume that the sellers'objects are similar so that the sellers' reservation prices are correlated. In addition, to consider incomplete information aspect regarding reservation prices, it is assumed that the sellers' reservation prices are unknown to the buyer. That is, we deal with one sided incomplete information case. In our model, there are two stages in each of which the buyer meets one seller. Since we are concerned with the bargaining order, we consider two different bargaining orders. Using game theory, we find a perfect Bayesian equilibrium and compute the buyer's expected payoff for each bargaining order. Finally we identify the advantageous bargaining order for the buyer by comparing the expected payoffs obtained under two different bargaining orders. Our results are as follows: the advantageous bargaining order depends on the prior probability of the seller type. However, in general, the buyer should bargain first with the seller whose object is less valuable to the buyer. The basic reason for our result is that the buyer wants to experiment in the first stage to find out the sellers' reservation prices and in doing so, to minimize the experimental cost and maximize potential gain in case of negotiation failure in the first stage. in the first stage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.599-606
• /
• 2016

Many people feel uncomfortable when fitness center is crowded with people in all at the same time. So we propose exercise machines reservation system for resolving the problem that people feel uncomfortable in fitness center. In this paper, we design and implement the exercise machines reservation system that allows for users to reserve fitness equipments by using a NFC-based smart band. A user can reserve exercise machine using some reservation device. he or she will receive notifications through the smart band about when and which machine she or he will have to use. The user can do exercise with a recommended program, and can use any equipments conveniently even in a peak time because no one is waiting. Also, a manager can save cost through the efficient facility management and provide customized member management. Additionally, manager don't need to purchase other exercise machines or computers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1346-1356
• /
• 2011

Transportation has been playing important role in our society by providing for people, freight, and information. However, it cuts its own throat by causing car accidents, traffic congestion, and air pollution. The main cause of these problems is a noticeable growth in the number of vehicles. The easiest way to mitigate these problems is to build new road infrastructures unless resources such as time, money, and space are limited. Therefore, there is a need to manage the existing road infrastructures effectively and safely. In this paper, we propose a road reservation scheme that provides fast and safe response for emergency vehicles using ubiquitous sensor network. Our idea is to allow emergency vehicle to reserve a road on a freeway for arriving to the scene of the accident quickly and safely. We evaluate the performance by three reservation method (No, Hop, and Full) to show that emergency vehicles such as ambulances, fire trucks, or police cars can rapidly and safely reach their destination. Simulation results show that the average speed of road reservation is about 1.09 ~ 1.20 times faster than that of non-reservation at various flow rates. However, road reservation should consider the speed of the emergency vehicle and the road density of the emergency vehicle processing direction, as a result of Hop Reservation and Full Reservation performance comparison analysis. We confirm that road reservation can guarantee safe driving of emergency vehicles without reducing their speed and help to mitigate traffic congestion.