• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4144-4165
• /
• 2018

Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1845-1865
• /
• 2019

Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

• ETRI Journal
• /
• 제35권3호
• /
• pp.512-522
• /
• 2013

In this paper, the radius weight mean (RWM) and the feature-embedding technique are used to present a novel watermarking scheme for color images. Simulations validate that the stego-images generated by the proposed scheme are robust against most common image-processing operations, such as compression, color quantization, bit truncation, noise addition, cropping, blurring, mosaicking, zigzagging, inversion, (edge) sharpening, and so on. The proposed method possesses outstanding performance in resisting high compression ratio attacks: JPEG2000 and JPEG. Further, to provide extra hiding storage, a steganographic method using the RWM with the least significant bit substitution technique is suggested. Experiment results indicate that the resulting perceived quality is desirable, whereas the peak signal-to-noise ratio is high. The payload generated using the proposed method is also superior to that generated by existing approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.145-164
• /
• 2014

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

• 정보보호학회논문지
• /
• 제23권3호
• /
• pp.359-370
• /
• 2013

2010년, Lin과 Chan은 가역 비밀이미지 공유(reversible secret image sharing) 기법을 최초로 제안했다. 이 기법의 장점은 쉐도우 이미지(shadow images)의 왜곡 비율(distortion ratio)이 작고, 비밀이미지의 삽입량(embedding capacity)이 기존의 기법들에 비해 높으며, 가역(reversible)이 가능하다. 그러나 그들의 기법은 몇 가지 문제점들이 존재한다. 첫째, 나머지 연산(modular operation)에 사용하는 소수 m에 의하여 전체 참가자들의 수가 제한된다. 둘째, 비밀 공유 과정 내 양자화 값(quantized value)과 다항식의 결과 값의 덧셈 연산에서 오버플로우(overflow)가 발생한다. 마지막으로, 다항식 최고차항의 계수가 0이 되어 t-1명의 참가자로도 비밀데이터 접근이 가능해지는 문제점을 가진다. 본 논문에서는 Lin과 Chan이 제안한 기법의 문제점을 해결하는 동시에 쉐도우 이미지의 왜곡 비율이 작고 비밀 이미지의 삽입량을 향상시키는 기법을 제안한다. GF($2^8$)상에서의 다항식 연산을 통해 전체 참가자 수의 제한과 오버플로우 문제를 해결하고, 다항식 최고차항의 계수 중 MSB 4-비트를 고정하는 방법을 적용하여 계수가 0이 될 수 있는 문제점을 해결한다. 실험결과에서는 Lin과 Chan의 기법에서 PSNR과 삽입량이 서로 반비례하지만 제안한 기법의 경우 삽입량이 증가하더라도 PSNR은 45dB 이상으로 유지됨을 알 수 있다.

• 한국멀티미디어학회논문지
• /
• 제17권7호
• /
• pp.849-857
• /
• 2014

In this paper, we propose a (2,2)-reversible secret image sharing scheme using histogram shifting and difference expansion. Two techniques are widely used in information hiding. Advantages of them are the low distortion between cover and stego images, and high embedding capacity. In secret image sharing procedure, unlike Shamir's secret sharing, a histogram generate that the difference value between the original image and copy image is computed by difference expansion. And then, the secret image is embedded into original and copy images by using histogram shifting. Lastly, two generated shadow images are distributed to each participant by the dealer. In the experimental results, we measure a capacity of a secret image and a distortion ratio between original image and shadow image. The results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2879-2899
• /
• 2021

The tone reservation (TR) scheme is an attractive method to reduce peak-to-average power ratio (PAPR) in the filter bank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) systems. However, the high PAPR of FBMC signal will severely degrades system performance. To address this issue, a cyclic shift based TR (CS-TR) scheme with embedding side information (SI) is proposed to reduce the PAPR of FBMC signals. At the transmitter, four candidate signals are first generated based on cyclic shift of the output of inverse discrete Fourier transform (IDFT), and the SI of the selected signal with minimum peak power among the four candidate signals is embedded in sparse symbols with quadrature phase-shift keying constellation. Then, the TR weighted by optimal scaling factor is employed to further reduce PAPR of the selected signal. At the receiver, a reliable SI detector is presented by determining the phase rotation of SI embedding symbols, and the transmitted data blocks can be correctly demodulated according to the detected SI. Simulation results show that the proposed scheme significantly outperforms the existing TR schemes in both PAPR reduction and bit error rate (BER) performances. In addition, the proposed scheme with detected SI can achieve the same BER performance compared to the one with perfect SI.

• 한국멀티미디어학회논문지
• /
• 제8권6호
• /
• pp.783-789
• /
• 2005

This paper is proposed a watermarking technique for copyright protection of multimedia contents. We proposed adaptive watermark detection algorithm using stochastic perceptual model and statistical decision method in DMWT(discrete multi wavelet transform) domain. The stochastic perceptual model calculates NVF(noise visibility function) based on statistical characteristic in the DMWT. Watermark detection algorithm used the likelihood ratio depend on Bayes' decision theory by reliable detection measure and Neyman-Pearson criterion. To reduce visual artifact of image, in this paper, adaptively decide the embedding number of watermark based on DMWT, and then the watermark embedding strength differently at edge and texture region and flat region embedded when watermark embedding minimize distortion of image. In experiment results, the proposed statistical decision method based on multiwavelet domain could decide watermark detection.