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

1. 发明授权

US07327695B2 Centralized link-scope configuration of an internet protocol (IP) network 有权
标题翻译：互联网协议（IP）网络的集中链路范围配置
公开(公告)号：US07327695B2
公开(公告)日：2008-02-05
申请号：US10742731
申请日：2003-12-19
申请人： Gergely Molnar , Gábor Tóth , Balázs Peter Gerö , Attila Rajmund Nohl
发明人： Gergely Molnar , Gábor Tóth , Balázs Peter Gerö , Attila Rajmund Nohl
IPC分类号： H04L12/28
CPC分类号： H04L41/0806
摘要： A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T1-TN. The links in each subset are then configured in parallel, starting with subset T1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.
摘要翻译：一种从集中管理节点在基于IP的网络中配置链路范围类型管理对象的方法。基于IP的网络包括至少一个管理站，一组网络节点以及网络节点之间以及管理站和网络节点之间的通信链路。优选地，准备网络的开放最短路径优先（OSPF）拓扑图，并且识别要配置的一组目标链路。然后将目标链路分为N个不相交的子集，T 1，N 2，N 2，N 3。然后每个子集中的链接被并行地配置，从子集T 1开始，并逐个地依次处理每个子集。可以通过从OSPF拓扑图中去除不配置的非目标链路来分类目标链路，构建LinkGraph以确定OSPF拓扑图中剩余的链路之间的依赖关系，以及从LinkGraph构建LinkTree以对其进行分类基于链接之间的依赖关系，目标链接到子集中。

2. 发明申请

US20150180766A1 Technique for Network Routing 有权
标题翻译：网络路由技术
公开(公告)号：US20150180766A1
公开(公告)日：2015-06-25
申请号：US14357926
申请日：2012-08-17
申请人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
发明人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
IPC分类号： H04L12/707 , H04W76/04 , H04W28/02 , H04W40/12 , H04W28/04
CPC分类号： H04L45/22 , H04L47/12 , H04L47/122 , H04L47/125 , H04L47/14 , H04W28/0268 , H04W28/04 , H04W40/12 , H04W76/22
摘要： A technique for routing one or more service tunnels in a telecommunications backhaul network (110) is provided. The telecommunications backhaul network has a first routing path (132) and a second routing path (134). As to a method aspect of the technique, data of the one or more service tunnels is transmitted on the first routing path (132). A reduction in transmission capacity is detected on the first routing path (134) by means of a first routing path condition. The first routing path condition indicates a state of the first routing path (132). A second routing path condition is determined indicating a state of the second routing path (134) in response to the detected reduction in transmission capacity on the first routing path (132). It is decided upon rerouting one or more of the service tunnels from the first routing path (132) to the second routing path (132) based on both the first routing path condition and the second routing path condition.
摘要翻译：提供了一种用于在电信回程网络（110）中路由一个或多个服务隧道的技术。电信回程网络具有第一路由路径（132）和第二路由路径（134）。关于该技术的方法方面，在第一路由路径（132）上发送一个或多个服务隧道的数据。通过第一路由路径条件在第一路由路径（134）上检测到传输容量的降低。第一路由路径条件指示第一路由路径（132）的状态。确定响应于所检测到的在第一路由路径（132）上的传输容量的降低，指示第二路由路径（134）的状态的第二路由路径条件。基于第一路由路径条件和第二路由路径条件两者，决定将从第一路由路径（132）到第二路由路径（132）的一个或多个服务隧道重新路由。

3. 发明申请

