• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.227-238
• /
• 2008

Recently, as network environment has broadened, the demands on VOD have been increased. The VOD services can be categorized into two types, RVOD and NVOD. Practical VOD services adopt one of them exclusively. Since a method using only one of RVOD and NVOD is not able to deal with frequently variable demand of clients, it leads to a result of overload on a server and a waste of server bandwidth. The efficiency of the network resource usage becomes lower. Hence this paper presents a study on the protocol for efficient VOD services. We propose a new protocol appliable for the existing VOD service algorithm, analyze its performance through simulation, and developed server/client systems applying the new protocol. We propose a mode switching protocol combined with protocols used in RVOD and NVOD. The proposed protocol is not able only to control both RVOD and NVOD but also to change the mode between RVOD and NVOD. As a result of using the proposed protocol to meet frequently variable demand, server bandwidth can be used efficiently. Especially, it can be applied to the existing VOD service algorithms. Therefore, we expect that the proposed protocol in this paper will be widely used in emerging VOD markets.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.11
• /
• pp.51-62
• /
• 2003

This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.737-748
• /
• 2005

Two flexible admission control schemes for integrated voice and stream-type data services are proposed in DS-CDMA systems. Most Previous studies on admission control have focused on integration of short, bursty Packet-type data services and conventional voice services. However, stream-type data services with a relatively long service holding time are expected to be a considerable portion of data traffic in future generation cellular systems. Scheme I is a basic scheme that accommodates both voice and data services with full bandwidth. However, voice services are given priority over data services using the duration difference between the holding times for these services. Scheme ll uses a different method to efficiently give priority to voice services over stream-type data services. An additional interference margin for voice services is provided by suppressing interference from stream-type data services according to voice access requests and a varying interference status. Performance of the two schemes is evaluated by developing Markovian models. Numerical results show that the voice capacity is highly sensitive to the service holding time of data services while the performance measures of data services are not highly sensitive. Scheme H is a significant improvement over Scheme I for accommodating voice and stream-type data services

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1311-1319
• /
• 1998

The methods of providing available bandwidth adaptively using feedback to maximize the utilization of network as well as the quality of service have been the focus of recent research activities for ATM(Asynchronous Transfer Mode). This study has been extended from the point-to-point connection to a point-to-multipoint environment as the number of applications requiring multicast service increases. It is known that the effectiveness of feedback based congestion control scheme diminishes as propagation delay increases. Especially for a multicast connection consisting of various paths and destinations with different performance and congestion status, the problem of unfairness due to different propagation delays may occur. The degree of such unfairness may change depending on various aspects of congestion control schemes. These has been, however, relatively little study on these problems. In this paper, we present how various aspects of control schemes-length of the interval between feedback generations, point of time to coalesce feedback cells from child paths, decreasing factor of source rate in case of congestion-affect the degree of unfairness. Simulation results show that degree of unfairness changes according to when the feedback coalescing happens. Expecially it is shown that the effect of feedback coalescing time to the degree of unfairness is more significant for the smaller feedback interval. It is also found that as the source rate decreasing factor becomes larger the average ACR(Allowed Cell Rate) at the source gets lower and the degree of unfairness grow larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.595-604
• /
• 2009

The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.974-987
• /
• 1999

이동 컴퓨팅 환경에서 자주 접근하는 데이터에 대한 캐싱은 무선 채널의 좁은 대역폭에서 경쟁을 줄일 수 있는 유용한 기술이다. 그러나, 트랜잭션 캐시 일관성을 지원하는 전통적인 클라이언트/서버 전략은 클라이언트와 서버간에 많은 양의 통신을 필요로 하기 때문에 이동 클라이언트/서버 컴퓨팅 환경에서는 적절하지 않다. 본 논문에서는 브로드캐스트-기반 캐시 무효화 정책을 사용하면서 트랜잭션 캐시 일관성을 지원하는 OCC-UTS (Optimistic Concurrency Control with Update TimeStamp) 프로토콜을 제안한다. 접근한 데이터에 대한 일관성 검사 및 완료 프로토콜은 캐시 무효화 과정의 내부 과정으로 완전 분산 형태로 효율적으로 구현되며, 일관성 체크의 대부분이 이동 클라이언트에서 수행된다. 또한, 분석 모델에 기반한 성능 비교를 통해, 본 논문에서 제안하는 OCC-UTS 프로토콜이 다른 경쟁 프로토콜보다 높은 트랜잭션 처리율을 얻으며, 데이터 항목을 자주 접근하면 할수록 지역 캐시를 사용하는 OCC-UTS 프로토콜이 더 효율적임을 보인다. 이동 클라이언트의 접속 단절에 대해서는 무효화 브로드캐스트 윈도우를 크게 하여 접속 단절에 적절히 대처할 수 있다.Abstract In a mobile computing environment, caching of frequently accessed data has been shown to be a useful technique for reducing contention on the narrow bandwidth of the wireless channels. However, the traditional client/server strategies for supporting transactional cache consistency that require extensive communications between a client and a server are not appropriate in a mobile client/server computing environment. In this paper, we propose a new protocol, called OCC-UTS (Optimisitic Concurrency Control with Update TimeStamp), to support transactional cache consistency in a mobile client/server computing environment by utilizing the broadcast-based solutions for the problem of invalidating caches. The consistency check on accessed data and the commitment protocol are implemented in a truly distributed fashion as an integral part of cache invalidation process, with most burden of consistency check being downloaded to mobile clients. Also, our experiments based on an analytical model substantiate the basic idea and study the performance characteristics. Experimental results show that OCC-UTS protocol without local cache outperforms other competitor protocol, and the more frequent a mobile client accesses data items the more efficient OCC-UTS protocol with local cache is. With respect to disconnection, the tolerance to disconnection is improved if the invalidation broadcast window size is extended.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.414-422
• /
• 2011

