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

1. 发明申请

WO2008066430A1 ENHANCED FLOW CONTROL IN A CELLULAR TELEPHONY SYSTEM 审中-公开
标题翻译：蜂窝电话系统中的增强流量控制
公开(公告)号：WO2008066430A1
公开(公告)日：2008-06-05
申请号：PCT/SE2006/050511
申请日：2006-11-28
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , LUNDH, Peter , FARONIUS, Carola , FARKAS, János , RÁCZ, Sándor , NÁDAS, Szilveszter
发明人： LUNDH, Peter , FARONIUS, Carola , FARKAS, János , RÁCZ, Sándor , NÁDAS, Szilveszter
IPC分类号： H04L12/56 , H04Q7/22
CPC分类号： H04L47/10 , H04L47/11 , H04L47/12 , H04L47/14 , H04L47/25 , H04W28/02 , H04W28/10 , H04W28/12 , H04W88/12 , H04W92/12
摘要： The invention discloses a method (200, 300, 400) for traffic control in a cellular telephony system (100) comprising a number of cells, each cell comprising at least one Radio Base Station, RBS, (170). The system (100) comprises at least one Radio Network Controller, RNC, (110 130 150), for the control of a number of Radio Base stations. The traffic between an RBS and an RNC comprises a number of flows. The invention is intended for the control of flows from the Radio Base Stations to their RNC. The method uses one control function for each flow from each of said Radio Base Stations, and also comprises a congestion detection function (220) which detects the presence or absence of congestion in the traffic from an RBS to an RNC, and which, upon detection of congestion reduces the bit rate of the congested traffic, and in the absence of congestion, increases the bit rate of the previously congested traffic.
摘要翻译：本发明公开了一种用于包括多个小区的蜂窝电话系统（100）中的业务控制的方法（200,300,400），每个小区包括至少一个无线电基站RBS（170）。系统（100）包括用于控制多个无线电基站的至少一个无线电网络控制器RNC（110 130 150）。 RBS和RNC之间的业务包括多个流。本发明旨在控制从无线电基站到其RNC的流量。该方法对来自每个所述无线电基站的每个流使用一个控制功能，并且还包括拥塞检测功能（220），其检测从RBS到RNC的流量中是否存在拥塞，以及哪个在检测到拥塞降低了拥塞流量的比特率，并且在没有拥塞的情况下，增加了先前拥塞的流量的比特率。

2. 发明申请

WO2008076052A1 METHOD FOR DISCOVERING THE PHYSICAL TOPOLOGY OF A TELECOMMNICATIONS NETWORK 审中-公开
标题翻译：发现电信网络物理拓扑的方法
公开(公告)号：WO2008076052A1
公开(公告)日：2008-06-26
申请号：PCT/SE2007/050723
申请日：2007-10-09
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János , GARCIA DE OLIVEIRA, Vinicius , SALVADOR, Marcos
发明人： FARKAS, János , GARCIA DE OLIVEIRA, Vinicius , SALVADOR, Marcos
IPC分类号： H04L12/24
CPC分类号： H04L41/0806 , H04L12/4641 , H04L41/0213 , H04L41/12
摘要： A network (NWl) has switches (S1-S7), routers (R1-R4) and a management node (NMSl) interconnected by links (PLl) in a spanning tree (STl) and links (PL2) to blocked interfaces. Switches and routers have the IP address of the management node. The nodes are discovered by the management node (NMSl) broadcasting a ping message (PiI) and on reply (RPiI) adds the nodes to the topology. The spanning tree (STl) is discovered in that the management node retrieves address forwarding tables from the switches and assigns them a ranking value. From the highest ranked node successively lower ranked nodes are connected. The blocked interfaces (PL2) are discovered by configuring a VLAN (VLANl) to include only the spanning tree (STl) and disabling the latter. The blocked interfaces are turned off and on, matching link down traps are noted and the corresponding link (PL2) is discovered. The status of the interfaces (1, 2, 3...) are cyclically checked for changes and new links and network segments are added. Only basic management features of the switches are needed and all nodes and links are discovered.
摘要翻译：网络（NW1）具有通过生成树（ST1）中的链路（PL1）和链路（PL2）到阻塞接口互连的交换机（S1-S7），路由器（R1-R4）和管理节点（NMS1）。交换机和路由器具有管理节点的IP地址。节点由广播ping消息（PiI）的管理节点（NMS1）发现，并且响应（RPiI）将节点添加到拓扑。发现生成树（ST1），管理节点从交换机检索地址转发表，并为它们分配排序值。从排名最高的节点连续下降的节点连接起来。通过配置VLAN（VLAN1）仅包含生成树（STl）并禁用后者来发现阻塞接口（PL2）。被阻塞的接口被关闭并且被打开时，匹配的链路陷阱被注意到相应的链路（PL2）被发现。循环检查接口（1，2，3 ...）的状态，并添加新的链路和网段。只需要交换机的基本管理功能，并发现所有节点和链路。

