US 7,333,511 Dynamically channelizable packet transport network
3 defendants · 3 suits · updated October 6, 2026
Also cited as U.S. Patent No. 7,333,511 · US7333511B2 · US 7,333,511 B2 · 7333511 · the '511 patent
Optimum Communications Services, Inc. has filed 3 patent-infringement suits on US 7,333,511, "Dynamically channelizable packet transport network" since July 16, 2026, all in the D. Del., against 3 distinct defendants including Northwest Fiber, LLC, Cogeco US Finance, LLC and Connect Holding II LLC. The patent is held by Optimum Communications Services Inc A Delaware Corp and was granted February 19, 2008 on a priority date of August 29, 2002. Its abstract opens: "A communications network for transporting data packets among L2/L3 nodes based on dynamically L1-channelizable multi-source buses." The examiner cited 6 references during prosecution.
- Assignee
- Optimum Communications Services Inc A Delaware Corp
- Priority date
- August 29, 2002
- Granted
- February 19, 2008
- Expires
- August 29, 2022
- Status
- Expired - Lifetime
- Claims
- 41 (3 independent)
- Inventors
- Mark Henrik Sandstrom
- Full text
- Google Patents
The suits
3 cases · D. Del. (3)
| Filed | Defendant | Plaintiff | Court | Docket |
|---|---|---|---|---|
| 2026-07-16 | Northwest Fiber, LLC | Optimum Communications Services, Inc. | D. Del. | 1:26-cv-00869 |
| 2026-07-20 | Cogeco US Finance, LLC | Optimum Communications Services, Inc. | D. Del. | 1:26-cv-00884 |
| 2026-07-22 | Connect Holding II LLC | Optimum Communications Services, Inc. | D. Del. | 1:26-cv-00897 |
Docket links open the public record on CourtListener. Filing dates are the complaint's.
Independent claims
What is actually asserted, verbatim.
1. A network system for maximizing its data throughput by adjusting its connection capacities according to their capacity demand variations, the network system comprising: a set of nodes including one or more source nodes and a destination node, each source node having a capacity demand figure toward the destination node, a logical data transport bus, referred to as a bus, configured to transfer data packets from the source nodes to the destination node, the bus having an aggregate capacity that can be channelized to source node specific connections, which have an adjustable data transport capacity and each of which transports data packets from its source node to the destination node without packet-layer processing in between its source node and the destination node, and digital logic at the destination node configured to allocate the aggregate capacity of the bus among its source nodes by adjusting the capacities of the source node specific connections on the bus at least in part based on the capacity demand figures from the source nodes toward the destination node of the network system.
20. A method for allocating a total data transport bandwidth on a data packet transport bus referred to as a bus, said bus having two or more data sources and a destination, said bus further providing source-specific variable-bandwidth channels from the individual sources of the bus to the destination of the bus for transporting data packets from the individual sources to the destination of the bus, the sources of the bus having their associated data traffic loads toward the destination of the bus, the method executed periodically once per a period of time referred to as an algorithm period, the method comprising: allocating, by the destination of the bus, said total bus bandwidth among said individual sources based at least in part on the traffic loads associated with the individual sources of the bus, assigning, by the destination of the bus, units of bus bandwidth for the source-specific channels on the bus according to the allocating of the bus bandwidth, and transporting data packets over the bus from the source nodes to the destination node based on the assigning of units of bus bandwidth for the source-specific channels.
29. A process for optimizing capacity allocation within a data transport network system referred to as a network system, the network system comprising a set of ingress interfaces, an egress interface, and a capacity pool for transporting data packets from the set of ingress interfaces to the egress interface of the network system, the process having a repeating process cycle, each process cycle comprising the steps: optimizing, by the egress interface, allocation of said capacity pool among the individual ingress interfaces for transport of data packets from the ingress interfaces to the egress interface based at least in part on demand for network capacity by the individual ingress interfaces for transporting data from them to the egress interface of the network system, assigning, by the egress interface, units of capacity within said capacity pool to said individual ingress interfaces according to the optimizing of capacity allocation, and transporting data packets from the ingress interfaces nodes to the egress interface based on the assigning of units of capacity within said capacity pool.
Art before the examiner
18 references of record, 6 cited by the examiner.
Everything listed here was before the Office and is what a challenge must go beyond. Art the examiner never saw is where an invalidity search starts.
Examiner-cited
- US4587651A — Distributed variable bandwidth switch for voice, data, and image communications (Cxc Corporation)
- US6108306A — Apparatus and method in a network switch for dynamically allocating bandwidth in ethernet workgroup switches (Advanced Micro Devices, Inc.)
- US6157656A — Method and arrangement for dynamic signalling (Net Insight Ab)
- US6697373B1 — Automatic method for dynamically matching the capacities of connections in a SDH/SONET network combined with fair sharing of network resources (Mark Henrik Sandstrom)
- US6813277B2 — Method and apparatus enabling multiple access on a broadband communication network (Lucent Technologies Inc.)
- US6826160B1 — Dynamic bandwidth allocation through multi-channel time slot assignment and migration for broadband access (3Com Corporation)
Applicant-cited and other (12)
- US6195332B1 — Rate-based flow control protocol on an ethernet-over-ring communications network
- US6246692B1 — Packet switching fabric using the segmented ring with resource reservation control
- US6542511B1 — Programmable transport and network architecture
- US6556548B1 — Method of allocating resources in a telecommunications network
- US6631128B1 — Core network optimization of topology and technology for traffic handling
- US6667956B2 — Multi-class network
- US6741572B1 — Architectures for communication networks
- US20050174948A1 — Received path trace detection apparatus
- US6973504B2 — Method for allocating network aggregation bandwidth and a network system using the same
- US7042892B2 — Voice-over IP communication without echo cancellation
- US20060182144A1 — Backplane bus
- US20070053369A1 — System apparatus and method for interconnecting TDM and frame/packet communication networks
Classification
- H04L12/40169primary — Flexible bus arrangements
- H04L12/417 — Bus networks with decentralised control with deterministic access, e.g. token passing
Family
- US7333511B2 — B2 (2008)
- US20040042495A1 — A1 (2004)
Abstract
A communications network for transporting data packets among L2/L3 nodes based on dynamically L1-channelizable multi-source buses. The dynamic channelization of a packet transport bus among source-node-specific L1 connections is managed by a bus control process, which periodically optimizes the allocation of bus capacity pool among the source nodes based on real-time bus capacity demand figures by the source nodes of the bus. The invention provides means for real-time dynamic, traffic load adaptive allocation of transport network capacity to continuously maximize the data throughput of the transport network for dynamic packet traffic, such as Internet traffic.
Also asserted by Optimum Communications Services, Inc.
- US 10,567,474 — Direct binary file transfer based network management system free of messaging, commands and data format conversions (3 defendants)
- US 10,848,546 — Direct binary file transfer based network management system free of messaging, commands and data format conversions (3 defendants)
- US 7,558,260 — Byte-timeslot-synchronous, dynamically switched multi-source-node data transport bus system (3 defendants)
Named in one of these suits? A prior-art search is commissioned once and serves every defendant who shares it. The examiner's own search record is free on the tools page, and your first preliminary search is free — one claim, back within 24 hours — so you know whether there is art the Office never saw before anyone pays for more. Flat fees: $2,500$899 for the independent claims, $5,000$1,500 for every asserted claim.
This page is assembled from public records — federal court dockets and the patent's own file — and is updated as the case list changes. It states what the record shows and is not an opinion on the validity or infringement of any claim. Patent data via Google Patents; docket data via CourtListener.