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

1. 发明申请

WO2013045083A1 OPTIMIZING ENDPOINT SELECTION OF MRT-FRR DETOUR PATHS 审中-公开
标题翻译：优化终点选择MRT-FRR DETP PATHS
公开(公告)号：WO2013045083A1
公开(公告)日：2013-04-04
申请号：PCT/EP2012/004036
申请日：2012-09-26
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , ENYEDI, Gabor Sandor , CSÁSZÁR, András , GERÖ, Balázs Peter
发明人： ENYEDI, Gabor Sandor , CSÁSZÁR, András , GERÖ, Balázs Peter
IPC分类号： H04L12/735
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）迂回路径的端点，以优化跨越网络的迂回路径成本或长度。该方法定义了一组步骤，包括选择目的地节点和下一跳失败以计算迂回路径。然后计算一组用于网络的干净的节点，其中，清洁的节点集合是网络中由于给定下一跳中的故障而不到达目的地节点的节点。基于多个配置选项中的任何一个从干净节点的集合中选择迂回p路径的端点的候选节点，并且将数据分组的转发配置为所选候选作为到达目的地的迂回路径的端点节点。

2. 发明申请

WO2013045084A1 INCREMENTAL DEPLOYMENT OF MRT BASED IPFRR 审中-公开
标题翻译：基于地铁的IPFRR的增量部署
公开(公告)号：WO2013045084A1
公开(公告)日：2013-04-04
申请号：PCT/EP2012/004037
申请日：2012-09-26
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , ENYEDI, Gabor, Sandor , CSÁSZÁR, András
发明人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , ENYEDI, Gabor, Sandor , CSÁSZÁR, András
IPC分类号： H04L12/70
CPC分类号： H04L45/128 , H04L45/48
摘要： A method supports incremental deployment of maximally redundant trees-fast reroute (MRT-FRR) by supporting MRT-FRR within an island of nodes in the network. A destination node and next hop failure selected to calculate detour paths. The clean set of nodes is calculated. The clean set of nodes is expanded with extended island candidate nodes that are reachable by a border node within the island via shortest path first (SPF) to the destination node that does not pass through the failed next hop. The extended island candidate nodes that are reachable by the border node within the island via SPF are part of an extended island. An MRT is calculated for each extended island candidate node. A candidate node is selected from the clean set of nodes according to a configured optimization option to serve as the endpoint of detour path to a destination node.
摘要翻译：一种方法通过在网络中的一个节点岛内支持MRT-FRR来支持最大限度地冗余的树快速重路由（MRT-FRR）的增量部署。选择目的地节点和下一跳失败来计算迂回路径。计算干净的节点集。通过最短路径优先（SPF）到岛内的边界节点可达到的扩展岛候选节点扩展到不通过故障下一跳的目的地节点的干净的一组节点。通过SPF可以通过岛内边界节点到达的扩展岛候选节点是扩展岛的一部分。为每个扩展岛候选节点计算MRT。根据配置的优化选项从干净的节点集中选择候选节点，以用作到目的地节点的迂回路径的端点。

3. 发明申请

WO2012130357A1 TECHNIQUE FOR OPERATING A NETWORK NODE 审中-公开
标题翻译：操作网络节点的技术
公开(公告)号：WO2012130357A1
公开(公告)日：2012-10-04
申请号：PCT/EP2012/000667
申请日：2012-02-15
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , ENYEDI, Gabor, Sandor , CSÁSZÁR, András
发明人： ENYEDI, Gabor, Sandor , CSÁSZÁR, András
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/16 , H04L45/22 , H04L45/24
摘要： A technique of operating a network node of a multicast communication network comprising a plurality of network nodes which are interconnected with each other by communication links is provided, wherein the network node is associate with a common source network node. A method implementation of the technique comprises: determining a first path which connects the network node to the common source network node along a primary network tree, and determining a second path which connects the network node to the common source network node along a secondary network tree, wherein the first path and the second path show redundancy with respect to each other; receiving, at the network node, multicast data from the common source network node via the first path; triggering, by the network node, reception of multicast data from the common source network node via the second path if the network node detects a failure of the first path (e.g., determines that no multicast data is received via the first path).
摘要翻译：提供了一种操作包括通过通信链路彼此互连的多个网络节点的组播通信网络的网络节点的技术，其中所述网络节点与公共源网络节点相关联。该技术的方法实现包括：确定沿着主网络树将网络节点连接到公共源网络节点的第一路径，以及确定沿着辅助网络树将网络节点连接到公共源网络节点的第二路径，其中所述第一路径和所述第二路径显示相对于彼此的冗余; 在所述网络节点处经由所述第一路径从所述公共源网络节点接收多播数据; 如果网络节点检测到第一路径的故障（例如，确定没有通过第一路径接收到多播数据），则通过网络节点触发从公共源网络节点经由第二路径接收多播数据。

