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:
Aug. 07, 2012

Filed:

Apr. 01, 2010
Applicants:

Nigel Bragg, Weston Colville, GB;

Paul Bottorff, Palo Alto, CA (US);

David Allan, Ottawa, CA;

Robert Friskney, Harlow, GB;

Simon Parry, Harlow, GB;

Inventors:

Nigel Bragg, Weston Colville, GB;

Paul Bottorff, Palo Alto, CA (US);

David Allan, Ottawa, CA;

Robert Friskney, Harlow, GB;

Simon Parry, Harlow, GB;

Assignee:

Rockstar Bidco, LP, New York, NY (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/26 (2006.01); H04L 12/28 (2006.01); H04L 12/56 (2006.01); G06F 15/16 (2006.01); G06F 15/173 (2006.01);
U.S. Cl.
CPC ...
Abstract

A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.


Find Patent Forward Citations

Loading…