• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.67-75
• /
• 2009

Multi-layered video coding that provides scalability across the visual content has emerged for easily adaptive service over current heterogeneous network. However, the network is still error prone environment so that video service may suffer packet loss or erroneous decoding of the video. Especially distortion caused by the burst error may propagate to several pictures until intra refreshing, which will raise a terrific degradation of picture quality. To overcome the problem at terminal independently, we propose a new error concealment algorithm for the multi-layered video coding. The proposed method uses the similarity of between layers in the multi-layered video coding and POCS (Projections Onto Convex Sets) which is a powerful error concealment tool, but heavily dependent on initial values. To find adequate initial value which can reduce iteration times as well as achieve high performance, we took consideration into both features of layered approach coding and the correlation in neighbor blocks. The simulation results show that the proposed concealment method works well.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.547-550
• /
• 2017

With the deployment of Internet of Things (IoT) services, the interest of smart building management system is rapidly increased. However, existing smart building management system has some limitations such as single point of failure, scalability, processing delay by using the centralized service platform server. To overcome these limitations, in this paper, the distributed server based smart building management scheme is proposed. In the proposed scheme, it is possible to provide fast and efficient IoT services, regardless of the scale of smart building, by using the distributed server of each floor. From the numerical analysis, it is shown that the proposed scheme provides better performance than the existing centralized scheme in terms of stability of database and service processing delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2054-2061
• /
• 2015

Biologically inspired modeling techniques have received considerable attention for their robustness, scalability, and adaptability with simple local interactions and limited information. Among these modeling techniques, Gene Regulatory Networks (GRNs) play a central role in understanding natural evolution and the development of biological organisms from cells. In this paper, we apply GRN principles to the WSN system and propose a new GRN model for decentralized node scheduling design to achieve energy balancing while meeting delay requirements. Through this scheme, each sensor node schedules its state autonomously in response to gene expression and protein concentration, which are controlled by the proposed GRN-inspired node scheduling model. Simulation results indicate that the proposed scheme achieves superior performance with energy balancing as well as desirable delay compared with other well-known schemes.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.51-58
• /
• 2010

Programming education needs learning which is adjusted individual learners' level of their learning abilities. Recommendation system is one way of implementing personalized service. In this research, we propose recommendation method which learning items are recommended for individual learners' learning in web-based programming education environment by. Our proposed system for leveled programming education provides appropriate programming problems for a certain learner in his learning level and learning scope employing collaborative filtering method using learners' profile of their level and correlation profile between learning topics. As a result, it resolves a problem that providing appropriate programming problems in learner's level, and we get a result that improving leaner's programming ability. Furthermore, when we compared our proposed method and original collaborative filtering method, our proposed method provides the ways to solve the scalability which is one of the limitations in recommendation systems by improving recommendation performance and reducing analysis time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.535-543
• /
• 2002

In order to overcome disadvantages of existing centralized network management systems that use simple objects, dynamic object platforms are proposed as alternative systems. So the distributed network management systems are implemented using various distributed platform such as CORBA and Java-RMI. Subsequently mobile agent-based platforms are proposed. The mobile agent-based platform can additionally provide flexibility and scalability to network management system that CORBA or Java-RMI based platforms do not support. In this paper, we address an architecture to solve the problem of the occurrence of additional traffic by using mobile agent and to save resources of network element. Our proposal in this paper is an efficient network management architecture using motile agents. And we make use of mobile agents for minimizing of traffic that can happen when mobile agents moves. Also we design agents using information architecture of TMN for efficient resource management of network element and improvement of operation performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.67-73
• /
• 2008

Our research is aimed at developing an architectural frame-work of USN sensor network discovery service systems. The research is fo-cused on the four areas a survey of USN technology, development of a USN software model, development of the design space of the USN sensor network discovery service, and finally the architectural framework of the USN sensor network dicovery service. The survey of the USN technology is conducted on four technological visions that contain USN system technology, USN networking technology, and USN middleware along with the service platform, With respect to each technological division, domestic and worldwide leading research projects are primarily explored with their technical features and research projects are primarily explored with their technical features and research output To provide a means to analyze sensor network discovery services, we devel-oped the design space of the sensor network discovery services by exploring the scalability with respect to query scope, lookup performance, and resolution network.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.4
• /
• pp.755-768
• /
• 2017

As Big Data becomes the core of the fourth industrial revolution, big data-based processing and analysis capabilities are expected to influence the company's future competitiveness. Comparative studies of RHadoop and RHIPE that integrate R and Hadoop environment, have not been discussed by many researchers although RHadoop and RHIPE have been discussed separately. In this paper, we constructed big data platforms such as RHadoop and RHIPE applicable to large scale data and implemented the machine learning algorithms such as multiple regression and logistic regression based on MapReduce framework. We conducted a study on performance and scalability with those implementations for various sample sizes of actual data and simulated data. The experiments demonstrated that our RHadoop and RHIPE can scale well and efficiently process large data sets on commodity hardware. We showed RHIPE is faster than RHadoop in almost all the data generally.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.31-39
• /
• 2002

The VPN(Virtual Private Network) is a private network constructed logically on a public network infrastructure. There have been numerous studies to support the VPN services by using different technologies such as IP in IP, GRE, L2TP, MPLS and so on. Among these technologies, MPLS has shown many merits in aspects of QoS, security, and management, compared with other technologies. As an enhancement of the VPN that is controlled by MPLS PE(Provider Edge) routers, this paper presents the VPN controlled by MPLS CE(Customer Edge) routers. The functional architecture of the CE based VPN and operations of the CE routers are described along with the performance comparison of CE based MPLS VPN. It has been shown that the CE based VPN has more advantages than PE based VPN with respect to independency, scalability, security, and complexity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.