• 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.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.12
• /
• pp.1505-1516
• /
• 2001

The goal of Medical multimedia server is to develop computer hardware and software which would enable electronic access, storage, transmission, and display of patient data and images. Since the current network only provides so called "best-effort" services, it is impossible to satisfy QoS guarantee that is required for real time application services for emergency room, operating room etc. Accordingly, world-wide research is being made for a variety of services to provide QoS. he goal of DiffServ is to offer scalable differentiated service in Internet which are made possible by traffic classification and conditioning only performed at an edge(or a boundary) node. In case DiffServ was deployed in the Medical multimedia network, it is difficult to estimate how the QoS mechanism would affect totally the network performance. Therefore, we need to verify by simulation the design of algorithm which provide a variety of differentiated services. In QoS for Medical multimedia network, a simulator is designed and implemented using OPNET to investigate the performance of DiffServ QoS support mechanism. The developed DiffServ simulator may generate packets according to random, and bursty traffic models in order to incorporate diverse traffic conditions in the Medical multimedia network environment. Based on our simulation results, we confirmed that service differentiation is possible by using the EF(Expedited Forwarding) class in DiffServ networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5243-5263
• /
• 2017

Data center networks provide critical bandwidth for the continuous growth of cloud computing, multimedia storage, data analysis and other businesses. The problem of low link bandwidth utilization in data center network is gradually addressed in more hot fields. However, the current scheduling strategies applied in data center network do not adapt to the real-time dynamic change of the traffic in the network. Thus, they fail to distribute resources due to the lack of intelligent management. In this paper, we present an improved adaptive traffic scheduling strategy utilizing the simulated annealing genetic algorithm (SAGA). Inspired by the idea of software defined network, when a flow arrives, our strategy changes the bandwidth demand dynamically to filter out the flow. Then, SAGA distributes the path for the flow by considering the scheduling of the different pods as well as the same pod. It is implemented through software defined network technology. Simulation results show that the bisection bandwidth of our strategy is higher than state-of-the-art mechanisms.

• IE interfaces
• /
• v.11 no.2
• /
• pp.39-48
• /
• 1998

It is strongly believed that Video on Demand(VOD) will become one of the most promising services for Broadband Integrated Services Digital Network(B-ISDN). VOD service can be classified into two types of services: Near VOD(NVOD) and Interactive VOD(IVOD). Although VOD network requires many kinds of resources, we only consider video servers, programs. and storages. In the network. some video servers should be installed at some nodes(especially, at the root node for NVOD service). so that each node with video server stores video programs and distributes stored programs to customers. We take into account three kinds of costs related with the above resources: a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to the locations of video servers and the kinds of programs stored at each video server. Given a multi-level VOD network and the total number of programs being served in the network. the resource. optimization problem for providing both IVOD and NVOD services is to determine where to install video servers, and which and how many programs should be stored at each video server, in order to minimize the total cost. In this paper we develop an efficient dynamic programming algorithm to solve the problem. We also implement the algorithm based on two different service policies assumed in this paper.

• The Journal of the Korea Contents Association
• /
• v.10 no.11
• /
• pp.58-67
• /
• 2010

Data-centric storage schemes(DCS) are one of representative researches that efficiently store and manage sensor readings in sensor nodes in the sensor networks. In DCS, a sensor sends the sensed data to a specific node in order to store them. However, it has a problem that sensor nodes consume a lot of energy for transmitting their readings to remote sensor node. In this paper, we propose a novel sensor data compression algorithm to reduce communication costs for DCS. The proposed algorithm establishes a safe region and transmits the sensed data only when current measurement is out of the safe region, As a result, the proposed algorithm extends network life time and reduces data transmission. It is shown through performance evaluation that our proposed algorithm reduces energy consumption by about 60% over the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1684-1691
• /
• 2016

Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.90-96
• /
• 2008

Recently, various recording technologies are studied for optical data storage. After standardization of BD (Blu-ray Disc) and HD-DVD (High-Definition Digital Versatile Disc), the industry is looking for a suitable technology for next generation optical data storage. Super-RENS (Super-Resolution Near Field Structure) technique, which is capable of compatibility with other systems, is one of next optical data storage. In this paper, we proposed a neural network-based nonlinear equalizer (NNEQ) for Super-RENS discs. To mitigate the nonlinear ISI (Inter-Symbol Interference), we applied NARX (Nonlinear AutoRegressive eXogenous) which is a kind of neural networks. Its validity is tested with the RF signal samples obtained from a Super-RENS disc. The performance of the proposed equalizer is superior to the one without equalization and that of the Limit-EQ in terms of BER (Bit Error Rate).

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2080-2091
• /
• 1997

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in the emerging broadband integrated services digital networks. A centralized VOD system, all programs are stored in a single VOD server which is linked to each user via exchanges, is applicable when a small number of users enjoys the VOD service. However, in case of large service penetration, it is very important to solve the problems of bandwidth and load concentrating in the central video server(CVS) and program transmission network. In this paper, the architecture of the video distribution service network is studied, then a traffic characteristics and models for VOD system are established, and proposed program allocation method to video servers. For this purpose, we present an analysis of program storage amount in each LVS(Local Video Server), transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVS, vision probability, etc. A method for finding out storage capacity in LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.31-42
• /
• 2005

We consider a network storage model whose administrator can not be fully trusted. In this model, we assume that all data stored are encrypted for data confidentiality and one owner distributes the decryption key for each time period to users. In this paper, we propose three privilege management schemes. In the first scheme, called Temporal Privilege Management (TPM), we use a symmetric encryption based on one-way function chains for key encapsulation. In the second scheme, called Asymmetric Temporal Privilege Management (ATPM), anyone can encrypt the data using the public key of owner, but only privileged users can decrypt the encrypted data. Finally, we present a scheme to restrict writers' privilege using ID-based signatures in ATPM. In our schemes, the privilege managements are based on the time and the addition of users is efficient. Specially, applying TPM and ATPM, we can solve the back-issue problem.

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.53-60
• /
• 2008

The Web Services infrastructure is a distributed computing environment for service-sharing. Mechanisms for Web services Discovery proposed so far have assumed a centralized and peer-to-peer (P2P) registry. A discovery service with centralized architecture, such as UDDI, restricts the scalability of this environment, induces performance bottleneck and may result in single points of failure. A discovery service with P2P architecture enables a scalable and an efficient ubiquities web service discovery service that needs to be run in self-organized fashions. In this paper, we propose an autonomic -interleaving Registry Overlay Network (RgON) that enables web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. The RgON, doubtless empowers consumers to discover web services associated with these advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulation.