• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.743-748
• /
• 2002

In recent research for the Internet, many studies have investigated the Diffserv AS architecture that can provide Quality of Service. However, this architecture still lacks the qualification to provide full use of the bandwidth to the customer In this paper, we propose the TS2W3C (Time Sliding Two Window Three Color) marking algorithm to improve the fair share of bandwidth by enhancing the TSW (Time Sliding Window) marking algorithm. Our proposed mechanism provides the bandwidth relatively more fairly than the TSW mechanism.

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

In this paper, we proposed a new buffer management and cell scheduling scheme for GFR service in ATM networks. The proposed scheme is able to satisfy fairness criteria and efficient cell service in GFR. Performance analysis through the simulation presents that the proposed scheme can meet fairness 2(MCR plus equal share), which are not met by conventional scheduling mechanisms such as WRR. Also, the proposed scheme is superior to WRR about 29% in throughput and more efficency in fairness criteria.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.2
• /
• pp.46-53
• /
• 2002

In a try to reduce the unbalance, MDFBA(Modified DFBA) algorithm is proposed in this paper. In this algorithm, cells in a region less than LBO are employed selectively to give less difference between fairness and efficiency. By choosing γ according to the situation of network, MDFBA algorithm can be applied to various situation effectively.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1393-1396
• /
• 2002

무선 ATM(Asynchronous Transfer Mode) 망을 기본으로 하여 ATM망에서 사용하는 서비스 종류인 CBR(Constant Bit Rate), rtVBR(Real-Time Variable Bit Rate), nrtVBR(Non-Real-Time Variable Bit Rate), ABR(Available Bit Rate), UBR(Unspecified Bit Rate)에 따른 플로우를 우선 각 서비스 흐름에 따라서 공평하게 패킷 스케줄링 한다. 그리고 각 서비스 종류에 따라 대역이나 지연에 따라 모든 사용자의 다양한 서비스 트래픽에 공평하게 서비스하는 구조를 갖는다. 아울러 무선 통신망 채널에 에러가 발생할 경우를 고려하여 각 서비스 트래픽에 대한 QoS(Quality of Service)를 보장해주는 무선 ATM 통신망에서 동작하는 스케줄링 알고리즘을 제안하여 시뮬레이션과을 통해 기존의 방법과 성능을 비교하여 기존의 유선 통신망 스케줄링 알고리즘과 달리 무선망의 에러에 대한 각 트래픽의 에러에 대한 성능 향상에 대해 알아본다.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.73-84
• /
• 2002

In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.22-29
• /
• 2002

The Gauranteed Frame Rate service category was proposed by the ATM Forum as an enhancement to the UBR service. This service aims to support minimum cell rate gaurantee for each virtual connection and allow any excess bandwidth in the network to be shared among the contending VCs in a fair manner. We propose a new buffer management algorithm for GFR service through FIFO queuing discipline. Proposed scheme can provide minimum bandwidth guarantee for GFR VCs as well as improve the fairness among the competing GFR VCs on a single FIFO queue. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.79-83
• /
• 2004

The purpose of ATM traffic management is to protect the network using minimum resources and guarantee the requred QoS and also it is desirable to provide fairness between input channels. In this paper, we propose the TBBM(threshold based buffer management) algorithm to improve fairness between input channels and utilization of ATM networks. TBBM algorithm controls output cell rate dynamically based on threshold. The result shows that the required bandwidth of the TBBM algorithm is 14.3% lower in audio traffic and 41.8% lower in video traffic than that of theoretically calculated equivalent capacity method. and also reveals that the TBBM algorithm provide improved CLR fairness between input channels

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.316-319
• /
• 1996

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.247-260
• /
• 2007

This paper solves the problem of finding a suitable sub-channel and power joint allocation method for multiple users in 802.16e OFDMA/TDD cellular systems. The joint allocation is thatfirstly the sub-channel is allocated to the users and then suitable power is allocated. We propose a FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm which is a dynamic channel allocation algorithm considering all users' channel state information conditionally to maximize fairness and throughput. The improved CHC algorithm, which is dynamic power allocation algorithm, is also proposed in this paper The Improved CHC algorithm collects the extra of the downlink transmit power and then re-allocates it to other users. Simulation results show that the proposed improved CHC algorithm additionally increases the fairness and sector throughput.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.