公开(公告)号：US20100295659A1

公开(公告)日：2010-11-25

申请号：US12470061

申请日：2009-05-21

申请人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

发明人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

IPC分类号： H04Q5/22

CPC分类号： G06K7/0008 ,  G06K7/10059

摘要： The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.

摘要翻译： 估计RFID标签中所有类别的集合T在指定的误差范围内。 对于一个或多个帧中的每一个，读取器向当前标签广播概率p，多重度d，帧大小M和种子值R. 每个标签上的确定性算法，并且由读者知道，计算（i）标签是否将在该帧中传输，如果是，则（ii）标签将在哪个时隙中传送单个“1”。当标签 读者通过最初假设所有可能的类别都在T中计算集合T，然后消除那些在没有标签发送的那些时隙中传送的类别。 或者，读取器最初假设集合T为空，并且添加将在一个或多个标签确实发送的那些时隙中传送的那些类别。

公开(公告)号：US09081996B2

公开(公告)日：2015-07-14

申请号：US12470061

申请日：2009-05-21

申请人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

发明人： Murali Kodialam ,  Thyaga Nandagopal ,  Wing C. Lau

IPC分类号： G08B21/00 ,  G06K7/00 ,  G06K7/10

CPC分类号： G06K7/0008 ,  G06K7/10059

摘要： The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.

摘要翻译： 估计RFID标签中所有类别的集合T在指定的误差范围内。 对于一个或多个帧中的每一个，读取器向当前标签广播概率p，多重度d，帧大小M和种子值R. 每个标签上的确定性算法，并且由读者知道，计算（i）标签是否将在该帧中传输，如果是，则（ii）标签将在哪个时隙中传送单个“1”。当标签 读者通过最初假设所有可能的类别都在T中计算集合T，然后消除那些在没有标签发送的那些时隙中传送的类别。 或者，读取器最初假设集合T为空，并且添加将在一个或多个标签确实发送的那些时隙中传送的那些类别。

公开(公告)号：US08943269B2

公开(公告)日：2015-01-27

申请号：US13446010

申请日：2012-04-13

申请人： Krishna P. Puttaswamy Naga ,  Murali Kodialam

发明人： Krishna P. Puttaswamy Naga ,  Murali Kodialam

IPC分类号： G06F12/08 ,  G06F11/30 ,  G06F12/12

CPC分类号： G06F12/0866 ,  G06F3/0619 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/3037 ,  G06F11/3409 ,  G06F11/3495 ,  G06F12/12 ,  G06F12/121 ,  G06F17/30135 ,  G06F2003/0692 ,  G06F2212/263 ,  H04L67/10 ,  H04L67/1097 ,  H04L67/2842 ,  H04L67/2852 ,  H04L67/2857

摘要： A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.

摘要翻译： 提出了数据块存储管理能力。 文件系统包括使用第一存储服务和第二存储服务来管理的多个数据块，其中第一存储服务具有比第二存储服务更低的存储成本和更高的输入/输出成本。 使用第二存储服务存储的数据块具有与其相应的预期存储持续时间，其指示将使用第二存储服务来存储数据块的相应时间长度（其可以在数据中的数据块之间相同或不同） 使用第二存储服务存储的块）。 基于第二存储服务的预期命中率和第二存储服务的当前命中率或数据块的当前命中率的比较来修改数据块的预期存储持续时间。

公开(公告)号：US20110044201A1

公开(公告)日：2011-02-24

申请号：US12543529

申请日：2009-08-19

申请人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

发明人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

IPC分类号： H04L12/26

CPC分类号： H04L41/142 ,  H04L47/19 ,  H04L47/2416 ,  H04L47/2441 ,  H04L65/80

摘要： A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.

摘要翻译： 线速率实时业务检测器在确定网络业务流的分组到达速率由经验导出的边界限定时的平滑度时，将网络流量流分类为实时。 在一些实施例中，为了提高性能，对于在第一组分组到达时间上执行的平滑度计算应用更紧密的平滑度约束，而将更松散的平滑度约束应用于第二组分组到达时间，第二组包括和 大于第一。

