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

1. 发明申请

WO2013071988A1 TECHNIQUE FOR NETWORK ROUTING 审中-公开
标题翻译：网络路由技术
公开(公告)号：WO2013071988A1
公开(公告)日：2013-05-23
申请号：PCT/EP2012/003510
申请日：2012-08-17
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , RÁCZ, Sándor , GERÖ, Balázs Peter , HARMATOS, János , NÁDAS, Szilveszter
发明人： RÁCZ, Sándor , GERÖ, Balázs Peter , HARMATOS, János , NÁDAS, Szilveszter
IPC分类号： H04L12/803 , H04L12/801
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）的一个或多个服务隧道重新路由。

2. 发明申请

WO2013159802A1 PACKET SCHEDULING IN A COMMUNICATION NETWORK 审中-公开
标题翻译：分组安排在通信网络中
公开(公告)号：WO2013159802A1
公开(公告)日：2013-10-31
申请号：PCT/EP2012/057347
申请日：2012-04-23
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , HARMATOS, János , GERÖ, Balázs Peter , NÁDAS, Szilveszter , RÁCZ, Sándor
发明人： HARMATOS, János , GERÖ, Balázs Peter , NÁDAS, Szilveszter , RÁCZ, Sándor
IPC分类号： H04W72/12 , H04L12/863
CPC分类号： H04L47/22 , H04L47/522 , H04L47/6215 , H04L47/623 , H04L47/626 , H04L47/629 , H04L47/762 , H04W72/1236
摘要： A method and apparatus for packet scheduling over a communication link in a communication network. A data packet scheduler accords scheduling weights to at least two sets of data packets to be transmitted, and the sending of the sets of data packets is scheduled in accordance with the scheduling weights. When it is determined that a change in available bandwidth over the communication link has occurred, the scheduler dynamically adjusts the scheduling weight for each set of data packets on the basis of the available bandwidth. This ensures more efficient resource sharing control and resource guarantees when the available bandwidth changes.
摘要翻译：一种用于在通信网络中的通信链路上的分组调度的方法和装置。数据分组调度器将调度权重分配给要发送的至少两组数据分组，并且根据调度权重来调度数据分组集合的发送。当确定已经发生通信链路的可用带宽的变化时，调度器基于可用带宽动态地调整每组数据分组的调度权重。这可以确保在可用带宽变化时更有效的资源共享控制和资源保证。

3. 发明申请

WO2013053405A1 OPTIMISED PACKET DELIVERY ACROSS A TRANSPORT NETWORK 审中-公开
标题翻译：运输网络优化的分发交付
公开(公告)号：WO2013053405A1
公开(公告)日：2013-04-18
申请号：PCT/EP2011/068025
申请日：2011-10-14
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , RÁCZ, Sándor , GERÖ, Balázs Peter , HARMATOS, János , NÁDAS, Szilveszter
发明人： RÁCZ, Sándor , GERÖ, Balázs Peter , HARMATOS, János , NÁDAS, Szilveszter
IPC分类号： H04L12/56 , H04W28/10
CPC分类号： H04L47/215 , H04L47/31 , H04W28/0257
摘要： A method of prioritising packets for delivery over a transport network interconnecting nodes of a mobile network, where a guaranteed minimum information rate over the transport network is specified for the mobile network. The method comprises, for each bearer to be injected into the transport network from the mobile network, specifying a bearer information rate and marking packets up to that rate as conformant with the bearer information rate and marking packets exceeding that rate as non-conformant with the bearer information rate. A plurality of traffic type streams from the mobile network are converged, each traffic type stream comprising a plurality of bearers. Packets of the converged traffic type streams are inspected to identify packets marked as conformant and non-conformant, and re-marking non-conformant packets, or at least a fraction of non-conformant packets, as conformant if the converged rate of conformant packets is less than said minimum information rate. The transport network prioritises the delivery of packets marked as conformant over those packets marked as non-conformant.
摘要翻译：一种优先分组的方法，用于通过互连移动网络的节点的传输网络进行传送，其中为移动网络指定传输网络上的保证的最小信息速率。该方法包括：对于从移动网络注入到传输网络中的每个承载，指定承载信息速率，并将分组标记为符合承载信息速率的分组，并将超过该速率的分组标记为不符合承载信息率。来自移动网络的多个业务类型流被收敛，每个业务类型流包括多个承载。对聚合流量类型流的数据包进行检查，以识别标记为一致和不一致的数据包，并重新标记不一致的数据包，或至少一部分不符合数据包，如果一致性数据包的收敛速率为小于最低信息速率。传输网络优先考虑标记为不符合标准的数据包的标签传输。

