• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.155-158
• /
• 1991

In this paper, we investigate key issues and the CCITT activities related to the quality of service in the B-ISDN based on the ATM. We first clarify the relationships between the QOS(Quality of Service). NP(Network Performance), and GOS(Grade of Service). Using the GOS, network design and tuning method is suggested. Also, we examine the performance impairments and key NP parameters in ATM networks.

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

본 논문에서는 PNNI 망에서의 다계층 라우팅 알고리즘에 대해서 제안한다. PNNI규격은 ATM 사설망의 노드간 혹은 망간 접속 규격으로 ATM FORUM에서 규정되었으나, 동적 라우팅, 다양한 QOS 지원, Soft PVC 등 망의 상태에 유동적으로 대처하고 관리의 편리함 때문에 ATM 공중망에서의 PNNI 도입이 논의되고 있는 실정이다. 그러나, 현재까지 공중망에서 쓰여질 PNNI에 관한 라우팅 알고리듬과 정책에 대해서 언급은 많지 않은 편이다. 이에 공중망의 비교적 간단한 토폴로지와 정확한 서비스 제공이라는 특징에 부합하는 라우팅 알고리듬을 제시한다.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.19-20
• /
• 2007

IEEE 802.lie is a new standard to support Quality of Service. HCCA(HCF controlled channel access) is a channel access mechanism, which polls the Qos-stations, utilized by the HC in AP. In this paper, we proposed an efficient scheduling algorithm in HCCA and compared with existing algorithms. Extensive simulation has done in ns-2 and the simulation results show our algorithm outperforms existing algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.43-46
• /
• 2003

브로드 밴드 네트웍과 모바일 네트웍을 통한 멀티미디어 컨텐츠의 전송이 늘어남에 따라 Qos의 보장과 트래픽 엔지니어링을 위해 멀티미디어 스트리밍 트래픽의 Qos 요구사항을 예측하고 적용하려는 연구가 활발하게 이루어지고 있다. 본 논문은 오브젝트 기술에 기반한 MPEG-4 컨텐츠의 트래픽을 패킷 레벨에서 측정하고 기에 기반하여 MPEG-4 스트리밍 시스템의 구성요소가 트래픽에 미치는 영향을 고찰해 본다. 또한 기존 멀티미디어 트래픽 모델링 방식의 한계를 규명하여 보다 정확한 트래픽 성격을 표현할 수 있는 모델링 방식을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1668-1676
• /
• 1997

The wireless communication network is evolving toward the Personal Communication System to provide various multimedia services. In order to accomplish this goal, the effective schemes are required which can dynamically utilize the limited wireless resources based on traffic characteristics of each services. This paper proposes a novel call admission control scheme for the hierarchical macrocell/microcell structured PCS. It is based on the bandwidth reservation procedure performed in the macrocell or neighboring microcell. Its effectiveness is investigated by simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.204-209
• /
• 1998

OMG에서 제안된 CORBA는 표준 개방 분산환경의 플래트폼을 제공하며 객체지향적인 방법으로 최근 주목을 받고 있다. 일반적으로 CORBA는 원격 데이터베이스 질의 등과 같은 요구/응답형의 응용에 잘 적용이 된다. 그러나 과도한 처리부담, 실시간 처리 기능과 QOS 지원 등의 결여로 멀티미디어 스트림과 같은 연속미디어의 처리에는 부적합하다. 본 논문에서는 실시간 제약을 갖는 멀티미디어 스트림의 효율적인 전송을 위하여 기존의 CORBA를 확장하여 멀티미디어 서비스를 설계한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.129-137
• /
• 2003

Multimedia streams, like MPEG continuously retrieve multimedia data because of their incessant playback. While these streams need an efficient support of kernel, the current buffer cache mechanism of Linux kernel such as Unix operating system was designed apt for small files, which is aperiodically requested as well as time uncritical. But, in case of continuous media, the CPU must enormously copy memory from kernel address space to user address space. This must lead to a large CPU overhead. This overhead both degrades system throughput and cannot guarantee QOS. In this paper, we have designed and implemented two memory copy reduction schemes in Linux kernel, direct I/O and one copy. The direct I/O skips the buffer cache layer of Linux kernel and results in dramatic reduction of CPU memory copy overhead. And, the one copy provides a fast disk-to-network data path without copying to user address space. The experimental results show considerable reduction of CPU overhead and throughput improvements.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.707-716
• /
• 2009

Wireless Sensor Networks are consisted of sensor nodes that communicated with each other to transmit information. Because sensor nodes have physically many limits, wireless sensor networks are hard to adopt for traditional networks. Transmissions are consumed most energy of sensor nodes. That's why energy-efficient transmission techniques and QoS support techniques for different kind of data are most important in wireless sensor networks. The thesis proposes the agent based framework for energy distribution and QoS in wireless sensor networks. Agents have its own behavior policy by means of a gene, which is optimized by genetic operations. Agents behavior to distribute energy consumption over sensor nodes. Simulation results show that the enhanced framework extends the lifetime of sensor nodes. Successful transmission ratios of emergency data and non emergency data are increased by 27% and 14%, respectively. Also, the results demonstrate that Qos of networks are improved.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3923-3932
• /
• 2000

In mobile network, wireless links may be overloaded due to a high concentratioJl of mobile hosts in a given cell. As a result, the required QOS(Quality of Service) cannot be provided to all flows in that cell. So, there exists adaptive applications which can operate with various bandwidth levels. When a wireless link is overloaded, it can adapt by reducing the bandwidths of flows, is referred to as rate adaptation. In this paper, we analyze the performance of existing rate adaptation methods by simulations. The result of simulation experiments shows that average-fair adaptation scheme has very low network overhead but high bandwidth variance of flows, which causes the worse quality of service. We propose a rate adaptation method refined by combining fair adaptation and average-fair adaptation, and shows the refined method can provide lower bandwidth variance of flows by simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.224-236
• /
• 1997

In order to control the flow of traffic in ATM networks and optimize the usage of network resources, an appropriate control mechanism is necessary to cope with congestion or prevent degradation of network performance caused by congestion. While the conventional UPC algorithm provides only unstable preventive function unrelated with the state of networks and is unable to recover congestion, the proposed adaptive UPC algorithm supervises the situation of ATM networks using the information from OAM cell. Then the monitor of the proposed adaptive UPC algorithm controls leaky rate and buffer threshold value according to QOS. Therefore, the proposed algorithm can cope with congestion as well as prevent and react sensitively to buffer delay. In proportion to the diversity of traffic and the increase of transmission rate in networks, the adaptive UPC-BT algorithm proposed in this paper can be effectively used in ATM networks with wide applications. This paper shows that the proposed algorithm efficiently uses in ATM networks with application. This paper shows that the proposed algorithm efficiently use network resources and provides QOS to users for various kinds of traffics by comparing with conventional UPC algorithms.