US20150117218A1 Feedback-based Profiling for Transport Networks 有权
标题翻译：基于反馈的传输网络分析
公开(公告)号：US20150117218A1
公开(公告)日：2015-04-30
申请号：US14398762
申请日：2012-05-08
申请人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
发明人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
IPC分类号： H04W28/02 , H04L12/26 , H04L12/911 , H04L12/801
CPC分类号： H04W28/0257 , H04L43/0882 , H04L47/11 , H04L47/20 , H04L47/263 , H04L47/745 , H04W28/0236 , H04W28/085
摘要： A method is provided of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers, the bearers each carrying data packets that relate to different ones of a plurality of services. In the method, for each bearer independently of the other bearers, bandwidth profiling is applied to the data packets of the bearer to identify and mark the data packets of each of the bearers that are conformant with a determined maximum information rate for the bearer. The data packets are forwarded for transport through the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets not identified by the profiling as being conformant are discarded, so as not to be transported through the transport network. The data packets of the bearer transported through the transport network are monitored to determine whether there has been any loss of data packets that should have been transported through the transport network, indicating congestion in the transport network. The maximum information rate of the bearer is adjusted based on the monitoring.
摘要翻译：提供了一种通过电信传输网络传输数据分组的方法。数据分组由多个承载携带，每个载体携带与多个服务中的不同服务相关的数据分组。在该方法中，对于每个载体，独立于其他载体，带宽分布被应用于承载的数据分组，以识别和标记符合承载的所确定的最大信息速率的每个承载的数据分组。转发数据包通过传输网络进行传输。如果传输网络中没有足够的带宽来传输所有数据包，那么被分析不被识别为一致的数据包将被丢弃，以便不通过传输网络传输。监视通过传输网络传输的载体的数据分组，以确定是否已经存在应该已经通过传输网络传输的数据分组的任何丢失，指示传输网络中的拥塞。基于监控调整承载的最大信息速率。

4. 发明申请

US20140328170A1 Enhanced Performance Service-Based Profiling for Transport Networks 有权
标题翻译：增强性能服务为基础的传输网络分析
公开(公告)号：US20140328170A1
公开(公告)日：2014-11-06
申请号：US14350945
申请日：2011-10-14
申请人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
发明人： Sándor Rácz , Balázs Peter Gerö , János Harmatos , Szilveszter Nádas
IPC分类号： H04W28/02
CPC分类号： H04W28/0278 , H04L47/20 , H04L47/2416 , H04L47/31 , H04L47/32 , H04W28/10
摘要： A method is presented of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers. For each of the bearers, independently of the other bearers, bandwidth profiling is applied to the data packets of the bearer to designate as ‘green’ data packets that are conformant with a predetermined maximum Information Rate for the bearer. One or more data packets is buffered for up to a predetermined maximum ‘green’ buffer time, during which if transporting the data packet would not cause the maximum information rate of the bearer to be exceeded, the data packet is designated as a ‘green’ data packet. The data packets are forwarded for transporting over the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets that are not designated as ‘green’ data packets are discarded, so as not to be transported through the transport network.
摘要翻译：提出了一种通过电信传输网络传输数据分组的方法。数据包由多个承载携带。对于每个载体，独立于其他承载，带宽分布被应用于承载的数据分组，以被指定为与承载的预定最大信息速率一致的“绿色”数据分组。一个或多个数据包被缓冲达预定的最大“绿色”缓冲时间，在此期间如果传输数据包不会导致承载的最大信息速率被超过，则数据包被指定为“绿色” 数据包。转发数据包以便通过传输网络传输。如果传输网络中没有足够的带宽传输所有数据包，则不会将未指定为“绿色”数据包的数据包丢弃，以免通过传输网络传输。

5. 发明申请

