Mintree-based routing in highly constrained networks

Patent metadata

Field	Value
Publication number	US-9219682-B2
Application number	US-201213668894-A
Country	US
Kind code	B2
Filing date	Nov 5, 2012
Priority date	Nov 5, 2012
Publication date	Dec 22, 2015
Grant date	Dec 22, 2015

Abstract

In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.

First claim

What is claimed is:

1. A method, comprising:
hosting a path computation element (PCE) at a capable node in a computer network;
receiving, at the capable node, one or more neighborhood discovery (ND) messages including neighborhood information from a plurality of nodes in the computer network;
computing centrally in the computer network, with the PCE, a minimum spanning tree (MinTree) for the plurality of nodes in the computer network based on the neighborhood information, the…

Assignees

• Cisco Tech Inc

Inventors

• Vasseur Jean-Philippe
• Dasgupta Sukrit
• Hui Jonathan W

Classifications

• H04L45/02

  Electricity · mapped topic

• H04L45/48 Primary

  Electricity · mapped topic

• H04L45/484

  Electricity · mapped topic