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

1. 发明授权

US10326688B2 Method and apparatus for instantiating a path with the minimum number of segments 有权
公开(公告)号：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.

2. 发明授权

US10348610B2 Method and apparatus for minimum label bandwidth guaranteed path for segment routing 有权
公开(公告)号：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.

3. 发明申请

US20110044201A1 LINE-RATE, REAL-TIME-TRAFFIC DETECTOR 有权
标题翻译：线速度，实时交通检测器
公开(公告)号：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.
摘要翻译：线速率实时业务检测器在确定网络业务流的分组到达速率由经验导出的边界限定时的平滑度时，将网络流量流分类为实时。在一些实施例中，为了提高性能，对于在第一组分组到达时间上执行的平滑度计算应用更紧密的平滑度约束，而将更松散的平滑度约束应用于第二组分组到达时间，第二组包括和大于第一。

4. 发明授权

US10374939B2 Hop constrained maximum flow with segment routing 有权
公开(公告)号：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.

5. 发明授权

US09619292B2 Resource placement in networked cloud based on resource constraints 有权
公开(公告)号：US09619292B2
公开(公告)日：2017-04-11
申请号：US13459430
申请日：2012-04-30
申请人： Murali Kodialam , Fang Hao , T. V. Lakshman , Sarit Mukherjee
发明人： Murali Kodialam , Fang Hao , T. V. Lakshman , Sarit Mukherjee
IPC分类号： G06F15/173 , G06F9/50
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.

6. 发明申请

US20100316051A1 PACKET PROCESSING USING BRAIDED TRIES 有权
标题翻译：使用BRAIDED TRIES进行分组处理
公开(公告)号：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编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

7. 发明申请

US20130290539A1 RESOURCE PLACEMENT IN NETWORKED CLOUD BASED ON RESOURCE CONSTRAINTS 有权
标题翻译：基于资源约束的网络云资源配置
公开(公告)号：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.
摘要翻译：各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点：在云控制器处接收包括对第一云资源的第一请求的请求消息; 识别用于提供第一云资源的一组潜在设备; 计算与所述潜在设备组的至少一部分相对应的多个权重值，用于提供第一云资源，其中基于与所述集合的所述至少一部分相关联的多个增量值来计算所述多个权重值的潜在设备; 基于所述多个权重值选择设备以提供所述第一云资源; 以及更新与所选设备相关联的增量值。

8. 发明授权

US08179898B2 Packet processing using braided tries 有权
标题翻译：使用编织尝试的包处理
公开(公告)号：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编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

9. 发明申请

US20180324082A1 WEIGHT SETTING USING INVERSE OPTIMIZATION 审中-公开
公开(公告)号：US20180324082A1
公开(公告)日：2018-11-08
申请号：US15587649
申请日：2017-05-05
申请人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： H04L12/721 , H04L12/733 , H04W40/02
CPC分类号： H04L45/123 , H04L41/0823 , H04L43/0882 , H04L43/16 , H04L45/126 , H04L45/14 , H04L45/70 , H04W40/02
摘要： The present disclosure generally discloses improvements in computer performance for supporting use of shortest path routing in a communication network. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on inverse optimization. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on distance between traffic matrices (e.g., distance between a requested traffic matrix and a routed traffic matrix). The shortest path routing capability may be configured to determine, based on the distance between a requested traffic matrix and a routed traffic matrix, whether to accept or reject a set of link weights for a network.

10. 发明申请

US20140089510A1 JOINT ALLOCATION OF CLOUD AND NETWORK RESOURCES IN A DISTRIBUTED CLOUD SYSTEM 审中-公开
标题翻译：在分布式云系统中的云和网络资源的联合分配
公开(公告)号：US20140089510A1
公开(公告)日：2014-03-27
申请号：US13628421
申请日：2012-09-27
申请人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： G06F15/173
CPC分类号： G06F9/5072
摘要： A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers.
摘要翻译：提供了在包括多个数据中心的分布式云系统中分配云和网络资源的能力。收到资源请求。对资源的请求包括对云资源的请求以及所请求的云资源量的指示。对资源的请求还可以包括对网络资源的请求或一个或多个约束。基于对与分布式云系统相关联的资源和信息的请求确定一组可行的资源映射。从可用资源映射的集合中选择用于资源请求的资源映射。所选择的资源映射包括所请求的云资源与一个或多个数据中心的云资源的映射以及被配置为支持一个或多个数据中心的云资源的通信的网络资源的标识。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式