US20130077475A1 Optimizing Endpoint Selection of MRT-FRR Detour Paths 有权
标题翻译：优化MRT-FRR绕路径的端点选择
公开(公告)号：US20130077475A1
公开(公告)日：2013-03-28
申请号：US13453875
申请日：2012-04-23
申请人： Gábor Sándor Enyedi , Balázs Peter Gerö , András Császár
发明人： Gábor Sándor Enyedi , Balázs Peter Gerö , András Császár
IPC分类号： G06F11/00
CPC分类号： H04L45/128
摘要： A method is described to be implemented by a node in a network. The method is for selecting an endpoint for a maximally redundant tree-fast reroute (MRT-FRR) detour path to optimize detour path cost or length across the network. The method defines a set of steps including selecting a destination node and next hop failure to calculate detour paths. A clean set of nodes for the network is then calculated, where the clean set of nodes are nodes in the network that are not impacted in reaching the destination node by the failure in the given next hop. A candidate node for the endpoint of the detour p path is selected from the set of clean nodes based on any one of a plurality of configured options and forwarding of data packets is configured to the selected candidate as the endpoint of the detour path to the destination node.
摘要翻译：描述了一种由网络中的节点实现的方法。该方法用于选择用于最大冗余树快速重路由（MRT-FRR）迂回路径的端点，以优化跨越网络的迂回路径成本或长度。该方法定义了一组步骤，包括选择目的地节点和下一跳失败以计算迂回路径。然后计算一组用于网络的干净的节点，其中，清洁的节点集合是网络中由于给定下一跳中的故障而不到达目的地节点的节点。基于多个配置选项中的任何一个从干净节点的集合中选择迂回路径的端点的候选节点，并且将数据分组的转发配置为所选候选作为到达目的地的迂回路径的端点节点。

6. 发明授权

US10708132B2 Technique for handling a status change in an interconnect node 有权
公开(公告)号：US10708132B2
公开(公告)日：2020-07-07
申请号：US14369322
申请日：2011-12-29
申请人： Balázs Peter Gerö , János Farkas , László Molnár , Panagiotis Saltsidis , Balázs Varga
发明人： Balázs Peter Gerö , János Farkas , László Molnár , Panagiotis Saltsidis , Balázs Varga
IPC分类号： H04L12/24 , H04L12/751
摘要： A technique for status change handling in an interconnect node is described, wherein the node comprises a data plane that can assume, per service, a passive or active status. A method aspect in the node comprises transmitting, to another node, a first indication that a change has been or is about to be performed, awaiting, from the other node, reception of a second indication that the data plane in the other node has been set to the passive status, and activating, responsive to the received indication, the data plane of the node from the passive status to the active status. The method aspect in the other node further comprises receiving, from the node, the first indication, passivating, responsive to the receiving step, the data plane being in the active status to the passive status, and transmitting, upon completion of the passivating step, the second indication.

7. 发明申请

US20150172121A1 Methods and Apparatus for Detecting and Handling Split Brain Issues in a Link Aggregation Group 有权
标题翻译：检测和处理链路聚合组中分裂大脑问题的方法和装置
公开(公告)号：US20150172121A1
公开(公告)日：2015-06-18
申请号：US14400619
申请日：2012-08-29
申请人： János Farkas , Balázs Peter Gerö , Panagiotis Saltsidis
发明人： János Farkas , Balázs Peter Gerö , Panagiotis Saltsidis
IPC分类号： H04L12/24 , H04L12/26 , H04L12/709
CPC分类号： H04L41/0816 , H04L41/0672 , H04L43/0811 , H04L45/245 , Y02D50/30
摘要： Methods and apparatus for operating a virtual node in a LAG that includes a first virtual node and a second virtual node are disclosed. The first virtual node includes at least a first fellow node and a second fellow node. In one exemplary method, the first fellow node receives, from the second virtual node, first control information comprising a system ID and first configuration information associated with the LAG. The first control information is compared with reference configuration information representing previously established expected configuration information associated with the LAG. Based on that comparison, and at least one additional criterion, a split brain condition may be determined to exist in the LAG. In a complementary fashion, a fellow node of the second virtual node may be configured to alter its transmitted configuration information depending on whether it is able to communicate with its fellow node in the second virtual node.
摘要翻译：公开了在包括第一虚拟节点和第二虚拟节点的LAG中操作虚拟节点的方法和装置。第一虚拟节点至少包括第一节点和第二节点。在一个示例性方法中，第一伙伴节点从第二虚拟节点接收包括与该LAG相关联的系统ID和第一配置信息的第一控制信息。将第一控制信息与表示与LAG相关联的先前建立的预期配置信息的参考配置信息进行比较。基于该比较，以及至少一个附加标准，可以确定在LAG中存在裂脑状况。以互补的方式，第二虚拟节点的节点可以被配置为根据它是否能够与第二虚拟节点中的其他节点通信来改变其发送的配置信息。

