• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2205-2217
• /
• 2015

Bio-inspired routing protocol uses a principle of swarm intelligence, which finds the optimal path to the destination in a distributed and autonomous way in dynamic environments, so that it can maximize routing performances, reduce control overhead, and recover a path failure quickly according to the change of network topology. In this paper, we propose a bio-inspired routing protocol for mobile ad hoc networks. The proposed scheme uses a function of overhearing via wireless media in order to obtain the routing information without additional overhead. Through overhearing, the pheromone is diffused around the shortest path between the source and destination. Based on this diffused pheromone, a probabilistic path exploration is executed and the useful alternative routes between the source and destination are collected. Therefore, the proposed routing protocol can ensure the up-to-date routing information while reducing the control overhead. The simulation results show that the proposed scheme outperforms the typical AODV and AntHocNet protocols in terms of routing performances and significantly decreases the routing overhead against the AntHocNet.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.704-711
• /
• 2003

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. But there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for small size of payload. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of U/UDP protocols to reduce overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented on the Linux environment. Using the designed Header compression system between a server and a client have the advantage of effective data throughput in network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.582-584
• /
• 2014

Conventional Web crawlers are reducing overhead burden on the server to ensure the integrity of data optimization measures have been continuously developed. The amount of data growing exponentially faster among those data, then the data needs to be collected should be used to the modern web crawler is the indispensable presence. In this paper, suggested that the existing Web crawler and Web crawler approach efficiency comparison and analysis. In addition, based on the results, compared to suggest an optimized technique, Web crawlers, data collection cycle dynamically reduces the overhead of the server system was designed for. This is a Web crawler approach will be utilized in the field of the search system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.981-987
• /
• 2019

In this paper, we propose a new SC-FDE (single carrier frequency domain equalization) structure to cope with narrow band interference signals or jammers and reduce pilot overhead. The conventional SC-FDE structure has a problem that the receiver performance degrades severely due to difficulty in time-domain channel estimation when narrow band jammers exist. In addition, the spectral efficiency is lowered by transmitting pilot at every SC-FDE block to estimate channel response. In order to overcome those problems, the proposed structure is devised to estimate frequency domain channel directly without time domain channel estimation. To reduce the pilot overhead, several data blocks are transmitted between two pilots. The channel estimate of each data block is found through linear interpolation of two channel estimates at two pilots. By performing frequency domain channel equalization using this channel estimate, the distortion by the channel is well compensated when narrow band jammers exist. The performance of the proposed structure is confirmed by computer simulation.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.293-294
• /
• 2009

시스템 통합(System Integration) 패러다임의 변화와 MEMS, 네트워크 기술의 발달로 사람, 컴퓨터 그리고 사물이 유기적으로 연계되어 다양하고 편리한 서비스를 제공해 주는 컴퓨팅 기술에 대한 연구들이 진행 되고 있다. 이와 관련하여 지능형 로봇 시스템 환경은 중앙집중 환경에서 분산 환경과 웹이융합된 새로운 환경으로 변화하고 있다. 이를 적용하기 위해서 다양한 연구기관의 개발자 들은 이를 지원할 수 있는 미들웨어의 개발에 많은 노력을 기울이고 있다. 로봇 미들웨어는 다양한 통신 프로토콜, 하드웨어, 운영체제 그리고 프로그래밍 언어의 통합, 통신 오버헤드 그리고 소프트웨어 개발 방법론 등 많은 문제점을 가지고 있다. 본 논문에서는 통합성, 통신 오버헤드, 유연성을 기준으로 기존 미들웨어의 단점을 제시하고 해당 문제점을 해결하기 위한 지능형 로봇을 위한 효율적 미들웨어를 제안한다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.331-336
• /
• 1999

웹은 지난 수년간 급속도로 발전하였으며 웹의 다양한 활용 분야 중에서 시뮬레이션은 웹의 특성을 가장 잘 이용하는 분야 중 하나로, 웹 기반 시뮬레이션의 구현에 대한 연구가 활발히 이루어지고 있다. 또한 Java 언어의 출현은 웹에서 실질적인 애니메이션과 애니메이션들간의 상호동작을 가능하게 한다. 웹 기반 분산 시뮬레이션은 웹의 분산 특성과 자바의 객체지향 특성을 이용한 분산 시뮬레이션이다. time-warp 기법을 사용하는 웹 기반 분산 시뮬레이션에서 speedup에 대한 성능은 rollback과 통신 지연이 가장 중요한 요인이다. rollback이 발생한 경우 시뮬레이션을 다시 수행하여 시뮬레이션을 매우 느리게 한다. 이러한 rollback과 통신 지연의 방대한 오버헤드는 시뮬레이션 모델의 지역적 분할을 사용할 때 발생한다. 본 발표에서는 time-warp을 기본 구졸 자바의 RMI를 사용하는 웹 기반 분산 시뮬레이션에서 통신 지연에 의한 오버헤드 및 거대한 병렬성과 분산을 고려한 시뮬레이션의 구현 모델을 제안하고 구현한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.41-44
• /
• 2012

Extensible Markup Language(XML)는 데이터 저장, 웹 서비스, 팟캐스팅, 신디케이션과 같은 분야에서 널리 사용되는 언어이다. XML 문서를 사용하기 위해서는 반드시 XML 문서에 대한 파싱이 이루어져야 하기 때문에 여러 연구들이 제안되었다. 스트림 기반 파서인 Roll-Back Streaming XML(RBStreX) 파서는 파싱의 흐름을 되돌리는 Roll-Back을 제안하였지만, 특정 노드를 검색할 때 발생되는 오버헤드를 해결하지 못하였다. 본 논문에서는 특정 노드에 대한 검색 기능을 지원하는 새로운 구조의 하드웨어 스트리밍 파서를 제안하였고, 시뮬레이션을 통하여 하드웨어의 동작 검증을 하였다. 제안된 구조는 RBStreX 파서와 비교하여 소프트웨어 오버헤드가 없으며 하드웨어 사이클도 반 정도로 감소시키는 성능향상을 얻는다.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.436-449
• /
• 2016

This paper compares the transport overhead of MMT (MPEG Media Transport) with that of MPEG-2 TS (Transport Stream). MPEG-2 TS is globally used in multiplexing compressed audio and video data in digital broadcast industry, including areas of DTV (Digital Television), IPTV (Internet Protocol Television), and DMB (Digital Multimedia Broadcasting). It was the early 1990s when MPEG-2 TS standard was established. After more than two decades of years since its first establishment, many parts of MPEG-2 TS turned out to be inappropriate to today's broadcast and communication environment. Given the situations, in 2014 MPEG (ISO/IEC JTC 1 SC 29/WG 11) standardized MMT as the next-generation multimedia transport standard hopefully that can replace MPEG-2 TS. In this paper, with assumptions of broadcast service scenarios we applied both MMT and MPEG-2 TS to each scenario and we calculated their transport overheads. We used a software program that counts the transport overhead, which was developed in our laboratory for this paper. And we conducted a comparative analysis based on the calculated result of transport overhead.