3. 发明申请

WO2009115480A1 METHOD AND APPARATUS FOR ETHERNET PROTECTION WITH LOCAL RE-ROUTING 审中-公开
标题翻译：用于以太网保护与本地重新路由的方法和装置
公开(公告)号：WO2009115480A1
公开(公告)日：2009-09-24
申请号：PCT/EP2009/053047
申请日：2009-03-16
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , FARKAS, János , ANTAL, Csaba , TAKACS, Attila
发明人： FARKAS, János , ANTAL, Csaba , TAKACS, Attila
IPC分类号： H04L12/56
CPC分类号： H04L12/4645 , H04L29/12349 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/66 , H04L61/2507 , H04L2212/00
摘要： A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.
摘要翻译：提供了一种在网络的第一节点使用的方法。第一节点（B）具有用于接收去往网络的第二节点的以太网帧的输入路径。第一节点（B）还具有用于将接收到的以太网帧转发到第二节点的第一输出（工作）路径。在第一个节点处检测到沿着第一个输出（工作）路径的故障。在这种故障检测之后，在第一节点处引起接收的以太网帧沿着与第一输出（工作）路径不同的第二输出（备用）路径被重新路由到第二节点。通过使用（例如参考和/或改变）应用于以太网帧的各个指示（VLAN1）来执行重新路由，以区分将沿着要转发的以太网帧沿着第一输出（工作）路径转发的以太网帧沿着第二个输出（备份）路径。

4. 发明申请

WO2009112929A3 METHOD AND APPARATUS FOR LINK-STATE HANDSHAKE FOR LOOP PREVENTION 审中-公开
公开(公告)号：WO2009112929A3
公开(公告)日：2009-09-17
申请号：PCT/IB2009/000477
申请日：2009-03-10
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János
发明人： FARKAS, János
IPC分类号： H04L12/56 , H04L29/06
摘要： A network node of a telecommunications network controlled by a link-state protocol includes a network interface which receives a message that contains information on a change in topology of the network. The node includes a processing unit that blocks forwarding of traffic to at least one neighbor node of the network at the network interface, agrees on the change in topology with the neighbor node; and unblocks the forwarding of traffic when the neighbor node has information about the topology which is the same as the information about the topology in a memory. A transient loop prevention method of a network node of a network having a plurality of a network nodes controlled by a link-state protocol includes the steps of receiving a message at a network interface which contains information on a change in topology of the network. There is the step of blocking forwarding of traffic to each neighbor node of the network at the network interface by a processing unit. There is the step of agreeing by the processing unit on the change in topology with the neighbor node. There is the step of unblocking the forwarding of traffic when the neighbor node has information about the topology which is the same as the information about the topology stored in a memory.

5. 发明申请

WO2008095538A1 FAULT LOCALISATION IN MULTIPLE SPANNING TREE BASED ARCHITECTURES 审中-公开
标题翻译：在多个基于云计算的树建筑中的故障定位
公开(公告)号：WO2008095538A1
公开(公告)日：2008-08-14
申请号：PCT/EP2007/051219
申请日：2007-02-08
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János , WEI, Zhao
发明人： FARKAS, János , WEI, Zhao
IPC分类号： H04L12/24
CPC分类号： H04L41/0677 , H04L45/48
摘要： A method of localising a fault in a network is disclosed. The network comprises nodes (SWl... SW4) links, and edge-nodes (ENl... EN4) arranged as a plurality of spanning trees (Tl, T2,T3) , the spanning trees being partially disjoint. The network further comprises means for network management. The method comprising the steps of receiving information on the configuration of the plurality of tree topologies in the network; monitoring connectivity in the network; upon detection of a loss of connectivity in the network, identifying the failed tree (s) , and determining the network elements common to the failed tree(s) .
摘要翻译：公开了一种在网络中定位故障的方法。网络包括布置为多个生成树（T1，T2，T3）的节点（SW1 ... SW4）链接和边缘节点（EN1 ... EN4），生成树是部分不相交的。网络还包括用于网络管理的装置。该方法包括以下步骤：接收关于网络中的多个树形拓扑结构的信息; 监控网络中的连通性; 在检测到网络中的连通性损失时，识别故障树，以及确定故障树共有的网络元件。

6. 发明申请

