• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.135-142
• /
• 2016

When video service is performed in simulation using NS-2(Network Simulation-2), the video replay is performed as the received frame order. In the existing video replay method based on the received frame order, as the frame orders of receiver and transmitter are different, the receiver buffer does not have the effect that the packets between the frames of transmitter buffer holds a regular size and packet dense and sparsity phenomenon in the receiver buffer is made by the irregular packet size due to the unpredictable reversed order of received partial frames. The above dense and sparsity phenomenon increases the probability of buffer overflow and underflow generation. To prevent these problems, the proposed frame receive order relocation method adds an extra replay buffer which rearranges the order of receive frame as the order of transmit frame, so it has the effect that the packets between the transmit frames keeps a regular size. Through the simulation using NS-2 and JSVM(Joint Scalable Video Model), the generation number of buffer overflow and underflow, and PSNR(Required Peak Signal to Noise Ratio) performance between the existing method and proposed method were compared. As a result, it was found that the proposed method would have better performance than the existing method.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.285-292
• /
• 2007

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.469-474
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1138-1147
• /
• 2012

In this paper, an efficient power control based MF-TDMA resource allocation scheme is proposed for next generation military satellite communication systems. The proposed scheme has the flexibility is used to support heterogeneous terminals with differ in transmission capabilities. The method can be divided into two parts : burst size calculation and burst structure determination. At first, we estimate the link budget taken into account a dynamic satellite link state variation. Then, applicable ACM level and burst size is chosen. In burst structure determination phase, we reorganize the burst structure in time-frequency domain by controlling limited power, bandwidth, time resources. In particular, we compensate the power spectral density among different terminals to integrate them in same transponder, Furthermore, we increase the packing efficiency by controlling the ACM level of the burst in applicable power spectral density range. Simulation results show that the method increase the spectral efficiency and burst packing efficiency. In addition, slot allocation rejection ratio is successfully reduced.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.69-72
• /
• 2007

DOCSIS 3.0 Protocol is proposed to make the advance of HFC network. In the DOCSIS based network, the upstream frame is divided into contention section reservation section. CMs to have packets send request messages through the contention section. That two or more CMs sends Request message at the same contention slot makes collison. In this paper, are propose the contention section establlish at algorithm considering of channel-bonding mechanism that is the primary technique of DOCSIS 3.0. Results of simulation display better performance int the number of contention slots and the utilization of contention section.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.321-328
• /
• 2010

This paper presents a coordinator-based TDMA reader protocol that can avoid the reader collision in a passive RFID system. In the proposed protocol, the coordinator can not only minimize the number of empty slots by efficiently allocating slots to readers incoming in Poisson distribution, but reduce latency time through the limited frame size. The proposed protocol can be implemented in either mobile or fixed mode through the slot structure to be described in the context. The simulation results show it works as suggested and the frame size limitation as well as the statistical distribution of incoming readers has a great impact on the overall slots and the average latency time.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.413-420
• /
• 2008

Network bandwidth is one of the major factors that impact the cost of a video service. In this paper we propose approaches to reducing the bandwidth requirement for transporting MPEG-4 video traffic over wireless LANs while guaranteeing a required level of quality of service(QoS). To support high quality video playbacks, video frames must be transported to the client prior to their playback times. A real-time transmission scheduling is used for this purpose, which transmits each frame assigned with a priority according to its importance. It addresses the challenge for a scheduling algorithm that efficiently handles the changing workloads of MPEG-4 video traffic. The goal of our research is to maximize the number of frames that are transported within their deadlines while minimizing the tardiness of frames that missed their deadlines. The performance of the proposed method is compared with that of similar service mechanisms through extensive simulation experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.396-398
• /
• 2023

Statista 통계 조사에 따르면 데이터의 규모는 매년 증가할 것으로 예상하고 빅데이터 처리 프레임워크의 관심이 높아지고 있다. 빅데이터 처리 프레임워크 Spark는 Shuffle 과정에서 노드 간 데이터 전송이 일어난다. 이때 분산 처리한 데이터를 네트워크로 전송하기 위해 객체를 바이트 스트림으로 변환하여 메모리 buffer에 담는 직렬화 작업이 필요하다. 그러나 바이트 스트림을 buffer에 담는 과정에서 바이트 스트림의 크기가 메모리 buffer보다 클 경우, 메모리 할당 과정이 추가로 발생하여 전체적이 Spark의 성능 저하로 이어질 수 있다. 이에 본 논문에서는 Spark 환경에서 분산 처리 성능 향상을 위한 직렬화 buffer 최적화 시스템을 제안한다. 제안하는 방법은 Spark Driver가 Executor에게 작업을 할당하기 전 직렬화된 데이터 크기 측정과 직렬화 옵션 설정을 통해 Executor에게 적절한 buffer를 할당할 수 있다. 향후 제안하는 방법의 검증을 위해 실제 Spark 클러스터 환경에서 성능 평가가 필요하다.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.219-227
• /
• 2011

The superframe structure of IEEE 802.15.4, an international standard for low rate WPAN, is composed of CAP(Contention access period) and CFP(Contention free period). CAP is the contention-based access period, while CFP is contention-free access period for supporting QoS by allocating fixed bandwidth. The standard can support QoS for only a few devices, because the maximum number of GTSs is 7. Furthermore, as the value of BO (Beacon order) or SO (Superframe order) increases, the size of a time slot increases. This makes it difficult to precisely allocate bandwidth for any device, because the bandwidth is allocated by the unit of GTS. The proposed scheme of this paper can reduce the waste of BW in CFP by adaptively reducing the size of a time slot in CFP as the value of BO or SO increases and increase the number of GTSs to 127 by modifying the standard. The performance analysis shows that the proposed scheme can dramatically increase the bandwidth utilization during the CFP when comparing with IEEE 802.15.4.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.563-564
• /
• 2011

본 논문에서 우리는 unequal loss protection(ULP) 알고리즘을 기반으로 패킷이 손실될 수 있는 망 환경에서 인지적으로 재구성된 영상의 왜곡을 최소화하는 방법을 제안한다. 알고리즘에는 2가지의 주요 요인이 있다. 첫째, 인간 시각 체계의 균일하지 않은 분포의 함수로 압축된 영상에 가중치를 준다. 둘째, 패킷은 오류 전파가 일어나지 않도록 하면서 각각의 group of picture(GOP)내에서 시간적인 중요성이 할당된다. 프레임의 인지적인 중요성과 GOP의 계층적인 중요성을 동시에 고려하여, 제안하는 ULP알고리즘은 인간 시각적으로 가장 중요한 지역의 크기를 식별하여 효율적인 forword error correction(FEC) 알고리즘을 수행한다.