4. 发明申请

WO2013053403A1 ENHANCED PERFORMANCE SERVICE-BASED PROFILING FOR TRANSPORT NETWORKS 审中-公开
标题翻译：基于运行网络的性能服务型性能提升
公开(公告)号：WO2013053403A1
公开(公告)日：2013-04-18
申请号：PCT/EP2011/068021
申请日：2011-10-14
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , RÁCZ, Sándor , NÁDAS, Szilveszter , GERÖ, Balázs Peter , HARMATOS, János
发明人： RÁCZ, Sándor , NÁDAS, Szilveszter , GERÖ, Balázs Peter , HARMATOS, János
IPC分类号： H04L12/56 , H04W28/10
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. 发明申请

WO2012007164A1 TECHNIQUE FOR ESTABLISHING A FORWARDING PATH IN A NETWORK SYSTEM 审中-公开
标题翻译：在网络系统中建立前进路径的技术
公开(公告)号：WO2012007164A1
公开(公告)日：2012-01-19
申请号：PCT/EP2011/003506
申请日：2011-07-13
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , GERÖ, Balázs Peter , FARKAS, János , SALTSIDIS, Panagiotis , DING, Zhemin
发明人： GERÖ, Balázs Peter , FARKAS, János , SALTSIDIS, Panagiotis , DING, Zhemin
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L12/437 , H04L45/04 , H04L45/22 , H04L45/24 , H04L45/58
摘要： A technique for determining an interconnect node for establishment of a forwarding path for transmitting service based data within a network system comprising a first network and a second network is provided. The first network comprises: a plurality of network interconnect nodes connectable to a plurality of external links towards the second network, and one or more internal links connecting the network interconnect nodes with each other. A method implementation of the technique comprises assigning, for a given service, interconnect node status information to the network interconnect nodes, wherein a network interconnect node to which a passive status is assigned is only allowed to transmit service based data between an external link and another interconnect node of the network, or between two other interconnect nodes of the network, and wherein only a network interconnect node to which an active status is assigned is allowed to send or receive service based data to or from the network. The method further comprises determining, for a given service, an interconnect node having an active status for establishment of a forwarding path including the interconnect node having the active status and an external link, wherein the determination is based on the respective status information assigned to the network interconnect nodes for the service.
摘要翻译：提供了一种用于确定用于建立用于在包括第一网络和第二网络的网络系统内发送基于服务的数据的转发路径的互连节点的技术。第一网络包括：可连接到朝向第二网络的多个外部链路的多个网络互连节点以及将网络互连节点彼此连接的一个或多个内部链路。该技术的方法实现包括为给定服务分配互连节点状态信息到网络互连节点，其中分配了被动状态的网络互连节点仅允许在外部链路和另一个之间传送基于服务的数据网络的互连节点或网络的另外两个互连节点之间，并且其中仅允许分配了活动状态的网络互连节点向网络或从网络发送或接收基于服务的数据。该方法还包括为给定服务确定具有用于建立包括具有活动状态的互连节点和外部链路的转发路径的活动状态的互连节点，其中所述确定基于分配给所述活动状态的相应状态信息用于服务的网络互连节点。

6. 发明申请

