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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.553-558
• /
• 2009

There have been various research efforts to support the fairness between uplink and downlink of TCP streams in IEEE 802.11 networks. Existing methods, which have been effective for the fairness, however could not provide the solution for the unfairness caused by the situation in which a station which is having multiple TCP uplink streams monopolizes the uplink bandwidth. This paper proposes a method that AP allocates token buckets for each uplink TCP station. The proposed method is also able to support the fairness between the uplink and downlink. To remedy the underutilization which may happen under token bucket-based schemes, it allows the movement of redundant tokens among the token buckets. By controlling the token movements, it can balance the fairness and the utilization. Simulation results show that the proposed method is able to support the fairness of the TCP uplink stations, as well as the fairness between the uplink and downlink.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.514-522
• /
• 2015

In Microwave Radio Link, it is necessary to consider the radio fading to consistently assure the radio link of the high quality as the distance. If the fixed modulation is used for the microwave radio link, it is difficult to keep the high availability of link for the case of the long distance. Adaptive Modulation(AM) provide good quality on microwave link, but the application of the only-AM is not enough to provide the availability assurance due to the fluctuating characteristics of link capacity. Our previous study has proposed the improvement method of transmission in association with the distance, however the previous method needed to make up for the common application. There was no suggestion of a mathematical formula with a variable. In this paper, we propose an optimized Adaptive Transmission Techniques with calculating formula of the priority traffic transmission capacity based on AM in consideration of the fade margin for the availability assurance as the distance and the comparison of the channel bandwidth for Long-distance Radio Link.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.465-474
• /
• 2001

In the network with small cell radius, a mobile terminal which has large mobility should perform frequent handover. This requires that handover mechanism must be done fastly. The currently existing method for handover uses an algorithm in which the bandwidth corresponding to the adjacent cells is supposed to be allocated. However, this method leads to the problem of requiring bandwidth allocation for many-unknown cells, due to the lack of information toward moving direction in mobile terminal. In this paper, we propose an efficient dynamic bandwidth allocation algorithm for solving those problem above, based on both path rerouting handover and soft handover mechanism with wireless ATM. As for the QoS, it has been shown that proposed algorithm shows better performance than that with static bandwidth allocation algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.66-71
• /
• 2012

In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.388-390
• /
• 2005

IEEE 802.16은 BWA (Broadband Wireless Access) 시스템의 표준으로 현재 많은 연구와 함께 상용 제품에 대한 연구가 진행중인 분야이다. IEEE 802.16에서는 QoS를 제공하기 위하여 BS (Base Station)와 SS(Subscriber Station)간의 QoS 협상 과정을 정의하고 있으며, BS 및 SS에서의 효율적인 QoS 보장을 위해 4가지의 서비스 클래스를 정의하고 있다. 이러한 서비스 클래스는 UGS, rtPS, nrtPS, 그리고 BE 이다. 하지만 표준에서는 이러한 서비스 클래스를 어떻게 이용할 것인지에 태한 언급이 없으며, 이에 따라 효율적인 packet scheduling에 관한 않은 연구가 진행되어 왔다. 기존 연구에서는 주로 BS에서의 효율적인 scheduling에 초점을 맞추어 연구가 진행되었으며, SS에서의 scheduling에 대한 연구는 거의 되어 있지 않다. 하지만 BS에서 SS에게 대역폭을 할당할 때 GPSS (Grants per subscriber station) mode로 대역폭을 할당한다면 SS에서는 할당 받은 대역폭을 효율적으로 사용하기 위하여 scheduling이 필요하다. 본 논문에서는 SS에서 효율적인 대역폭 사용을 가능하도록 하기 위한 scheduling 알고리즘을 제안하고자 한다. 제안하는 알고리즘은 SS의 상황에 맞추어서 주어진 대역폭을 보다 더 효과적으로 이용하는데 초점을 맞추고 있다. 성능 명가를 통하여 제안하는 알고리즘이 기존 알고리즘에 비해서 보다 더 효율적으로 대역폭을 사용함을 알 수 있다.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.889-896
• /
• 2006

ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.229-231
• /
• 2004

유비쿼터스 환경에서 이동하는 객체 위치를 감지하고 서비스를 제공하는 위치 감지 시스템의 역할은 매우 중요하다. 하지만, 감지 시스템들은 적용되는 감지 범위에 따라 프로세스 전락이 다르고 사용이 제한적이기 때문에 신뢰성 있는 QoS를 보장하기가 힘든 실정이다. 따라서 본 논문에서는 지능적인 모니터링 기법을 사용하여 상황을 분석하고 자동으로 최적의 감지 프로세스 전략을 선택하는 자동화 시스템을 설계하였다. 또한 네트워크 대역폭 변화에 따라 최적 QoS를 보장할 수 있는 제안된 시스템의 성능을 시뮬레이션을 통해 검증한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.171-176
• /
• 2003

광 파장 경로 네트워크에서 시간슬롯을 도입한 RWTA(Routing, Wavelength and Time-slot Assignment)에서는 시간슬롯의 할당이 제공하는 연결의 대역폭을 결정한다. 본 논문에서는RWTA 방식에서 요구되는 트래픽에 따라 시간슬롯을 제공하고 자원을 효율적으로 사용 할 수 있는 GBTA(Guaranteed-bandwidth Time-slot allocation) 알고리즘을 제안한다. GBTA는 보장된 시간슬롯을 할당함으로서 세션이 블록킹 되지 않고 연결될 확률을 높여 세션의 연결성을 보장하여 QoS의 요구사항을 만족시킨다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.412-414
• /
• 2003

무선 이동망에서 점점 증가하는 멀티미디어 트래픽의 QoS(Quality of Service)를 위해서는 충분한 자원이 제공되어야 한다. 하지만 무선망에서의 자원은 한정적이므로 이를 효율적으로 활용해야 멀티미디어 트래픽에 대한 QoS 보장이 가능하다. 이 논문에서는 무선망에서의 멀티미디어 트래픽에 대한 QoS 보장 알고리즘을 제안하였다. 제안된 알고리즘은 이동단말이 위치한 주위 셀의 자원들을 미리 예약하는 방식을 기반으로 하는 admission control 방법이다.