• Journal of the Korean Home Economics Association
• /
• v.35 no.3
• /
• pp.245-257
• /
• 1997

The purpose of this study is to interpretate filial piety norm based on reciprocity and fairness. For this goal, we reviewed literature related to social, economical, and cultural situations, centered on the middle of the seventeenth century. The major results can be summerized as follow: The interaction between the parent generation and the married adult children generation changed according to the context of particular social, economical, and cultural conditions, so filial piety norm must also change paced along with social change. Therefore, the concepts of reciprocity and fairness has been an important one which maintains the quality of the relationship between the parent generation and the married adult children generation. So in general, we think it is reasonable to draw the conclusion that there are reciprocity and fairness principle between the parent generation and the married adult children generation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.225-230
• /
• 2010

In this paper, we propose a new power control scheme to maximize the network throughput with fairness provisioning. Based on the game model, decisions in the scheme cooperatively and collaborate with each other to satisfy efficiency and fairness requirements. The simulation results demonstrate that proposed scheme has excellent network performance, while other schemes cannot offer such an attractive performance balance.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.624-633
• /
• 2018

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2262-2269
• /
• 2016

In IEEE 802.11 wireless LANs, when a source node with low data rate occupies the channel resource for a long time, network performance degrades. In order to improve performance, the cooperative communication has been proposed. In the previous cooperative communication protocols, relay nodes deliver data packets only for a source node. In this paper, we propose an additional transmission scheme in which relay nodes select an additional source node based on several information and deliver data packets for the original source node and the selected additional source node. The proposed scheme improves performance and provides fairness among source nodes. Performance of the proposed scheme is investigated by simulation. Our results show that the proposed scheme outperforms the previous protocol in terms of fairness index and throughput.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.81-84
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, Scheduling algorithm allocates network resources fairly to each VC. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.97-104
• /
• 2000

Effective call admission control is desirable to control an ATM traffics. It should provide high fairness and utilization for different kinds of services during call admission. Complete bandwidth sharing method is efficient for utilization of bandwidth but not efficient for fairness of call admission. Complete bandwidth partitioning method is efficient for fairness but not efficient for utilization. We propose a new CST(Complete Sharing with Threshold) algorithm using threshold on a total link to improve fairness and utilization.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.117-145
• /
• 1991

IS changeback is regarded as an offective way to control the usage of computers and communication systems which are very much limited resources and whose costs are very high, In this paper, the problem of combining the optimal chargeback system which guarantees the efficiency with the Rawls'(1971) concept of fairness. Primary conclusion of this paper is that if the value function which represents the contributions of IS user to the firm's profit is evidit and there is no uncertainty about this contribution information, optimality can be achived without any loss of fairness using full cost allocation pricing. But if there is no significant differences among contribution of each user and there is no significant differences among users because of the managerial arbitrariness, From this point of view contingent chargeback system with which manager can find the golden middle between optimality and fairness by adjusting the 'efficiency coefficient' according to his/her organizational characterisics and environments is proposed. A heuristic of finding the appropriate efficiency coefficient is also suggested.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.374-383
• /
• 2008

IEEE 802.11 WLANs support various data rates in order to adapt to wireless channel condition. It is known that when some WLAN stations use a lower data rate than the others, total throughput is considerably degraded. The concept of temporal fairness which provides equal time to all stations has been introduced to alleviate this performance anomaly problem. However, most previous mechanisms assume that stations have infinite backlogs in the MAC layer and do not consider transport layer. In this paper, we first examine and analyze the performance of previous methods considering transport layer protocols. We then propose two new temporal fairness guarantee methods: AP priority and dynamic CWmin adjustment. We carried out extensive performance study via ns-2 computer simulations. The results show that the proposed methods provide temporal fairness and improve the throughput of WLANs in various environments.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.125-143
• /
• 2015

As improving the life quality of citizen because of development of Urbanization and Information, civil application service of public institutions has been changed. The government provides a 24-hour civil service of e-government, public institutions operate U-complaints call center to pursue a personalized service to customers. As customer service are diversified, the inconvenience of service is increased. Therefore, public institutions instituted U-complaints call center to solve increased complaints. In early days, public institutions operated simple call center. However, it became intelligent U-complaints call center by SNS. The more increase the importance of agents' contact customer service, the more increase Job Performance considered by Organizational Commitment & Job Satisfaction of call center agents. This study analyzed that applied to Fairness Theory with Organizational Commitment, Job Satisfaction and analyze U-complaints call center agents' role and job performance of public institutions. Proposed a research model applied to job satisfaction with key variables, organizational commitments, job satisfaction. It's expected to impact on job performance of U-complaints call center agents in public institutions. For empirical study of research model, conducted a survey of the U-complaints call center agents of public institutions. 170 samples were collected from the survey and analyze relationship between the factors. Procedural justice, distribution fairness, fairness interaction are significant influence on organizational commitment of parameters by analysis U-complaints call center agents. Procedural justice and fairness of interaction was found not to effect on parameters of job satisfaction. Also, parameter, organizational commitment have significant influence on job satisfaction. However, have no influence on job performance. Therefore, the parameters of job satisfaction have significant influence on job performance. Public institutions should adopt to improve the quality of citizen services through U-complaints call center agents.