A Non-Weighted Load Balanced Fast Local Protection Scheme for IP Networks

Lee, Steven; Tseng, Po-Kai; Chang, Chih‐Wen; Wu, Cheng-Shong

doi:10.1109/infcomw.2010.5466649

Cited by 5 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Paper [15] adopted the log information of path state as the basis for routing and considered the path with highest statistics availability as the service channel. Papers [16][17][18] proposed A SPA based multipath routing mechanism by increasing the redundancy of resources to enhance the A SPA of the channel. Paper [19] proposed a primary-backup sharing routing mechanism in optical networks to improve the resource utilization in premise of ensuring the statistical availability.…”

Section: Related Workmentioning

confidence: 99%

Random Violation Risk Degree Based Service Channel Routing Mechanism in Smart Grid

et al. 2018

View full text Add to dashboard Cite

Smart gird, integrated power network with communication network, has brought an innovation of traditional power for future green energy. Optical fiber technology and synchronous digital hierarchy (SDH) technology is widely used in smart grid communication transmission network. It is a challenge to reduce impact of the availability of smart grid communication services caused by random failures and random time to repair. Firstly, we create a service channel violation risk degree (SCVRD) model to precisely track the violation risk change of communication service channel. It is denoted by the probability of service channel cumulative failure duration exceeding the prescribed duration. Secondly, a service channel violation risk degree routing mechanism is proposed to improve the availability of communication service. At last, the simulation is implemented with MATLAB and network data in one province are used as data instance. The simulation results show that the average service channel failure rate of availability-aware routing based on statistics (AAR-OS) algorithm and risk-aware provisioning algorithm are reduced by 15% and 6%, respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

Random Violation Risk Degree Based Service Channel Routing Mechanism in Smart Grid

et al. 2018

View full text Add to dashboard Cite

show abstract

“…2(b) depicts the Destination Only (DO) protection scheme. DO is borrowed from IP fast reroute [11]. The decision for forwarding a packet is only based on the destination address of it.…”

Section: Of Switchmentioning

confidence: 99%

“…For the DO problem, we directly apply the formulation proposed in [11]. Due to the space limitation, the algorithm for link protection is not included.…”

Section: Layout Problemmentioning

confidence: 99%

Path layout planning and software based fast failure detection in survivable OpenFlow networks

Lee

Chan

et al. 2014

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)

Self Cite

View full text Add to dashboard Cite

In an OpenFlow network, the controller is responsible to control and manage the whole network. Although such central control paradigm is easier to achieve efficient network resources usage, the controller becomes the bottleneck when the network size is large. In this paper, we propose using pre-provisioned paths to mitigate the burden on a controller. The basic idea is to setup some background paths in the network. When an ordinary flow coming into the network, the controller only needs to setups flow entries at the ingress and egress switches. An admitted flow follows a preplanned path toward its destination. Except the ingress and egress switches, the flow entries in the remaining switches on the path kept unchanged. Since routing paths for ordinary flows are pre-planned, the whole admission and connection setup process are simplified. Jointly considering load balancing, network survivability, fast failure recovery, and flow entry consumption are the major challenges in this problem. The contribution of this paper includes two parts. First, we propose a path preplanning scheme that takes advantage of interface specific forwarding (ISF) to resolve the problem. We formulate the path preplanning problem as an integer linear programming problem. Optimization based heuristic algorithms are proposed to obtain a near optimal solution. In the second contribution, we propose a software based failure detection and failure location identification scheme. Since some existing switches take longer time to detect a network failure, a reliable lightweight software based failure detection scheme that can fast pinpoint the failure location is needed. We have performed simulations and experiments to evaluate the performance of the proposed schemes. The experimental results indicate that the proposed software failure detection scheme generates very limited overhead on the OpenFlow controller. It can be used to achieve fast failure recovery even when the network is in heavy load state. The simulation results also show that the proposed ISF based path preplanning scheme can reduce controller load and is able to achieve 100% survivability against any single link failure with low bandwidth consumption.

show abstract

“…Refs. [6]- [8] has proposed specific port based forwarding mechanism, that is when a failure occurs the routers adjacent the failure will suppress the failure information instead of forwarding them to specific pre-determined ports. They may have high survivability, but they cause many back forward hops or detouring hops and results in long delay time.…”

Section: A Protection Mechanisms For Ipmentioning

confidence: 99%

A network connection protection mechanism based on random node identification

Jiang

Liang

2011

2011 IEEE 13th International Conference on Communication Technology

View full text Add to dashboard Cite

Network failures cause service disruption, loss of packets, long transition delay, etc. Both IP network and MPLS network, which are two classical network types today, due to their limitations of packet forwarding mechanisms, have difficulties in supporting fast network failure recovery. In this paper, we first introduce a new packet switching method and make a brief introduction of Vector Network (VN). Taking advantage of the multiple paths and source-routing-like properties of VN, we propose a network connection protection mechanism based on random node identification to achieve fast network failure restoration efficiently with minor cost. Unlike the conventional routing mechanisms that immediately start rerouting when detected failures, in our proposal, end systems maintain multiple paths to every destination. When one network failure occurs, routers adjacent to the failure flood the failure information to all end systems. Each end system firstly uses backup paths to restore its connections without starting rerouting immediately. Our mechanism can guarantee fast connection restoration with little interruptions of data transition. Due to the simplicity of our new proposed random node identification method that each node generates node identification (NI) in a specific range for itself, there is no extra cost for maintaining NI distribution and management. Both the theoretical analysis and experimental results show the efficiency of our mechanism.

show abstract

A Non-Weighted Load Balanced Fast Local Protection Scheme for IP Networks

Cited by 5 publications

References 9 publications

Random Violation Risk Degree Based Service Channel Routing Mechanism in Smart Grid

Random Violation Risk Degree Based Service Channel Routing Mechanism in Smart Grid

Path layout planning and software based fast failure detection in survivable OpenFlow networks

A network connection protection mechanism based on random node identification

Contact Info

Product

Resources

About