WO2011038750A1 TECHNIQUE FOR CONTROLLING DATA FORWARDING IN COMPUTER NETWORKS 审中-公开
标题翻译：用于控制计算机网络中数据转发的技术
公开(公告)号：WO2011038750A1
公开(公告)日：2011-04-07
申请号：PCT/EP2009/007087
申请日：2009-10-02
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János
发明人： FARKAS, János
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L43/0817 , H04L45/24 , H04L45/28 , H04L45/48 , H04L45/66
摘要： Technique for controlling data forwarding in a computer network are provided. The network comprises a set of nodes for forwarding data, wherein a first node is associated with a primary tree and a backup tree, wherein the primary tree defines a default path for the first node to forward data to a second node and the backup tree defines another path for the data forwarding in case of a failure of the primary tree. The basic principle of the techniques is to notify the first node of a failure of the primary tree wherein the notification is provided by the second node. The techniques are particularly beneficial for computer networks offering multipoint services, such as SPB-controlled networks, because the techniques ensure the congruency of the forward and reverse paths even when the data forwarding has been switched from the primary tree to the backup tree.
摘要翻译：提供了一种用于控制计算机网络中数据转发的技术。网络包括用于转发数据的一组节点，其中第一节点与主树和备份树相关联，其中主树定义用于第一节点将数据转发到第二节点的默认路径，并且备份树定义在主树失败的情况下数据转发的另一路径。该技术的基本原理是向第一节点通知主树的故障，其中通知由第二节点提供。这些技术对于提供多点服务（例如SPB控制网络）的计算机网络特别有利，因为即使当数据转发已经从主树切换到备份树时，这些技术确保前向和反向路径的一致性。

7. 发明申请

WO2011003478A1 LOSS MEASUREMENT FOR MULTICAST DATA DELIVERY 审中-公开
标题翻译：用于多媒体数据传送的丢失测量
公开(公告)号：WO2011003478A1
公开(公告)日：2011-01-13
申请号：PCT/EP2009/058878
申请日：2009-07-10
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , JOCHA, Dávid , FARKAS, János
发明人： JOCHA, Dávid , FARKAS, János
IPC分类号： H04L12/26 , H04L12/18
CPC分类号： H04L43/0835 , H04L12/1863
摘要： A method of measuring loss in a multicast transmission in a network is described. Service frames including a service multicast destination address are sent from a source node towards a receiving node. A counter of the number of service frames sent is maintained at the source node. This counter is periodically read, and its value copied into a loss measurement OAM frame. The loss measurement OAM frame includes a unique identifier and an OAM destination address which is different to the service multicast destination address, and is sent from the source node towards the receiving node. Every time the sent frames counter is read, a measurement indicator frame is also sent from the source node towards the receiving node. The measurement indicator frame includes the unique identifier so that it can be related to the loss measurement OAM frame. The measurement indicator frame also includes the service multicast destination address, although the measurement indicator frame is distinguishable from the service frames. The receiving node eventually receives the loss measurement OAM frame and the measurement indicator frame, and calculates the number of lost or delayed service frames by comparing the number of service frames received at the receiving node at the time the measurement indicator frame is received with the sent frames counter value contained in the loss measurement OAM frame. The calculation is only performed when the loss measurement OAM frame and measurement indicator frame having the same identifier have been received by the receiving node.
摘要翻译：描述了一种测量网络中的多播传输中的丢失的方法。包括服务组播目的地地址的服务帧从源节点发送到接收节点。在源节点处维护发送的服务帧数的计数器。该计数器定期读取，其值复制到损耗测量OAM帧中。丢失测量OAM帧包括与服务多播目的地地址不同的唯一标识符和OAM目的地址，并且从源节点向接收节点发送。每次读取发送的帧计数器时，测量指示符帧也从源节点向接收节点发送。测量指标框架包括唯一标识符，使其与丢失测量OAM帧相关。测量指标帧也包括业务组播目的地址，尽管测量指标帧与服务帧不同。接收节点最终接收丢失测量OAM帧和测量指示符帧，并且通过将在接收到的测量指示符帧接收到的接收节点处的服务帧的数量与发送的接收节点进行比较来计算丢失或延迟的服务帧的数量包含在损失测量OAM帧中的帧计数器值。仅当接收节点已经接收到具有相同标识符的丢失测量OAM帧和测量指示符帧时才进行计算。

8. 发明申请

