• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.175-186
• /
• 2009

A new medium access control (MAC) scheme embedding physical channels into multiband carrier sense multiple access/collision avoidance (CSMA/CA) networks is proposed to provide strict quality of service (QoS) guarantee to high priority users. In the proposed scheme, two priority classes of users, primary and secondary users, are supported. For primary users physical channels are provided to ensure strict QoS, whereas secondary users are provided with best-effort service using CSMA/CA modified for multiband operation. The performance of the proposed MAC scheme is investigated using a new multiband CSMA/CA Markov chain model capturing the primary user activity and the operation of secondary users in multiple bands. The throughput of secondary users is obtained as a function of the primary user activity and other CSMA/CA parameters. It is shown that the new MAC scheme yields larger throughput than the conventional single-band CSMA/CA when both schemes use the same bandwidth.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.9-12
• /
• 2000

Today, QoS is one of the most critical issues in the network research area and Differentiated Services (DiffServ) is considered as the most prominent solution to provide some kinds of service differentiation without introducing any scalability problem. Among DiffServ's approaches, Assured Service (AS) provides some minimal level of QoS guarantee by treating more preferably than traditional Best Effort (BE) traffic and by using different level of drop probabilities within the same AS classes. In this paper, we investigate the ECN's capability of improving overall goodput of the flows and the possibility of resolving the fairness problem among the flows belonging to same class in Differentiated Services architecture.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.311-314
• /
• 2001

현재 인터넷 스트리밍 기술과 그 시장은 날로 발전하고 있으며 사용자들의 멀티미디어 데이터에 대한 요구 사항인 시간적 신뢰성과 데이터의 질이 점점 다양해지고 있으며 그 요구사항을 보장 해 주기를 요구를 하고 있다. 인터넷 스트리밍 서비스는 영상과 유사한 트래픽을 가지며 이러한 트래픽 소스를 지금의 시간에 가변적인 인터넷 망에서 전송하기 때문에 손실과 지연, 지터등이 가변적으로 발생하는 문제를 가지고 있다. 그 이유는 현재의 인터넷 트래픽에게 최선 서비스(best-effort service)만을 제공하기 때문이며 비디오 데이터는 가변적이며 매우 높은 트래픽의 특징을 가지고 있기 때문이다. 이를 극복하기 위해 네트 워크 계층에서는 종합서비스(Intserv : Integrated Service), 차별서비스(Diffserv : Different Service)등특정한 트래픽의 스트림에게는 일정한 대역폭을 보장하는 개념으로 자원 예약 프로토콜이 연구되어 지고 있으며 비디오 계층에서는 비디오의 보다 효율적인 전송을 위하여 하나의 영상정보를 다중의 Layer로 구성하여 부호화하는 계층부호화에 대하여 MPEG(moving Picture Expert Group)에서 많은 연구가 진행되어왔다. 이러한 두 계층의 노력을 감안하여 특정 비디오 스트림에 대하여 예약 프로토롤을 사용하여 보다 효율적인 전송 시스템을 제안하며 그 성능을 객관적인 평가기준인 PSNR을 사용하여 평가하고 지연, 지터, 손실의 분포 빈도등을 사용자의 요구 사항을 만족시키는 서비스 방안에 대하여 연구하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.572-574
• /
• 1999

인터넷 통합 서비스 모델(Internet Integrated Service Mode)은 인터넷에서 화상, 음성, 데이터 등의 다양한 멀티미디어, 실시간 응용들에 대해서 서비스 품질을 제공하기 위해 새로운 인터넷 서비스 모델이다. 현재 인터넷을 통해 제공되는 서비스는 최선형 서비스(best effort service)에 속한다. 따라서 인터넷 서비스 제공자는 사용자가 원하는 서비스 품질을 보장할 수 없다. 인터넷 통합 서비스 모델에서는 자원 예약 프로토콜과 새로운 구성을 추가하여 각 플로우에 대해 예약된 서비스 품질을 제공한다. 즉, 인터넷 통합 서비스 모델에서는 신호 프로토콜, 패킷 분류자, 패킷 스케줄러, 수락 제어 등의 요소를 사용하여 각 플로우에 대해 예약된 서비스 품질을 제공한다. 본 논문에서는 FreeBSD 기반이 라우터에 SCFQ(Self-Clocked Fair Queueing) 스케줄링방식, 버퍼 관리 방식 및 RSVP(ReSource Reservation Protocol)와 커널 사이의 트래픽 제어 인터페이스 부분을 구현하여 RSVP를 이용한 자원 예약을 가능하게 함으로써 라우터가 인터넷 통합 서비스를 지원할 수 있도록 구현하였다. 그리고 테스트 베드 상에서 기존 라우터와 구현된 라우터와의 성능 평가를 수행하였다.

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

