• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.1-8
• /
• 2014

As the e-learning spreads widely and demands on the internet video service, transmitting video data for many users over the Internet becomes popular. To satisfy this needs, the traditional approach uses a tree structure that uses the video server as the root node. However, this approach has the danger of stopping the video service even when one of the nodes along the path has a some problem. In this paper, we propose a video-on-demand service that uses multiple paths. We add new paths for backup and speed up for transmitting the video data. We show by simulation experiments that our approach provides a high-quality of video service.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.603-610
• /
• 2003

On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This paper analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization and management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various schemes is performed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.1
• /
• pp.41-43
• /
• 2014

In this paper, we proposed a new protection scheme of the WDM mesh networks that can utilize the network resources efficiently while satisfying with the recovery time defined in the SLA (service level agreement). The protection scheme and the backup path are selected based on the comparison of the expected protection time with the SLA recovery time. The superior performance of the proposed protection scheme was demonstrated by comparing with ones of the existing protection schemes.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.77-82
• /
• 2005

Protection of user service becomes increasingly important since even very short interruption of service due to link or node failure will cause huge data loss and incur tremendous restoration cost in high speed network environment. Thus fast and efficient protection and restoration is one of the most important issues to be addressed. Protection methods have been proposed to provide efficiency and stability in optical networks. In this paper, an original network is separated into several domains using Hamiltonian cycle. and link protection is performed on the cycles of the domains. We have shown that protection path length can be decreased up to $57{\%}$ with marginal increase of backup capacity. Our proposed method can provide high-speed protection with marginal increase of protection capacity.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.6
• /
• pp.129-135
• /
• 2010

This paper suggests a multipath establishing scheme for ad hoc networks. Data paths are established by on-demand manner. Multipath are made as a sequence of route control message exchange at route setup process. Multipath can be used as a backup path or load balancing for data exchange. Proposed scheme uses a one-hop pre-search scheme for establishing multipath between source and destination. When a node selects a next node for route reply, the node finds optimal route by exchanging route information with neighbor nodes. Simulation results show that the proposed multipath scheme has better split characteristics among multipath and higher route survivability at the environment where nodes are moving.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4720-4738
• /
• 2015

Proper management on user-driven virtual circuits (VCs) is essential for seamless operation of virtual networks. The Network Provisioning System (NPS) is useful software for creating user-driven VCs automatically and must take fault management into account for physical layer impairments on user-driven VCs. This paper addresses a user-driven and trusty protection management in an NPS with an open standard Network Service Interface (NSI), as a contribution to show how to implement the user-driven and trusty protection management required for user-driven VCs. In particular, it provides a RESTful web service Interface for Configuration and Event management (RICE) that enable management of a distinguished data and control plane VC status between Network Service Agents (NSAs) in the event of a node or link fault and repair in a domain. This capability represents a contribution to show how network and protection events in a domain can be monitored between NSAs (NPSs with the NSI) in multiple domains. The implemented NPS controls and manages both the primary and backup VC with disjoint path in a user-driven manner. A demonstration to verify RICE API's capability is addressed for the trusty protection in the dynamic VC network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1690-1700
• /
• 2000

Connection management function of the TINA which is developed by TINA-C provides network connection services such as setup modification and release of connections. The connection management function provides these services to network operators to the fault management function that provides backup-path and to the performance management function that provides load-balancing. The connection management function necessarily requires a routing algorithm to set up a new connection. In this paper we propose a new routing algorithm named QTHR (QoS and Traffic parameter based Hierarchical Routing) for TINA based connection management of ATM/B-ISDN network. And we implemented the QTHR and analyzed the performance of the QTHR.