The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 10, 2015

Filed:

Nov. 11, 2011
Applicants:

Neda Beheshti-zavareh, San Jose, CA (US);

Ying Zhang, San Jose, CA (US);

Inventors:

Neda Beheshti-Zavareh, San Jose, CA (US);

Ying Zhang, San Jose, CA (US);

Assignee:
Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04L 12/28 (2006.01); H04L 12/753 (2013.01); H04L 12/707 (2013.01); H04L 12/703 (2013.01); H04L 12/721 (2013.01);
U.S. Cl.
CPC ...
H04L 45/48 (2013.01); H04L 45/22 (2013.01); H04L 45/28 (2013.01); H04L 45/12 (2013.01); H04L 45/24 (2013.01);
Abstract

The invention is a routing algorithm characteristic that minimizes the weight, meaning that the probability that a node is disconnected from the controller in case of a failure in the network is minimized. The first algorithm used in the invention is an approximation algorithm for finding the controller routing tree that provides maximum resilience in the network. The algorithm is referred to herein as the Maximum Resilience (MR) algorithm. The heuristic MR algorithm selects a shortest-path tree as a starting point and modifies the tree in order to improve resilience. The output of the MR algorithm is not necessarily a shortest-path tree, but provides more resilience compared to the initial tree. The RASP algorithm provides a shortest-path tree with improved network resilience compared to other possible shortest-path trees.


Find Patent Forward Citations

Loading…