8. 发明申请

US20140112191A1 Technique for Ensuring Congruency in Link Aggregation 有权
标题翻译：确保链路聚合一致性的技术
公开(公告)号：US20140112191A1
公开(公告)日：2014-04-24
申请号：US13819526
申请日：2012-09-21
申请人： János Farkas , Balázs Peter Gerö , László Molnár , Panagiotis Saltsidis
发明人： János Farkas , Balázs Peter Gerö , László Molnár , Panagiotis Saltsidis
IPC分类号： H04L12/24
CPC分类号： H04L41/0873 , H04L41/0853 , H04L45/245 , Y02D50/30
摘要： The present disclosure provides a technique for ensuring that a service or conversation is carried in a congruent manner on a Link Aggregation Group (LAG). The Service ID (e.g., conversation ID) to link mapping is configured on both sides of the LAG independently of each other. The Service ID to link assignment is stored in a well-defined format, e.g. in an assignment table. A digest is then prepared on the assignment table. The digest is exchanged between the two sides of the LAG. If there is a mismatch between the digests, then the service is transmitted on a predefined and agreed-upon default link if congruency has to be enforced for that particular service. Furthermore, the digest exchange allows verification on the configuration to check whether all services to be handed-off are configured on both sides.
摘要翻译：本公开提供了一种用于确保在链路聚合组（LAG）上以一致方式携带服务或对话的技术。链路映射的服务ID（例如，会话ID）被配置在LAG的两侧，彼此独立。要链接分配的服务ID以明确定义的格式存储，例如。在作业表中。然后在作业表上准备摘要。摘要在LAG的两边交换。如果摘要之间不匹配，那么如果必须对该特定服务执行一致性，则服务将在预定义和约定的默认链接上传输。此外，摘要交换允许对配置进行验证，以检查是否在双方配置要分派的所有服务。

9. 发明授权

US08441937B2 GMPLS based OAM provisioning 有权
标题翻译：基于GMPLS的OAM配置
公开(公告)号：US08441937B2
公开(公告)日：2013-05-14
申请号：US13356219
申请日：2012-01-23
申请人： Balázs Peter Gerö , Attila Takács , Benoit Tremblay , Sylvain Monette , Joacim Halén
发明人： Balázs Peter Gerö , Attila Takács , Benoit Tremblay , Sylvain Monette , Joacim Halén
IPC分类号： H04L12/26
CPC分类号： H04L45/50 , H04L41/12 , H04L43/0811 , H04L45/02 , H04L45/70
摘要： A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.
摘要翻译：这里描述了一种方法和网络，用于在建立入口边缘节点和出口边缘节点之间的连接时为连接提供操作，管理和维护（OAM）实体。

10. 发明授权

US09602348B2 Methods and apparatus for detecting and handling split brain issues in a link aggregation group 有权
公开(公告)号：US09602348B2
公开(公告)日：2017-03-21
申请号：US14400619
申请日：2012-08-29
申请人： János Farkas , Balázs Peter Gerö , Panagiotis Saltsidis
发明人： János Farkas , Balázs Peter Gerö , Panagiotis Saltsidis
IPC分类号： H04L12/24 , H04L12/709 , H04L12/26
CPC分类号： H04L41/0816 , H04L41/0672 , H04L43/0811 , H04L45/245 , Y02D50/30
摘要： Methods and apparatus for operating a virtual node in a LAG that includes a first virtual node and a second virtual node are disclosed. The first virtual node includes at least a first fellow node and a second fellow node. In one exemplary method, the first fellow node receives, from the second virtual node, first control information comprising a system ID and first configuration information associated with the LAG. The first control information is compared with reference configuration information representing previously established expected configuration information associated with the LAG. Based on that comparison, and at least one additional criterion, a split brain condition may be determined to exist in the LAG. In a complementary fashion, a fellow node of the second virtual node may be configured to alter its transmitted configuration information depending on whether it is able to communicate with its fellow node in the second virtual node.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式