• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1413-1421
• /
• 2000

In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on WAN environment with long delay. For getting the transmission rate, the proposed algorithm use FMMAR as ER scheme which calculate exactly the fair share. And, in large delay state. we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm. According to the results, the proposed algorithm shows good performance.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.27-30
• /
• 2002

In this paper, we propose a window-based congestion control algorithm to achieve a fair sharing of the available bandwidth in ECN capable heterogeneous TCP networks with a single bottleneck link. The proposed algorithm is based on extracting the network status from the successive binary congestion information provided by ECN. From the explicit network information, we estimate the fair window size proportional to the propagation delay. Through simulations, the effect and performance of the proposed algorithm are shown for the heterogeneous networks.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.1-8
• /
• 1999

In order to provide appropriate Quality of Service(QoS) guarantee to each traffic flow in intergrated service networks, an efficient traffic scheduling algorithm as well as resource reservation must be adopted in host and transit routers. In this paper, a new efficient fair queueing algorithm which adopts a linearly increasing virtual time is presented. The proposed algorithm is fair and the maximum and mean delay guaranteed of each flow are less than those of the SCFQ(self clocked fair queueing) algorithm which is one of the most promising traffic scheduling algorithm, while providing low implementation complexity as the SCFQ scheme. And, it has the better isolation provided than SCFQ, which means that each flow is much less influenced by the violating traffic flows provided its allocated bandwidth gurantee. The fairness of the proposed algorithm is proved and simulation results of maximum and mean delay presented.

• Asia pacific journal of information systems
• /
• v.33 no.4
• /
• pp.1118-1134
• /
• 2023

Previous research has shown that employees tend to react more positively to corrective feedback from supervisors to the extent they perceive that they were treated with empathy, respect, and concern towards fair interpersonal treatment in receiving the feedback information. Then, to facilitate effective supervisory feedback and coaching, it would be useful for organizations to monitor the contents of feedback exchanges between supervisors and employees to make sure that supervisors are providing performance feedback using languages that are more likely to be perceived as interpersonally fair. Computer-aided text analysis holds potential as a useful tool that organizations can use to efficiently monitor the quality of the feedback messages that supervisors provide to their employees. In the current study, we applied computer-aided text analysis (using closed-vocabulary text analysis) and machine learning to examine the validity of language-based algorithms trained on supervisor language in performance feedback situations for predicting human ratings of feedback interpersonal fairness. Results showed that language-based algorithms predicted feedback interpersonal fairness with reasonable level of accuracy. Our findings provide supportive evidence for the promise of using employee language data for managing (and improving) performance management in organizations.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.687-694
• /
• 2005

In ATM and W networks, high Priority Packets should be selectively favored over low Priority Packets in case of congestion. For this purpose, we introduce a space priority policy for ATM nodes in this paper which is very similar to the weighted core-stateless fair queueing(WCSFQ) in IP nodes. We also analyze the loss probabilities for different classes of cells for MMPP/D/1/K with a threshold level, and discuss the numerical results. The numerical results illustrate that the WCSFQ scheme can be used to support the differentiated services in ATM or IP nodes.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2006.11b
• /
• pp.483-494
• /
• 2006

The purpose of this study is to suggest the framework for innovation policy that the approach to popularization, diffusion, and S&T culture through the science and technology(S&T) fair. The innovation policy has a role which suggests direction to do behavior and concerns to social members. According to, this point of the diffusion of the S&T culture emerges the reasonable and adoptable innovation policy. Korean S&T fair have many problems, for example, a short historical background, lack of the fund and special human resource, so on. In this aspect, this study provides theoretical reviews and several issues for publicity of the innovation policy and S&T popularization and culture through the representative case-Future Tech Korea2006. Also, this study argues that "How to build and improve S&T fair", and "What the figure of S&T is that communicate and approach to people". Finally, the research for the S&T fair gives detailed and realized strategies for improving them.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1177-1186
• /
• 2003

The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we implemented the delay guaranteed fair queueing (DGFQ) scheme distributively. Through the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

• Journal of Distribution Science
• /
• v.14 no.12
• /
• pp.43-51
• /
• 2016

Purpose - The purpose of this paper is to discuss success factors behind ATO distribution channels by examining successful partnerships between producers and alternative trading organizations (ATOs). Research design, data, and methodology - This is a case study, an analytical approach, which illustrates how the partnership between producers and ATOs has strengthened the fair trade and the performance of participants in the trade based on the example of the trading relationship between Beautiful Coffee, an alternative trading organization dealing coffee related products, and the coffee cooperative union (CCU), a coffee producing cooperative in Gulmi, Nepal. Results - Beautiful Coffee in the partnership with HELVETAS empowered small coffee farmers by a successful institutionalization of CCU that consolidated the distribution channel to be more efficient. Also, Beautiful Coffee and its partnership with KOICA have tried to increase productivity and quality of coffee beans. Conclusions - The case of Beautiful Coffee demonstrates that the partnership between producers and alternative trading organizations (ATOs) has benefited the fair trade partners. In other words, Beautiful Coffee's partnerships with a NGO working in the local producing area, HELVETAS, and a government aid agency, KOICA could strengthen the relationship between the producers and the ATO, and thus contributes to the whole distribution channel.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1020-1029
• /
• 2006

Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.