4. 发明申请

WO2012000557A1 METHOD AND APPARATUS FOR DISSEMINATION OF INFORMATION BETWEEN ROUTERS 审中-公开
标题翻译：解决路由器之间信息的方法和装置
公开(公告)号：WO2012000557A1
公开(公告)日：2012-01-05
申请号：PCT/EP2010/059391
申请日：2010-07-01
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , CSÁSZÁR, András , ENYEDI, Gabor Sandor , KINI, Sriganesh
发明人： CSÁSZÁR, András , ENYEDI, Gabor Sandor , KINI, Sriganesh
IPC分类号： H04L12/56
CPC分类号： H04L45/566 , H04L45/00 , H04L45/023 , H04L45/60
摘要： There is provided a method for use by a first processing unit in or to be installed in a router. The first processing unit is configured or responsible for routing (or forwarding) packets to and from other routers. There may be other such first processing units in or installed in the router. In a first step (S1), information is received at the first processing unit which requires dissemination to other routers. The information also requires processing to determine what, if any, reconfiguration of the routing (forwarding) performed by the first processing unit is required. I n a second step (S2 b) the information is forwarded in a packet to other routers as required according to the routing (forwarding) configuration for the first processing unit. In a third step (S2c) the information is forwarded to at least one other first processing unit in the router (if there are any other first processing units in the router) not already in receipt of the information. If an expedited dissemination procedure is required, the second and third steps (S2b, S2c) are performed before the processing (to determine what if any reconfiguration is required) has been performed (completed) and/or before the first processing unit has been informed of the result of such processing and/or before any reconfiguration required in the first processing unit has been requested, arranged or performed (completed).
摘要翻译：提供了一种由路由器中的第一处理单元使用或安装在路由器中的方法。第一个处理单元被配置或负责将数据包路由（或转发）到其他路由器或从其他路由器转发数据包。路由器中可能还有其他这样的第一处理单元或安装在路由器中。在第一步（S1）中，在需要向其他路由器传播的第一处理单元处接收信息。该信息还需要处理以确定需要由第一处理单元执行的路由（转发）的重新配置（如果有的话）。在第二步骤（S2b）中，根据第一处理单元的路由（转发）配置，根据需要将信息以分组的形式转发到其他路由器。在第三步骤（S2c）中，信息被转发到路由器中的至少另一个第一处理单元（如果路由器中还有其他第一处理单元）尚未接收到该信息。如果需要快速传播程序，则在执行（完成）和/或在第一处理单元被通知之前的处理（以确定是否需要重新配置）之前执行第二和第三步骤（S2b，S2c）这种处理的结果和/或在第一处理单元中所需的任何重新配置之前已被请求，排列或执行（完成）。

5. 发明申请

