• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.937-944
• /
• 2002

The current fast-growing Internet traffic is demanding more and more network capacity. Photonic packet switching offers high-speed, data rate/format transparency, and configurability, which are some of the important characteristics needed in future networks supporting different forms of data. In this paper, we define that optical backbone networks for IP transport consist of optical packet core switches and optical fibers. We propose a multi-link photonic packet switch managing as single media which unifies the whole bandwidth of multiple wavelengths on the optical fiber in the WDM optical networks. The proposed switch uses optical packet memories of output link equally as well as using the WDM buffer. So it cuts down the required number of buffers and realizes of the optical packet memory economically.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.818-825
• /
• 2004

High availability means Service-technology that can provide any solution when occur a problem in relation to hardware, software, network etc. We are in the times that the network computing service are essential to our daily life. So the importance of the high availability is being higher and higher in this social change such as the arrival of information anger times, e-commerce the extension of multi-media service etc. In this thesis, I analyzed about High-availability Linux Server for Multimedia Tourism Information System, and I proposed an alternative plan which related with its result.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.54-57
• /
• 2013

최근 다양한 방송 및 영상 분야에서 사람의 행동을 인식하여는 연구들이 많이 이루어지고 있다. 영상은 다양한 형태를 가질 수 있기 때문에 제약된 환경에서 유용한 템플릿 방법들보다 특징점에 기반한 연구들이 실제 사용자 환경에서 더욱 관심을 받고 있다. 특징점 기반의 연구들은 영상에서 움직임이 발생하는 지점들을 찾아내어 이를 3차원 패치들로 생성한다. 이를 이용하여 영상의 움직임을 히스토그램에 기반한 descriptor(서술자)로 표현하고 학습기반의 판별기(classifier)로 최종적으로 영상 내에 존재하는 행동들을 인식하였다. 그러나 단일 판별기를 이용한 다양한 영상 인식을 수용하기에는 힘들다. 최근에 이를 개선하기 위하여 다중 판별기를 활용한 연구들이 영상 판별 및 물체 검출 영역에서 사용되고 있다. 따라서 본 논문에서는 행동 인식을 위하여 support vector machine과 spare representation을 이용한 decision-level fusion 방법을 제안하고자 한다. 제안된 논문의 방법은 영상에서 특징점 기반의 descriptor를 추출하고 이를 각각의 판별기를 통하여 판별 결과들을 획득한다. 이 후 학습단계에서 획득된 가중치를 활용하여 각 결과들을 융합하여 최종 결과를 도출하였다. 본 논문에 실험에서 제안된 방법은 기존의 융합 방법보다 높은 행동 인식 성능을 보여 주었다.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.857-864
• /
• 2002

Channel coding is one of the most important things to improve digital communications. In this paper, we analyze the performance of turbo code with block interleaver using hopping algorithm (i. e., non-linear interleaver) for high speed multi-media service. The input and output of conventional block interleaver is achieved by the order of column and row, but hoping algorithm is achieved by hopping the column and row that increase the minimum distance and average distance between the nearest data dually. To verify and compare the performance of an proposed method the computer simulation have been performed using turbo code in gaussian channel environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2107-2113
• /
• 2015

This paper proposed a Prior Forecast System of Crossroad Traffic Information that allows vulnerable road users to perceive traffic signal changes beforehand and respond in concentrated traffic areas such as crossroads. Also, it mapped out information linking procedures of the proposed system and it designed a PHY based wireless communication simulator to verify the operational feasibility of wireless communications. Conclusively, by conducting performance analysis according to crossroad channel environments using the simulator designed in this paper, it verified that a Prior Forecast System of Crossroads Traffic Information service for vehicle IT based decision-making support for vulnerable road users is a possibility.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.172-178
• /
• 2008

Orthogonal Frequency Division Multiplexing (OFDM) is one of the most promising technologies for high data rate wireless communications. OFDM has been adopted in wireless standards such as digital audio/video broadcasting. The combination of OFDM and cooperative diversity techniques can provide the diversity gain and/or increased capacity. In this paper, the cooperative coding using cyclic delay diversity (CDD) for multiuser OFDM systems is introduced. To improve the beneficial effects of relays's cooperation, CDD is adopted in cooperative transmission of relays. Simulation results show the bit error rate (BER) for various consideration. The proposed scheme provides improved performance compared to delay.

• Journal of Broadcast Engineering
• /
• v.23 no.2
• /
• pp.293-301
• /
• 2018

In ISDB-T, which is Japanese digital terrestrial TV specification based on OFDM technology, 6MHz bandwidth is divided into 13 segments. Twelve segments (full-seg) are used for high definition broadcasting for fixed receivers and one segment (one-seg) for mobile receivers. Though one-seg supports high speed mobility by using QPSK modulation, it is not suitable for large display mobile devices because of its low data rate. Full-seg using 64QAM modulation also suffers from its low mobile performance. In this paper, mobile performance of ISDB-T full-seg receiver is evaluated by applying sub-carrier interference removing scheme, high speed mobile channel estimation scheme and antenna diversity scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.326-329
• /
• 2017

Most modern computer communications and storage media support encryption technology. Many of the Ping Pong algorithms are stream ciphers that generate random numbers in the LFSR core structure. The LFSR has a structure that guarantees the maximum period of a given size, but it has a linear structure and can be predicted. Therefore, the Ping Pong algorithm has a feature of making the linearity of the LFSR into a nonlinear structure through variable clocks and functions. In this paper, we try to improve the existing linearity by replacing the linear disadvantages of LFSR with logistic maps.