公开(公告)号：US20100316051A1

公开(公告)日：2010-12-16

申请号：US12482533

申请日：2009-06-11

申请人： Haoyu Song ,  Murali Kodialam ,  Fang Hao ,  T.V. Lakshman

发明人： Haoyu Song ,  Murali Kodialam ,  Fang Hao ,  T.V. Lakshman

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L45/742

摘要： Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.

摘要翻译： 数据包根据编织特技进行处理（例如，路由或分类），其代表两个或多个不同的原始尝试的组合（例如，表示不同的转发/分类表）。 通过扭转特定特里节点的映射来组合不同的尝试，使不同尝试的形状更相似。 编织特技中的每个节点包含至少一个原始特里的编织位，指示该特里节点的映射。 Trie编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。 编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

公开(公告)号：US10374939B2

公开(公告)日：2019-08-06

申请号：US15605790

申请日：2017-05-25

申请人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

发明人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

IPC分类号： H04L12/26 ,  H04L12/721 ,  H04L12/733

摘要： A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

公开(公告)号：US10326688B2

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

申请号：US15605712

申请日：2017-05-25

申请人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman ,  Ehsan Rezaaifar

发明人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman ,  Ehsan Rezaaifar

IPC分类号： H04L12/721 ,  H04L12/723

摘要： Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

公开(公告)号：US20130290539A1

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

申请号：US13459430

申请日：2012-04-30

申请人： Murali Kodialam ,  Fang Hao ,  T.V. Lakshman ,  Sarit Mukherjee

发明人： Murali Kodialam ,  Fang Hao ,  T.V. Lakshman ,  Sarit Mukherjee

IPC分类号： G06F15/16

CPC分类号： G06F9/5072 ,  G06F2209/502 ,  G06F2209/506

摘要： Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the cloud controller, a request message including a first request for a first cloud resource; identifying a set of potential devices for providing the first cloud resource; calculating a plurality of weight values corresponding to at least a portion of the set of potential devices for providing the first cloud resource, wherein the plurality of weight values are calculated based on a plurality of delta values associated with the at least a portion of the set of potential devices; selecting a device based on the plurality of weight values to provide the first cloud resource; and updating the delta value associated with the selected device.

摘要翻译： 各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点：在云控制器处接收包括对第一云资源的第一请求的请求消息; 识别用于提供第一云资源的一组潜在设备; 计算与所述潜在设备组的至少一部分相对应的多个权重值，用于提供第一云资源，其中基于与所述集合的所述至少一部分相关联的多个增量值来计算所述多个权重值 的潜在设备; 基于所述多个权重值选择设备以提供所述第一云资源; 以及更新与所选设备相关联的增量值。

公开(公告)号：US08179898B2

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

申请号：US12482533

申请日：2009-06-11

申请人： Haoyu Song ,  Murali Kodialam ,  Fang Hao ,  Tirunell V. Lakshman

发明人： Haoyu Song ,  Murali Kodialam ,  Fang Hao ,  Tirunell V. Lakshman

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

CPC分类号： H04L45/00 ,  H04L45/742

摘要： Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.

摘要翻译： 数据包根据编织特技进行处理（例如，路由或分类），其代表两个或多个不同的原始尝试的组合（例如，表示不同的转发/分类表）。 通过扭转特定特里节点的映射来组合不同的尝试，使不同尝试的形状更相似。 编织特技中的每个节点包含至少一个原始特里的编织位，指示该特里节点的映射。 Trie编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。 编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

公开(公告)号：US10348610B2

公开(公告)日：2019-07-09

申请号：US15605749

申请日：2017-05-25

申请人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman ,  Ehsan Rezaaifar

发明人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman ,  Ehsan Rezaaifar

IPC分类号： H04L12/749 ,  H04L12/729 ,  H04L12/733 ,  H04L12/723 ,  H04L12/721 ,  H04L12/741

摘要： Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.