Method and apparatus for scaling traffic engineering routing in a network

US9231877B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9231877-B2
Application numberUS-201314029110-A
CountryUS
Kind codeB2
Filing dateSep 17, 2013
Priority dateSep 17, 2013
Publication dateJan 5, 2016
Grant dateJan 5, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method for scaling traffic engineering, TE, routing in a network, having a plurality of network elements (nodes) connected in a given layer to each other via links TE domain segments of a TE domain of said network are collapsed into a virtual TE nodes (VNs). Each VN having an allocated DE domain unique identifier and a detailed connectivity matrix, DCM, to provide a hierarchically virtualized network topology of the network.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method for scaling Traffic Engineering, TE, routing in a network, comprising a plurality of network elements (nodes) connected in a given layer to each other via links, wherein contiguous TE domain segments, TE-SEGs, of a TE domain of said network are collapsed into virtual TE nodes, VN, each having an allocated TE domain unique identifier, VNID, and a detailed connectivity matrix, DCM, to provide a hierarchically virtualized network topology of said network, wherein a TE domain segment, TE-SEG, is selected by a network operator as an arbitrary contiguous part of the TE domain, and is collapsed into at least one virtual TE node, VN, representing the selected TE domain segment, TE-SEG, wherein the virtual TE node, VN, collapsing is achieved by reconfiguring the TE links, connecting the selected TE domain segment, TE SEG, with the rest of the TE domain, thus forming VN access links, ALs, as well as all of the TE domain segment TE links, thus forming VN internal TE links, ILs, in such a way, that the AL advertisements flooded across the TE domain represent said TE domain segment, TE-SEG, to the remaining part of the TE domain as at least one virtual TE node, while the IL advertisements are contained within the respective VN(s) and are not leaked into said TE domain. 2. The method according to claim 1 , wherein the selected TE domain segment, TE-SEG, internal TE links, ILs, connecting the TE nodes within the TE-SEG, represented by at least one virtual TE node, VN, are reconfigured to be advertised into distinct TE domains, each of which associated with respective virtual TE node, VN. 3. The method according to claim 2 , wherein a dedicated policy controller, POL-CTRL, of a virtual TE node, VN, is provided to enforce policies of the network operator with respect to a required connectivity between the access TE links, ALs, across the virtual TE node, VN. 4. The method according to claim 3 , wherein a dedicated path computation element, PCE, of a virtual TE node, VN, performs internal path computations between access TE links, ALs, of said virtual TE node, VN, to generate the detailed connectivity matrix, DCM, of the virtual TE node, VN, advertised to the TE domain external to said VN. 5. The method according to claim 1 , wherein the virtual TE nodes, VNs, representing a selected contiguous TE domain segment, TE-SEG, are interconnected by virtual TE links, VLs. 6. The method according to claim 1 , wherein the selected contiguous TE domain segment, TE-SEG, comprises TE nodes, including virtual TE nodes, VNs, connected to each other via TE links, including virtual TE links, VLs. 7. The method according to claim 1 , wherein the hierarchically virtualized network topology of the network comprising virtual TE nodes, VNs, of different hierarchy levels is exploited to compute path(s) between a single or multiple sets of service source destination TE node pairs within a given TE domain. 8. An apparatus for scaling Traffic Engineering, TE, routing in a network comprising a plurality of network elements (nodes) connected in a given network layer to each other via links, is adapted to collapse selected by the operator arbitrary contiguous TE domain segments, TE-SEGs, of a TE domain of said network into virtual TE nodes, VNs, each having an allocated TE domain unique identifier, VNID, and a detailed connectivity matrix, DCM, to provide a hierarchically virtualized network topology of said network, wherein a contiguous TE domain segment, TE-SEG, is selected by a network operator and collapsed into at least one virtual TE node, VN, representing said TE-SEG by reconfiguring access TE links, ALs, connecting the TE-SEG with the remaining part of said TE domain such that the ALs advertise the TE domain unique identifier(s), VNID(s), of the respective virtual TE nodes, VNs, as local node identifiers. 9. The apparatus according to claim 8 , wherein the internal TE links connecting TE nodes within the selected contiguous TE domain segment, TE-SEG, represented by at least one virtual TE node, VN, are reconfigured to be advertised into distinct TE domains, each associated with a respective virtual TE node, VN. 10. The apparatus according to claim 9 , wherein a dedicated policy controller, POL-CTRL, of a virtual TE node, VN, is provided to enforce policies of the network operator with respect to a required connectivity between the access TE links, ALs, across the virtual TE node, VN. 11. The apparatus according to claim 10 , wherein a dedicated path computation element, PCE, of a virtual TE node, VN, performs internal path computations between access TE links, ALs, of said VN to generate the detailed connectivity matrix, DCM, of the VN, advertised in to the TE domain external to the VN. 12. A transport network comprising an apparatus according to claim 8 . 13. The transport network according to claim 12 , wherein the transport network comprises a wavelength division multiplexing, WDM, layer network, a SDH network, an Ethernet network, and/or a MPLS-TP network.

Assignees

Inventors

Classifications

  • Distributed routing · CPC title

  • Interdomain routing, e.g. hierarchical routing · CPC title

  • using optical switching · CPC title

  • H04L47/22Primary

    Traffic shaping · CPC title

  • Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9231877B2 cover?
A method for scaling traffic engineering, TE, routing in a network, having a plurality of network elements (nodes) connected in a given layer to each other via links TE domain segments of a TE domain of said network are collapsed into a virtual TE nodes (VNs). Each VN having an allocated DE domain unique identifier and a detailed connectivity matrix, DCM, to provide a hierarchically virtualized…
Who is the assignee on this patent?
Adva Optical Networking Se
What technology area does this patent fall under?
Primary CPC classification H04L47/22. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jan 05 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).