WO2012079655A1 DATA PLANE FOR RESILIENT NETWORK INTERCONNECT 审中-公开
标题翻译：数据平面适用于网络互连
公开(公告)号：WO2012079655A1
公开(公告)日：2012-06-21
申请号：PCT/EP2011/003033
申请日：2011-06-20
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , GERÖ, Balázs Peter , FARKAS, János , SALTSIDIS, Panagiotis , DING, Zhemin
发明人： GERÖ, Balázs Peter , FARKAS, János , SALTSIDIS, Panagiotis , DING, Zhemin
IPC分类号： H04L12/46
CPC分类号： H04L41/12 , H04L12/4625 , H04L12/4633 , H04L12/4641 , H04L45/04 , H04L45/306 , H04L2212/00
摘要： The present disclosure relates to a technique for forwarding frames received by a network interconnect node (114) of an internal network (112) having the network interconnect node (114), one or more internal network nodes (118, 120) and one or more other internal network interconnect nodes (116), the network interconnect node (114) having a network interconnect interface for communicating with an external network interconnect node (104) of an external network (102) and a network interface for communicating with one or more of the other internal network interconnect nodes (116) and with one or more of the internal network nodes (118, 120), wherein the frames are related to a service provided by at least one of the external network (102) and the internal network (112). A method embodiment comprises at least one of the steps of: receiving, from the external network interconnect node (104), frames at the network interconnect interface and forwarding according to a Virtual Local Area Network (VLAN) tagging forwarding process, by the network interconnect node (114), the frames to one or more of the other internal network interconnect nodes (116) or to one or more of the internal network nodes (118, 120) on a network link via the network interface by considering whether the network interconnect node (114) is active for the service associated with the frames; and receiving, from one or more of the other internal network interconnect nodes (116) or from one or more of the internal network nodes (118, 120), frames at the network interface and forwarding according to a VLAN tagging forwarding process, by the network interconnect node (114), the frames to one or more of the other internal network interconnect nodes (116) or to one or more of the internal network nodes (118, 120) on a network link via the network interface or to the external network interconnect node (104) via the network interconnect interface based on at least one of whether the frames are encapsulated frames and whether the network interconnect node (114) is active for the service.
摘要翻译：本公开涉及一种用于转发由具有网络互连节点（114），一个或多个内部网络节点（118,120）和一个或多个内部网络（114）的内部网络（112）的网络互连节点（114）接收的帧的技术，其他内部网络互连节点（116），所述网络互连节点（114）具有用于与外部网络（102）的外部网络互连节点（104）通信的网络互连接口以及用于与外部网络（102）的一个或多个所述其他内部网络互连节点（116）以及所述内部网络节点（118,120）中的一个或多个，其中所述帧与由所述外部网络（102）和所述内部网络（102）中的至少一个提供的服务相关 112）。方法实施例包括以下步骤中的至少一个：从网络互连节点（104）接收网络互连接口上的帧，并根据虚拟局域网（VLAN）标签转发过程，通过网络互连节点（114），通过网络接口考虑到网络互连（114）到网络链路上的一个或多个其他内部网络互连节点（116）的帧或者一个或多个内部网络节点（118,120）节点（114）对于与帧相关联的服务是活动的; 以及从一个或多个其他内部网络互连节点（116）或从一个或多个内部网络节点（118,120）接收网络接口的帧并根据VLAN标签转发过程进行转发，由网络互连节点（114），经由网络接口或网络接口将网络链接到一个或多个其他内部网络互连节点（116）或网络链路上的一个或多个内部网络节点（118,120）网络互连节点（104）经由所述网络互连接口基于所述帧是否是封装帧中的至少一个以及所述网络互连节点（114）是否对于所述服务是活动的。

7. 发明申请

