公开(公告)号：US07460487B2

公开(公告)日：2008-12-02

申请号：US10947072

申请日：2004-09-22

申请人： Fang Hao ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

发明人： Fang Hao ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

IPC分类号： H04L12/26

CPC分类号： H04L41/14 ,  H04L43/024 ,  H04L43/026 ,  H04L63/145

摘要： A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.

摘要翻译： 通过链路互连的节点网络估计每流量流量的方法通过使用散列函数的流分配将输入业务流分解成多个并行子流。 由于进入业务流中的每个流量构成其子流中流量的较大部分，所以获得两次运行的概率增加。 然后使用每个流的两次运行的数量来生成流量的流量的估计。

公开(公告)号：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.

公开(公告)号：US09223630B2

公开(公告)日：2015-12-29

申请号：US13334141

申请日：2011-12-22

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

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

IPC分类号： G06F9/46 ,  G06F9/50

CPC分类号： G06F9/505 ,  G06F9/5083 ,  Y02D10/22

摘要： Various embodiments provide a method and apparatus of providing a load balancing configuration that adapts to the overall load and scales the power consumption with the load to improve energy efficiency and scalability. The energy efficient distributed and elastic load balancing architecture includes a collection of multi-tiered servers organized as a tree structure. The handling of incoming service requests is distributed amongst a number of the servers. Each server in the virtual load distribution tree accepts handles incoming service requests based on its own load. Once a predetermined loading on the receiving server has been reached, the receiving server passes the incoming requests to one or more of its children servers.

摘要翻译： 各种实施例提供一种方法和装置，其提供适应于总负载的负载平衡配置，并且与负载缩放功率消耗以提高能量效率和可扩展性。 节能分布式和弹性负载平衡架构包括组织为树结构的多层服务器集合。 传入服务请求的处理分布在多个服务器之间。 虚拟负载分配树中的每个服务器都会根据自己的负载接收传入的服务请求。 一旦达到接收服务器上的预定加载，接收服务器将传入请求传递给其一个或多个子服务器。

公开(公告)号：US20150180769A1

公开(公告)日：2015-06-25

申请号：US14137047

申请日：2013-12-20

申请人： An Wang ,  Yang Guo ,  Fang Hao ,  Tirunell V. Lakshman

发明人： An Wang ,  Yang Guo ,  Fang Hao ,  Tirunell V. Lakshman

IPC分类号： H04L12/713 ,  H04L12/803 ,  H04L12/851 ,  H04L12/721 ,  H04L12/813

CPC分类号： H04L47/2483 ,  H04L45/38 ,  H04L45/64

摘要： A capability for scale-up of a control plane of a Software Defined Network (SDN) using a virtual switch based overlay is presented. A central controller (CC) of the SDN that is providing control functions for a physical switch (pSwitch) of the SDN, based on a determination that the control plane between the CC and the pSwitch is congested, modifies the default flow forwarding rule on the pSwitch from a rule indicating that new traffic flows are to be forwarded to the central controller to a rule indicating that new traffic flows are to be forwarded to a virtual switch (vSwitch). Upon receipt of a first packet of a new traffic flow at the pSwitch, the pSwitch provides the first packet of the new traffic flow to the vSwitch, which in turn provides an indication of the first packet of the new traffic flow to the CC for processing by the CC.

摘要翻译： 提出了使用基于虚拟交换机的覆盖软件定义网络（SDN）的控制平面扩展的能力。 基于对CC和pSwitch之间的控制平面拥塞的确定，SDN的中央控制器（CC）正在为SDN的物理交换机（pSwitch）提供控制功能，修改了默认流转发规则 pSwitch从指示将新的业务流转发到中央控制器的规则指示要将新的业务流转发到虚拟交换机（vSwitch）的规则。 在pSwitch接收到新的业务流的第一个分组后，pSwitch将新的业务流的第一个分组提供给vSwitch，vSwitch又向CC提供新的业务流的第一个分组的指示，以进行处理 由CC。

公开(公告)号：US20130011136A1

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

申请号：US13350457

申请日：2012-01-13

申请人： Fang Hao ,  Muralidharam S. Kodialam ,  Tirunell V. Lakshman ,  Haoyu Song ,  Martin Zimgibl

发明人： Fang Hao ,  Muralidharam S. Kodialam ,  Tirunell V. Lakshman ,  Haoyu Song ,  Martin Zimgibl

