• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.459-468
• /
• 2013

Under nonlinear characteristics of frames, we propose the frame interpolation using GRNN to enhance the visual picture quality. By full search with block size of 128x128~1x1 to reduce blocky artifact and image overlay, we select the frame having block of minimum error and re-estimate the nonlinear moving vector using GRNN. We compare our scheme with forward(backward) motion compensation, bidirectional motion compensation when the object movement is large or the object image includes zoom-in and zoom-out or camera focus has changed. Experimental results show that the proposed method provides better performance in subjective image quality compared to conventional MCFI methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.217-228
• /
• 2011

In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.269-279
• /
• 2004

A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1807-1824
• /
• 2015

As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2179-2187
• /
• 2008

The P2P technology has been widely used to distribute files efficiently, and its use in streaming is rapidly increasing. P2P streaming has issues about startup-delay, scalability, and real-time playback, however, what affects these factors has not been researched sufficiently. This paper suggests a buffering model for progressive download within mesh-based P2P system, which corresponds to downloading and playing the content at the same time. It is used to analyze PDF(Playback Deadline First), Rarest algorithms which are block-selection strategies of P2P streaming and proposes a mixed selection of them. The mixed block selection strategy dynamically performs different strategies based on whether the blocks to be played are received or not. In consequence, it enhances the QoS of streaming in a single peer point of view, as well as improving block distributions in an overlay network.

• Spatial Information Research
• /
• v.11 no.1
• /
• pp.41-60
• /
• 2003

It is noted that the paper mapping system for University Building Facility has many limitations in terms of data maintenance, real-time GIS data acquisition, and economic efficiency. The aim of this research was to evaluate an operational potential of an on site real-time mobile GIS technique to resolve the problem faced in the university. The idea is based upon the recent trends in the field of 'Telecommunication and Information Technology' that uses a PDA (personal Digital Assistants), wireless network computing, mobile computing, etc. A real time mobile GIS approach has been adopted, in which a PDA is linked to a wireless internet and field workers record data on the computer at the site and analyse data on site. While there should be a considerable number and variety of factors associated with real-time mobile GIS quality, this research focuses on three criteria that are identified as fundamental to customer requirements; (1) data quarry (2) spatial analysis (3) real-time GIS database building. 'Art--empirical study for a case study facility has been conducted to confirm the validity for the system. The system has been checked experimentally, enabled the field users to quarry the data required simply and execute spatial analysis (buffer, overlay etc.,) accommodating versatile alternatives on the site. Detailed visual maps can be generated over large areas quickly and easily. The PDA interface, in particular, were ideally suited for field users to interactively displaying positional information with attribute data. This system has shown to be quite convenient to maintaining a highly reliable database since it could playa crucial role in documenting at real-time basis temporal and spatial changes occurred in the facilities. It is anticipated that this research output will greatly serve to introduce the reliable and cost-effective facility mapping system in the university by overcoming serious constraints suffered from the past non-real time mobile GIS approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.1-6
• /
• 2019

Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.153-164
• /
• 2007

The Access Grid (AG) provides collaboration environments over the IP multicast networks by enabling efficient exchange of multimedia contents among remote users; however, since lots of current networks are still multicast-disabled, it is not easy to deploy this multicast-based multi-party AG. For this problem, the AG provides multicast bridges as a solution by putting a relay server into the multicast networks. Multicast-disabled clients make UDP connections with this relay server and receive forwarded multicast traffics in unicast UDP packets. This solution is facing several limitations since it requires duplicate forwarding of the same packet for each unicast peer. Thus, in this paper, we propose an alternate solution for the multicast connectivity problem of the AG based on the UMTP (UDP multicast tunneling protocol). By taking advantage of flexibilities of UMTP, the proposed solution is designed to improve the efficiency of network and system utilization, to allow reuse of multicast-based AG applications without modification, and to partially address the NAT/firewall traversal issues. To verify the feasibility of proposed solution, we have implemented a prototype AG connectivity tool based on the UMTP, named as the AG Connector.

• Spatial Information Research
• /
• v.17 no.2
• /
• pp.201-212
• /
• 2009

As GIS analysis method began to be introduced in late 1980's, studies of land development applying the GIS also started to be proceeded in various fields. Since 2003, Land Suitability Assesment has been adopted in order to prevent national land from development thoughtless for the environment and to plan appropriate national land management in terms of green development. Land Suitability Assessment System II based on diverse GIS analysis method such as Contour Analysis, Overlay Analysis, Network Analysis was particularly adopted to draft plans of specifying and altering of exclusionary zoning as well as installing and maintaining of urban planning facilities. But there has been a lot of problem, like an inaccurate basic data and assessment indicators, unmatched threshold, and contradicted evaluation result between each evaluating systems. Even though it is suited to an evaluation criteria, grade distribution is applied to start at 20, and development-centered evaluation result is offered. Now, we observed how suitability values and grading were changed, ordering to change grade distribution system from $20{\sim}100$ to $0{\sim}100$. In result, it showed changes of grades in some parcels. And in case of suitability values, 87% of parcels decreased to minimum 1 point, maximum 70 points. It means that changing grade distribution system of assessment system II doesn't have only influence on suitability values and grading but it is also an empirical analysis because of considering both development and maintenance.