Hash-based overlay routing architecture for information centric networks

A method implemented in a network element (NE) configured to operate in an information centric network (ICN), the method comprises creating, by a processor of the NE, a minimum spanning tree for an overlay cluster to which the NE is assigned within a host domain, wherein the minimum spanning tree co...

Full description

Saved in:
Bibliographic Details
Main Authors Azgin, Aytac, Ravindran, Ravishankar
Format Patent
LanguageEnglish
Published 04.02.2020
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A method implemented in a network element (NE) configured to operate in an information centric network (ICN), the method comprises creating, by a processor of the NE, a minimum spanning tree for an overlay cluster to which the NE is assigned within a host domain, wherein the minimum spanning tree comprises a root corresponding to the NE and a plurality of member nodes assigned to the overlay cluster, and broadcasting, by a transmitter coupled to the processor, a hash cluster setup (HCS) message to the member nodes, wherein the HCS message comprises source path routing information for the overlay cluster and hop limit values corresponding to distances within the ICN between the NE and each of the member nodes.
Bibliography:Application Number: US201815910811