MPLS virtual rings
First Claim
1. A method of constructing a virtual ring from a plurality of nodes in a packet network, the method comprising the steps of:
- defining a community of interest by selecting nodes from an interconnected mesh of nodes in the packet network;
determining inter-node connectivity for each node in the community of interest with respect to all other nodes in the community of interest;
computing an optimal virtual ring to connect all the nodes in the community of interest;
advertising ring labels to all nodes in the community of interest;
determining neighboring nodes in the community of interest for each node in the community of interest and selecting east and west labels for the neighboring nodes from a set of advertisements received at each node in the community of interest, wherein the step of determining east and west labels comprises the step of first determining eastbound and westbound directions according to a lowest BGP next hop identifier and its closest next hop identifier; and
instantiating the ring labels in respective forwarding tables for each node in the community of interest to enable efficient forwarding of data packets to nodes in the community of interest.
7 Assignments
0 Petitions
Accused Products
Abstract
A virtual ring representing a community of interest is constructed from an interconnected mesh of nodes in a packet network. The virtual ring instantiates ring labels in respective forwarding tables for each node in the virtual ring and then advertises the ring labels to all other nodes in the virtual ring, for example by flooding BGP advertisements. Data packets entering the ring are assigned a ring label which is then stripped off when exiting the ring. The data packets are forwarded around the virtual ring using the ring labels. The virtual ring can operate using BGP/LDP Multi Protocol Label Switching (MPLS). Multiple virtual rings can be bridged together using a central hub or alternatively multiple virtual rings can be redundantly bridged together using tandem hubs.
27 Citations
15 Claims
-
1. A method of constructing a virtual ring from a plurality of nodes in a packet network, the method comprising the steps of:
-
defining a community of interest by selecting nodes from an interconnected mesh of nodes in the packet network; determining inter-node connectivity for each node in the community of interest with respect to all other nodes in the community of interest; computing an optimal virtual ring to connect all the nodes in the community of interest; advertising ring labels to all nodes in the community of interest; determining neighboring nodes in the community of interest for each node in the community of interest and selecting east and west labels for the neighboring nodes from a set of advertisements received at each node in the community of interest, wherein the step of determining east and west labels comprises the step of first determining eastbound and westbound directions according to a lowest BGP next hop identifier and its closest next hop identifier; and instantiating the ring labels in respective forwarding tables for each node in the community of interest to enable efficient forwarding of data packets to nodes in the community of interest. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method of forwarding data packets through a virtual ring of nodes that connect a community of interest in a packet network, the method comprising the steps of:
-
computing the virtual ring connecting all nodes of the community of interest; advertising ring labels to the nodes in the community of interest; determining neighboring nodes in the community of interest for each node in the community of interest and selecting east and west labels for the neighboring nodes from a set of advertisements received at each node in the community of interest, wherein selecting east and west labels comprises determining eastbound and westbound directions according to a lowest BGP next hop identifier and its closest next hop identifier; instantiating the ring labels in forwarding tables at each node in the community of interest; assigning a ring label identifier to each data packet entering the virtual ring at an originating node; forwarding the data packet through the virtual ring; and stripping the ring label identifier from the data packet when the data packet exits the virtual ring at the originating node. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A virtual ring for transporting data packets to one or more nodes that form part of a community of interest within a packet network, the virtual ring comprising:
-
a plurality of networked nodes connected together to define the virtual ring linking the community of interest; a forwarding table at each node in the virtual ring, the forwarding table including ring labels for all other nodes in the ring, the ring labels having being advertised to other nodes in the community of interest to determine east and west labels for neighboring nodes for constructing the virtual ring, wherein determining the east and west labels comprises determining eastbound and westbound directions according to a lowest BGP next hop identifier and its closest next hop identifier; packet-labeling means for assigning ring label identifiers to data packets entering the virtual ring; means for forwarding data packets around the virtual ring; and label-stripping means for stripping the ring label identifiers from data packets exiting the ring. - View Dependent Claims (12, 13, 14, 15)
-
Specification