WO2013171552A1 METHODS AND APPARATUS FOR DETECTING AND HANDLING SPLIT BRAIN ISSUES IN A LINK AGGREGATION GROUP 审中-公开
标题翻译：检测和处理链接聚集组中分离的大脑问题的方法和装置
公开(公告)号：WO2013171552A1
公开(公告)日：2013-11-21
申请号：PCT/IB2012/054444
申请日：2012-08-29
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , FARKAS, János , GERÖ, Balázs Peter , SALTSIDIS, Panaglotis
发明人： FARKAS, János , GERÖ, Balázs Peter , SALTSIDIS, Panaglotis
IPC分类号： H04L12/70
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. 发明申请

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路径的端点的候选节点，并且将数据分组的转发配置为所选候选作为到达目的地的迂回路径的端点节点。

9. 发明申请

WO2007032733A3 IMPROVED DIMENSIONING METHODS FOR HSDPA TRAFFIC 审中-公开
公开(公告)号：WO2007032733A3
公开(公告)日：2007-03-22
申请号：PCT/SE2006/050320
申请日：2006-09-11
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , RÀCZ, Sándor , NÀDAS, Szilveszter , MALOMSOKY, Szabolcs , GERÖ, Balázs Peter , ROSBERG, Ulf
发明人： RÀCZ, Sándor , NÀDAS, Szilveszter , MALOMSOKY, Szabolcs , GERÖ, Balázs Peter , ROSBERG, Ulf
IPC分类号： H04Q7/38 , H04L12/56 , H04L29/08
摘要： A method for determining the capacity that is needed on an lub link to fulfill Grade of Service (GoS) requirements in a Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN) for both Dedicated Channel (DCH) traffic and High-Speed Downlink Packet Access (HSDPA) traffic, the method comprising the steps of determining the bandwidth demand of the HSDPA traffic (ElasticDim); calculating an average bandwidth of the DCH traffic on the lub interface ( BW use,avg ) setting an initial capacity (Capacity) to the capacity need of the DCH traffic (Capacity DCH), wherein at least the initial capacity will be provided for the DCH traffic in the dimensioned system; and, increasing the value of Capacity until a quality requirement of the HSDPA traffic is fulfilled, the maximum value of Capacity reached being the capacity that is needed for DCH and HSDPA traffic for the lub interface.

10. 发明申请

WO2014175804A1 A METHOD AND SYSTEM OF UPDATING CONVERSATION ALLOCATION IN LINK AGGREGATION 审中-公开
标题翻译：在链路聚合中更新对等分配的方法和系统
公开(公告)号：WO2014175804A1
公开(公告)日：2014-10-30
申请号：PCT/SE2014/050282
申请日：2014-03-07
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： SALTSIDIS, Panagiotis , FARKAS, Janos , GERÖ, Balázs Peter
IPC分类号： H04L12/891 , H04L12/823 , H04L12/801
CPC分类号： H04L45/245 , H04L47/32 , H04L47/34 , H04L47/41 , Y02D50/30
摘要： A method of updating conversation allocation in link aggregation is disclosed. The method starts with verifying that an implementation of a conversation-sensitive link aggregation control protocol (LACP) is operational at a network device of a network for an aggregation port. Then it is determined that operations through enhanced link aggregation control protocol data units (LACPDUs) are possible. The enhanced LACPDUs can be used for updating conversation allocation information, and the determination is based at least partially on a compatibility check between a first set of operational parameters of the network device and a second set of operational parameters of a partner network device. Then a conversation allocation state of an aggregation port of the link aggregation group is updated based on a determination that the conversation allocation state is incorrect, where the conversation allocation state indicates a list of conversations transmitting through the aggregation port.
摘要翻译：公开了一种在链路聚合中更新对话分配的方法。该方法首先验证对话敏感链路聚合控制协议（LACP）的实现在聚合端口的网络的网络设备上可操作。然后确定通过增强的链路聚合控制协议数据单元（LACPDU）的操作是可能的。增强的LACPDU可以用于更新对话分配信息，并且所述确定至少部分地基于网络设备的第一组操作参数与伙伴网络设备的第二组操作参数之间的兼容性检查。然后，基于对话分配状态不正确的判断来更新链路聚合组的聚合端口的会话分配状态，其中会话分配状态表示通过聚合端口发送的对话列表。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式