• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.156-166
• /
• 2005

Ethernet passive optical network is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON, the next generation access network, is based on TDMA(Time Division Multiple Access) basically. In this thesis, we addressed the problem of dynamic bandwidth allocation in QoS based Ethernet PONs. We augmented the bandwidth allocation to support QoS in a differentiated services framework. Our differentiated bandwidth guarantee allocation(DBGA) allocates effectively and fairly bandwidths among end users. Moreover, we showed that DBGA that perform weighted bandwidth allocation for high priority packets result in better performance in terms of average and maximum packet delay, as well as network throughput compared with existing dynamic bandwidth allocations. We used simulation experiments to study the performance and validate the effectiveness of the proposed bandwidth allocations.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.923-928
• /
• 2003

This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1663-1668
• /
• 2005

There have been numerous researches regarding the QoS guarantee in packet switching networks. IntServs, based on a signaling mechanism and scheduling algorithms, suggesting promising solutions, yet has the crucial complexity problem so that not enough real implementations has been witnessed. Flow aggregation is suggested recently to overcome this issue. In order to aggregated flows fairly so that the latency of the aggregated flows is bound, however, a non-work conserving scheduler is necessary, which is not very popular because of its another inherent complexity. We suggest a non-work conserving scheduler, the Round Robin with Virtual Flow (RRVF), which is a variation of the popular Deficit Round Robin (DRR). We study the latency of the RRVF, and observe that the non-work conserving nature of the RRVF yields a slight disadvantage in terms of the latency, but after the aggregation the latency is greatly reduced, so that e combined latency is reduced. We conclude that the flow aggregation through RRVF can actually reduce the complexity of the bandwidth allocation as well as the overall latency within a network.

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.65-74
• /
• 2012

The QoS guarantee for the forward link in satellite communication networks is very important because there are a variety of packets with multiplexing. Especially, the packets are processed depending on the available bandwidth in satellite network changing the wireless channel state in accordance with weather condition. The DVB-S2 increases the transmission efficiency by applying the adaptive coding and modulation (ACM) techniques as a countermeasure of rain attenuations. However, the channel estimation algorithm is required to support the ACM techniques that select the MODCOD values depending on the feedback data transmitted by RCSTs(Return Channel via Satellite Terminal) because satellite communication networks have a long propagation delay. In this paper, we proposed the channel estimation algorithm using rain attenuation values and reference data and the packet scheduling scheme to support the QoS and fairness. As a result of performance evaluation, we showed that proposed algorithm exactly predicts the channel conditions and supports bandwidth fairness to the individual RCST and guarantees QoS for user traffics.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.240-242
• /
• 1998

차세대 고속 무선망에서는 신뢰성이 높고 광전송로를 근간으로 하는 유선망의 멀티미디어 응용지원의 확장으로 유무선 종합 정보 통신망의 구현을 목표로 하고 있다. 현재 기존의 유선망에서는 멀티미디어 응용 지원을 위해 QoS Provisioning에 관한 많은 연구가 되어 있으나 무선망에서의 이동성과 무선 전파의 열악한 전송으로 인해 새로운 QoS Provisioning 방법에 관한 연구가 필수적이다. 본 논문에서는 지연에 민감한 실시간 트래픽의 QoS보장을 위하여 이동 터미널의 속도에 따라 이웃 셀의 대역폭을 예약함로써 핸드오프를 대비하고, 효육적인 무선 자원의 사용을 위해 적응적으로 예약된 대역폭의 양을 조정하는 방법을 제안한다. 또한, 트래픽 종류와 호의 종류, 터미널의 속도에 따라 다른 우선 순위를 부여하여 우선순위에 기반한 호 수락 제어 방법을 제안한다. 실험을 통하여 기존에 제안된 방법과 성능 비교한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.21-28
• /
• 2009

To provide IPTV service successfully, we have to guarantee quality of service (QoS). However, in IPTV service, when we change channels, channel zapping delay will cause lower subscriber's satisfaction. Also, we can not provide IPTV service efficiently by limited bandwidth problem. In this paper, we propose a new enhanced IPTV transmission scheme to solve the two types problems using RACR (Robust Aggregation Control Router) which can control bandwidth and channel zapping time.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.541-544
• /
• 2003

본 논문에서는 분산 실시간 멀티미디어 시스템에서 경성 실시간 태스크들과 멀티미디어 태스크들을 효율적으로 통합할 수 있는 동적 스케줄링 기법이 제시된다. 경성 실시간 태스크가 최악의 경우에 대한 실행 시간을 기반으로 하는 반면 멀티미디어 태스크는 평균 실행 시간을 기반으로 스케줄링된다. 동일한 시스템에 존재하는 두가지 태스크들에 대하여 CPU 대역폭을 분할하고 해당 대역폭의 비율을 동적으로 조정하는 스케줄링 기법을 제시함으로써 한 부류의 태스크들의 수와 도착 비율이 변동될 때 발생하는 과부하 문제를 해결할 수 있다 경성 실시간 태스크가 서버의 주기내에서 실행될 수 있는 시간이 제한되는 반면 멀티미디어 태스크에 설정된 대역폭은 동적으로 변할 수 있다 제시된 기법은 경성 실시간 태스크들의 실시간성을 모두 보장하는 한편 멀티미디어 태스크들의 평균 지연 시간을 최소화할 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2713-2721
• /
• 2000

이 논문에서는 Web 사이트를 설계할 때 응답시간과 관련해서 고려되어야 할 요수 중[10,15,16], 인터넷 연결 회선의 대역폭 결정에 참조될 수 있는 자료를 제시한다. 이를 위해 다양한 환경에서 Web 세션 도착율에 따른 응답시간과 회선 이용율의 변화를 관찰하고, 이를 통해 특정 대역폭의 회선에 대해 Web 서비스가 한계 응답시간 내에 보장될 수 있는 Web 세션 도착율의 임계치를 구한다. [15,16]. 이 논문에서는 데이터 수집을 위해 실험 네트워크를 구성하고, 자체적으로 구현한 패킷 생성기를 이용하여 세션 도착율의 변화에 따른 Web 트래픽을 시뮬레이션한다. 응답시간은 패킷 생성기가 생성한 각각의 HTTP(Hyper-Text Transfer Protocol)요청 패킷이 전송되는 시점부터 HTTP응답 메시지가 도착하는 시점까지의 경과된 시간으로 구하고, 회선 이용율은 SNMP(Simple Network Management Protocol)를 이용해 자체 구현한 데이터 수집기로 구한다[3]. 이 실험의 결과는, Web 사이트를 설계할 때 네트워크 전문가가 아니더라도 인터넷 연결 회선의 대역폭 결정 문제를 해결하는데 쉽고 유용하게 참조될 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.121-124
• /
• 2002

In Diffserv Network, RIO is the most effective active queue management algorithm. RIO, the enhanced queue management algorithm from RED, divides IN and OUT packets and manages them differently. one of the main problems for the implementation of RIO is the Bandwidth Skew problem for providing the Assured Service. In this paper, we will show the bandwidth skew problem in RIO and provide an enhanced RIO mechanism that will alleviate the bandwidth skew problem.