• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2783-2804
• /
• 2021

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

• ETRI Journal
• /
• v.41 no.4
• /
• pp.473-482
• /
• 2019

High availability and reliability have been considered promising requirements for the support of seamless network services such as real-time video streaming, gaming, and virtual and augmented reality. Increased availability can be achieved within a local area network with the use of the virtual router redundancy protocol that utilizes backup routers to provide a backup path in the case of a master router failure. However, the network may still lose a large number of packets during a failover owing to a late failure detections and lazy responses. To achieve an efficient failover, we propose the implementation of fast detection with virtual router redundancy protocol (FDVRRP) in which the backup router quickly detects a link failure and immediately serves as the master router. We implemented the FDVRRP using open neutralized network operating system (OpenN2OS), which is an open-source-based network operating system. Based on the failover performance test of OpenN2OS, we verified that the FDVRRP exhibits a very fast failure detection and a failover with low-overhead packets.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.137-145
• /
• 2020

Providing safety training to construction workers is essential to reduce safety accidents at the construction site. With the prosperity of visualization technologies, Immersive Virtual Reality (IVR) has been adopted for construction safety training by providing interactive learning experiences in a virtual environment. Previous research efforts on IVR-based training have found that the level of fidelity of interaction between real and virtual worlds is one of the important factors contributing to the sense of presence that would affect training performance. Various interactive devices that link activities between real and virtual worlds have been applied in IVR-based training, ranging from existing computer input devices (e.g., keyboard, mouse, joystick, etc.) to specially designed devices such as high-end VR simulators. However, the need for high-fidelity interactive devices may hinder the applicability of IVR-based training as they would be more expensive than IVR headsets. In this regard, this study aims to understand the impact of the level of fidelity of interactive devices in the sense of presence in a virtual environment and the training performance during IVR-based forklift safety training. We conducted a comparative study by recruiting sixty participants, splitting them into two groups, and then providing different interactive devices such as a keyboard for a low fidelity group and a steering wheel and pedals for a high-fidelity group. The results showed that there was no significant difference between the two groups in terms of the sense of presence and task performance. These results indicate that the use of low-fidelity interactive devices would be acceptable for IVR-based safety training as safety training focuses on delivering safety knowledge, and thus would be different from skill transferring training that may need more realistic interaction between real and virtual worlds.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.1
• /
• pp.112-120
• /
• 2003

In this paper, dynamic track tension fur high mobility tracked vehicle is investigated by multibody dynamic simulation techniques. This research focuses on a heavy military tracked vehicle which has sophisticated suspension and rubber bushed rack systems. In order to obtain accurate dynamic track tension of track subsystems, each track link is modeled as a body which has six degrees of freedom. A compliant bushing element is used to connect track links. Various virtual proving ground models are developed to observe dynamic changes of the track tension. Numerical studies of the dynamic track tension are validated against the experimental measurements. The effects of pre-tensions, traction forces, fuming resistances, sprocket torques, ground profiles, and vehicle speeds, for dynamic responses of track tensions are explored, respectively.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.929-944
• /
• 2015

We give a quotient of the ring ${\mathbb{Q}}[A^{{\pm}1},\;t^{{\pm}1]$ so that the Miyazawa polynomial is a non-trivial invariant of welded links. Furthermore we show that this is also an invariant under the other forbidden move $F_u$, and so it is a fused isotopy invariant. Also, we give some quotient ring so that the index polynomial can be an invariant for welded links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1917-1921
• /
• 1999

In this paper, we studied the method of path distribution in order to increase reliability of the network by reducing path congestion, solving the problems of increasing blocking statistics, and increasing the utilization of network resource. A scheme of efficient path calculation which can reduce the traffic congestion in an arbitrary link is proposed by path calculation equations considering link occupation rates. A rapid method of establishing a connection which can efficiently cope with accidental connection failure are studied.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1323-1333
• /
• 1997

In this paper, we propose an efficient architecture for a high-speed cell concentrator/distributor(HCCD) in an ATM(Asynchronous Transfer Mode) switch and by analyzeing the simulation results evaluate the performance of the proposed architecuture. The proposed HCCD distributes cells from a switch link to local processors, or concentrates cells from local processor s to a switch link. This design is to guarntee a high throughput for the IPC (inter-processor communication) link in a distributed ATM switching system. The HCCD is designed in a moudlar architecture to provide the extensibility and the flexibility. The main characteristics of the HCCD are 1) Adaption of a local CPU in HCCD for improving flexibility of the system, 2) A cell-baced statistical multiplexing function for efficient multiplexing, 3) A cell distribution function based on VPI(Virtual Path Identifier), 4) A bypassing capability for IPC between processor attached to the same HCCD, 5) A multicasting capability for point-to-multipoint communication, 6) A VPI table updating function for the efficient management of links, 7) A self-testing function for detecting system fault.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.45-52
• /
• 2009

In this paper, we develop queueing network models of communication networks with reliability model considering link failures. The reliability of a communication network with a virtual connection exposed to link failures is analyzed. Stochastic Reward Nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. It is shown that SRN modeling is well suited to specify, automatically generate and solve for reliability under rerouting. Markov models using SRN are developed and solved to depict various rerouting caused by link failures and reliability analysis in communication networks.