专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08046451B2 Hierarchical tree-based protection scheme for mesh networks 有权
标题翻译：网状网络的分层树型保护方案
公开(公告)号：US08046451B2
公开(公告)日：2011-10-25
申请号：US12775262
申请日：2010-05-06
申请人： Shahram Shah-Heydari
发明人： Shahram Shah-Heydari
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L45/48 , H04L45/02
摘要： In a hierarchical tree-based protection scheme, a node in a mesh network is designated as a root node of a spanning hierarchical protection tree and subsequently invites each adjacent node to become its child within the tree. If the inviting node provides a more capacious protection path to the root node than is currently enjoyed by the invitee, the invitee designates the inviting node as its primary parent and assumes a new tree position. Otherwise, the invitee designates the inviting node as a backup parent. A node assuming a new tree position invites all adjacent nodes except its parent to become its child. The invitations propagate throughout the network until a spanning hierarchical protection tree is formed. Upon a subsequent failure of a straddling link, the tree may be used to re-route data. Further, given a tree link failure, protection switching is quickly achieved at a disconnected node through use of a backup parent as the new primary parent. Dynamic tree reconfiguration in the event of network topology changes may be limited to the network area surrounding the change.
摘要翻译：在基于层次树的保护方案中，将网状网络中的节点指定为跨层次保护树的根节点，随后邀请每个相邻节点在树中成为其子节点。如果邀请节点比被邀请者当前享有的节点提供比根节点更宽裕的保护路径，则被邀请者将邀请节点指定为其主父节点并假定新的树位置。否则，被邀请者将邀请节点指定为备用父节点。假设新树位置的节点邀请除父节点之外的所有相邻节点成为其子节点。邀请在整个网络中传播，直到形成跨越层级保护树。在跨越链路的后续故障时，该树可以用于重新路由数据。此外，鉴于树状链路故障，通过使用备用父节点作为新的主要父节点，在断开的节点处快速实现保护切换。在网络拓扑变化的情况下，动态树重新配置可能会限制在围绕变化的网络区域。

2. 发明授权

US07774448B2 Hierarchical tree-based protection scheme for mesh networks 有权
标题翻译：网状网络的分层树型保护方案
公开(公告)号：US07774448B2
公开(公告)日：2010-08-10
申请号：US11617296
申请日：2006-12-28
申请人： Shahram Shah-Heydari
发明人： Shahram Shah-Heydari
IPC分类号： G06F15/177
CPC分类号： H04L45/48 , H04L45/02
摘要： In a hierarchical tree-based protection scheme, a node in a mesh network is designated as a root node of a spanning hierarchical protection tree and subsequently invites each adjacent node to become its child within the tree. If the inviting node provides a more capacious protection path to the root node than is currently enjoyed by the invitee, the invitee designates the inviting node as its primary parent and assumes a new tree position. Otherwise, the invitee designates the inviting node as a backup parent. A node assuming a new tree position invites all adjacent nodes except its parent to become its child. The invitations propagate throughout the network until a spanning hierarchical protection tree is formed. Upon a subsequent failure of a straddling link, the tree may be used to re-route data. Further, given a tree link failure, protection switching is quickly achieved at a disconnected node through use of a backup parent as the new primary parent. Dynamic tree reconfiguration in the event of network topology changes may be limited to the network area surrounding the change.
摘要翻译：在基于层次树的保护方案中，将网状网络中的节点指定为跨层次保护树的根节点，随后邀请每个相邻节点在树中成为其子节点。如果邀请节点比被邀请者当前享有的节点提供比根节点更宽裕的保护路径，则被邀请者将邀请节点指定为其主父节点并假定新的树位置。否则，被邀请者将邀请节点指定为备用父节点。假设新树位置的节点邀请除父节点之外的所有相邻节点成为其子节点。邀请在整个网络中传播，直到形成跨越层级保护树。在跨越链路的后续故障时，该树可以用于重新路由数据。此外，鉴于树状链路故障，通过使用备用父节点作为新的主要父节点，在断开的节点处快速实现保护切换。在网络拓扑变化的情况下，动态树重新配置可能会限制在围绕变化的网络区域。

3. 发明授权

US07203743B2 Hierarchical tree-based protection scheme for mesh networks 有权
标题翻译：网状网络的分层树型保护方案
公开(公告)号：US07203743B2
公开(公告)日：2007-04-10
申请号：US10029194
申请日：2001-12-28
申请人： Shahram Shah-Heydari
发明人： Shahram Shah-Heydari
IPC分类号： G06F15/177 , G06F15/173
CPC分类号： H04L45/48 , H04L45/02
摘要： In a hierarchical tree-based protection scheme, a node in a mesh network is designated as a root node of a spanning hierarchical protection tree and subsequently invites each adjacent node to become its child within the tree. If the inviting node provides a more capacious protection path to the root node than is currently enjoyed by the invitee, the invitee designates the inviting node as its primary parent and assumes a new tree position. Otherwise, the invitee designates the inviting node as a backup parent. A node assuming a new tree position invites all adjacent nodes except its parent to become its child. The invitations propagate throughout the network until a spanning hierarchical protection tree is formed. Upon a subsequent failure of a straddling link, the tree may be used to re-route data. Further, given a tree link failure, protection switching is quickly achieved at a disconnected node through use of a backup parent as the new primary parent. Dynamic tree reconfiguration in the event of network topology changes may be limited to the network area surrounding the change.
摘要翻译：在基于层次树的保护方案中，将网状网络中的节点指定为跨层次保护树的根节点，随后邀请每个相邻节点在树中成为其子节点。如果邀请节点比被邀请者当前享有的节点提供比根节点更宽裕的保护路径，则被邀请者将邀请节点指定为其主父节点并假定新的树位置。否则，被邀请者将邀请节点指定为备用父节点。假设新树位置的节点邀请除父节点之外的所有相邻节点成为其子节点。邀请在整个网络中传播，直到形成跨越层级保护树。在跨越链路的后续故障时，该树可以用于重新路由数据。此外，鉴于树状链路故障，通过使用备用父节点作为新的主要父节点，在断开的节点处快速实现保护切换。在网络拓扑变化的情况下，动态树重新配置可能会限制在围绕变化的网络区域。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式