• Macromolecular Research
• /
• v.11 no.3
• /
• pp.163-171
• /
• 2003

For the pervaporation of water-ethanol mixtures, new composite membranes having poly(acrylic acid)-poly (butyl methacrylate-co-methyl methacrylate) interpenetrati ng polymer network [PAA-P(BMA-co-MMA) IPN] skin layer supported on porous and crosslinked poly(BMA-co-MMA) were prepared. The morphology of the sub-layer of the composite membrane prepared in the presence of 60 wt% solvent showed cellular structure, on the other hand that of sublayer prepared in the presence of 70 wt% solvent presented very porous interconnected pore structure with macrovoids. Permeation rates of the composite membranes were largely influenced by the morphology of the sublayer. Separation factors increased with the increase of the degree of crosslinking of the PAA network. It was found that permeation rates could be increased by introducing anionic charges on carboxyl groups of the PAA. The permeation rate changes of the PAA-P(BMA-co-MMA) IPN composite membranes according to the feed compositions showed quite similar pattern with the swelling behavior in water-ethanol mixtures.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1090-1097
• /
• 1999

the multi computers operated in harsh environments should be designed to guarantee normal operations in the presence of the component faults. One solution for this is a fault-tolerant routing. In the paper, we consider n-dimensional meshed network for the basic topology and propose a simple fault-tolerant routing algorithm that can transfer messages to their destination as desired in the presence of some component faults. the built algorithms basically adopts a WormHole(WH) routing method and uses the virtual channels sharing a physical channel for deadlock-freedom. Consequently, we show that the suggested algorithm has a higher performance than the X-Y routing algorithm through simulation results.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.157-163
• /
• 2000

Introduction of motion video including live video into network virtual reality systems makes virtual spaces more attractive. To handle live video in networked virtual reality s)'stems based on VRML, the scalability of networked virtual reality systems becomes very important on the internet where the performance of the network and the end systems varies dynamically. In this paper, a new quality control algorithm suitable for scalable networked virtual reality systems with live video capability is proposed. Our approach is to introduce the notion of the importance of presence (IoP) which represents the importance of objects in virtual spaces. According to IoPs, the degree of the deterioration of each object presentation will be determined in case of the starvation of system resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1198-1212
• /
• 2013

Network virtualization enables autonomous and heterogeneous Virtual Networks (VNs) to co-exist on a shared physical substrate. In a Network Virtualization Environment (NVE), the fact that individual VNs are underpinned by diverse naming mechanisms brings about an obvious challenge for transparent communication across multiple VN domains due to the complexity of uniquely identifying users. Existing solutions were mainly proposed compatible to Internet paradigm with little consideration of their applications in a virtualized environment. This calls for a scalable and efficient naming framework to enable consistent communication across a large user population (fixed or mobile) hosted by multiple VNs. This paper highlights the underlying technical requirements and presents a scalable Global Naming Framework (GNF), which (1) enables transparent communication across multiple VNs owned by the same or different SPs; (2) supports communication in the presence of dynamics induced from both VN and end users; and (3) greatly reduces the network operational complexity (space and time). The suggested approach is assessed through extensive simulation experiments for a range of network scenarios. The numerical result clearly verifies its effectiveness and scalability which enables its application in a large-scale NVE without significant deployment and management hurdles.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.786-799
• /
• 2018

Recently, NFV has attracted attention as a next-generation network virtualization technology for hardware -independent and efficient utilization of resources. NFV is a technology that not only virtualize computing, server, storage, network resources based on cloud computing but also connect Multi-Tenant of VNFs, a software network function. Therefore, it is possible to reduce the cost for constructing a physical network and to construct a logical network quickly by using NFV. However, in NFV, when a new VNF is added to a running Tenant, authentication between VNFs is not performed. Because of this problem, it is impossible to identify the presence of Fake-VNF in the tenant. Such a problem can cause an access from malicious attacker to one of VNFs in tenant as well as other VNFs in the tenant, disabling the NFV environment. In this paper, we propose Auto-configurable Security Mechanism in NFV including authentication between tenant-internal VNFs, and enforcement mechanism of security policy for traffic control between VNFs. This proposal not only authenticate identification of VNF when the VNF is registered, but also apply the security policy automatically to prevent malicious behavior in the tenant. Therefore, we can establish an independent communication channel for VNFs and guarantee a secure NFV environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.81-86
• /
• 2011

In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.327-338
• /
• 2011

With the incitation to reduce power consumption and the aggressive reuse of spectral resources, there is an inevitable trend towards the deployment of small-cell networks by decomposing a traditional single-tier network into a multi-tier network with very high throughput per network area. However, this cell size reduction increases the complexity of network operation and the severity of cross-tier interference. In this paper, we consider a downlink two-tier network comprising of a multiple-antenna macrocell base station and a single femtocell access point, each serving multiples users with a single antenna. In this scenario, we treat the following beamforming optimization problems: i) Total transmit power minimization problem; ii) mean-square error balancing problem; and iii) interference power minimization problem. In the presence of perfect channel state information (CSI), we formulate the optimization algorithms in a centralized manner and determine the optimal beamformers using standard convex optimization techniques. In addition, we propose semi-decentralized algorithms to overcome the drawback of centralized design by introducing the signal-to-leakage plus noise ratio criteria. Taking into account imperfect CSI for both centralized and semi-decentralized approaches, we also propose robust algorithms tailored by the worst-case design to mitigate the effect of channel uncertainty. Finally, numerical results are presented to validate our proposed algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.745-748
• /
• 2006

With a home network, a device can dynamically join a home network, obtain an IP address, convey its capabilities, and learn about the presence and capabilities of other devices. Devices can subsequently communicate with each other directly. Device discovery protocol defines how network services can be discovered on the network. In this paper, we propose the secure discovery method of devices that uses mutual authentication with symmetric key between devices. This method that we present distributes symmetric-key to home network devices by the home server. Using this key, mutual authentication is performed between home appliances. It enables any appliance under any middleware's control to securely communicate any other appliances.

• Informatization Policy
• /
• v.18 no.3
• /
• pp.25-49
• /
• 2011

As a way to gather diverse information required for everyday living, the importance of social networks has been growing. Social network services have been spreading rapidly because of diffusion of the Internet, evolution of social network sites, and recognition of the importance of social networks. Recently, the social network service has been evolved based on a new paradigm, Web 2.0, pursuing participation and openness. Following the adoption of Web 2.0 technologies, the social network service allows users to make and maintain new relationships in a more convenient way. Users of the social network service tend to reveal their personal information, and share their ideas and content with other people; in the process they become aware of their existence, feel satisfaction with life and exert influence to others as a member of the society. This study uses higher order factor analysis to analyze factors that affect the intention of using the social network service. A research model was developed with second-order factors including perceived social presence, perceived gratification and perceived social influence. First-order factors are grouped by technical, individual and social factors. Smart PLS 2.0 was used to conduct empirical analysis. The analysis results supported the validity of the research model.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.85-90
• /
• 2013

To provide high-quality services, national public institutions and companies have provided information and materials over the internet network. However, a risk of malware infection between transmission and reception of data leads to exposure to various security threats. For this reason, national institutions have proceeded with projects for network separation since 2008, and data linkage has been made using network connection storage through network separation technologies, along with physical network separation. However, the network connection storage has caused waste of resources and problems with data management due to the presence of the same data in internal network storage and external network storage. In this regard, this study proposes a method to connect internal and external network data using NAS storage as a way to overcome the limitations of physical network separation, and attempts to verify the priority of items for the optimization of network separation by means of AHP techniques.