公开(公告)号：US08315644B2

公开(公告)日：2012-11-20

申请号：US12516534

申请日：2006-11-28

申请人： Peter Lundh ,  Carola Faronius ,  János Farkas ,  Sándor Rácz ,  Szilveszter Nádas

发明人： Peter Lundh ,  Carola Faronius ,  János Farkas ,  Sándor Rácz ,  Szilveszter Nádas

IPC分类号： H04W72/00

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的流量中是否存在拥塞，以及哪个在检测到 拥塞降低了拥塞流量的比特率，并且在没有拥塞的情况下，增加了先前拥塞的流量的比特率。

公开(公告)号：US09240928B2

公开(公告)日：2016-01-19

申请号：US13146279

申请日：2011-06-20

申请人： Balázs Peter Gerö ,  János Farkas ,  Panagiotis Saltsidis ,  Zhemin Ding

发明人： Balázs Peter Gerö ,  János Farkas ,  Panagiotis Saltsidis ,  Zhemin Ding

IPC分类号： G06F15/16 ,  H04L12/24 ,  H04L12/46 ,  H04L12/715 ,  H04L12/725

CPC分类号： H04L41/12 ,  H04L12/4625 ,  H04L12/4633 ,  H04L12/4641 ,  H04L45/04 ,  H04L45/306 ,  H04L2212/00

摘要： A network interconnect node of an internal network may communicate with an external network interconnect node of an external network, other internal network interconnect node(s) and internal network node(s). The network interconnect node may receive frames from the external network interconnect node and forward them according to a Virtual Local Area Network (VLAN) tagging forwarding process to other internal network interconnect node(s) or internal network node(s) based on whether the network interconnect node is active for the service associated with the frames. The network interconnect node may receive frames from other internal network interconnect node(s) or from internal network nodes and forward them according to the VLAN tagging forwarding process to other internal network interconnect nodes, internal network nodes or the external network interconnect node based on whether the frames are encapsulated frames and/or whether the network interconnect node is active for the service.

摘要翻译： 内部网络的网络互连节点可以与外部网络的外部网络互连节点，其他内部网络互连节点和内部网络节点进行通信。 网络互连节点可以从外部网络互连节点接收帧，并根据虚拟局域网（VLAN）标记转发过程将其转发到其他内部网络互连节点或内部网络节点，基于网络 互连节点对于与帧相关联的服务是活动的。 网络互连节点可以从其他内部网络互连节点或内部网络节点接收帧，并根据VLAN标记转发过程将其转发到其他内部网络互连节点，内部网络节点或外部网络互连节点，基于是否 帧是封装帧和/或网络互连节点是否对于该服务是活动的。

公开(公告)号：US08837329B2

公开(公告)日：2014-09-16

申请号：US12525062

申请日：2008-01-18

申请人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

发明人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

IPC分类号： H04L12/28 ,  H04L12/705 ,  H04L12/721 ,  H04L12/751 ,  H04L12/703 ,  H04L12/753 ,  H04L12/46 ,  H04L12/24

CPC分类号： H04L12/462 ,  H04L41/069 ,  H04L41/0853 ,  H04L41/0856 ,  H04L41/12 ,  H04L45/02 ,  H04L45/12 ,  H04L45/18 ,  H04L45/28 ,  H04L45/48

摘要： There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use.

摘要翻译： 公开了一种方法和装置，用于通过收集邻居信息，生成和分发链路状态通告，填充网络的拓扑数据库以及计算每个网桥的树，从而方便诸如以太网LAN的网络来有效地转发数据流量 作为根桥。 在优选实施例中，方法和系统还准备一个或多个备用拓扑，并且如果由于在网络中检测到故障状况而需要，则存储它们以供使用。 在特别优选的实施例中，将概率分配给各种潜在的故障条件，并且概率值用于决定要计算，存储或使用哪些备份拓扑。

公开(公告)号：US08737270B2

公开(公告)日：2014-05-27

申请号：US13508758

申请日：2010-08-18

申请人： János Farkas

发明人： János Farkas

IPC分类号： H04L12/46 ,  H04L12/44 ,  H04L12/56

CPC分类号： H04L45/28 ,  H04L12/462 ,  H04L12/4625 ,  H04L41/0803 ,  H04L45/021 ,  H04L45/48 ,  H04L45/66 ,  H04L45/72