The paper is for top and bottom symmetrical phase controlled loop antenna using for multi-media devices. We developed a top and bottom phase control loop pattern arrangement methods for loop antenna in mobile devices like as a cell phone and PCS, WCDMA. In the loop antenna pattern, arrange close adhesive the loop antenna pattern $180^{\circ}$ cycle in wave length, the radiated electro-magnetic wave from close adhesive loop pattern in $180^{\circ}$ become to coherent wave than the phase controlled loop antenna has high efficiency and high radiation gain. To acquire a wide band width on phase controlled loop antenna, we arrange a top and bottom symmetrical architecture loop pattern that bas a $180^{\circ}$ wave length in each layer. Top and bottom each layer bas a U form pattern separated $90^{\circ}$ wave length each other. This architecture cause a well balanced electro-magnetic flow control that acquired wide bandwidth resonance response in loop pattern antenna. In experiment, we designed a WCDMA mobile multi-media antenna in $40mm{\times}6mm$ area thickness 0.2mm, in that passive experiment the radiation efficiency is over 50% and over 0dBi radiation average gain was acquired, in the active experiment in real multi-media device we acquired -4dBi average gain and 43% transmit/receive efficiency.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.9
• /
• pp.987-994
• /
• 2010

In this paper, a simple and effective active load-pull method is proposed, and the method to improve the efficiency of X-band power amplifier using harmonic control circuit is presented. The proposed active load-pull system mainly consists of directional coupler, phase shifter, short circuit, and power amplifier, and allows a user to access reflection coefficients near the edge of the Smith chart($\Gamma$=1) easily. The device used in this paper is Mitsubishi's GaAs FET MGF1801, and the operating frequency of the power amplifier is 9 GHz, The amplifier had output power of 21.65 dBm and drain efficiency of 24.9 % at class-A, and had output power of 21.46 dBm and drain efficiency of 53.3 % at class-AB. Harmonic control circuit is designed only second and third harmonic components because of the bandwidth limitation of the microwave components. The drain efficiency is improved as much as 6.4 % compared with class-AB power amplifier.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.85-96
• /
• 2005

A ' Virtual Private Network (YPN) over Internet' has the benefits of being cost-effective and flexible. However, given the increasing demands for high bandwidth Internet and for reliable services in a 'VPN over Intemet,' an IP/GMPLS over DWDM backbone network is regarded as a very favorable approach for the future 'Optical VPN (OVPN)' due to the benefits of transparency and high data rate. Nevertheless, OVPN still has survivability issues such that a temporary fault can lose a large amount of data in seconds, moreover unauthorized physical attack can also be made on purpose to eavesdrop the network through physical components. Also, logical attacks can manipulate or stop the operation of GMPLS control messages and menace the network survivability of OVPN. Thus, network survivability in OVPN (i.e. fault/attack tolerant recovery mechanism considering physical structure and optical components, and secured transmission of GMPLS control messages) is rising as a critical issue. In this Paper, we propose a new path establishment scheme under shared risk link group (SRLG) constraint for physical network survivability. And we also suggest a new logical survivability management mechanism by extending resource reservation protocol-traffic engineering extension (RSVP-TE+) and link management protocol (LMP). Finally, according to the results of our simulation, the proposed algorithms are revealed more effective in the view point of survivability.