• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.276-284
• /
• 2006

WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.132-135
• /
• 2006

Recently, multimedia data service using mobile terminal has been increased according to the development of wireless network technology which can be used in an indoor or outdoor environment. However, the wireless network shares the channel and it has a high error rate because of characteristics of transmission media. Therefore, it has a lot of problems for guaranteeing QoS(Quality of Services) in various requirements. This paper suggests a CSD-WRR(Channel State Dependent-WRR) method for compensating the service rate considering the transmission deadline. Simulation results show that the suggested method outperforms the conventional WRR in the view of the deadline miss rate and fairness.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.293-298
• /
• 2010

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• The KIPS Transactions:PartC
• /
• v.8C no.2
• /
• pp.134-140
• /
• 2001

스케쥴링 알고리즘들은 제안된 패킷 지연을 가진 각 연결에 대하여보장된 대역을 제공한다. 스케쥴링 알고리즘의 일종인 WRR은 매우 간편하며 각 큐에 다른 가중치를 할당하여 여러 큐를 직접 제어한다. BSW 알고리즘은 WRR 스케쥴러를 구현하는데 버퍼 관리를 효율적으로 수행하도록 제안되었다. 그러나 BSW 알고리즘은 VC에 실제 할당된 가중치 보다 더 많은 가중치를 할당하고 서비스 받을 VC의 큐가 비어있을 때 서비스를 수행하지 않기 때문에 셀 지연 및 최대 큐 길이에서 심각한 성능 저하를 유발한다. 본 논문에서는 WRR 스케쥴링 알고리즘을 효율적으로 수행할 수 있는 새로운 BSW 구조를 제안한다. 또한, 새로운 BSW 구조에 적합한 셀 스케쥴링 알고리즘을 개발한다. 제안된 BSW 구조와 알고리즘은 VC에 할당된 가중치를 정확히 유지 할 수 있고, 서비스 받을 VC큐가 비어 있을 경우 다른 VC 셀을 서비스하여 평균 셀 지연 및 최대 버퍼 크기를 감소시킨다. 그리고 셀 서비스율을 전체적으로 증가시킨다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.135-143
• /
• 2006

PQ(Priority Queue) and WRR(Weighted Round Robin) are the most famous schedulers, however, these schedulers have both points of advantages and disadvantages. In this paper, we propose an algorithm that can be adopted in my kind of scheduling type with making up for weak points of PQ and WRR. The proposed algorithm includes a fuzzy theory in the scheduler to assign priorities dynamically in the DiffServ network. This algorithm produces the control discipline by the fuzzy theory to assign priorities of the Queue effectively with checking the Queue status of each class dynamically under the discipline.

• 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.

• The Journal of the Korea Contents Association
• /
• v.3 no.3
• /
• pp.55-62
• /
• 2003

In this paper, I proposed a new WRR Cell Scheduling algorithm for improving the problem of existing smoothing scheme. in proposed algorithm, when queue of being service VC in present round is emptied, instead VC that difference between assigned weight and length of present buffer is biggest in all VC service. This result efficiency of bandwidth allocation is increased. And above all real-time traffic is serviced, non-real-time to allocate bandwidth of the remainder multimedia-service is possible. In one cycle, number of serviced average cell is increased. And for many eel serviced, length of total Duffer is decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1089-1098
• /
• 2001

WRR 스케줄링 알고리즘은 계산의 단순성과 저 비용 구현의 장점을 가지고 있어 고속 패킷 스위칭 네트워크에서 널리 쓰이고 있지만 버스티한 트래픽에 대해서는 입력 트래픽을 일정 비율로 스케줄링하기 때문에 효율성이 낮다는 문제점이 있다. 또한, WRR 알고리즘은 ABR 서비스 클래스의 공평성 기준의 하나인 Maximum of MCR or Max-Min share 공평성을 만족시키지 못한다. 따라서 ABR 서비스를 위한 공평성 기준을 만족시키는 스케줄링 알고리즘이 필요하다. 따라서, 본 논문에서는 ABR 서비스를 위한 5가지 공평성 기준들 중 Maximum of MCR or Max-Min share를 만족시키는 스케줄링 알고리즘을 제안한다. 제안된 알고리즘이 공평성 기준을 만족시키고, 네트워크 자원을 각 ABR VC들에게 공평하게 할당해 주는지를 컴퓨터 시뮬레이션을 통하여 WRR 알고리즘과 비교, 분석한다.