公开(公告)号：US07263100B2

公开(公告)日：2007-08-28

申请号：US10357559

申请日：2003-02-04

申请人： Oded Hauser ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

发明人： Oded Hauser ,  Muralidharan S. Kodialam ,  Tirunell V. Lakshman

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

CPC分类号： H04L41/0896 ,  H04L41/0663 ,  H04L43/0811

摘要： Capacity design of an optical network for demands of fast path restorable (FPR) connections forms a linear programming sizing problem for a optimal routing. A dual of the linear programming sizing problem is formed and solved with an approximation algorithm. Edge lengths are initialized based on i) the inverse of the edge's capacity and ii) a scalar constant. Then, the approximation algorithm proceeds in phases to route each commodity over the edges of a graph. During each phase, the demand's flow is sent from the source to destination via multiple iterations. During each iteration, the set of shortest disjoint paths from the source to the destination is determined, a portion of the flow is sent, and the lengths of the edges that carry the flow are updated. The value employed to scale the network is generated after the last phase from the maximum ratio of edge flow to edge capacity.

摘要翻译： 用于快速路径恢复（FPR）连接需求的光网络的容量设计形成用于优化路由的线性规划大小问题。 线性规划大小问题的双重形成并用近似算法求解。 边缘长度基于i）边缘容量的倒数初始化，以及ii）标量常数。 然后，近似算法逐步进行，以在图的边缘上路由每个商品。 在每个阶段，需求流通过多次迭代从源到目的地发送。 在每次迭代期间，确定从源到目的地的最短不相交路径的集合，发送流的一部分，并且更新携带流的边的长度。 用于缩放网络的值是在从边缘流量到边缘容量的最大比率的最后一个阶段之后生成的。

公开(公告)号：US5539559A

公开(公告)日：1996-07-23

申请号：US934098

申请日：1992-08-21

申请人： Arturo Cisneros ,  Tirunell V. Lakshman

发明人： Arturo Cisneros ,  Tirunell V. Lakshman

IPC分类号： H04L12/56 ,  H04Q11/04 ,  H04J14/02

CPC分类号： H04L12/5601 ,  H04L49/1561 ,  H04L49/1576 ,  H04Q11/0478 ,  H04L2012/5627 ,  H04L2012/5672 ,  H04L2012/5679 ,  H04L2012/5681

摘要： Apparatus and methods are provided for photonic contention resolution in a switch including a plurality of input modules and a plurality of output modules, wherein at least two of the plurality of input modules have cells to be transmitted to a destination output module. The photonic contention resolution device includes a plurality of coherent light sources for emitting a beam of coherent light and a plurality of tunable receivers. Each of the coherent light sources and tunable receivers are tunable by an associated input module to a plurality of distinct wavelengths. Each tunable laser preferably illuminates at least one of the plurality of tunable receivers at the particular wavelength associated with the destination output module such that one of the at least two input modules transmits its cell to the destination output module if none of the plurality of coherent light sources is illuminating its associated tunable receiver at the particular wavelength.

摘要翻译： 在包括多个输入模块和多个输出模块的开关中提供用于光子争用分辨率的装置和方法，其中多个输入模块中的至少两个具有要发送到目的地输出模块的单元。 光子争用解决装置包括用于发射相干光束的多个相干光源和多个可调接收器。 每个相干光源和可调谐接收器可由相关的输入模块调谐到多个不同的波长。 每个可调谐激光器优选地以与目的地输出模块相关联的特定波长照亮多个可调谐接收器中的至少一个，使得如果不存在多个相干光，则至少两个输入模块中的一个将其单元发送到目的地输出模块 光源在特定波长下照亮其相关联的可调谐接收器。

公开(公告)号：US5301055A

公开(公告)日：1994-04-05

申请号：US39546

申请日：1993-03-29

申请人： Anindo Bagchi ,  Tirunell V. Lakshman ,  Kasra Rastani

发明人： Anindo Bagchi ,  Tirunell V. Lakshman ,  Kasra Rastani

IPC分类号： H04L12/18 ,  H04L12/56 ,  H04Q11/00 ,  H04Q11/04 ,  H04J14/08 ,  H04J14/00

CPC分类号： H04Q11/0478 ,  H04L49/203 ,  H04Q11/0001 ,  H04Q11/0066

摘要： A scheduler for a packet switch capable of atomic multicasts, that is, allowing one packet at an input port to be simultaneously transmitted to multiple output ports. The scheduling algorithm sequentially polls each of the input ports to determine to which output ports it desires connection for the next transmission slot. If those output ports are available, that input port assigns itself to the slot, and subsequent input ports are blocked from those output ports. The scheduling algorithm does not poll these blocked input ports for the current slot. The scheduler can be advantageously implemented in an optical system having one optical path for indexing control and multiple optical paths corresponding to each of the output ports. Sub-schedulers are arranged serially along all the optical paths. When a sub-scheduler is notified by the indexing control path that its turn to assign has arrived, it checks all of the optical paths corresponding to the output ports to which it desires connection. If those output ports are available, it assigns itself to the current slot, indicates on the output port optical paths that those desired output ports are no longer available, and indicates on the indexing control path that its assigning turn is over. If those output ports are not available, it nonetheless indicates on the indexing control path that its assigning turn is over and waits till the next assigning period.

