Patents by Inventor David Michael Pullen
David Michael Pullen 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: 8908716Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Channel bonding allows smaller bandwidth upstream channels to be bonded together to create a larger bandwidth pipe.Type: GrantFiled: September 14, 2012Date of Patent: December 9, 2014Assignee: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, Jr., David Michael Pullen
-
Patent number: 8711878Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Channel bonding allows smaller bandwidth upstream channels to be bonded together to create a larger bandwidth pipe.Type: GrantFiled: December 12, 2005Date of Patent: April 29, 2014Assignee: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, Jr., David Michael Pullen
-
Patent number: 8705567Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Bandwidth allocation is achieved by transmitting from a CMTS to a cable modem a unique bandwidth allocation message for each upstream channel in a bonded group of upstream channels, wherein the combination of unique bandwidth allocation messages collectively allocates requested bandwidth across the bonded group.Type: GrantFiled: March 21, 2006Date of Patent: April 22, 2014Assignee: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, Jr., David Michael Pullen
-
Publication number: 20130070784Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Channel bonding allows smaller bandwidth upstream channels to be bonded together to create a larger bandwidth pipe.Type: ApplicationFiled: September 14, 2012Publication date: March 21, 2013Applicant: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, JR., David Michael Pullen
-
Patent number: 8279892Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Channel bonding allows smaller bandwidth upstream channels to be bonded together to create a larger bandwidth pipe.Type: GrantFiled: December 12, 2005Date of Patent: October 2, 2012Assignee: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, Jr., David Michael Pullen
-
Patent number: 7970010Abstract: A method for increasing upstream bandwidth per cable modem user in a cable communications system that includes a cable modem termination system (CMTS) and a plurality of cable modems is provided. The method permits a cable modem to transmit data to the CMTS on multiple upstream channels simultaneously using a technique called “channel bonding.” Channel bonding allows smaller bandwidth upstream channels to be bonded together to create a larger bandwidth pipe.Type: GrantFiled: December 12, 2005Date of Patent: June 28, 2011Assignee: Broadcom CorporationInventors: Lisa Voigt Denney, Niki Roberta Pantelias, A. Scott Hollums, Victor T. Hou, John Daniel Horton, Jr., David Michael Pullen
-
Patent number: 7916731Abstract: An apparatus, method, and computer program for efficient rapid loss detection in a channel bonding system. A received packet having a packet sequence number (PSN) not equal to a next expected PSN is queued. A channel counter for a first channel on which the received packet was received is incremented. If all channel counters are non-zero, increment the next expected PSN to equal a lowest queued packet PSN. Forward the queued packet with the lowest queued packet PSN. Decrement a channel counter for a second channel from which the lowest PSN packet is forwarded.Type: GrantFiled: November 30, 2006Date of Patent: March 29, 2011Assignee: Broadcom CorporationInventor: David Michael Pullen
-
Patent number: 7751404Abstract: A method, system, and computer program product for receiving and resequencing a plurality of data segments received on a plurality of channels of a bonding channel set, comprising determining if a sequence number of a received segment matches an expected sequence number. If so, the process includes forwarding the segment for further processing, incrementing the expected sequence number; and forwarding any queued packets corresponding to the expected sequence number and immediately succeeding sequence numbers less than a sequence number of annexed missing segment. If the sequence number of the received segment does not match the expected sequence number, the received segment is queued at a memory location. The address of this location is converted to a segment index. The segment index is stored in a sparse array.Type: GrantFiled: September 24, 2007Date of Patent: July 6, 2010Assignee: Broadcom CorporationInventors: David Michael Pullen, Niki Pantelias, Dannie Gay
-
Patent number: 7526628Abstract: The present invention finds the optimum organization of compiled code within an application to ensure maximal cache efficiency. A configuration file specifies predefined cache, optimization, and application parameters. The cache parameters include a cache size, cache line size, set associativity, address-to-cache-line mapping algorithm, and set replacement algorithm. The optimization parameters specify the minimum acceptable efficiency level. The application parameters include a list of object modules and functions within those modules. All possible orderings of the modules are stepped through to determine where the specified functions fall within the cache given the location of the function within the module. The function locations in each permutation of the orderings are analyzed to find a solution that matches or beats the optimization parameters.Type: GrantFiled: October 3, 2006Date of Patent: April 28, 2009Assignee: Broadcom CorporationInventors: David Michael Pullen, Michael Antony Sieweke
-
Publication number: 20080130649Abstract: An apparatus, method, and computer program for efficient rapid loss detection in a channel bonding system. A received packet having a packet sequence number (PSN) not equal to a next expected PSN is queued. A channel counter for a first channel on which the received packet was received is incremented. If all channel counters are non-zero, increment the next expected PSN to equal a lowest queued packet PSN. Forward the queued packet with the lowest queued packet PSN. Decrement a channel counter for a second channel from which the lowest PSN packet is forwarded.Type: ApplicationFiled: November 30, 2006Publication date: June 5, 2008Applicant: Broadcom CorporationInventor: David Michael Pullen
-
Patent number: 7124276Abstract: The present invention finds the optimum organization of compiled code within an application to ensure maximal cache efficiency. A configuration file specifies predefined cache, optimization, and application parameters. The cache parameters include a cache size, cache line size, set associativity, address-to-cache-line mapping algorithm, and set replacement algorithm. The optimization parameters specify the minimum acceptable efficiency level. The application parameters include a list of object modules and functions within those modules. All possible orderings of the modules are stepped through to determine where the specified functions fall within the cache given the location of the function within the module. The function locations in each permutation of the orderings are analyzed to find a solution that matches or beats the optimization parameters. In an embodiment, a front-end analysis program (“tool”) and a back-end processing stage, usually related to a linker, are provided.Type: GrantFiled: April 14, 2003Date of Patent: October 17, 2006Assignee: Broadcom CorporationInventors: David Michael Pullen, Michael Antony Sieweke
-
Publication number: 20040205307Abstract: The present invention finds the optimum organization of compiled code within an application to ensure maximal cache efficiency. A configuration file specifies predefined cache, optimization, and application parameters. The cache parameters include a cache size, cache line size, set associativity, address-to-cache-line mapping algorithm, and set replacement algorithm. The optimization parameters specify the minimum acceptable efficiency level. The application parameters include a list of object modules and functions within those modules. All possible orderings of the modules are stepped through to determine where the specified functions fall within the cache given the location of the function within the module. The function locations in each permutation of the orderings are analyzed to find a solution that matches or beats the optimization parameters. In an embodiment, a front-end analysis program (“tool”) and a back-end processing stage, usually related to a linker, are provided.Type: ApplicationFiled: April 14, 2003Publication date: October 14, 2004Applicant: Broadcom CorporationInventors: David Michael Pullen, Michael Antony Sieweke
-
Patent number: 5923376Abstract: A method for compressing related data sets of a sequence is disclosed. The method compares domain blocks from a current frame buffer to range blocks in a previous frame buffer or vector quantization ("VQ") tables to generate codes. The method includes determining an initial codeword that represents a domain block of a current frame buffer in reference to a selected range block in a previous frame buffer. The selected range block is identified by a best measurement determined from an initial type of search performed on a first group of range blocks in the previous frame buffer. A cost factor is generated for coding the initial codeword. A first estimated cost of a codeword representing the domain block in reference to a second range block is determined. The second range block is identified by an estimated best measurement determined for a second type of search performed on a second group of range blocks.Type: GrantFiled: October 22, 1998Date of Patent: July 13, 1999Assignee: Iterated Systems, Inc.Inventors: David Michael Pullen, Bradley Thomas Howard