WO2012022357A1 TECHNIQUE OF PROCESSING NETWORK TRAFFIC THAT HAS BEEN SENT ON A TUNNEL 审中-公开
标题翻译：处理网络流量的技术已经在隧道上出现
公开(公告)号：WO2012022357A1
公开(公告)日：2012-02-23
申请号：PCT/EP2010/005039
申请日：2010-08-17
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , MIHÁLY, Attila , CSÁSZÁR, András , WESTBERG, Lars
发明人： MIHÁLY, Attila , CSÁSZÁR, András , WESTBERG, Lars
IPC分类号： H04L29/12 , H04L29/08 , H04L12/46
CPC分类号： H04W28/065 , H04L12/4633 , H04L29/12367 , H04L29/12462 , H04L61/2514 , H04L61/255 , H04W8/082
摘要： A technique of processing network traffic that is sent on a tunnel between a first tunnel and a second tunnel node in a communication network is provided. A device implementation of this technique comprises an enhanced network address translation, eNAT, component (10) comprising a first obtaining unit (14) configured to obtain an uplink data packet (26) from an uplink tunnel from the first tunnel node to the second tunnel node, the uplink data packet comprising a first network address associated with the first tunnel node, a second network address associated with the second tunnel node, a first identifier associated with the uplink tunnel an internal network address, and an internal port number, a second obtaining unit (16) configured to obtain a second identifier associated with a downlink tunnel from the second tunnel node to the first tunnel node, wherein the downlink tunnel is related to the uplink tunnel, a checking unit (18) configured to check, based on the second network address and the first identifier, whether a database entry comprising the second network address and the first identifier exists in a database (12), an updating unit (20) configured to update the database (12) in case the checked database entry does not exist in the database (12), and a manipulating unit (22) configured to manipulate the uplink data packet (26).
摘要翻译：提供了一种处理在通信网络中的第一隧道和第二隧道节点之间的隧道上发送的网络流量的技术。该技术的设备实现包括增强的网络地址转换，eNAT，组件（10），包括第一获取单元（14），第一获取单元（14）被配置为从第一隧道节点到第二隧道的上行链路隧道获取上行链路数据分组（26）节点，所述上行链路数据分组包括与所述第一隧道节点相关联的第一网络地址，与所述第二隧道节点相关联的第二网络地址，与所述上行链路隧道相关联的第一标识符，内部网络地址，以及内部端口号，第二获取单元（16），被配置为获得与从所述第二隧道节点到所述第一隧道节点的下行链路隧道相关联的第二标识符，其中所述下行链路隧道与所述上行链路隧道相关;检查单元（18），被配置为基于第二网络地址和第一标识符，包括第二网络地址的数据库条目和第一标识符是否存在于数据库（12）中，更新单元（20），被配置为在数据库（12）中不存在所检查的数据库条目的情况下更新数据库（12）;以及操纵单元（22），其被配置为操纵上行链路数据分组（26）。

6. 发明申请

WO2011079962A1 PROVIDING FEEDBACK TO PATH COMPUTATION ELEMENT 审中-公开
标题翻译：提供反馈到路径计算元素
公开(公告)号：WO2011079962A1
公开(公告)日：2011-07-07
申请号：PCT/EP2010/050006
申请日：2010-01-04
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (Publ) , JOCHA, Dávid , KERN, András , CSÁSZÁR, András
发明人： JOCHA, Dávid , KERN, András , CSÁSZÁR, András
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/10 , H04L45/42 , H04L45/62
摘要： A Path Computation Client (24) of a node in a network sends a request message (52) to a Path Computation Element (28) of the network for computation of a path, and the Path Computation Element sends a response message (54) comprising information identifying a calculated path. The Path Computation Element also sends a request for feedback on a result of the attempt to set up the connection. The Path Computation Element attempts to set up a connection based on the calculated path, and reports (64) to the Path Computation Element the result of the attempt to set up the connection.
摘要翻译：网络中的节点的路径计算客户机（24）向网络的路径计算元件（28）发送请求消息（52）以计算路径，并且路径计算元件发送响应消息（54），其包括识别计算出的路径的信息。路径计算元素还发送关于尝试建立连接的结果的反馈的请求。路径计算元素尝试根据计算的路径设置连接，并将路径计算元素（64）报告给尝试设置连接的结果。

7. 发明申请

WO2010115459A1 OPTIMIZING COMMUNICATION TRAFFIC TRANSPORT 审中-公开
标题翻译：优化通信交通运输
公开(公告)号：WO2010115459A1
公开(公告)日：2010-10-14
申请号：PCT/EP2009/054210
申请日：2009-04-08
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , SUNDELL, Hans-Olof , OLSSON, Lars-Bertil , OLSSON, Lasse , GOTARE, Christian , CSÁSZÁR, András , MIHALY, Attila
发明人： SUNDELL, Hans-Olof , OLSSON, Lars-Bertil , OLSSON, Lasse , GOTARE, Christian , CSÁSZÁR, András , MIHALY, Attila
IPC分类号： H04W8/06
CPC分类号： H04W8/065
摘要： The present invention relates to a solution for handling mobility and attachment of users in a wireless communication network (10). User equipment (1) is connected logically to an attachment node (14) at initial attachment and this attachment is determined from an analysis of stored historical mobility patterns of the user equipment. For instance, a mobility management device may be responsible for handling the attachment and for handling the determination of suitable attachment node, e.g. a gateway (5, 7, 8).
摘要翻译：本发明涉及用于处理无线通信网络（10）中的用户的移动性和附着的解决方案。用户设备（1）在初始附接时逻辑地连接到附件节点（14），并且根据用户设备的存储的历史移动性模式的分析来确定该附件。例如，移动性管理设备可以负责处理附件和处理适当的附接节点的确定，例如，网关（5,7,8）。

