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

21. 发明申请

US20120106322A1 TECHNIQUE ESTABLISHING A FORWARDING PATH IN A NETWORK SYSTEM 有权
标题翻译：技术建立网络系统中的前进路径
公开(公告)号：US20120106322A1
公开(公告)日：2012-05-03
申请号：US13181020
申请日：2011-07-12
申请人： Balázs Peter Gero , János Farkas , Panagiotis Saltsidis , Zhemin Ding
发明人： Balázs Peter Gero , János Farkas , Panagiotis Saltsidis , Zhemin Ding
IPC分类号： H04L12/26
CPC分类号： H04L45/28 , H04L12/437 , H04L45/04 , H04L45/22 , H04L45/24 , H04L45/58
摘要： A method and network for determining an interconnect node for establishing a forwarding path for service based data within a network system. The method includes assigning, interconnect node status information to 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. Only a network interconnect node with active status is allowed to send or receive service based data to or from the network. The method includes determining, for a given service, an interconnect node with active status for establishment of a forwarding path including the interconnect node with 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.
摘要翻译：一种用于确定互连节点的方法和网络，用于在网络系统内建立用于基于服务的数据的转发路径。该方法包括将节点状态信息分配给网络互连节点，其中分配了被动状态的网络互连节点仅被允许在网络的外部链路和另一互连节点之间或另外两个之间传输基于服务的数据网络的互连节点。仅允许具有活动状态的网络互连节点向网络发送或接收基于服务的数据。该方法包括为给定服务确定具有活动状态的互连节点，用于建立包括具有活动状态的互连节点和外部链路的转发路径，其中所述确定基于分配给网络互连节点的相应状态信息为服务。

22. 发明申请

US20110080854A1 Method And System For Controlled Tree Management 有权
标题翻译：控制树管理方法与系统
公开(公告)号：US20110080854A1
公开(公告)日：2011-04-07
申请号：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
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的网络来有效地转发数据流量作为根桥。在优选实施例中，方法和系统还准备一个或多个备用拓扑，并且如果由于在网络中检测到故障状况而需要，则存储它们以供使用。在特别优选的实施例中，将概率分配给各种潜在的故障条件，并且概率值用于决定要计算，存储或使用哪些备份拓扑。

23. 发明授权

US08817594B2 Technique establishing a forwarding path in a network system 有权
标题翻译：在网络系统中建立转发路径的技术
公开(公告)号：US08817594B2
公开(公告)日：2014-08-26
申请号：US13181020
申请日：2011-07-12
申请人： Balázs Peter Gero , János Farkas , Panagiotis Saltsidis , Zhemin Ding
发明人： Balázs Peter Gero , János Farkas , Panagiotis Saltsidis , Zhemin Ding
IPC分类号： H04L1/00 , H04L12/28 , H04L12/56 , H04L12/437
CPC分类号： H04L45/28 , H04L12/437 , H04L45/04 , H04L45/22 , H04L45/24 , H04L45/58
摘要： A method and network for determining an interconnect node for establishing a forwarding path for service based data within a network system. The method includes assigning, interconnect node status information to 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. Only a network interconnect node with active status is allowed to send or receive service based data to or from the network. The method includes determining, for a given service, an interconnect node with active status for establishment of a forwarding path including the interconnect node with 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.
摘要翻译：一种用于确定互连节点的方法和网络，用于在网络系统内建立用于基于服务的数据的转发路径。该方法包括将节点状态信息分配给网络互连节点，其中分配了被动状态的网络互连节点仅被允许在网络的外部链路和另一互连节点之间或另外两个之间传输基于服务的数据网络的互连节点。仅允许具有活动状态的网络互连节点向网络发送或接收基于服务的数据。该方法包括为给定服务确定具有活动状态的互连节点，用于建立包括具有活动状态的互连节点和外部链路的转发路径，其中所述确定基于分配给网络互连节点的相应状态信息为服务。

24. 发明授权

