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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.369-380
• /
• 2003

In the CDMA wireless link, frame errors are correlated and burst because of fading. The implementation ability of RLP error recovery is dependent on the correlated frame errors. The (1,2,3) retransmission scheme, which is recommended as default in IS-707, is not adapted in high frame loss regime with strong correlations. By using the modified error recovery method, where the total number of retransmission attempts is the same and the retransmission is increased, the proposed retransmission scheme can efficiently recover frame errors than the (1,2,3) retransmission scheme. Since the modified scheme has longer transmission delay due to the increase of retransmission round, we propose the algorithm of retransmission failure prediction to improve the modified error recovery scheme. We simulate the modified error recovery scheme applying our algorithm and compare two schemes. (i.e. default scheme by IS-707 and modified scheme) not applying our algorithm. In the result, we show TCP performance improvement is better than default scheme by IS-707.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.98-107
• /
• 2008

In mobile ad hoc networks, packet loss is unavoidable due to MAC contention, link failure or the inherent characteristics of wireless link. Since TCP relies on the timely reception of TCP ACK packets to progress the transmission of the TCP DATA packets, ACK loss obviously affects the performance due to two main problems: (a) Frequent occurrence of spurious retransmissions caused by timeout events and (b) impairment of the fast retransmit mechanism caused by the lack of a sufficient number of duplicate ACK packets. In particular, since most reactive routing protocols force the packets buffered over a path to be discarded while performing a route recovery, the performance degradation becomes more serious due to such ACK loss. In this paper, therefore, TCP with two piggybacking schemes (called TCP-pgy) is proposed in order to resolve the above-mentioned problems over reactive routing protocols. Through extensive simulations using the ns-2 simulator, we prove that our proposed schemes contribute to TCP performance improvements.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.655-664
• /
• 2002

The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.35-41
• /
• 2010

Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.12
• /
• pp.105-114
• /
• 2023

In this paper, we propose a deployment and operation scheme of UxNB network toward mobile IAB. By operating a UxNB network based on SDN(Software Defined Network), UxNBs are deployed in areas where mobile communication services are desired. After deploying UxNB in the service area, IAB can be set up to perform mobile communication services. For this purpose, this paper first proposes a UxNB Network Controller consisting of a UAV Controller and an SDN Controller, and proposes the necessary functions. Next, we present a scenario in which a UxNB network can be deployed and operated in detail step by step. We also discuss the location of the UxNB network controller, how to deliver control commands from the UAV controller to the UxNB, how to apply IAB for UxNB networks, optimization of UxNB networks, RLF(radio link failure) recovery in UxNB networks, and future research on security in UxNB networks. It is expected that the proposed UxNB Network Controller architecture and UxNB network deployment and operation will enable seamless integration of UxNB networks into Mobile IAB.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.127-129
• /
• 2004

대부분의 통신망 복구기법에서는 예상되는 손실에 대한 망 복구를 설계한다. 예를 들어 가장 자주 발생하는 단일 링크 손실의 경우에 대하여 100%의 복구를 보장하는 형태이다. 그러나, 예상되지 않은 손실, 즉 다중 링크의 손실과 같은 경우에는 이리 준비된 예비 자원을 가지고는 설계한대로 100% 복구를 수행할 수 없다. 이 경우에는 남아있는 예비 자원을 이용하여 손실된 트래픽의 일부만이라도 복구하여야 한다. 본 논문에서는 두 개의 링크가 동시에 손실된 경우에 트래픽의 우선순위에 기반하여 여러 단계의 계층적인 복구 견고성을 제공하여, 최상위 우선순위의 트래픽에 대해서는 100%에 가까운 복구율을 제공하는 기법을 제안한다. 제안된 기법은 단일 링크의 손실에 대비한 예비 자원만을 할당하여 다중 링크 손실의 경우에도 높은 우선순위의 트래픽에 대하여 복구 견고성을 제공한다는 점에서 그 실효성이 크다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1303-1315
• /
• 2012

In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1233-1244
• /
• 2016

In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.