최근 인터넷 사용의 폭발적인 증가와 업무에 있어서 네트웍 의존도가 증가함에 따라 최종 사용자들은 좀 더 신뢰성 있는 네트웍 서비스를 요구하게 되었다. 또한 보편적인 인터넷망은 최선형 서비스 (best­effort service)를 모델로 하기 때문에 종단간(end­to­end) QoS(Quality of Service)를 만족시키지 못하고 있다. 따라서, 네트웍 관리자는 최종 사용자 관점에서 네트웍 성능을 모니터링하여 언제, 어느 구간에서 QoS를 만족시키지 못하는지 파악하기를 원한다. 본 논문에서는 IP 상에서의 전송프로토콜 별 종단간 QoS 측정 방법을 연구하고 네트웍 제공자와 사용자간에 체결한 SLA(Service Level Agreement)를 만족하는지 분석하여 문제 구간 및 노드를 파악할 수 있는 시스템의 구조를 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2B
• /
• pp.100-107
• /
• 2007

Recently, a study of BcN(Broadband convergence Network) is progressing continuously, and it is important to improve the quality of the service according to subscribers because a scale of network is about to be larger. It is more important to manage QoS(Quality of Service) of all subscribers in layer 2 than layer 3 network since managing it in layer 3 network cost both additional processes and large hardware. Moreover, QoS based on Best-Effort service has been developed because tots of subscribers should use limited resource in BcN. However, they want to be supplied with different service even though they pay more charge. Therefore, it is essential to assign the different bandwidth to subscribers depending on their level of charge. The method of current Rate Limiter limits the bandwidth of each port that does not offer fair service to subscribers. The Rate Limiter proposed in this paper limits bandwidth according to each subscriber. Therefore, subscribers can get fair service regardless of switch structure. This new Rate Limiter controls the bandwidth of subscribers according to the information of learning subscriber and manages maximum performance of Ethernet switch and QoS.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.123-134
• /
• 2002

The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.1-6
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets my occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay time. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution So, the arriving packets my be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. To prevent network congestion and maintain minimum quality of service the transmitter performs media scaling-down by dropping the current packet when informed excessive delay from the receiver.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.611-620
• /
• 2001

To meet the requirements of reliable service for various applications, a Reliable Multicast Transport Protocol should be implemented over IP Multicast where currently best-effort service is provided. Among the current researches, hierarchical tree-based mechanism has been proposed and actively studied. This mechanism is known to provide high scalability as well as reliability, but needs an additional tree configuring mechanism for building an efficient logical tree in transport layer. Bottom-up approach has been used for creating such a tree. This method has benefits from parallel tree construction for receivers, while it has some drawbacks such that it does not guarantee a loop-free tree and brings heavy message overhead during tree creation process. Therefore, this paper proposes a top-down based mechanism for constructing a control tree, which can guarantee loop-freeness by step-wise mannered tree building. From experimental simulations, it shows that the proposed mechanism has less message overhead. It is recommended that the bottom-up and the proposed top-down will be selectively used in real networks, according to the requirements of the concerned multicast applications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.7
• /
• pp.261-272
• /
• 2003

An Ethernet PON(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 and can classify this protocol into a fixed length slot assignment method suitable for leased line supporting QoS(Quality of Service) and a variable length slot assignment method suitable for LAN/MAN with the best effort. For analyzing the performance of these protocols, we design an Ethernet PON model using OPNET tool. To establish the maximum efficiency of a network, we verify a MAC protocol and determine the optimal number of ONUs(Optical Network Unit) that can be accepted by one OLT(Optical Line Terminal) and propose the suitable buffer size of ONU based on analyzing the end-to-end Ethernet delay, queuing delay, throughput, and utilization.