IP Library Granted Patent US 8,797,845
Granted Patent B2
US 8,797,845 · App. 12/743,107 · Granted Aug 5, 2014

Failure recovery method in non revertive mode of ethernet ring network

Inventors: Jeong-Dong Ryoo (Daejeon, KR); June-Koo Rhee (Daejeon, KR); Bheom-Soon Joo (Daejeon, KR); Jin-Sung Im (Ulsan, KR); Zahir Uddin Ahmad (Daejeon, KR); Yang Yang (Shenzhen, CN); Marc Holness (Nepean, CA)
Assignees: Electronics and Telecommunications Research Institute; Korea Advance Institute of Science and Tecnology
H04L12/437H04L12/26
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,797,845
App. No.
12/743,107
Granted
Aug 5, 2014
Kind
B2
Abstract

Provided is a failure recovery method in a non-revertive mode of an Ethernet ring network. In an Ethernet ring network, link priorities between nodes or node priorities are determined based on media access control (MAC) addresses and the nodes having blocked ports are determined after failures are recovered from based on the priorities so that the blocked ports can be distributed.

Claims (23)

1. A simultaneous failure recovery method, the failure occurring in at least two links in an Ethernet ring network, the method comprising:

transmitting a first message comprising a priority information of a first node after a failure recovery between the first node and a second node;

comparing the priority information of the first node to a priority information of other node comprised in a received second message;

if the priority of other node is higher than the priority of the first node, removing blocking of a port of the first node;

a node adjacent to the links where the failures occur, multicasting a first failure recovery message comprising link priority (or node priority), when the links where the failures occur, are simultaneously recovered where the priority is determined solely from a larger value from among media access control (MAC) addresses of ports included in two nodes that are adjacent to the link where the failure occurs; and

determining whether to remove blocking of the node based on the link priority (or the node priority) and a link priority (or a node priority) included in a second failure recovery message, when the node receives the second failure recovery message from other nodes.

2. The method of claim 1 , further comprising, removing blocking of the node, when the node receives a message indicating that a master node is blocked.

3. A failure recovery method of a first node in a network, the method comprising:

transmitting a first message comprising a priority information of the first node after a failure recovery between the first node and a second node;

comparing the priority information of the first node to a priority information of other node comprised in a received second message; and

if the priority of other node is higher than the priority of the first node, removing blocking of a port of the first node,

wherein the other node is a third node, and the second message comprising a priority information of the third node is received after a failure recovery between the third node and a fourth node.

4. The method of claim 3 , further comprising,

if the priority of the other node is lower than the priority of the first node, maintaining blocking of a port of the first node.

5. The method of claim 4 , further comprising,

receiving a clear message from a master node; and

removing blocking of a port of the first node in response to the clear message.

6. The method of claim 3 , further comprising,

starting a guard timer after a failure recovery between the first node and the second node.

7. The method of claim 3 , wherein the priority information of the first node is a node ID of the first node.

8. The method of claim 3 , wherein the other node is the second node.

9. The method of claim 3 , further comprising,

if the priority of the third node is lower than the priority of the first node, maintaining blocking of a port of the first node.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2012
From: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE; KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY
Reel/Frame 029519/0989 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2010
From: RYOO, JEONG-DONG; RHEE, JUNE-KOO; JOO, BHEOM-SOON; IM, JIN-SUNG; AHMAD, ZAHIR UDDIN; YANG, YANG; HOLNESS, MARC
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 025078/0440 →
Priority Claims (3)
KR 10-2007-0117532 · Nov 16, 2007 · national
KR 10-2008-0036844 · Apr 21, 2008 · national
KR 10-2008-0084750 · Aug 28, 2008 · national
Continuity (1)
Related Publication 20110019538A1 · Jan 27, 2011