US08737270B2 System, network management system, and method for avoiding a count-to-infinity problem 有权
标题翻译：系统，网络管理系统和避免计数到无限问题的方法
公开(公告)号：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）（例如，外部网络到网络接口）。

25. 发明授权

US08711703B2 Load balancing in shortest-path-bridging networks 有权
标题翻译：最短路径网络中的负载均衡
公开(公告)号：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）报头，但在其他情况下可包括其他客户机帧内容。

26. 发明授权

US08606961B2 Method and apparatus for link-state handshake for loop prevention 有权
标题翻译：用于环路预防的链路状态握手的方法和装置
公开(公告)号：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.
摘要翻译：由链路状态协议控制的电信网络的网络节点包括接收包含关于网络拓扑变化的信息的消息的网络接口。该节点包括一个处理单元，其阻止在网络接口处向网络的至少一个相邻节点转发流量，与邻居节点的拓扑变化一致; 并且当相邻节点具有关于与存储器中的拓扑的信息相同的拓扑的信息时，解除阻塞流量的转发。具有由链路状态协议控制的多个网络节点的网络的网络节点的暂态环路预防方法包括以下步骤：在包含关于网络拓扑变化的信息的网络接口处接收消息。通过处理单元在网络接口处阻塞流量到网络的每个邻居节点的步骤。处理单元同邻近节点拓扑变化的步骤。当邻居节点具有关于与存储在存储器中的拓扑的信息相同的拓扑的信息时，解除阻塞流量的转发的步骤。

27. 发明授权

US07965621B2 Method and arrangement for failure handling in a network 有权
标题翻译：网络中故障处理的方法和布置
公开(公告)号：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上广播相应的故障消息。当活动消息恢复时，通知器广播相应的修复消息。如果通知程序无法注意到故障，则其中一个边缘节点执行类似的功能，尽管稍微慢些。

28. 发明申请

US20110026438A1 METHOD OF GENERATING SPANNING TREES 有权
标题翻译：产生扫描条的方法
公开(公告)号：US20110026438A1
公开(公告)日：2011-02-03
申请号：US12889636
申请日：2010-09-24
申请人： János Farkas , Gábor Tóth
发明人： János Farkas , Gábor Tóth
IPC分类号： H04L12/28
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 (ST1,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 (ST1) 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 (ST1,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）的方法。网络具有通过链路（L2）互连的节点（A-K），树用于处理链路和节点故障。为了处理链路故障，每个链路（L2）至少有一个树（ST1，ST2）不包括该链路。对于节点故障，对于每个节点（A-K），至少一个生成树（ST1-ST3），特定节点通过单个链路（L2）连接到该生成树。第一个生成树（ST1）连接所有节点（A-K），并且从每个节点连接一个链路未连接。第二树（ST2）包括所有节点和所有未连接的链路。两个树中都没有链接（ST1，ST2）。如果节点B断开，则节点A不能与节点C和D通信，所以需要第三棵树（ST3）。该方法具有为任何拓扑的大网络提供少量树的优点，并且可以离线实现。

29. 发明授权

US08879401B2 Loss measurement for multicast data delivery 有权
标题翻译：组播数据传输丢失测量
公开(公告)号：US08879401B2
公开(公告)日：2014-11-04
申请号：US13383301
申请日：2009-07-10
申请人： Dávid Jocha , János Farkas
发明人： Dávid Jocha , János Farkas
IPC分类号： H04L1/00 , 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帧和测量指示符帧时才进行计算。

30. 发明授权

US08411688B2 Method and apparatus for ethernet protection with local re-routing 有权
标题翻译：具有局部重路由的以太网保护方法和装置
公开(公告)号：US08411688B2
公开(公告)日：2013-04-02
申请号：US12933200
申请日：2009-03-16
申请人： János Farkas , Csaba Antal , Attila Takács
发明人： János Farkas , Csaba Antal , Attila Takács
IPC分类号： H04L12/28
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）来执行重新路由以区分将沿着要转发的那些以太网帧沿着第一输出（工作）路径转发的以太网帧沿着第二个输出（备份）路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式