• Korean Management Science Review
• /
• v.25 no.3
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.1
• /
• pp.101-112
• /
• 2004

Customer satisfaction level is usually measured in terms of price, qualify, customization, after-sale-service, product variety etc. Each firm sets up a distinctive production/marketing strategy to gain competitive advantage by Prioritizing the customer satisfaction measures. The market differentiation strategy directly results in supply chain performance such as lead time, inventory, customer fill rate and market share. Product proliferation desirable in customization sense often conflicts the economies of scale effect in production side. This paper focuses the relationship between product variety and market share. Specifically, we investigate how introduction of new product affects the current market share, i.e., formation of customer preference and provide some insight into the optimal range of product variety.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.56 no.6
• /
• pp.11-18
• /
• 2014

Vulnerable areas by non-point source pollution and prioritizing control areas were researched using hydrological and geomorphological data, non-point source loads, and water quality data. Using overlay analysis, vulnerable areas were graded with various scenarios. Vulnerable areas were selected near the metro city with impermeable landuse because non-point source loads and water quality data had influence on overlay analysis to rank vulnerable area. Analysis scenarios and weighted values can be changed under regional characteristics and given conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.178-194
• /
• 2009

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.21-32
• /
• 1998

A primary concern of physical database design has been efficient retrieval and update of a record because predictable performance of a DBMS is indispensable to time-critical missions. To maintain such phenomenal performance, database manages often spends more than or as much as the goal of an organization can warrant. The motivation of this research stems from the fact that even predictable performance of a physical database can be hampered by stochastic query processing time, physical configurations of a database, and random arrival processes of queries. They all together affect the overall performance of a DBMS. In particular, if there are queuing delays due to limited capacity or during on-peak congestion, this paper suggest to prioritize database services. A surprising finding of this paper is that such a transition from a non-priority system to a corresponding priority-based system can be Pareto-improving in the sense that no users in the system will be worse off after the transition. Thus prioritizing database services can be a viable option for efficient database management.

• The Journal of Society for e-Business Studies
• /
• v.3 no.1
• /
• pp.69-80
• /
• 1998

CALS has been a hot issue in the information-related industry in the world in order to achieve the competitive advantage of a firm or a nation. Nontheless, while there is an abundance of literature advocating the importance of introducing CALS, little attention has been given to the analysis of processes to be applied by CALS. This research conducts a case study on Firm H, investigating its processes for which CALS should be deployed and prioritizing these processes. Based on the analysis of the interviews with CALS experts who are familiar with the processes of Firm H, this paper concludes that CALS must be applied to the processes of the purchase/supply for Firm H, followed by such processes as the development of telephone exchangers, the operations management, and the service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.277-285
• /
• 2008

We previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.9 no.1
• /
• pp.7-12
• /
• 2010

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop counts. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.11-20
• /
• 2005

Strict priority scheduling scheme is a good candidate for the implementation of service differentiation in an Internet because of simplicity in implementation and the capability to guarantee the delay requirement of the highest class of traffic. However, it is also blown that strict priority starves the lower-class traffic at the cost of prioritizing the higher-class traffic. The purpose of this work is to propose an analytic method which can estimate the average delay performance of Diffserv service architecture and shows that strict priority scheme does not sacrifice the lower class traffic over a diverse condition of the load. From the numerical experiments for three-class Diffserv network we validate our argument that strict priority scheme may be applied to a service differentiation scheme for the future Internet.

• Journal of Broadcast Engineering
• /
• v.6 no.3
• /
• pp.234-245
• /
• 2001

According to market needs of better quality of service (QoS) for realtime multimedia services over Internet, they haute been standardizing RSVP, Intserv, and DiffiServ. This paper combines the benefits of RSVP/IntServ with scalable video encoding. We Propose that more important bit stream is given more priority such that limited network resources are reserved for the stream Various prioritizing approaches are proposed and compared to normal approach by using Network Simulator. The calculated QoS parameters such as Packet loss rate are used to calculate degree of degradation in video quality.