• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1890-1910
• /
• 2013

Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.159-162
• /
• 2003

This paper presents a novel heuristic mechanism, Dynamic-network Adapted Cost selection (DAC-selection), which has higher backup path sharing rate, lower number of blocked channel requests and number of used wavelengths fer reservation of working path and backup path by using unique cost function than that of widely used random selection (R-selection) mechanism and Combined Min-cost selection (CMC-selection) mechanism proposed by Lo, while maintaining 100% restoration capability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.397-404
• /
• 2006

As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.855-857
• /
• 2011

In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1911-1930
• /
• 2017

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.668-675
• /
• 2003

In this paper, we propose an enhanced p-cycle (preconfigured protection cycle) scheme for WDM mesh networks with QoS constraints. In the previous researches on p-cycle, it is assumed that user's connection has a hi-directional connectivity and the same bandwidth on both direction. Therefore it is difficult to apply p-cycle based link protection to uni-directional connections for multicasting or asymmetric broadband multimedia communications with hi-directional connectivity. And it didn't consider QoS of backup path. We enhanced the p-cycles to accomodate uni-directional connections for multicasting or asymmetric bandwidth communications with hi-directional connectivity. And we propose a selection procedure of p-cycle to assure QoS of backup path. We were able to reduce a required backup bandwidth by applying a uni-directional p-cycle concept to asymmetric broadband multimedia communication environment. The proposed p-cycle selection procedure is applied to the U.S. sample network to evaluate whether the configured p-cycles can support QoS constraint of working path and backup path.

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