• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.596-610
• /
• 2012

This paper proposes a method to provide the high quality 3D broadcasting service in a mobile broadcasting system. In this method, audio and video data are delivered through a heterogeneous network, consisting of a mobile network as well as a broadcasting network, due to the limited bandwidth of the broadcasting system. However, it is more difficult to synchronize the left and right video frames of a 3D stereoscopic service, which come through different types of networks. The proposed method suggests the use of the offset from the initial timestamp of RTP (Real Time Protocol) to determine the order of frames and to find the pair of a left and a right frame that must be played at the same time. Additionally, a new signaling method is introduced for a mobile device to request a 3D service and to get the initial RTP timestamp.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2179-2187
• /
• 1999

To privide multimedia mobile communication services for the users in scattered locations, the application ATM cells efficiently in wireless communications, it is effective to the use TDMA method. However, it is necessary to have methods to compensate the CDV(cell delay variation) caused by the difference between TDMA-ATM and cell stream multiplexing of the users. This paper optimizes the cell control time(Tc) when VBR traffic inputs have MMPP by applying CDV characteristics of time stamp method, which has the most advantages among compensation methods of CDV. This paper suggests a cell stream multiplex method employing time stamp techniques to reduce CDV for wireless suggest method shows that CDV distribution and cell stream multiples rangd can be controlled to 1.2${\times}$Tc which reduced over the VBR service in the TDMA-WATM transmission. This paper also presents evaluation of the suggested architecture obtained simulation.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.79-90
• /
• 2006

Data broadcasting is an efficient method for disseminating data, and is widely accepted in the database applications of mobile computing environments because of its asymmetric communication bandwidth between a server and mobile clients. This requires new types of concurrency control mechanism to support mobile transactions executed in the mobile clients, which have low-bandwidths toward the server. In this paper, we propose an OCC/DTA (Optimistic Concurrency Control with Dynamic Time-stamp Adjustment) protocol that can be efficiently adapted to mobile computing environments. The protocol reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics. We show that the proposed protocol satisfies data consistency requirements, and simulate that this protocol can improve the performance of mobile transactions in data broadcasting environments.

• 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 the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.71-80
• /
• 2013

In this paper, we analyze the security vulnerability through the several attack scenarios for the MCR-MAP(Multi-Context RFID Mutual Authentication Protocol) proposed by Ahn et al. And we propose the secure mutual authentication protocol that improved a prior MCR-MAP. The suggested protocol uses the ID of the legal tag and the timestamp generated by the server, when the tag tries to authenticate. And when the tag creates the credential, we create the new secret key computing the XOR operation between the secret key shared with the server and the tag timestamp generated by the server. As a result, the proposed protocol provides the secure mutual authentication and then is safe to spoofing attack. Also it provides forward-secrecy and then is safe to offline brute-burst attack. In this paper, we compare and verify the security vulnerability of the prior and the proposed protocol through the security analysis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.55-57
• /
• 2004

이동 컴퓨팅(Mo띠le Computing) 환경에서 빈번한 접속 단절은 클라이언트의 캐시 일관성(Consistency) 문제로 직결된다. 본 논문에서는 이를 해결하기 일한 무효화 보고(Invalidation Report. In)중 하나를 제시한다. 기존의 IR방식은 대량의 데이터와 빈번한 데이터의 갱신(Update)시 IR 길이의 증기폭이 상당히 크다. 이는 타임스탬프가 IR에서 차지하는 비중이 큼으로써 오는 현상이다. 또한 기존방식은 캐시 레벨의 선택적 청취(Selective tuning)를 지원하지 못하는 문제점을 가지오 있다. 이러한 점을 극복하고자 B＋Tree를 기반으로 시간 값을 구성하고 이에 따른 데이터 아이디를 재구성하는 IR방식을 제안한다. 이를 활용하면 각 클라이언트가 자신의 단절(Disconnect)된 시간에 맞는 갱신 정보를 확인할 수 있게 된다. 이러한 방법은 기존 IR의 단점을 보완하며 선택적 청취론 유도할 수 있는 효과적인 방법이다.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1020-1029
• /
• 2006

Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.435-438
• /
• 2004

전자 상거래에서 보안과 신뢰성을 보장하는 것은 매우 중요하다. 공개키 기반 구조에서는 인증서를 사용 함으로서 암호 및 인증기능을 제공하나, 신뢰성 있는 부인 방지 기능을 제공하기 위해서는 상위 기관의 인증기관이나 타임 스탬프 기능과 공증 기능을 위한 제 3의 신뢰성 있는 공증 기관이 필요하다. 본 논문에서는 전자공증의 기능과 필요성 및 동향에 대하여 소개한다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.2
• /
• pp.91-105
• /
• 2014

This paper proposes a digital forensic method by an evaluation function based on timestamp changing patterns. Operations on file or folder leave changed timestamps, which give the ways to know what operations were executed. Changes of timestamps of ten operations of a file and eight operations of a folder were examined. Analyses on the changes on the eight folder operations are newly added in this paper, which are not performed in the previous works. Based on the timestamps changes of the file and the folder, two evaluation functions are proposed. The first evaluation function checks whether timestamps are changed by file and folder operations, and the second evaluation function checks whether timestamps are originated from a source file or other attribute field. By the two output values from these evaluation functions, a digital forensic investigation on the file or the folder is performed. With some cases, i. e. file copy and folder creation operations, the proposed forensic method is tested for its usefulness.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.68-69
• /
• 2016

ISO/IEC 13818-1 MPEG2 시스템의 타이밍 모델은 인코더에 들어간 비디오와 오디오 샘플들이 일정한 딜레이가 지난 후 디코더에서 정확히 한 번씩 나타나는 식으로 구현된다. 해당되는 디코더는 타이밍 모델에 부합하여 대응되는 비트스트림을 전달받는다. 이를 통해서 적절하게 동기화가 이루어진 고품질 오디오와 비디오를 위한 디코더 구현을 쉽게 할 수 있다. 반면에, RTP 타이밍 모델은 실제 프리젠테이션 시간에 관한 타이밍 정보를 가지고 있지 않다. 데이터 패킷의 타임스탬프는 상대적 타이밍을 제공하고, RTCP 송신자는 스트림 간 동기화에 대한 정보를 제공하지만 RTP 수신기에서는 버퍼링의 량이나 패킷의 디코딩 시간에 대한 정보를 주지 않는다. 따라서 RTP는 유동적인 전송 지향적인 타이밍 모델을 가지고 있다. 반면에 MPEG-2 시스템은 정확한 타이밍 모델을 수신측을 위해 제공하고 있다. 본 논문에서는 MPEG-2 시스템과 RTP의 타이밍 모델의 이점을 가져와 MMT 시스템을 위한 타이밍 모델을 제안한다.