8. 发明申请

WO2011025422A1 RELOCATION OF MOBILITY ANCHOR FOR NOMADIC SUBSCRIBERS 审中-公开
标题翻译：移动锚定器对于NOMADIC订户的转移
公开(公告)号：WO2011025422A1
公开(公告)日：2011-03-03
申请号：PCT/SE2009/050954
申请日：2009-08-25
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , MIHALY, Attila , CSÁSZÁR, András , GOTARE, Christian
发明人： MIHALY, Attila , CSÁSZÁR, András , GOTARE, Christian
IPC分类号： H04W36/12 , H04W76/00
CPC分类号： H04W76/041 , H04W36/12 , H04W76/22 , H04W92/14 , H04W92/24
摘要： A method, a mobility node 211 and a new mobility anchor 214b configured to operatively relocate the mobility anchor 214a for a mobile terminal 215a in a wireless communication system 200. The relocation is achieved by a request for redirecting an old bearer B-old configured to communicate user-data between the mobile terminal 215a and an old mobility anchor 214a, and by setting up a new standby bearer B-new configured to operatively communicate user-data between the Mobile Terminal 215a and the new mobility anchor 214b. The standby bearer B-old is ready to be activated once the old bearer B-old is deleted.
摘要翻译：配置为在无线通信系统200中为移动终端215a可操作地重新定位移动性锚点214a的方法，移动性节点211和新的移动锚点214b。重定位是通过将旧承载B老版本重定向到在移动终端215a和旧的移动锚点214a之间传送用户数据，并且通过建立新的备用载体B-新配置以在移动终端215a和新的移动锚点214b之间可操作地传送用户数据。一旦旧承载B-old被删除，备用承载B-old就可以被激活了。

9. 发明申请

WO2009013582A1 SYSTEM AND METHOD FOR ETHERNET LABEL DISTRIBUTION 审中-公开
标题翻译：用于以太网标签分发的系统和方法
公开(公告)号：WO2009013582A1
公开(公告)日：2009-01-29
申请号：PCT/IB2008/001855
申请日：2008-07-16
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , TAKACS, Attila , PAPP, Oktavian , CSÁSZÁR, András
发明人： TAKACS, Attila , PAPP, Oktavian , CSÁSZÁR, András
IPC分类号： H04L12/46
CPC分类号： H04L45/00 , H04L45/50
摘要： There is disclosed a method and system for enhancing the efficiency of packet routing in a packet-switched network such as an Ethernet. The method establishes an LSP (label switched path) toward an edge router by distributing advertising messages that include a label formed of the MAC address of the edge router, and VLAN identifier. When the advertising message is received at an Ethernet bridge or similar node, the node selectively downloads and stores the label information in the database, mapped to the interface on which the message was received. In a preferred embodiment, an Ethernet router receiving the label mapping message includes an enhanced ARP cache that is able to store IP (Internet protocol) prefixes, and the method is further characterized by the step of storing an FEC including IP prefixes bound to the label information in the enhanced ARP cache.
摘要翻译：公开了用于提高诸如以太网之类的分组交换网络中的分组路由效率的方法和系统。该方法通过分发包含由边缘路由器的MAC地址形成的标签的广播消息和VLAN标识符，向边缘路由器建立LSP（标签交换路径）。当在以太网桥或类似节点处接收到广告消息时，节点选择性地将标签信息下载并存储在数据库中，映射到接收到该消息的接口。在优选实施例中，接收标签映射消息的以太网路由器包括能够存储IP（因特网协议）前缀的增强型ARP高速缓存，并且该方法的特征还在于存储包括绑定到标签上的IP前缀的FEC 增强型ARP缓存中的信息。

10. 发明授权

EP2692097B1 TECHNIQUE FOR OPERATING A NETWORK NODE 有权
标题翻译：一种用于运行网络节点
公开(公告)号：EP2692097B1
公开(公告)日：2015-08-19
申请号：EP12704698.5
申请日：2012-02-15
申请人： Telefonaktiebolaget L M Ericsson (publ)
发明人： ENYEDI, Gábor, Sándor , CSÁSZÁR, András
IPC分类号： H04L12/761 , H04L12/703
CPC分类号： H04L45/28 , H04L45/16 , H04L45/22 , H04L45/24

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式