-
公开(公告)号：US20180278466A1
公开(公告)日：2018-09-27
申请号：US15465012
申请日：2017-03-21
IPC分类号： H04L12/24 , H04L12/911
摘要： A method and apparatus for instantiating network slices using connectivity and computing resources, is provided. Information regarding connectivity and computing resources for supporting network slices is used to identify shared risk groups. Each shared risk group includes those resources expected to be disabled by a common failure event. A first set of functions, such as virtual network functions, belonging to a network slice, is instantiated on a first subset of the resources. The union of all shared risk groups which include at least one of the first subset of resources is disjoint from the union of all shared risk groups which include at least one of a second subset of resources. The second subset of resources is allocated for instantiating a second set of functions which are redundant with the first set of functions. As such, redundant network slices and/or functions thereof can be provided which are robust to failure.
-
公开(公告)号：US11451475B2
公开(公告)日：2022-09-20
申请号：US16721171
申请日：2019-12-19
摘要： The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.
-
公开(公告)号：US10581666B2
公开(公告)日：2020-03-03
申请号：US15465012
申请日：2017-03-21
IPC分类号： G01R31/08 , H04L12/24 , H04L12/911 , H04L12/26
摘要： A method and apparatus for instantiating network slices using connectivity and computing resources, is provided. Information regarding connectivity and computing resources for supporting network slices is used to identify shared risk groups. Each shared risk group includes those resources expected to be disabled by a common failure event. A first set of functions, such as virtual network functions, belonging to a network slice, is instantiated on a first subset of the resources. The union of all shared risk groups which include at least one of the first subset of resources is disjoint from the union of all shared risk groups which include at least one of a second subset of resources. The second subset of resources is allocated for instantiating a second set of functions which are redundant with the first set of functions. As such, redundant network slices and/or functions thereof can be provided which are robust to failure.
-
公开(公告)号：US20210194808A1
公开(公告)日：2021-06-24
申请号：US16721171
申请日：2019-12-19
IPC分类号： H04L12/801 , H04L12/733 , H04L12/911 , H04L12/721 , H04L12/753 , H04W84/18
摘要： The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.
-
公开(公告)号：US10133890B2
公开(公告)日：2018-11-20
申请号：US15249934
申请日：2016-08-29
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
摘要： There is provided a Radio Frequency Identification tag that is sensitive to stress induced in a component to which the tag is coupled. In some embodiments, the RFID tag includes an electrically conductive loop that it configured to retain the RFID tag in a first operational state and upon breakage of the electrically conductive loop the RFID tag changes into a second operational state. By adhering the stress sensitive RFID tag to a particular component or location thereon, the operation state change of the RFID tag can be indicative of a the particular component reaching a known physical change. Moreover, a change in the operational state of the RFID tag can be detected by an appropriate RFID detector or scanner without the need for visual inspection, and thus provides evaluation of components that are positioned in hard to reach locations or hidden behind one or more coverings.
-
6.发明授权Multicast implementation in a link state protocol controlled ethernet network 有权链路状态协议控制的以太网网络中的组播实现公开(公告)号：US09008088B2
公开(公告)日：2015-04-14
申请号：US13302704
申请日：2011-11-22
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： H04L12/28 , H04L12/18 , H04L12/46 , H04L12/701 , H04L12/751 , H04L12/721 , H04L12/761 , H04L12/705 , H04L12/753 , H04L12/931 , H04L12/24 , H04L12/935
CPC分类号： H04L12/18 , H04L12/462 , H04L12/4625 , H04L12/4641 , H04L12/4675 , H04L41/0816 , H04L45/00 , H04L45/02 , H04L45/12 , H04L45/16 , H04L45/18 , H04L45/48 , H04L45/66 , H04L49/3009 , H04L49/354
摘要： Forwarding state is installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.
摘要翻译： 通过使中间节点能够为一个或多个物理组播树安装状态，每个可能具有映射到其上的多个逻辑组播树，为链路状态协议控制的以太网中的稀疏组播树安装转发状态。 通过将多个逻辑组播映射到特定的物理组播，并为物理组播的安装状态，需要较少的FIB表项来实现多个组播。 映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。 如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。
-
7.发明授权公开(公告)号：US08879424B2
公开(公告)日：2014-11-04
申请号：US13526907
申请日：2012-06-19
申请人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Guoli Yin
发明人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Guoli Yin
IPC分类号： H04L12/66 , H04L12/28 , G06F15/16 , H04L12/751 , H04L12/721 , H04L12/46 , H04L12/715
CPC分类号： H04L41/12 , H04L12/462 , H04L45/02 , H04L45/04 , H04L45/66
摘要： Routes may be installed across multiple link state protocol controlled Ethernet network areas by causing ABBs to leak I-SID information advertised by BEBs in a L1 network area into an L2 network area. ABBs will only leak I-SIDs for BEBs where it is the closest ABB for that BEB. Where another ABB on the L2 network also leaks the same I-SID into the L2 network area from another L1 network area, the I-SID is of multi-area interest. ABBs will advertise I-SIDs that are common to the L1 and L2 networks back into their respective L1 network. Within each L1 and L2 network area, forwarding state will be installed between network elements advertising common interest in an ISID, so that multi-area paths may be created to span the L1/L2/L1 network areas. The L1/L2/L1 network structure may recurse an arbitrary number of times.
摘要翻译： 可以通过使ABB将L1网络区域中的BEB发布的I-SID信息泄漏到L2网络区域中，将路由安装在多个链路状态协议控制的以太网网络区域。 ABB只会泄漏BEB的I-SID，而该BEB是该BEB最接近的ABB。 在L2网络上的另一个ABB也从另一个L1网络区域将相同的I-SID泄漏到L2网络区域中，I-SID具有多方面的兴趣。 ABB将通过将L1和L2网络通用的I-SID广播回各自的L1网络。 在每个L1和L2网络区域内，转发状态将被安装在对ISID广播共同兴趣的网元之间，从而可以创建多区域路径来跨越L1 / L2 / L1网络区域。 L1 / L2 / L1网络结构可能会递归任意次数。
-
8.发明申请公开(公告)号：US20130208718A1
公开(公告)日：2013-08-15
申请号：US13370755
申请日：2012-02-10
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04L12/56
摘要： An apparatus comprising a node that uses a set of determined virtual local area network (VLAN) identifier (VIDs) to provide a hop limit for a packet forwarded by the node in a network. Also disclosed is a network component comprising a receiver that receives a packet comprising a VID that belongs to a determined set of ordered VIDs, a processor that substitutes the VID in the packet from the set of ordered VIDs and maps the VID to a next hop or instead drops the VID if the VID is a last ordered VID of the ordered VIDs, and a transmitter that forwards the packet comprising the substituted VID to the mapped next hop.
摘要翻译： 一种装置，包括使用一组确定的虚拟局域网（VLAN）标识符（VID）来为网络中的节点转发的分组提供跳数限制的节点。 还公开了一种网络组件，其包括：接收器，其接收包含属于所确定的有序VID集合的VID的分组;处理器，用于从所述一组有序VID中替换所述分组中的VID，并将所述VID映射到下一跳; 如果VID是有序VID的最后一个有序的VID，则将VID丢弃，以及将包括替换的VID的分组转发到映射的下一跳的发射机。
-
9.发明授权公开(公告)号：US08223668B2
公开(公告)日：2012-07-17
申请号：US11899118
申请日：2007-09-04
申请人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Yin Guoli
发明人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Yin Guoli
CPC分类号： H04L41/12 , H04L12/462 , H04L45/02 , H04L45/04 , H04L45/66
摘要： Routes may be installed across multiple link state protocol controlled Ethernet network areas by causing ABBs to leak I-SID information advertised by BEBs a L1 network area into an L2 network area. ABBs will only leak I-SIDs for BEBs where it is the closest ABB for that BEB. Where another ABB on the L2 network also leaks the same I-SID into the L2 network area from another L1 network area, the I-SID is of multi-area interest. ABBs will advertise I-SIDs that are common to the L1 and L2 networks back into their respective L1 network. Within each L1 and L2 network area, forwarding state will be installed between network elements advertising common interest in an ISID, so that multi-area paths may be created to span the L1/L2/L1 network areas. ABBs may summarize BEB multicast trees such that the set of trees for a given I-SID transiting the ABB is condensed into a common tree. The L2 network may further be implemented as a second layer implemented using a L1/L2/L1 network structure, so that the L1/L2/L1 network structure may recurse an arbitrary number of times.
摘要翻译： 可以通过使ABB将由L1B网络区域发布的I-SID信息泄漏到L2网络区域中，将多个链路状态协议控制的以太网网络上的路由安装到L2网络区域。 ABB只会泄漏BEB的I-SID，而该BEB是该BEB最接近的ABB。 在L2网络上的另一个ABB也从另一个L1网络区域将相同的I-SID泄漏到L2网络区域中，I-SID具有多方面的兴趣。 ABB将通过将L1和L2网络通用的I-SID广播回各自的L1网络。 在每个L1和L2网络区域内，转发状态将被安装在对ISID广播共同兴趣的网元之间，从而可以创建多区域路径来跨越L1 / L2 / L1网络区域。 ABB可能会总结BEB组播树，以便将通过ABB的给定I-SID的树组合成一个公共树。 L2网络还可以被实现为使用L1 / L2 / L1网络结构实现的第二层，使得L1 / L2 / L1网络结构可以递归任意次数。
-
公开(公告)号：US07995569B2
公开(公告)日：2011-08-09
申请号：US11338118
申请日：2006-01-23
CPC分类号： H04L45/00 , H04L45/50 , H04L45/586
摘要： Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.
摘要翻译： 为GMPLS网络提供了抽象光子子域的虚拟路由器。 虚拟路由器使用链路可行性矩阵来跟踪光子子域的输入和输出之间的一组可行的连接。 虚拟路由器可以接收RSVP-TE信令消息，并且分配工作输入以输出链路对，或者如果明确地发信号，则验证所请求的链路当前是否可行。 虚拟路由器还在其链路状态更新中通告任何输入链路的当前可能输出集合。 可以通过根据虚拟路由器的链路可行性矩阵修改拓扑图来利用虚拟路由器来实现最短路径计算。
-
-
-
-
-
-
-
-
-
搜索结果
87 条记录 (耗时 0.023 秒)