会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD AND MONITORING COMPONENT FOR NETWORK TRAFFIC MONITORING
    • 网络交通监控的方法和监控组件
    • US20100226278A1
    • 2010-09-09
    • US12738400
    • 2007-10-16
    • Tamas BorsosGábor TóthSzabolcs Malomsoky
    • Tamas BorsosGábor TóthSzabolcs Malomsoky
    • H04L12/26
    • H04L12/2602H04L43/00H04L43/028H04W24/08
    • A technique for traffic monitoring in a network comprising monitoring components and a management center (MC) is described. A method implementation comprises the steps of selecting a first set of local identifiers from a larger second set of local identifiers, wherein the local identifiers are capable of providing a unique identification of a network connection at the first monitoring component, filtering network connections, allocating a local identifier of the first set of local identifiers to a network connection in case a filter condition applies during the filtering, checking associations of network traffic with local identifiers, and selectively monitoring network traffic associated with a local identifier from the first set of local identifiers.
    • 描述了一种用于监视组件和管理中心(MC)的网络中的流量监控技术。 方法实现包括以下步骤:从较大的第二组本地标识符中选择第一组本地标识符,其中本地标识符能够在第一监视组件处提供网络连接的唯一标识,过滤网络连接,分配 在过滤期间应用过滤条件的情况下,网络连接的第一组本地标识符的本地标识符,检查网络流量与本地标识符的关联,以及从第一组本地标识符选择性地监视与本地标识符相关联的网络流量。
    • 2. 发明授权
    • Method and monitoring component for network traffic monitoring
    • 网络流量监控的方法和监控组件
    • US08750133B2
    • 2014-06-10
    • US12738400
    • 2007-10-16
    • Tamas BorsosGábor TóthSzabolcs Malomsoky
    • Tamas BorsosGábor TóthSzabolcs Malomsoky
    • H04L12/26
    • H04L12/2602H04L43/00H04L43/028H04W24/08
    • A technique for traffic monitoring in a network comprising monitoring components and a management center (MC) is described. A method implementation comprises the steps of selecting a first set of local identifiers from a larger second set of local identifiers, wherein the local identifiers are capable of providing a unique identification of a network connection at the first monitoring component, filtering network connections, allocating a local identifier of the first set of local identifiers to a network connection in case a filter condition applies during the filtering, checking associations of network traffic with local identifiers, and selectively monitoring network traffic associated with a local identifier from the first set of local identifiers.
    • 描述了一种用于监视组件和管理中心(MC)的网络中的流量监控技术。 方法实现包括以下步骤:从较大的第二组本地标识符中选择第一组本地标识符,其中本地标识符能够在第一监视组件处提供网络连接的唯一标识,过滤网络连接,分配 在过滤期间应用过滤条件的情况下,网络连接的第一组本地标识符的本地标识符,检查网络流量与本地标识符的关联,以及从第一组本地标识符选择性地监视与本地标识符相关联的网络流量。
    • 3. 发明授权
    • Method and apparatus for segmenting a data packet
    • 分割数据包的方法和装置
    • US07224703B2
    • 2007-05-29
    • US10012348
    • 2001-12-12
    • Csaba AntalBengt HenriquesGábor Tóth
    • Csaba AntalBengt HenriquesGábor Tóth
    • H04J3/24
    • H04L47/6215H04L12/6418H04L47/2408H04L47/36H04L47/50H04L2012/6459
    • The efficiency of transmitting lower priority data traffic along with higher priority traffic is improved by segmenting a data packet in such a way so as to reduce transmission delay of the higher priority traffic. The data packet is segmented so that all its segments, including the last segment, are approximately the same size. The segment size is set smaller than a maximum permitted segment size. Indeed, it is desirable (though not necessary) to set the segment size as small as design parameters, (e.g., minimize segment header overhead), allow in order to reduce transmission delay of the higher priority traffic. Because the last segment is set at the same size or a larger size than the other segments, delay in transmitting the data packet is also reduced. The last segment may be sized as large as practical to minimize the transmission delay of the data packet. Once segmented, the data packet segments are transmitted along with the higher priority traffic.
    • 通过以这样的方式分割数据分组来提高传输较低优先级数据业务以及较高优先级业务的效率,以便减少较高优先级业务的传输延迟。 数据包被分段,使其包括最后一个段的所有段都大致相同。 段大小设置为小于最大允许段大小。 实际上,期望(尽管不是必需的)将段大小设置为小于设计参数(例如,最小化段头开销),允许以减少较高优先级业务的传输延迟。 因为最后一个段被设置为与其他段相同的大小或更大的大小,所以传输数据分组的延迟也减少了。 最后一个段的大小可以设置为尽可能大,以最小化数据分组的传输延迟。 一旦分段,数据分组段与更高优先级的业务一起传输。
    • 4. 发明授权
    • Method of generating spanning trees to handle link and node failures in a network
    • 生成生成树来处理网络中链路和节点故障的方法
    • US08483097B2
    • 2013-07-09
    • US12889636
    • 2010-09-24
    • János FarkasGábor Tóth
    • János FarkasGábor Tóth
    • H04L12/28
    • H04L12/4625H04L45/02H04L45/22H04L45/28H04L45/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)。 该方法具有为任何拓扑的大网络提供少量树的优点,并且可以离线实现。
    • 5. 发明授权
    • Lightweight mobility architecture
    • 轻量级移动架构
    • US08325626B2
    • 2012-12-04
    • US12523664
    • 2008-01-14
    • Gábor TóthAndrás CsászárAttila MihalyZoltán Richárd Turányi
    • Gábor TóthAndrás CsászárAttila MihalyZoltán Richárd Turányi
    • H04J1/16H04L12/56
    • H04W8/087H04L29/12028H04L61/103H04L61/2015H04W80/06
    • Mobility between access domains in an Internet Protocol (IP) network can be supported by introducing a so-called Mobility Manager (MM) that maintains a database of currently attached devices and their current access domain location. The mobility manager may then detect, for a device registered in the database, a change of access domain from a first access domain to a second access domain by monitoring connection maintenance signaling related to the considered device. The mobility manager should at least obtain an indication of such a change of access domain. In response to a detected change of access domain, the mobility manager arranges for a reconfiguration of the network to forward traffic destined to an IP address of the device in the first access domain to a new location in the second access domain. In this way, the mobility manager allows the device to keep its IP address when moving between access domains.
    • 可以通过引入维护当前连接的设备的数据库及其当前访问域位置的所谓的移动管理器(MM)来支持互联网协议(IP)网络中的接入域之间的移动性。 然后,移动性管理器可以通过监视与所考虑的设备相关的连接维护信令来检测对于在数据库中注册的设备,从第一接入域到第二接入域的接入域的改变。 移动管理员至少应该获得访问域这种更改的指示。 响应于检测到的接入域的改变,移动性管理器布置网络的重新配置以将目的地为第一接入域中的设备的IP地址的流转发到第二接入域中的新位置。 以这种方式,移动管理器允许设备在接入域之间移动时保持其IP地址。
    • 6. 发明授权
    • Centralized link-scope configuration of an internet protocol (IP) network
    • 互联网协议(IP)网络的集中链路范围配置
    • US07327695B2
    • 2008-02-05
    • US10742731
    • 2003-12-19
    • Gergely MolnarGábor TóthBalázs Peter GeröAttila Rajmund Nohl
    • Gergely MolnarGábor TóthBalázs Peter GeröAttila Rajmund Nohl
    • H04L12/28
    • H04L41/0806
    • A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T1-TN. The links in each subset are then configured in parallel, starting with subset T1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.
    • 一种从集中管理节点在基于IP的网络中配置链路范围类型管理对象的方法。 基于IP的网络包括至少一个管理站,一组网络节点以及网络节点之间以及管理站和网络节点之间的通信链路。 优选地,准备网络的开放最短路径优先(OSPF)拓扑图,并且识别要配置的一组目标链路。 然后将目标链路分为N个不相交的子集,T 1,N 2,N 2,N 3。 然后每个子集中的链接被并行地配置,从子集T 1开始,并逐个地依次处理每个子集。 可以通过从OSPF拓扑图中去除不配置的非目标链路来分类目标链路,构建LinkGraph以确定OSPF拓扑图中剩余的链路之间的依赖关系,以及从LinkGraph构建LinkTree以对其进行分类 基于链接之间的依赖关系,目标链接到子集中。
    • 9. 发明申请
    • METHOD OF GENERATING SPANNING TREES
    • 产生扫描条的方法
    • US20110026438A1
    • 2011-02-03
    • US12889636
    • 2010-09-24
    • János FarkasGábor Tóth
    • János FarkasGábor Tóth
    • H04L12/28
    • H04L12/4625H04L45/02H04L45/22H04L45/28H04L45/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)。 该方法具有为任何拓扑的大网络提供少量树的优点,并且可以离线实现。
    • 10. 发明申请
    • Lightweight Mobility Architecture
    • 轻量级移动架构
    • US20100172293A1
    • 2010-07-08
    • US12523664
    • 2008-01-14
    • Gábor TóthAndrás CsászárAttila MihalyZoltán Richárd Turányi
    • Gábor TóthAndrás CsászárAttila MihalyZoltán Richárd Turányi
    • H04W8/02
    • H04W8/087H04L29/12028H04L61/103H04L61/2015H04W80/06
    • Mobility between access domains in an Internet Protocol (IP) network can be supported by introducing a so-called Mobility Manager (MM) that maintains a database of currently attached devices and their current access domain location. The mobility manager may then detect, for a device registered in the database, a change of access domain from a first access domain to a second access domain by monitoring connection maintenance signaling related to the considered device. The mobility manager should at least obtain an indication of such a change of access domain. In response to a detected change of access domain, the mobility manager arranges for a reconfiguration of the network to forward traffic destined to an IP address of the device in the first access domain to a new location in the second access domain. In this way, the mobility manager allows the device to keep its IP address when moving between access domains.
    • 可以通过引入维护当前连接的设备的数据库及其当前访问域位置的所谓的移动管理器(MM)来支持互联网协议(IP)网络中的接入域之间的移动性。 然后,移动性管理器可以通过监视与所考虑的设备相关的连接维护信令来检测对于在数据库中注册的设备,从第一接入域到第二接入域的接入域的改变。 移动管理员至少应该获得访问域这种更改的指示。 响应于检测到的接入域的改变,移动性管理器布置网络的重新配置以将目的地为第一接入域中的设备的IP地址的流转发到第二接入域中的新位置。 以这种方式,移动管理器允许设备在接入域之间移动时保持其IP地址。