摘要翻译： 用于能够进行原子组播的分组交换机的调度器，即允许在输入端口处的一个分组被同时发送到多个输出端口。 调度算法顺序地轮询每个输入端口，以确定其期望下一个传输时隙连接的输出端口。 如果这些输出端口可用，则该输入端口将自身分配给插槽，并且后续输入端口从这些输出端口被阻止。 调度算法不会轮询当前时隙的这些阻塞的输入端口。 调度器可以有利地在具有用于索引控制的一个光路和对应于每个输出端口的多个光路的光学系统中实现。 子调度器沿着所有光路顺序排列。 当子调度器通过其转向分配的索引控制路径到达时，它检查与其期望连接的输出端口相对应的所有光路径。 如果这些输出端口可用，则将其分配给当前时隙，在输出端口光纤路径上指示那些所需输出端口不再可用，并在索引控制路径上指示其分配转向结束。 如果这些输出端口不可用，它仍然在索引控制路径上指示其分配转向结束，并等待到下一个分配周期。

公开(公告)号：US20170244619A1

公开(公告)日：2017-08-24

申请号：US15047988

申请日：2016-02-19

申请人： Randeep S. Bhatia ,  Fang Hao ,  Tirunell V. Lakshman ,  Harish Viswanathan ,  Colin L. Kahn

发明人： Randeep S. Bhatia ,  Fang Hao ,  Tirunell V. Lakshman ,  Harish Viswanathan ,  Colin L. Kahn

IPC分类号： H04L12/26 ,  H04L12/927 ,  H04L29/08

CPC分类号： H04L43/08 ,  H04L47/80 ,  H04L67/141 ,  H04L67/143 ,  H04W36/12 ,  H04W88/16

摘要： This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

公开(公告)号：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数据结构的子树形状的顶点。 形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作，以执行来自该组数据值的数据值的查找，同时减少二进制特里数据结构的结构冗余， 形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。

公开(公告)号：US20130166943A1

公开(公告)日：2013-06-27

申请号：US13334141

申请日：2011-12-22

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

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

IPC分类号： G06F15/173 ,  G06F11/20

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.

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

公开(公告)号：US20130060601A1

公开(公告)日：2013-03-07

申请号：US13225878

申请日：2011-09-06

申请人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sarit Mukherjee

发明人： Muralidharan S. Kodialam ,  Tirunell V. Lakshman ,  Sarit Mukherjee

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02

摘要： A distribution and scheduling system for advertisements that targets ads to users and maximizes service-provider revenue without having full knowledge of user-profile information. Each user device stores a user profile and is pre-loaded with a set of ads that could possibly be shown during a timeslot. Each user device selects and displays an ad based on the user profile but does not identify the selected ad to the service provider. Instead, the user devices provide perturbed user-profile information in the form of Boolean vectors, which the service provider uses in conjunction with a guaranteed-approximation online algorithm to estimate the number of users that saw a particular ad. Thus, the service provider can charge advertisers for the number of times their ads are viewed, without knowing the users' profiles or which ads were viewed by individual users, and users can view the targeted ads while maintaining privacy from the service provider.

摘要翻译： 用于向用户展示广告的广告的分发和调度系统，并且在不了解用户简档信息的情况下最大化服务提供商收入。 每个用户设备存储用户简档，并且预先加载可能在时隙期间显示的一组广告。 每个用户设备根据用户配置文件选择并显示广告，但不将所选广告标识给服务提供商。 相反，用户设备以布尔向量的形式提供扰动的用户简档信息，服务提供商结合保证近似在线算法来估计看到特定广告的用户数量。 因此，服务提供商可以在不知道用户的个人资料或哪些广告被个人用户查看的情况下向广告客户收取广告的次数，并且用户可以在维护来自服务提供商的隐私的同时查看有针对性的广告。

公开(公告)号：US08266506B2

公开(公告)日：2012-09-11

申请号：US12426227

申请日：2009-04-18

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

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

IPC分类号： G06F11/00

CPC分类号： H03M13/13 ,  H03M13/51

摘要： A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.

摘要翻译： 一种使用编程为提供多个非零f位二进制向量的单个Bloom滤波器来提供候选数据元素的改进的集合隶属确定和组成员标识的方法和装置，其中每个f位二进制向量与 各自组。 布隆过滤器使用多个散列滤波器组中的一个或多个（但不是全部）进行编程。

公开(公告)号：US08250016B2

公开(公告)日：2012-08-21

申请号：US12425576

申请日：2009-04-17

申请人： Nan Hua ,  Tirunell V. Lakshman ,  Haoyu Song

发明人： Nan Hua ,  Tirunell V. Lakshman ,  Haoyu Song

IPC分类号： G06F17/00

CPC分类号： G06K9/62

摘要： A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.

摘要翻译： 可变跨度多模式匹配装置根据修改的风选算法将模式和输入流分割成可变大小的块。 可变步长模式段用于确定用于检测输入流中的模式的可变步长离散有限自动机（VS-DFA）的块符号字母表。 应用包括网络入侵检测和保护系统，基因组匹配和取证。 风选算法的修改包括使用特殊哈希值来确定模式和输入流的分隔符的位置。 分隔符标记段的开头和结尾。 在各种实施例中，图案被分割为头部，芯部和尾部块。 该方法提供了存储器，存储器带宽和处理器周期效率，确定性，高速的线速率模式匹配。