IPC分类号： H04J14/00

CPC分类号： H04B10/032 ,  H04B10/038 ,  H04B10/27 ,  H04L1/22 ,  H04Q11/00

摘要： A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

公开(公告)号：US07961731B2

公开(公告)日：2011-06-14

申请号：US11096220

申请日：2005-03-31

申请人： Fang Hao ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

发明人： Fang Hao ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

IPC分类号： H04L12/28 ,  G01R31/08 ,  H04J3/24 ,  G06F15/173

CPC分类号： H04L63/1408 ,  H04L43/024

摘要： A method for measuring flow is disclosed. The method includes receiving an IP packet; determining if another IP packet is stored in a register; if another IP packet is stored in the register, comparing the stored IP packet with the received IP packet; and determining the longest match between the stored IP packet and the received IP packet.

摘要翻译： 公开了一种测量流量的方法。 该方法包括：接收IP包; 确定另一个IP包是否存储在一个寄存器中; 如果另一IP分组存储在寄存器中，则将所存储的IP分组与接收的IP分组进行比较; 并确定所存储的IP分组与所接收的IP分组之间的最长匹配。

公开(公告)号：US07930547B2

公开(公告)日：2011-04-19

申请号：US11763676

申请日：2007-06-15

申请人： Fang Hao ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

发明人： Fang Hao ,  Muralidharan Sampath Kodialam ,  Tirunell V. Lakshman

IPC分类号： H04L9/32

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

摘要： A method and system for generating a bloom filter by mapping into respective groups each of a plurality of initial keys according to a first hash function and mapping each group hashed key into a bloom filter using k respective hash functions.

摘要翻译： 一种用于通过根据第一散列函数映射到多个初始密钥中的每个组并且将每个组映射到相应组中来生成布隆过滤器的方法和系统，其使用k个相应的散列函数将密钥散列到布隆过滤器中。

公开(公告)号：US20100040066A1

公开(公告)日：2010-02-18

申请号：US12190633

申请日：2008-08-13

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

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

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L45/745 ,  H04L45/7457

摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.

摘要翻译： 在一个实施例中，使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找，而不必将编程到布隆过滤器中的任何前缀扩展。 使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现，其中每个Bloom子过滤器基于一组散列函数进行散列，其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度 。 可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。 可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

公开(公告)号：US09066160B2

公开(公告)日：2015-06-23

申请号：US13350457

申请日：2012-01-13

申请人： Fang Hao ,  Muralidharam S. Kodialam ,  Tirunell V. Lakshman ,  Haoyu Song ,  Martin Zimgibl

发明人： Fang Hao ,  Muralidharam S. Kodialam ,  Tirunell V. Lakshman ,  Haoyu Song ,  Martin Zimgibl

IPC分类号： H04B10/00 ,  H04Q11/00

CPC分类号： H04B10/032 ,  H04B10/038 ,  H04B10/27 ,  H04L1/22 ,  H04Q11/00

摘要： A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

摘要翻译： 为可靠和低成本的数据中心网络提供冗余保护的方式。 在通过主聚合节点在多个接入节点和网络核心层之间的数据业务的数据中心网络中，提供诸如OLT（光线路终端）之类的光网络设备作为主要的一个或多个的备份聚合节点 聚合节点。 当通过主聚合节点的通信路径发生故障时，流量将通过光网络设备进行路由。 在优选实施例中，通过组合上行传输并分发下行传输的光分路器，从多个接入节点到OLT或其他光网络设备的单个端口形成通信链路。 来自多个接入节点的上行传输可以根据需要备份聚合节点时生成的分配调度进行。

公开(公告)号：US08631043B2

公开(公告)日：2014-01-14

申请号：US12633845

申请日：2009-12-09

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

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

IPC分类号： G06F17/30

CPC分类号： G06F17/30958

摘要： A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.

摘要翻译： 提供了一种用于使用数据结构表示一组数据值的能力，包括将表示该组数据值的二进制特里数据结构转换为表示数据值集合的形状图数据结构。 形状图数据结构是从二进制trie数据结构生成的基于二叉树数据结构的节点的子树的形状。 形状图包括表示二进制trie数据结构的子树形状的顶点。 形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作，以执行来自该组数据值的数据值的查找，同时减少二进制特里数据结构的结构冗余， 形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。