摘要： A system (300), a network management system (306), and a method are described herein for avoiding a count-to-infinity problem in a network (304) (e.g., Provider Backbone Bridging) with bridges having network interface ports (2,4) (e,g., Layer Two Gateway Ports) which are connected to an external network (302) (e.g., External Network to Network interface).

摘要翻译： 这里描述了一种系统（300），网络管理系统（306）和方法，用于避免具有网络接口端口（2）的网络（304）（例如，提供商骨干桥接）中的无穷大计数问题 ，4）（例如，二层网关端口），其连接到外部网络（302）（例如，外部网络到网络接口）。

公开(公告)号：US08711703B2

公开(公告)日：2014-04-29

申请号：US13097336

申请日：2011-04-29

申请人： David Ian Allan ,  Scott Andrew Mansfield ,  Eric Gray ,  János Farkas

发明人： David Ian Allan ,  Scott Andrew Mansfield ,  Eric Gray ,  János Farkas

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L45/74 ,  H04L12/4625 ,  H04L45/12 ,  H04L45/121 ,  H04L45/122 ,  H04L45/123 ,  H04L45/38 ,  H04L45/745 ,  H04L47/125 ,  H04L47/2483

摘要： A flow classification process is used at the edge of the shortest path bridging network to determine a flow label for attachment to a client frame entering the network. Any of several flow labels can be assigned to a client frame traversing the network to a particular egress node, and the flow labels are used by forwarding nodes to select among multiple equal-cost paths. In several embodiments, the flow label is calculated as a function of the client frame contents, which provide an entropy source for randomizing the selection of the flow label. This entropy source comprises the Internet Protocol (IP) header in the client frame, in some embodiments, but may comprise other client frame content in other cases.

摘要翻译： 在最短路径桥接网络的边缘使用流分类过程，以确定用于连接到进入网络的客户端帧的流标签。 可以将多个流标签中的任一个分配给穿过网络到特定出口节点的客户端帧，并且流标签由转发节点用于在多个等价路径之间选择。 在几个实施例中，流标签被计算为客户端帧内容的函数，其提供用于随机化流标签的选择的熵源。 在一些实施例中，该熵源包括客户端帧中的因特网协议（IP）报头，但在其他情况下可包括其他客户机帧内容。

公开(公告)号：US08606961B2

公开(公告)日：2013-12-10

申请号：US12922235

申请日：2009-03-10

申请人： János Farkas

发明人： János Farkas

IPC分类号： G06F15/173 ,  H04L12/28

CPC分类号： H04L45/14 ,  H04L45/00 ,  H04L45/02 ,  H04L45/021 ,  H04L45/023 ,  H04L45/123 ,  H04L45/18

摘要： 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.

摘要翻译： 由链路状态协议控制的电信网络的网络节点包括接收包含关于网络拓扑变化的信息的消息的网络接口。 该节点包括一个处理单元，其阻止在网络接口处向网络的至少一个相邻节点转发流量，与邻居节点的拓扑变化一致; 并且当相邻节点具有关于与存储器中的拓扑的信息相同的拓扑的信息时，解除阻塞流量的转发。 具有由链路状态协议控制的多个网络节点的网络的网络节点的暂态环路预防方法包括以下步骤：在包含关于网络拓扑变化的信息的网络接口处接收消息。 通过处理单元在网络接口处阻塞流量到网络的每个邻居节点的步骤。 处理单元同邻近节点拓扑变化的步骤。 当邻居节点具有关于与存储在存储器中的拓扑的信息相同的拓扑的信息时，解除阻塞流量的转发的步骤。

公开(公告)号：US20130246635A1

公开(公告)日：2013-09-19

申请号：US13818883

申请日：2012-06-28

申请人： Balázs Peter Gerö ,  János Farkas ,  Shahryar Khan ,  Panagiotis Saltsidis ,  Balázs Varga

发明人： Balázs Peter Gerö ,  János Farkas ,  Shahryar Khan ,  Panagiotis Saltsidis ,  Balázs Varga

IPC分类号： H04L12/24

CPC分类号： H04L41/0654 ,  H04L41/0663 ,  H04L45/245 ,  Y02D50/30

