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

1. 发明申请

US20100214947A1 Determination of Network Topology Using Flow-Based Traffic Information 有权
标题翻译：使用基于流量的交通信息确定网络拓扑
公开(公告)号：US20100214947A1
公开(公告)日：2010-08-26
申请号：US12391556
申请日：2009-02-24
申请人： Xenofontas Dimitropoulos , Andreas Kind , Bernhard Jansen , Jeroen Massar
发明人： Xenofontas Dimitropoulos , Andreas Kind , Bernhard Jansen , Jeroen Massar
IPC分类号： H04L12/26 , H04L12/28
CPC分类号： H04L41/12
摘要： A method for determination of a network topology includes generating a list of device sets for a destination; removing any duplicate device sets from the list; creating a tree for the destination by introducing a root node into the tree; sorting the list of device sets for the destination by length; removing the shortest device set from the list; introducing a new node representing the shortest device set into the tree; determining whether a node in the tree represents a maximum length subset of the shortest device set, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node; setting the identifier of the introduced node to a list of members of the shortest device set that are not included in the maximum length subset of the determined node.
摘要翻译：一种用于确定网络拓扑的方法包括生成目的地的设备集列表; 从列表中删除任何重复的设备集合; 通过将根节点引入到树中为目的地创建树; 按长度对目的地的设备集列表进行排序; 从列表中删除最短的设备集; 将表示最短设备集的新节点引入到树中; 确定树中的节点是否表示最短设备集合的最大长度子集，并且在确定节点的情况下，将新节点连接到确定的节点，或者将新节点连接到根节点; 将引入的节点的标识符设置为不包括在所确定的节点的最大长度子集中的最短设备集的成员的列表。

2. 发明授权

US07864707B2 Determination of network topology using flow-based traffic information 有权
标题翻译：使用基于流的流量信息确定网络拓扑
公开(公告)号：US07864707B2
公开(公告)日：2011-01-04
申请号：US12391556
申请日：2009-02-24
申请人： Xenofontas Dimitropoulos , Andreas Kind , Bernhard Jansen , Jeroen Massar
发明人： Xenofontas Dimitropoulos , Andreas Kind , Bernhard Jansen , Jeroen Massar
IPC分类号： H04L12/28
CPC分类号： H04L41/12
摘要： A method for determination of a network topology includes generating a list of device sets for a destination; removing any duplicate device sets from the list; creating a tree for the destination by introducing a root node into the tree; sorting the list of device sets for the destination by length; removing the shortest device set from the list; introducing a new node representing the shortest device set into the tree; determining whether a node in the tree represents a maximum length subset of the shortest device set, and in the event that a node is determined, connecting the new node to the determined node, or else connecting the new node to the root node; setting the identifier of the introduced node to a list of members of the shortest device set that are not included in the maximum length subset of the determined node.
摘要翻译：一种用于确定网络拓扑的方法包括生成目的地的设备集列表; 从列表中删除任何重复的设备集合; 通过将根节点引入到树中为目的地创建树; 按长度对目的地的设备集列表进行排序; 从列表中删除最短的设备集; 将表示最短设备集的新节点引入到树中; 确定树中的节点是否表示最短设备集合的最大长度子集，并且在确定节点的情况下，将新节点连接到确定的节点，或者将新节点连接到根节点; 将引入的节点的标识符设置为不包括在所确定的节点的最大长度子集中的最短设备集的成员的列表。

3. 发明授权

US07937388B2 Probabilistic lossy counting 失效
标题翻译：概率有损计数
公开(公告)号：US07937388B2
公开(公告)日：2011-05-03
申请号：US12194784
申请日：2008-08-20
申请人： Xenofontas Dimitropoulos , Paul T. Hurley , Andreas Kind , Marc Stoecklin
发明人： Xenofontas Dimitropoulos , Paul T. Hurley , Andreas Kind , Marc Stoecklin
IPC分类号： G06F7/00
CPC分类号： H04L41/142 , H04L43/00 , H04L43/026 , H04L43/16
摘要： A method for probabilistic lossy counting includes: for each element in a current window, determining whether an entry corresponding to a current element is present in a table; in the event an entry corresponding to the current element is present in the table, incrementing a frequency counter associated with the current element; otherwise, inserting an entry into a table, wherein inserting an entry comprises: calculating a probabilistic error bound Δ based on an index i of the current window; and inserting the probabilistic error bound Δ and a frequency counter into an entry corresponding to the current element in the table; and at the end of the current window, removing all elements from the table wherein the sum of the frequency counter and probabilistic error bound Δ associated with the element is less than or equal to the index of the current window.
摘要翻译：概率有损计数的方法包括：对于当前窗口中的每个元素，确定对应于当前元素的入口是否存在于表中; 在表中存在对应于当前元素的条目的情况下，增加与当前元素相关联的频率计数器; 否则，将条目插入到表中，其中插入条目包括：计算概率误差界限＆Dgr; 基于当前窗口的索引i; 并插入概率误差界限＆Dgr; 以及与表中的当前元素相对应的条目的频率计数器; 并且在当前窗口的末尾，从表中移除所有元素，其中频率计数器和概率误差的总和＆Dgr; 与元素关联的小于或等于当前窗口的索引。

4. 发明申请

US20100049700A1 Probabilistic Lossy Counting 失效
标题翻译：概率有损计数
公开(公告)号：US20100049700A1
公开(公告)日：2010-02-25
申请号：US12194784
申请日：2008-08-20
申请人： Xenofontas Dimitropoulos , Paul T. Hurley , Andreas Kind , Marc Stoecklin
发明人： Xenofontas Dimitropoulos , Paul T. Hurley , Andreas Kind , Marc Stoecklin
IPC分类号： G06F7/20 , G06F17/30
CPC分类号： H04L41/142 , H04L43/00 , H04L43/026 , H04L43/16
摘要： A method for probabilistic lossy counting includes: for each element in a current window, determining whether an entry corresponding to a current element is present in a table; in the event an entry corresponding to the current element is present in the table, incrementing a frequency counter associated with the current element; otherwise, inserting an entry into a table, wherein inserting an entry comprises: calculating a probabilistic error bound Δ based on an index i of the current window; and inserting the probabilistic error bound Δ and a frequency counter into an entry corresponding to the current element in the table; and at the end of the current window, removing all elements from the table wherein the sum of the frequency counter and probabilistic error bound Δ associated with the element is less than or equal to the index of the current window.
摘要翻译：概率有损计数的方法包括：对于当前窗口中的每个元素，确定对应于当前元素的条目是否存在于表中; 在表中存在对应于当前元素的条目的情况下，增加与当前元素相关联的频率计数器; 否则，将条目插入到表中，其中插入条目包括：计算概率误差界限＆Dgr; 基于当前窗口的索引i; 并插入概率误差界限＆Dgr; 以及与表中的当前元素相对应的条目的频率计数器; 并且在当前窗口的末尾，从表中移除所有元素，其中频率计数器和概率误差的总和＆Dgr; 与元素关联的小于或等于当前窗口的索引。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式