Invention Grant
US08238245B2 Planning routes and allocating identifiers to routes in a managed frame-forwarding network
失效
规划路由并为托管的帧转发网络中的路由分配标识符
- Patent Title: Planning routes and allocating identifiers to routes in a managed frame-forwarding network
- Patent Title (中): 规划路由并为托管的帧转发网络中的路由分配标识符
-
Application No.: US12752228Application Date: 2010-04-01
-
Publication No.: US08238245B2Publication Date: 2012-08-07
- Inventor: Nigel Bragg , Paul Bottorff , David Allan , Robert Friskney , Simon Parry
- Applicant: Nigel Bragg , Paul Bottorff , David Allan , Robert Friskney , Simon Parry
- Applicant Address: US NY New York
- Assignee: Rockstar Bidco, LP
- Current Assignee: Rockstar Bidco, LP
- Current Assignee Address: US NY New York
- Agency: Withrow & Terranova, PLLC
- Main IPC: H04L12/26
- IPC: H04L12/26 ; H04L12/28 ; H04L12/56 ; G06F15/16 ; G06F15/173

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.
Public/Granted literature
- US20100189015A1 Planning Routes and Allocating Identifiers to Routes in a Managed Frame-Forwarding Network Public/Granted day:2010-07-29
Information query