To All PostsEntropic Communications, LLC v. Comcast Corporation Patents
Case Filing Date: 2025-08-23
| Patent Number | Organic/Acquired | Forward Citation Count | Age Of Patent From Priority Date | Independent Claim Count | Claim 1 Word Count | Family Size | Patent Quality Score |
|---|---|---|---|---|---|---|---|
| US7594249B2 | Acquired | 7 | 24 years, 4 months | 3 | 179 | 1 | 17 |
| US7889759B2 | Acquired | 1 | 24 years, 4 months | 2 | 205 | 5 | 11 |
| US10257566B2 | Acquired | 0 | 20 years, 9 months | 3 | 124 | 6 | 18 |
| US9838213B2 | Acquired | 1 | 18 years, 7 months | 3 | 300 | 13 | 13 |
| US10432422B2 | Acquired | 0 | 18 years, 7 months | 8 | 185 | 13 | 33 |
| US8228910B2 | Acquired | 5 | 18 years, 4 months | 1 | 184 | 3 | 9 |
| US8320566B2 | Acquired | 0 | 16 years, 10 months | 1 | 166 | 7 | 20 |
| US8363681B2 | Acquired | 1 | 16 years, 10 months | 1 | 262 | 7 | 20 |
| Patent Summary | Independent Claim |
|---|---|
| US7594249B2 - Broadband cable networks for direct device communication Reflective network interface enables direct communication between devices using coaxial cables. Frequency bins optimize signal transmission based on noise levels. Efficient signal distribution enhances device interconnectivity. | 1. A signal distribution network comprising: a filter located at the point of entry of a building tuned to reject network signals originating in the building, such that the network signals originating in the building do not pass through the filter, but rather are reflected back into the building; at least one signal splitter, the signal splitter having a common port and a plurality of tap ports, the common port of the signal splitter being coupled to the filter; and a plurality of terminal devices, each terminal device being coupled to a tap port of at least one signal splitter, at least one of the terminal devices providing frequency bins with more transmit bits which occupy parts of the channel where the signal to noise ratio (SNR) is high; wherein the reflections from the filter provide a path for terminal devices back through the tap port of the signal splitter and out each other tap port to transmit signals to other terminal devices thus allowing terminal devices to communicate directly with each other to form the signal distribution network. |
| US7889759B2 - Broadband cable networks for establishing modulation schemes Probe signals determine optimal modulation schemes for communication between nodes. Bit-loading modulation adapts to signal-to-noise characteristics for efficient data transfer. Dynamic adjustments enhance network performance. | 1. A method for determining a common bit-loading modulation scheme for communicating between a plurality of nodes in a broadband cable network (“BCN”), the method comprising: transmitting a probe signal from a transmitting node within the plurality of nodes to a sub-plurality of receiving nodes within the plurality of nodes; receiving a plurality of response signals from the sub-plurality of receiving nodes wherein each response signal includes a bit-loading modulation scheme determined by a corresponding receiving node; and determining the common bit-loading modulation scheme from the received plurality of response signals; receiving the probe signal at one receiving node of the plurality of receiving nodes through a channel path of transmission; determining the transmission characteristics of the channel path at the one receiving node; and transmitting a response signal from the one receiving node to the transmitting node, wherein the transmission characteristics of the channel path are determined by measuring the signal-to-noise (“SNR”) characteristics of the received probe signal at the one receiving node and wherein determining a common bit-loading modulation scheme includes: comparing a plurality of bit-loading modulation schemes from the corresponding received plurality of response signals; and determining the common bit-loading modulation scheme in response to comparing the plurality of bit-loaded modulation schemes. |
| US10257566B2 - Broadband cable networks for controlling node admission Admission control procedures ensure secure and efficient node integration into coaxial networks. Probing communication links optimizes transmission parameters for new nodes. Dynamic adjustments enhance network reliability. | 1. A communication circuit comprising: a transceiver operable to communicate in a coaxial cable network (CCN); a controller that is operable to, at least: transmit first information on the CCN, the first information comprising information indicating when admission messages for requesting admission to the CCN may be transmitted on the CCN; receive an admission request message from a new node for admission to the CCN; if the received admission request message is correctly received and the new node is authorized to join the CCN, then perform an admission procedure with the new node; probe a communication link of the CCN connecting the communication circuit to the new node; and adapt transmission parameters for the communication link based, at least in part, on the probe. |
| US9838213B2 - Low-cost and high-speed resource management in networks Guaranteed quality of service flows ensure efficient resource allocation in networks. Dynamic bandwidth adjustments optimize data rates for successful communication. Network coordination enhances overall system performance. | 1. A communication method implemented in a Network Coordinator (NC) node of a communication network of a premises, the method comprising: broadcasting to a plurality of nodes of the network, a request for a guaranteed quality of service flow in the network from a source node to at least one egress node, the plurality of nodes of the network to which the NC node broadcasts the request including at least the source node and the at least one egress node; receiving a first response to the request from the source node, wherein the source node is the point of origin for the purposes of the guaranteed quality of service flow for data to be communicated within the guaranteed quality of service flow, the first response indicating whether the source node has available resources to support the guaranteed quality of service flow; receiving a second response to the request from the at least one egress node indicating whether the at least one egress node has available resources to support the guaranteed quality of service flow; and if the source node and the at least one egress node have available resources to support the guaranteed quality of service flow, then allocating resources for the guaranteed quality of service flow; if the source node and the at least one egress node do not have available resources to support the guaranteed quality of service flow, then: denying the guaranteed quality of service flow; and if the guaranteed quality of service flow is denied based on bandwidth-related reasons, then determining a maximum data rate that would have resulted in a successful request for a guaranteed quality of service flow, and transmitting a message comprising information describing the maximum data rate that would have resulted in a successful request for a guaranteed quality of service flow. |
| US10432422B2 - Resource allocation for guaranteed quality of service flows Aggregated lists of service flows streamline resource allocation in networks. Dynamic querying ensures efficient communication between nodes. Network coordination enhances service reliability. | 1. A communication network comprising: a requesting node; a Network Coordinator (NC) node; and a plurality of requested nodes, wherein: the requesting node is operable to, at least, communicate a first message to the NC node requesting a list comprising parameterized quality of service (PQoS) flows of the communication network; and the NC node is operable to, at least: receive the first message from the requesting node; and in response to the received first message: communicate a second message to each requested node of the plurality of requested nodes, the second message requesting from said each requested node a list identifying PQoS flows for which said each requested node is an ingress node; receive, from said each requested node a respective third message comprising a list identifying PQoS flows for which said each requested node is an ingress node; form an aggregated list of PQoS flows comprising each respective list identifying PQoS flows from each received third message; and communicate a fourth message to at least the requesting node comprising the aggregated list, wherein the second message specifies a range of PQoS flows being queried. |
| US8228910B2 - Transmitting data over a network with packet aggregation Packet aggregation enhances data transmission efficiency by combining packets with similar identifiers. Checksum validation ensures data integrity during transmission. Streamlined communication reduces network overhead. | 1. A method of transmitting digital data over a network comprising: receiving a plurality of packet data units; identifying at least two of the plurality of packet data units that have a same aggregation identifier; forming an aggregate packet from the at least two of the plurality of packet data units; and transmitting the aggregate packet to at least one destination node; wherein the aggregate packet comprises an aggregation header that comprises a number of packet data units in the aggregate packet, further comprising: determining the presence of a checksum bit in a media access control header; calculating a first checksum for the aggregation header; comparing the first checksum to a second checksum that is received in the aggregation header of the aggregate packet; receiving the aggregate packet, wherein the aggregate packet comprises the media access control header; determining the presence of an original frame check sequence bit in the media access control header; and passing the at least two of the plurality of packet data units to a device without modifying frame check sequences if the second checksum is found to be correct. |
| US8320566B2 - OFDMA mode for multiple transmitting network devices Constellation scrambling enables synchronized transmissions from multiple devices. OFDMA mode optimizes subcarrier allocation for efficient communication. Single descrambling simplifies receiver operations. | 1. A method for communications transmission using orthogonal frequency division multiple access on a network comprising: a) providing a plurality of transmitting network devices with a set of available subcarriers for orthogonal frequency division multiple access; b) providing a corresponding element of a pseudorandom noise sequence for each subcarrier of the set of available subcarriers; c) allocating a subset of the set of available subcarriers to each of the transmitting network devices; d) a transmitting network device of the plurality of devices mapping a packet onto a plurality of used subcarriers of its allocated subset of available subcarriers, wherein the step of mapping the packet comprises mapping the packet onto a plurality of quadrature amplitude modulated symbols to be transmitted on the used subcarriers; e) the transmitting network device performing a predetermined transformation on a quadrature amplitude modulated symbol using the element of the pseudorandom noise sequence corresponding to the used subcarrier; f) the transmitting network device transmitting the transformed symbol to a receiving network device. |
| US8363681B2 - Improving clock synchronization in communication networks Ranging methods improve clock synchronization between network nodes. Propagation delay adjustments ensure accurate timekeeping. Enhanced synchronization boosts network efficiency. | 1. A method for synchronizing a plurality of nodes on a communication network, comprising: exchanging a local clock time between a first node and a second node over the communication network, wherein the exchange comprises: transmitting a first packet from the first node to the second node, wherein the first packet includes a first packet clock time set to the local clock time of the first node at transmission time, and includes a scheduled arrival clock time, and setting the local clock time of the second node to the first packet clock time; performing a ranging method between the first and second nodes based on the local clock time exchanged, wherein the ranging method results in an estimated propagation delay between the first and second node, and wherein the ranging method comprises: transmitting a second packet from the second node to the first node, wherein the second packet is transmitted from the second node at the scheduled arrival clock time, and wherein the second packet is received by the first node at an actual arrival clock time, calculating and storing the estimated propagation delay at the first node, wherein calculating the estimated propagation delay is based on the scheduled arrival clock time and the actual arrival time, and transmitting a third packet from the first node to the second node, wherein the third packet comprises the estimated propagation delay; and adjusting the local clock time of either the first or second node based on the estimated propagation delay, thereby resulting in a synchronized local clock time between the first and second node. |
