• 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)
• /
• 제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.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.460-477
• /
• 2020

As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.

• Journal of Welding and Joining
• /
• 제24권3호
• /
• pp.27-33
• /
• 2006

Structural stress approach is well known as a mesh-size insensitive fatigue assessment method by using finite element analyses. It is, however, difficult to estimate the structural stress (SS) at weld end points due to stress singularities when shell elements are used. In this study, fatigue evaluations with longitudinal load carrying box fillet weldment under out-of-plane bending load have been performed by using virtual node method (VNM) in order to avoid the problem, which is called the weld end effect. Various combinations of virtual node parameters, such as reference point and virtual node locations, are investigated for the estimation of proper structural stress values applying VNM in a systematic manner. The appropriate guidance of virtual node parameter has been offered for the fillet weldment considered in the study. The structural stress values obtained by VNM have also been validated by comparing the result with finite element model including weld bead. Moreover, the fatigue strength of the fillet weldment based on the equivalent structural stress is shown to be consistent with the master S-N curve.

• 한국통신학회논문지
• /
• 제42권1호
• /
• pp.50-63
• /
• 2017

무선 센서 네트워크에서 사용되는 센서 노드는 배터리, 메모리 등의 제한된 자원을 가지고 있기 때문에 이를 효율적으로 사용하기 위한 라우팅 프로토콜이 요구된다. 본 논문에서는 싱크 노드와 센서 노드 간에 최단 전송 경로로 데이터를 전송할 수 있도록 보장하는 VAP(Virtual Address Protocol)를 제안한다. VAP는 각 노드에 이웃노드와 연관된 가상 주소와 보조 주소를 할당하고, 목적지 노드의 주소와 이웃 노드의 주소를 비교하여 최단 전송 경로를 찾아 데이터를 전송한다. 또한, 네트워크 토폴로지에서 노드가 삭제되거나 추가된 경우 재할당 알고리즘을 사용하여 노드에 주소를 할당한다. VAP를 기존의 라우팅 프로토콜과 비교한 결과, 노드간의 주소가 중복되지 않아 전송 경로 및 메모리 자원의 사용이 최소화되고, 최적의 전송 경로를 이용하여 데이터를 전송하므로 데이터의 전송 지연 시간이 감소한 것을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4023-4043
• /
• 2016

Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

• 한국IT서비스학회지
• /
• 제19권3호
• /
• pp.139-149
• /
• 2020

There are now many different commercial weather sensors suitable for smart farms, and various smart farm devices are being developed and distributed by companies participating in the government-led smart farm expansion project. However, most do not comply with standard specifications and are therefore limited to use in smart farms. This paper proposed the connecting structure of operating non-standard node devices in smart farms following standard specifications supporting smart greenhouse. This connecting structure was proposed as both a virtual node module method and a virtual node wrapper method. In addition, the SoftFarm2.0 system was experimentally operated to analyze the performance of the implementation of the two methods. SoftFarm2.0 system complies with the standard specifications and supports non-standard smart farm devices. According to the analysis results, both methods do not significantly affect performance in the operation of the smart farm. Therefore, it would be good to select and implement the method suitable for each non-standard smart farm device considering environmental constraints such as power, space, distance of communication between the gateway and the node of the smart farm, and software openness. This will greatly contribute to the spread of smart farms by maximizing deployment cost savings.

• Radiation Oncology Journal
• /
• 제33권1호
• /
• pp.50-56
• /
• 2015

Purpose: To investigate the coverage of axillary lymph node with tangential breast irradiation fields by using virtual lymph node (LN) analysis. Materials and Methods: Forty-eight women who were treated with whole breast irradiation after breast-conserving surgery were analyzed. The axillary and breast volumes were delineated according to the Radiation Therapy Oncology Group (RTOG) contouring atlas. To generate virtual LN contours, preoperative fluorodeoxyglucose positron emission tomography/computed tomography (FDG-PET/CT) scans with identifiable LN were fused with the CT scans, and the virtual LN contour were delineated on the CT. Results: The median level I and II axillary volume coverage percentages at the $V_{D95%}$ line were 33.5% (range, 5.3% to 90.4%) and 0.6% (range, 0.0% to 14.6%), respectively. Thirty-one LNs in 18 patients were delineated (26 in level I and 5 in level II). In the level I axilla, 84.6% of virtual LNs were encompassed by the 95% isodose line. In the level II axilla, by contrast, none of the virtual LNs were encompassed by the 95% isodose volumes. There was a substantial discrepancy between the RTOG contouring atlas-based axillary volume analysis and the virtual LN analysis, especially for the level I axillary coverage. The axillary volume coverage was associated with the body mass index (BMI) and breast volume. Conclusion: The tangential breast irradiation did not deliver adequate therapeutic doses to the axillary region, particularly those in the level II axilla. Patients with small breast volumes or lower BMI showed reduced axillary coverage from the tangential breast fields. For axillary LN irradiation, individualized anatomy-based radiation fields for patients would be necessary.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1187-1208
• /
• 2022

One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

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