Patents by Inventor Haoyu Song
Haoyu Song has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8519543Abstract: A multi-die integrated circuit assembly includes an interposer substrate larger than the typical reticle size used in fabricating the “active area” in which the through-silicon vias (TSVs) and interconnect conductors are formed in the interposer. At the same time, each of the dies has its external power/ground and I/O signal line connections concentrated into a smaller area of the die. The dies are disposed or mounted on the interposer such that these smaller areas (with the power/ground/IO connections) overlap with the active area of the interposer. In this configuration, a plurality of dies having a combined area substantially greater than the active area of the interposer can be mounted on the interposer (and take advantage of the active area for interconnections).Type: GrantFiled: July 17, 2012Date of Patent: August 27, 2013Assignee: Futurewei Technologies, Inc.Inventors: Haoyu Song, Cao Wei, Rui Niu, Anwar A. Mohammed
-
Publication number: 20130166943Abstract: 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.Type: ApplicationFiled: December 22, 2011Publication date: June 27, 2013Applicant: Alcatel-Lucent USA Inc.Inventors: Haoyu Song, Fang Hao, Tirunell V. Lakshman
-
Publication number: 20130114414Abstract: A network component comprising a hash generator configured to generate a first hash value using a first hash function and a packet, and generate a second hash value using a second hash function and the packet, a memory comprising a first hash table related to the first hash function and a second hash table related to the second hash function, the first and second hash tables comprising one or more entries, the one or more entries comprising a signature, a timestamp, and a path identification, a comparator configured to compare the first hash value and the second hash value with the one or more entries, and a forwarding decision module configured to forward the packet on a selected path.Type: ApplicationFiled: November 8, 2011Publication date: May 9, 2013Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventor: Haoyu Song
-
Publication number: 20130114413Abstract: A network component comprising a traffic manager (TM) configured to assign a unique identifier (ID) to a received packet, a splitter module configured to separate a header and a payload of the received packet, the splitter module further configured to attach the unique ID to each of the header and the payload, and a merger module configured to assemble an outgoing packet using the header and the payload.Type: ApplicationFiled: November 8, 2011Publication date: May 9, 2013Applicant: FUTUREWEI TECHNOLOGIES, INC.Inventors: Haoyu Song, Thomas J. Boures
-
Publication number: 20130111122Abstract: An apparatus comprising a plurality of memory components each comprising a plurality of memory banks, a memory controller coupled to the memory components and configured to control and select a one of the plurality of memory components for a memory operation, a plurality of address/command buses coupled to the plurality of memory components and the memory controller comprising at least one shared address/command bus between at least some of the plurality of memory components, and a plurality of data buses coupled to the memory components and the memory controller comprising at least one data bus between at least some of the memory components, wherein the memory controller uses a memory interleaving and bank arbitration scheme in a time-division multiplexing (TDM) fashion to access the plurality of memory components and the memory banks.Type: ApplicationFiled: October 31, 2011Publication date: May 2, 2013Applicant: Futurewei Technologies, Inc.Inventors: Haoyu Song, Wang Xinyuan, Cao Wei
-
Patent number: 8369333Abstract: A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine.Type: GrantFiled: October 21, 2009Date of Patent: February 5, 2013Assignee: Alcatel LucentInventors: Fang Hao, Tirunell V. Lakshman, Sarit Mukherjee, Haoyu Song
-
Publication number: 20130011136Abstract: 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.Type: ApplicationFiled: January 13, 2012Publication date: January 10, 2013Applicant: Alcatel-Lucent USA Inc.Inventors: Fang Hao, Muralidharam S. Kodialam, Tirunell V. Lakshman, Haoyu Song, Martin Zimgibl
-
Patent number: 8266506Abstract: 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.Type: GrantFiled: April 18, 2009Date of Patent: September 11, 2012Assignee: Alcatel LucentInventors: Fang Hao, Muralidharan Sampath Kodialam, Tirunell V. Lakshman, Haoyu Song
-
Patent number: 8250016Abstract: 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.Type: GrantFiled: April 17, 2009Date of Patent: August 21, 2012Assignee: Alcatel LucentInventors: Nan Hua, Tirunell V. Lakshman, Haoyu Song
-
Publication number: 20120136846Abstract: Example embodiments are directed to methods of hashing for networks and systems thereof. At least one example embodiment provides a method of processing elements in a system. The method includes receiving a first element, generating a first plurality of hash values based on the first element and a first plurality of hash functions, determining a first plurality of buckets in a table based on the first plurality of hash values, each of the first plurality of buckets associated with a different one of the hash values, selecting one of the first plurality of buckets, storing a first associated value in the selected bucket, the first associated value being associated with the first element, and encoding an identifier (ID) of the hash function generating the hash value associated with the selected bucket into a filter based on the hash value.Type: ApplicationFiled: November 30, 2010Publication date: May 31, 2012Inventors: Haoyu SONG, Murali KODIALAM, Fang HAO, T.V. LAKSHMAN
-
Patent number: 8179898Abstract: 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.Type: GrantFiled: June 11, 2009Date of Patent: May 15, 2012Assignee: Alcatel LucentInventors: Haoyu Song, Murali Kodialam, Fang Hao, Tirunell V. Lakshman
-
Patent number: 8018940Abstract: 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.Type: GrantFiled: August 13, 2008Date of Patent: September 13, 2011Assignee: Alcatel LucentInventors: Fang Hao, Muralidharan S. Kodialam, Tirunell V. Lakshman, Haoyu Song
-
Patent number: 7990973Abstract: In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.Type: GrantFiled: August 13, 2008Date of Patent: August 2, 2011Assignee: Alcatel-Lucent USA Inc.Inventors: Fang Hao, Muralidharan S. Kodialam, Haoyu Song
-
Publication number: 20110137930Abstract: 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.Type: ApplicationFiled: December 9, 2009Publication date: June 9, 2011Inventors: Fang Hao, Muralidharan Kodialam, T.V. Lakshman, Haoyu Song
-
Publication number: 20110090911Abstract: A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine.Type: ApplicationFiled: October 21, 2009Publication date: April 21, 2011Inventors: Fang Hao, T.V. Lakshman, Sarit Mukherjee, Haoyu Song
-
Publication number: 20100322255Abstract: The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity.Type: ApplicationFiled: June 22, 2009Publication date: December 23, 2010Applicant: Alcatel-Lucent USA Inc.Inventors: Fang Hao, T.V. Lakshman, Sarit Mukherjee, Haoyu Song
-
Publication number: 20100316051Abstract: 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.Type: ApplicationFiled: June 11, 2009Publication date: December 16, 2010Applicant: ALCATEL-LUCENT USA INC.Inventors: Haoyu Song, Murali Kodialam, Fang Hao, T.V. Lakshman
-
Publication number: 20100269024Abstract: 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.Type: ApplicationFiled: April 18, 2009Publication date: October 21, 2010Inventors: Fang Hao, Muralidharan Sampath Kodialam, Tirunell V. Lakshman, Haoyu Song
-
Publication number: 20100266215Abstract: 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.Type: ApplicationFiled: April 17, 2009Publication date: October 21, 2010Applicant: ALCATEL-LUCENT USA INC.Inventors: Nan Hua, Tirunell V. Lakshman, Haoyu Song
-
Publication number: 20100040066Abstract: 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.Type: ApplicationFiled: August 13, 2008Publication date: February 18, 2010Applicant: Lucent Technologies Inc.Inventors: Fang Hao, Muralidharan S. Kodialam, Tirunell V. Lakshman, Haoyu Song