• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.585-591
• /
• 2006

Generalized Processor Sharing(GPS) model provides instantaneous fair services to currently backlogged sessions. Since this fair service distributes server capacity to backlogged sessions in proportion to their weights, the fairness is only valid between the sessions serviced at the same time. From the long time view, however, this fair service provides different server capacity with one session or another, even if these sessions have the same weights. This paper proposes a cumulative fair service(CFS) model to provide fair server capacity to all sessions in the long time view. This model provides fair service in session Viewpoint because it distributes server capacity in proportion to the weights of sessions. The model and an algorithm referencing that model are analyzed for their properties and performances. Performance evaluations verify that the proposed algorithm provides proportional service capacity to sessions in the long time view.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.47-52
• /
• 2010

This paper examines the casual relations among service quality, perceived value and satisfaction from the perspective of Job Fair attendees. Numerous studies have been conducted in the field of perceived value and satisfaction. This work would be the mere contribution in the literature development but surely contribute to the better development of service providing sector to create better quality, value and satisfaction. A framework suggested that personal service, touristic attractiveness and physical environments were turned out to affect positively on the perceived value and satisfaction. The service providers should concentrate on developing the issues.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

• Journal of Korea Fair Competition Federation
• /
• no.117
• /
• pp.70-80
• /
• 2005

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.529-538
• /
• 2007

Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.379-382
• /
• 2001

In this paper, a new enhanced early fair rate allocation(EFRA＋) algorithm is proposed for ATM switches supporting ABR service. The central issue of explicit rate control algorithms for ABR service is the computation of max-min fair rates for every connection. The EFRA＋ inherits the main feature of the EFRA, uses the connection control information during the connection setup to prevent potential congestion in switches, and enhances the computation method of the max-min fair rate.

• The Korean Journal of Health Service Management
• /
• v.5 no.4
• /
• pp.149-159
• /
• 2011

The purpose of this research is to provide an available basis for marketing strategy by defining the cause-effect relation between the service level of staff members in dental clinic and purchasing behavior of the customers. This study was done in 10 days from November 2, 2009 to November 11, 2009 and the total 172 copies were used for the analysis. As a result of the correlation analysis, a significant positive correlation among all the measured variables was found. As a result of the structural model analysis, I found that the fair service among the variables of the service level significantly affects the building of relationship and the hospital image. The building of relationship and the hospital image significantly affect the positive oral spread. The building of relationship significantly affects the repurchase intentions but the hospital image does not affects the repurchase intentions. To sum up the result of this study, I found that the fair service and the building of relationship with patients are important variables in order to attract new patients and maintain existing customers. I recommend that the hospital continues to motivate staffs through internal marketing and conduct regular trainings. It is necessary to have patients satisfied with broadening responsibility and authority and set marketing strategy for the relationship with patients.

• Journal of the East Asian Society of Dietary Life
• /
• v.27 no.3
• /
• pp.257-267
• /
• 2017

This study investigated the effects of values towards Korea fair trade coffee consumers upon attitudes and behavioral intentions and verified the moderating effects of ethical consumption consciousness between relationships among values, attitudes and behavioral intentions. A total of 283 data were analyzed for consumers of fair trade coffee residing in Seoul. Structural equation models were used to identify the relationship between the variables. As a result of the analysis, Schwartz (1994)'s 30 value items were factored into four areas: openness to change, self-enhancement, conservation, and self-transcendence. The value of 'self-transcendence' showed a significant positive impact on attitudes toward fair trade coffee, whereas 'openness to change' had a significant negative impact. Positive attitude toward fair trade coffee showed a significant impact on intentions to buy fair trade coffee. In addition, a moderating effect of ethical consumption consciousness between attitude and behavioral intention was found. Limitations and future research directions are also discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.611-619
• /
• 2005

The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.