• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.37-42
• /
• 2016

In this paper, in today's highly complex video and broadcast operations, broadcasters are constantly challenged to reliably deliver low-latency, high-quality video to multiscreen audiences on-air and online. The Adaptive Bit Rate (ABR) protocols enable internet video to a wide range of multiscreen devices. However, video quality is often marginal and would prove unacceptable for valued linear broadcast content delivered to the Big Screen today. The Media information processing technology advances in ABR enables service providers to take control and offer quality managed linear video services to ALL screens in the home, including the Big Screen, with a single unified IP Video infrastructure. The New Multiscreen-Assisted ABR (MSA-ABR) delivery management system proposed using Cloud based multicast-assisted ABR for a broadcast facility that performs routing of contribution content and online publishing services within a virtual, centralized cloud infrastructure.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.67-75
• /
• 2009

The growing need for the mobility supportable networks induces the IP-based mobility management protocols. Though HMIPv6 which manages the micro-mobility of mobile nodes using MAPs suggests an effective method for mobility-support for mobile nodes within the domain that is managed by MAP. There is a problem that traffic may be concentrated on MAPs. In this paper, therefore, we proposed a method that can effectively distribute the traffic which is concentrated on a MAP under phased Mobile IPv6. In our proposed method, two or more MAPs are required and classified as an 'Active MAP' or a 'Passive MAP'. In addition, we defined the state of transition events between Active MAP and Passive MAP and the operations among MAPs for load distribution when an overload condition is occurred at some MAPs by traffic congestion. We compared the performance of our proposed method with its phased Mobile IPv6 to prove the propriety of our proposed method. As a result, we showed that our proposed method can provide an enhanced performance by about 12 percentages in view of packet throughput at the node.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.455-460
• /
• 2008

건설교통부는 국가미래에 대비해 실질적으로 기여할 수 있는 전략적이고 중장기적인 실효성 있는 R&D 혁신 로드맵인 VC-10 사업을 진행하고 있다. 이 과제의 핵심 기술 중에 하나인 유비쿼터스 센서네트워크는 초소형 센서들로 구성된 망으로써 환경 및 재난 재해, u-City 건설, 스마트 하이웨이, 방범 및 국방, 시설 관리, 유통, 등과 같은 다양한 분야에 사용할 수 있는 유비쿼터스 사회의 핵심 요소이다. 이것은 실시간 네트워크를 통해 전송 또는 관리되고 언제, 어디서나, 어떠한 대상과 의사소통이 가능한 지능형 컴퓨팅 환경을 구현하는 것이다. 그러나 이러한 기술을 바탕으로 하는 기존의 시스템들은 특정분야를 위한 독자적인 프로토콜이나 저전력 통신을 제공하는 ZigBee 기반으로 설계되었기 때문에 소규모 범위에서만 서비스 제공이 가능하며 시스템간의 연동이 어렵다. 따라서 본 논문에서는 유비쿼터스 센서네트워크간의 연동성을 고려한 대규모 실시간 모니터링 시스템을 설계하여 다양한 분야로 서비스할 수 있는 테스트베드 구축에 대한 방안을 제시하고자 한다. 여기서 모니터링 대상은 국토의 지반, 환경, 그리고 도심지역 등이다. 이렇게 제시된 방안은 국내실정에 적합한 모니터링 시나리오를 작성하여 테스트베드를 구축 시에 요구된 사항들에 대한 정당성을 입증한다.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1245-1251
• /
• 2017

In this study we present a novel directory architecture that can dynamically allocate a directory entry for a cache block on demand at runtime only when the block is shared by more than one core. Thus, we do not maintain coherence for private blocks, substantially reducing the number of directory entries. Even for shared blocks, we allocate directory entry dynamically only when the block is actively shared, further reducing the number of directory entries at runtime. For this, we propose a new directory architecture called dynamic directory table (DDT), which is implemented as a cache of active directory entries. Through our detailed simulation on PARSEC benchmarks, we show that DDT can outperform the expensive full-map directory by a slight margin with only 17.84% of directory area across a variety of different workloads. This is achieved by its faster access and high hit rates in the small directory. In addition, we demonstrate that even smaller DDTs can give comparable or higher performance compared to recent directory optimization schemes such as SPACE and DGD with considerably less area.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.60-69
• /
• 2013

Highlighted by recent security breaches including Google, Western Energy Company, and the Stuxnet infiltration of Iranian nuclear sites, Cyber warfare attacks pose a threat to national and global security. In particular, targeted attacks such as APT exploiting a high degree of stealthiness over a long period, has extended their victims from PCs and enterprise servers to government organizations and critical national infrastructure whereas the existing security measures exhibited limited capabilities in detecting and countermeasuring them. As a solution to fight against such attacks, we designed and implemented a security monitoring system, which shares security information and helps cooperative countermeasure. The proposed security monitoring system collects security event logs from heterogeneous security devices, analyses them, and visualizes the security status using 3D technology. The capability of the proposed system was evaluated and demonstrated throughly by deploying it under real network in a ISP for a week.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.03a
• /
• pp.933-939
• /
• 2010

Gathering information and systemization of infrastructure disaster management is to reduce uncertainties in making decisions and maximize the number of alternations for reasonable decision making. The key object is the progress report & propagation automation system based on sensors, which is major for providing objective data to realize and support decision makings and delivering decision to a certain area, department, manager and other people rapidly. Collecting, reviewing and database of existing progress report & propagation manual in order to achieve networking of safety management on major social infrastructure of the nation, materialization of field-oriented intelligent business process by developing mobile safety management command transmission device and integrating it into facility safety management network.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.975-982
• /
• 2004

In current P2P concept, pure P2P and Hybrid P2P structures are used commonly. Gnutella and Ktella are forms of pure P2P. and forms of Hybrid P2P are innumerable. File searching models exist in these models. These models provide group management for file sharing, searching and indexing. The general file sharing model is good at maintaining connectivity. However, it is defective in group management. Therefore, this study approaches hierarchical structure in file sharing models through routing technique and backup system. This system was designed so that the user was able to maintain group efficiency and connection reliability in large-scale network.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.14-24
• /
• 2010

Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.99-108
• /
• 2010

The traffic classification is a preliminary but essentialstep for stable network service provision and efficient network resource management. While various classification methods have been introduced in literature, the payload signature-based classification is accepted to give the highest performance in terms of accuracy, completeness, and practicality. However, the collection and maintenance of up-to-date signatures is very difficult and time consuming process to cope with the dynamics of Internet traffic over time. In this paper, We propose an automatic payload signature generation mechanism which reduces the time for signature generation and increases the granularity of signatures. Furthermore, We describe a signature update system to keep the latest signatures over time. By experiments with our campus network traffic we proved the feasibility of our mechanism.