• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.117-133
• /
• 1990

This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.643-658
• /
• 1998

In this paper we analyze the performance of a statistical ATM multiplexer with bursty input traffic and two thresholds in the buffer by using queueing model. Two priority levels are considered for source traffic which is modeled by Markov Modulated Poisson Process to represent the bursty characteristics. Service time distributions of two priority sources are assumed to be same and deterministic for ATM environment. The partial buffer sharing scheme with one threshold may experience a sensitive state change around the threshold. But the proposed multiplexer with two thresholds avoids this hysterical phenominon to improve the system operation.

• Journal of the Korea Society for Simulation
• /
• v.8 no.2
• /
• pp.101-109
• /
• 1999

In a commercial facsimile network system, a simulation analysis has been performed using ARENA due to the unavailability of theoretical models. The effect of a priority is compared with that of the current FCFS rule on the arriving call blocking rate and transmission time delay. The result shows that the priority rule reduces more service time delay as the arrival rate increases. A simulation analysis procedure is proposed to select optimal in/out port ratio at various hourly arrival rates with a given multiple-place transmission requests ratio.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.35-43
• /
• 2013

The aim of this research is to analyze the priority to functions of the U-city Service Aid Organization(USAO), which is to support invigorating U-City industry. This research analyzes the relative importance and the priority about the functional area and components of UASO based on AHP. This research also performs a sensitivity analysis. The research result shows that relative importance of functional area is like following orders: 1) distribution of U-City service-related information, 2) quality certification of U-City-related products and services, 3) R&D of U-City technology, 4) standardization of U-City, 5) U-City human resource development. The relative importance order of functional components is 1) establishment of U-City information distribution organization, 2) construction and management of U-City information distribution network, 3) supporting U-City information distribution and price policy, 4) providing U-City information list for distribution, 5) preparation and application of quality certification standard of U-City products and services, 6) research on legal system of U-City items, targets, and procedures for quality certification, 7) research, analysis, and provision of U-City information distribution situation, 8) level examination of constructed infrastructures and services in U-City, 9) U-City core technology development and localization of technology, 10) standardization of collected U-City information, service classification, distribution system. This research result can be applied directly to design functions of USAO. The result also can be used for duty management, human resource planning, or resource allocation.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12B
• /
• pp.2109-2119
• /
• 2000

In this paper, the Packet CDMA Reservation ALOHA protocol is proposed to support the multi-traffic services such as voice and videophone services with handoff calls, high-rate data and low-rate data services efficiently on the multi-rate transmission in uplink cellular systems. The frame structure, composed of the access slot and the transmission slot, and the proposed access permission probability based on the estimated number of contending users for each service are presented to reduce MAI. The assured priority to the voice and the videophone handoff calls is given through higher access permission probability. And through the proposed code assignment scheme, the voice service can be provided without the voice packet dropping probability in the CDMA/PRMA protocols. The code reservation is allowed to the voice and the videophone services. The low-rate data service uses the available codes during the silent periods of voice calls and the remaining codes in the codes assigned to the voice service to utilize codes efficiently. The high-rate data service uses the assigned codes to the high-rate data service and the remaining codes in the codes assigned to the videophone service. Using the Markov-chain subsystem model for each service including the handoff calls in uplink cellular systems, the steady-state performances are simulated and analyzed. After a round of tests for the examples, through the proposed code assignment scheme and the access permission probability, the Packet CDMA Reservation ALOHA protocol can guarantee the priority and the constant QoS for the handoff calls even at large number of contending users. Also, the data services are integrated efficiently on the multi-rate transmission.

• Health Policy and Management
• /
• v.18 no.3
• /
• pp.1-17
• /
• 2008

The measurement and management of patient satisfaction has become one of the key issues in the last two decades. Hospitals must thoroughly understand the needs of their customers and design products and health services that meet and exceed their expectations. The importance-performance analysis(IPA) is a widely used analytical technique that yields strategies for managing customer satisfaction in a variety of applications. IP A is a two-dimensional grid based on customer-perceived importance of quality attributes and attribute performance. Depending on the interplay of these two dimensions, four strategies can be derived. The aim of this study is to develop the management strategies for improving patient satisfaction in university hospitals using the I-P analysis. The attributes on inpatient service quality in 4 university hospitals was investigated using the Martilla and James(l977)' s a mean adjusted I-P grid where the axes of the grid cross at the average rating point of all items. The patient satisfaction questionnaires were completed by 600 hospital inpatients. The main statistical methods are path analysis and IPA with SPSS 12.0 and AMOS 4.0 statistical softwares. The two attributes, physician and medical service, administrative staff kindness attributes position in first quadrant(Keep Up the Good domain). The nurse and nursing service attributes position in second quadrant(Possible Overkill domain). The two attributes, convenience of check-in service, facilities and physical environment position in third quadrant(Low Priority domain). Finally the quality of inpatient service(food etc.) attributes position in fourth quadrant(Concentrate Here domain). These findings show various implications on the development of strategies in university hospitals in the future. It was determined that quality of inpatient service(food etc.) need to concentrate more on investments. These investments include a taste, price, proper provision of food service and quick response of pain management. A low priority was given to investment in streamlining the check-in process of inpatient and hospital facilities and physical environment in the long run.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.131-134
• /
• 2005

This paper describes the efficient peer-to-peer migration method of Grid service agent on the mobile agent based P-Grid. The migration mechanism for transmitting service agent upon the service request is based on the peer's logic network topology. The network topologies that this system uses are organized as star topology, ring topology and tree topology, and agents are migrated by the master/slave method and serial/parallel method. The migration method of services is chosen based on the execution range and characteristic of the requested service. Also, the entire execution time of service is affected by the performance of peer that is a part of network topology, and the migration order, Therefore, the system monitors the performance of peers, and determines the migration priority based on analyzing and learning history. The system can reduce service execution time efficiently with decisions of migration method for service agent and priority of peers.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.