摘要： Methods and apparatus are disclosed for applying multiple Link Aggregation Group (LAG) entities on the same set of physical links, thus making bundling of individual services or conversations possible by the different LAG entities within Link Aggregation. Each LAG entity is configured such that a single physical link is Active and all the other links are Standby. Each LAG entity may be regarded as a “bundle.” Thus the services/conversations are bundled into a LAG entity and are handed-off on the Active link during normal operation. If service hand-off is not possible on the Active link (e.g., due to a failure), then the LAG entity switches over to a Standby link thus the service/conversation is handed-off on that formerly Standby link. Bundling may simplify operations of control and signaling.

摘要翻译： 公开了用于在同一组物理链路上应用多个链路聚合组（LAG）实体的方法和装置，从而使链路聚合中的不同LAG实体可以捆绑各个服务或对话。 每个LAG实体被配置为使得单个物理链路是活动的，并且所有其他链路是待机。 每个LAG实体可以被视为“捆绑”。 因此，服务/对话被捆绑成LAG实体，并且在正常操作期间在活动链路上被切换。 如果在Active链路上无法进行业务切换（例如，由于故障），则LAG实体切换到备用链路，从而在以前的待机链路上进行业务/对话切换。 捆绑可以简化控制和信令的操作。

公开(公告)号：US08467317B2

公开(公告)日：2013-06-18

申请号：US13414927

申请日：2012-03-08

申请人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

发明人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L12/462 ,  H04L45/02 ,  H04L45/025 ,  H04L45/04 ,  H04L45/48

摘要： There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

摘要翻译： 公开了在诸如以太网局域网的计算机网络中管理活动拓扑的方式，即用于转发数据的方案。 从网络中的多个桥中选择根桥; 根桥从已经从链接状态广告消息收集的桥接邻居信息填充的拓扑数据库中计算至少一个生成树。 如果检测到影响主生成树的故障条件，则根桥也可以计算备用拓扑。 根桥然后通告生成树，并通过树形广告消息远程配置生成树中的网桥的端口状态，桥梁被布置为相应地处理和设置其端口。

公开(公告)号：US20120170489A1

公开(公告)日：2012-07-05

申请号：US13414927

申请日：2012-03-08

申请人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

发明人： János Farkas ,  Csaba Antal ,  Attila Takács ,  Panagiotis Saltsidis

IPC分类号： H04L12/44

CPC分类号： H04L12/462 ,  H04L45/02 ,  H04L45/025 ,  H04L45/04 ,  H04L45/48

摘要： There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

摘要翻译： 公开了在诸如以太网局域网的计算机网络中管理活动拓扑的方式，即用于转发数据的方案。 从网络中的多个桥中选择根桥; 根桥从已经从链接状态广告消息收集的桥接邻居信息填充的拓扑数据库中计算至少一个生成树。 如果检测到影响主生成树的故障条件，则根桥也可以计算备用拓扑。 根桥然后通告生成树，并通过树形广告消息远程配置生成树中的网桥的端口状态，桥梁被布置为相应地处理和设置其端口。

公开(公告)号：US07965621B2

公开(公告)日：2011-06-21

申请号：US11916565

申请日：2005-06-14

申请人： János Farkas ,  Csaba Antal ,  Lars Westberg

发明人： János Farkas ,  Csaba Antal ,  Lars Westberg

IPC分类号： G01R31/08

CPC分类号： H04L12/4641 ,  H04L12/462 ,  H04L41/0213 ,  H04L41/06 ,  H04L43/10 ,  H04L45/00

摘要： A method and arrangement for failure handling in a tree-structured communications network having interconnected edge nodes and switching nodes. VLANs may be established by using spanning trees to provide connectivity in case of a failure in the network. Emitters in the edge nodes periodically broadcast alive messages on the VLANs, and notifiers note the alive messages. A missing alive message indicates a failure on one of the VLANs, and the notifier broadcasts corresponding failure messages on the VLANs. When the alive messages are restored, the notifier broadcasts corresponding repair messages. If a notifier fails to note a failure, one of the edge nodes performs a similar function although somewhat slower.

摘要翻译： 一种具有互连边缘节点和交换节点的树状结构化通信网络中的故障处理方法和装置。 可以通过使用生成树在网络中发生故障的情况下提供连接来建立VLAN。 边缘节点中的发射器周期性地在VLAN上广播活动消息，通知器记下活着的消息。 缺少的活着消息表示其中一个VLAN发生故障，通知程序在VLAN上广播相应的故障消息。 当活动消息恢复时，通知器广播相应的修复消息。 如果通知程序无法注意到故障，则其中一个边缘节点执行类似的功能，尽管稍微慢些。