WO2010086022A1 PORT TABLE FLUSHING IN ETHERNET NETWORKS 审中-公开
标题翻译：以太网网络中的端口表冲洗
公开(公告)号：WO2010086022A1
公开(公告)日：2010-08-05
申请号：PCT/EP2009/051068
申请日：2009-01-30
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , KAPITANY, Gábor , PLOSZ, Sándor , HORVATH, Dániel , PALLOS, Richard , FARKAS, János
发明人： KAPITANY, Gábor , PLOSZ, Sándor , HORVATH, Dániel , PALLOS, Richard , FARKAS, János
IPC分类号： H04L12/43 , H04L12/46
CPC分类号： H04L12/437 , H04L12/462 , H04L45/02 , H04L45/025 , H04L45/18 , H04L45/28 , H04L45/48 , H04L45/66 , Y02D30/32
摘要： A method and apparatus for flushing port tables in an Ethernet network that includes a Root Bridge node (1) and a plurality of bridge nodes (2 - 7). A ring of bridge nodes affected by a change in the topology of the Ethernet network is identified from the plurality of, bridge nodes. The ring of bridge nodes (2 - 7) includes a branching bridge node (2) providing a connection to the Root Bridge node (1). Port tables are flushed only at the bridge nodes on the ring (2 - 7), rather than all of the bridge nodes in the Ethernet network, which greatly reduces the amount of signalling required during a relearning process.
摘要翻译：一种用于冲洗包括根网桥节点（1）和多个网桥节点（2-7）的以太网网络中的端口表的方法和装置。从多个桥节点识别受以太网网络拓扑变化影响的网桥节点环。桥节点（2-7）的环包括提供到根网桥节点（1）的连接的分支桥节点（2）。端口表仅在环（2 - 7）上的桥节点刷新，而不是以太网中的所有网桥节点，这大大减少了重新学习过程中所需的信号量。

9. 发明申请

WO2010007467A1 MULTIPLE TREE REGISTRATION PROTOCOL 审中-公开
标题翻译：多树注册协议
公开(公告)号：WO2010007467A1
公开(公告)日：2010-01-21
申请号：PCT/IB2008/003889
申请日：2008-11-15
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János , ANTAL, Csaba , TAKÁCS, Attila
发明人： FARKAS, János , ANTAL, Csaba , TAKÁCS, Attila
IPC分类号： H04L12/56
CPC分类号： H04L45/48 , H04L12/462 , H04L12/4641 , H04L45/02 , H04L45/66
摘要： A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.
摘要翻译：用于设置和更新在以太网中定义活动拓扑的树的注册协议包括与应用组件对应的多个应用组件和多个属性声明组件，其中应用组件声明并注册属性值，属性声明组件制作和撤销属性的注册。

10. 发明申请

WO2007043919A1 METHOD OF GENERATING SPANNING TREES 审中-公开
标题翻译：产生扫描条的方法
公开(公告)号：WO2007043919A1
公开(公告)日：2007-04-19
申请号：PCT/SE2005/001502
申请日：2005-10-11
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , FARKAS, János , TÓTH, Gábor
发明人： FARKAS, János , TÓTH, Gábor
IPC分类号： H04L12/56 , H04L12/24
CPC分类号： H04L12/4625 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/48
摘要： A method for generating spanning trees (ST1,ST2,ST3) in a network (NW2) . The network has nodes (A-K) interconnected by- links (L2) and the trees are used for handling link and node failures . For handling link failures there is for each link (L2) at least one tree (STl, ST2) that does not include that link. For node failures there is for each node (A-K) at least one spanning tree (ST1-ST3) to which the particular node is connected by a single link (L2) . The first spanning tree (STl) connects all nodes (A-K) and from each node one link is left unconnected. The second tree (ST2) includes all nodes and all the unconnected links. None of the links is included in both the trees (STl, ST2) . If node B is broken, node A cannot communicate with nodes C and D so the third tree (ST3) is needed. The method has the advantage of giving a low number of trees also for big networks of any topology and can be implemented off-line.
摘要翻译：一种用于在网络（NW2）中生成生成树（ST1，ST2，ST3）的方法。网络具有互连的节点（A-K）（L2），树用于处理链路和节点故障。为了处理链路故障，每个链路（L2）至少有一个不包括该链路的树（ST1，ST2）。对于节点故障，对于每个节点（A-K），至少一个生成树（ST1-ST3），特定节点通过单个链路（L2）连接到该生成树。第一个生成树（ST1）连接所有节点（A-K），并且从每个节点连接一个链路未连接。第二树（ST2）包括所有节点和所有未连接的链路。两个树中都没有链接（ST1，ST2）。如果节点B断开，则节点A不能与节点C和D通信，所以需要第三棵树（ST3）。该方法具有为任何拓扑的大网络提供少量树的优点，并且可以离线实现。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式