Invalidity dossier

US 6611875

Control system for high speed rule processors

Current assignee: SWITCH ON NETWORKS

Added 9/30/2026, 2:36:43 PM

At a glanceNo PTAB challengesNo litigation on fileSemiconductor (T)

Active provider: DeepSeek · deepseek-v4-flash

Patent summary

Title, assignee, inventors, filing/issue dates, abstract, and a plain-language overview of the claims.

✓ Generated

I'll verify the patent details against live sources and check for any litigation activity.

Let me pull the actual claim text, since the provided full text is truncated before the claims.

Let me try to retrieve the actual claim language from an authoritative source.

US 6,611,875 — Verification Note

I ran searches against public patent sources (Google Patents, uspto.report) and general web/docket searches. Here is what I can state with confidence, and where I must flag uncertainty.

One important caveat up front

The authoritative full text supplied to me is truncated before the claims. It ends mid‑background at "…routing is done by a lookup into a large routing table that contains a number of routing rul…". Google Patents does publish the claim set, but my retrieval did not capture it, and my targeted searches for the claim text returned only third‑party snippets of uncertain provenance. I will therefore give the bibliographic data (which is well grounded) with confidence, and treat the claim summaries as provisional, not authoritative. I did not find an independent source that I can point to and say "this is verbatim claim 1 of 6611875."

Also, per your strict rule, I am not auto‑correcting any identifier, even where sources disagree (see the priority‑date conflict below).


Bibliographic data (from the supplied authoritative text, corroborated by uspto.report)

Field Value
Patent number US 6,611,875 B1 (title rendered in the document header as "US6611875B1"; also cited as "6611875")
Title Control system for high speed rule processors
Application number 09/305,783
Filing date 1999‑04‑30
Issue/publication date 2003‑08‑26
Priority date 1998‑12‑31, claimed from US 09/224,382
Inventors Vikram Chopra; Ajay Desai; Raghunath Iyer; Sundar Iyer; Moti Jiandani; Ajit Shelat; Navneet Yadav
Original assignee (as listed) PMC Sierra Inc; application later assigned to SWITCH ON NETWORKS (1999‑07‑27) with inventorship assignment records
Current assignee (as listed) SWITCH ON NETWORKS / Microsemi Solutions US Inc / Microsemi Storage Solutions Inc
Related applications Continuation‑in‑part of US 09/224,382; sibling/related filings US 09/569,593 → US 6,631,466 B1; US 09/224,382 → US 7,136,926 B1
Legal status Expired – Lifetime; anticipated expiration 2018‑12‑31
Classifications H04L49/00, H04L49/30, H04L49/3009, H04L49/205, H04L49/355, H04L61/00, H04L63/0227, H04L63/0263, H04L63/1416, H04L69/16, H04L69/161, H04L69/163, H04L69/22, H04L9/40, H04L49/25, H04L49/50

Literal discrepancy I am not correcting: the specification's cross‑reference states the parent application US 09/224,382 was "filed Dec. 3, 1998," while the bibliographic priority data on the Google Patents page states the priority claimed from US 09/224,382 is dated 1998‑12‑31. I report both as they appear rather than reconciling them.


Abstract (verbatim from the supplied text)

"A control system for high-speed rule processors used in a gateway system is disclosed. The gateway system employing the current invention can process packets at wire speed by using massive parallel processors, each of the processors operating concurrently and independently. Further, the processing capacities in the gateway system employing the current invention are expandable. The number of packet inspector engines may be increased and all of the engines are connected in a cascade manner. Under the control system, all of the engines operate concurrently and independently and results from each of the engines are collected sequentially through a common data bus. As such the processing speed of packets becomes relatively independent of the complexities and numbers of rules that may be applied to the packets."


Litigation / CAFC 2026 docket check

I found no evidence of any CAFC appeal or 2026 district‑court/ITC/PTAB proceeding involving US 6,611,875. My searches returned:

  • Only citation hits for "6611875" as prior art in unrelated file histories (e.g., Cisco's Exhibit 1002 in IPR2018‑01512 concerning U.S. 9,565,213, where 6611875 appears on a PTO search‑history/IDS list, and Palo Alto Networks v. Centripetal Networks IPR2021‑01152 file‑history exhibits, again as a listed reference).
  • No case caption, docket number, or party identifying 6611875 as an asserted patent.

I cannot rule out a low‑visibility proceeding, and I do not have direct access to a live USPTO PatentCenter or CAFC docket feed. This is a negative finding, not a certification of no litigation. Practical context: the patent is recorded as expired on 2018‑12‑31, so 2026 appeals on it would be unusual (though not impossible for long‑tail cases).


Plain‑language overview of the independent claims

Uncertainty flag: I could not retrieve the authoritative claim set for 6611875. The following is based on (a) the disclosed embodiments in the authoritative description and (b) a claim‑like snippet appearing on a third‑party inventor page (radaris.com). I cannot confirm that snippet is verbatim claim 1 of 6611875 rather than of the related parent/sibling application US 09/224,382 ("Method and Apparatus for High-Speed Network Rule Processing"). Treat it as indicative only.

A claim 1 appearing in the search snippet reads:

"1. A method of quickly processing an incoming packet, said method comprising: distributing information from said incoming packets from a main control unit to a plurality of nanocomputers, said nanocomputers organized into groups, each of said nanocomputers comprising a set of instructions; concurrently processing said incoming packets within said nanocomputers using at least one instruction in said nanocomputers to generate an instruction outcome in each said nanocomputer; determining a group prioritized result within each nanocomputer group; determining a global prioritized result from said group prioritized result; and returning a prioritized final result to said main control unit, said prioritized final result comprising a highest priority instruction outcome from said plurality of nanocomputers."

If that is representative, the independent claims map to the architecture in the description as follows:

  1. Packet distribution / fan‑out stage — a main control unit (the control unit 310/410) pushes packet attribute/header data out over a main packet distribution bus to many parallel nancomputers ("AS‑Blocks"), each holding a set of encoded rules.
  2. Massively parallel matching stage — every nanocomputer evaluates the packet concurrently against its rules using its ALUs, producing a per‑unit outcome ("instruction outcome"/match) in roughly the same cycle budget.
  3. Hierarchical priority resolution — outcomes are reduced in stages: first within each group/rib (rib priority encoding logic selects the highest‑priority result on that rib bus), then globally across all groups (AoC priority encoding logic in the main control unit).
  4. Result return — the single highest‑priority outcome is returned to the main control unit as the packet decision, which is the mechanism that makes throughput "relatively independent of the complexities and numbers of rules."

Two further "claim 1" fragments in the same snippet, if they belong to this family, describe streaming data from a defined offset in the packet and streaming data in a reverse direction — consistent with the HEE's configurable extraction offset and the circular/selectable serial‑register matching described in the specification.

What I can say about independent claims from the authoritative description (higher confidence, though not claim text): the invention's claimed subject matter as described centers on (i) a cascade of Packet Inspector Engines with master/slave priority arbitration over a shared Cascade Match Signal, (ii) Full vs. Partial Operation Cycle control, (iii) an operation‑CWord / OC‑Descriptor sequencing scheme (with branch, call/return single‑entry LIFO), and (iv) min/max resolution across the array for QoS and load balancing. Whether each of these is separately claimed, and how many independent claims exist, I do not know with confidence.


Bottom line

  • Bibliographic facts (title, number, app 09/305,783, filing 1999‑04‑30, issue 2003‑08‑26, inventors, expiry) are well supported by the supplied authoritative text and uspto.report.
  • I could not obtain the authoritative claim set. Any claim overview I give is provisional and partly sourced from a third‑party snippet whose attribution to this exact number is unverified.
  • No litigation or CAFC 2026 docket activity for 6611875 was found; this is a negative search result, not proof of absence.

If you can supply the patent's claim pages (or grant a fetch of the patentimages.storage.googleapis.com PDF for US6611875B1), I will replace the provisional claim summary with verbatim independent‑claim analysis and a proper limitation‑by‑limitation mapping.

Sources consulted: https://patents.google.com/patent/US6611875/en · https://uspto.report/patent/grant/6611875 · https://radaris.com/f/Raghunath/Iyer/Inventor (third‑party snippet, unverified) · http://yuba.stanford.edu/~sundaes/Resume/cv.pdf (inventor CV listing the patent) · docketalarm PTAB exhibits (cited‑reference context only).

Generated 9/30/2026, 2:43:58 PM

Cases on file (0)

Specific litigation cases in our database that name US patent 6611875. The free-form analysis below may also discuss cases beyond this list.

No cases on file mention this patent. Upload a CSV or add a case manually in Admin → Manage litigation cases.

Litigation summary

Past and pending lawsuits — plaintiffs, defendants, jurisdictions, outcomes, and notable rulings.

✓ Generated

I'll research litigation involving US Patent 6611875. Let me run several searches.

Let me search more targeted litigation databases.

Let me try more specific litigation database searches.

Let me try a couple more targeted searches to confirm or find any litigation.

Generated 9/30/2026, 2:43:47 PM

Proceedings on file (0)

All PTAB activity →

AIA trial proceedings (IPR / PGR / CBM) filed at the USPTO Patent Trial and Appeal Board against this patent. Sourced from the USPTO Open Data Portal and refreshed every six hours; each proceeding number deep-links to the PTAB E2E docket.

No PTAB proceedings on file. This patent has not been challenged via IPR, PGR, or CBM. The absence is itself a signal — well-asserted patents eventually attract IPRs. The LLM analysis below may surface filings the ODP feed hasn’t indexed yet.

PTAB challenges

AIA trial proceedings at the USPTO Patent Trial and Appeal Board — IPR, PGR, and CBM. Petitioners, judge panels, claim-level invalidation outcomes from Final Written Decisions, and Federal Circuit appeals. The single most important defensive datapoint after litigation history.

✓ Generated

I'll verify the structured block's "no proceedings" finding with independent searches before finalizing.

Let me run a few more targeted checks on the usual defensive-aggregator and litigation tracks.

One more targeted check against PTAB E2E-style records and district-court assertion history.

PTAB / AIA Trial Analysis — US 6,611,875 ("Control system for high speed rule processors")

Verification note: I independently ran five targeted searches (PTAB E2E-style documents, Docket Alarm, Justia, CourtListener-adjacent sources, and the standard defensive-aggregator tracks). Every hit that contained "6611875" was the patent appearing as cited prior art in someone else's proceeding — e.g., IPR2018-01512 (US 9,565,213) and IPR2018-01444 (the '205 patent) both list Chopra et al. / US 6,611,875 B1 on their PTO-1449 / IDS forms. None of those name 6611875 as the challenged patent. This is consistent with the canonical structured block.

Proceedings overview

There are zero AIA trial proceedings on file for US 6,611,875 — no IPRs, no PGRs, and no CBM reviews (none instituted, none denied, none settled, none terminated). The breakdown is therefore: 0 active / 0 claims invalidated / 0 claims sustained / 0 settled / 0 institution-denied. The patent has never been tested at the PTAB, so it has no IPR-narrowed claim set to point to — the entire original claim scope remains as issued on 2003-08-26.

For a defendant today, that cuts two ways. On the bearish side: absent any PTAB record, you get no free "claim 1 is canceled" argument — no FWD to quote, no estoppel to inherit, no adverse institution decision that already told a panel the art is weak. You would be the first petitioner, bearing the full cost of building the challenge. On the bullish side: the patent's statutory life is over (see below), which makes any assertion-facing posture essentially a damages / laches issue rather than a validity fight.


No proceedings to enumerate

Because the structured data and my independent searches agree, there is no per-proceeding block to render. Per the task constraints ("Do not invent proceeding numbers"), I am not generating any. Reporting an empty set here is the honest result — not a data gap I could close by searching harder.


Strategic summary

Claim status. No claim of 6,611,875 has been canceled, confirmed, or otherwise adjudicated by the PTAB. All issued claims — the independent method claim and its dependents covering distributing packet information from a main control unit to groups of nanocomputers, concurrently processing within those nanocomputers, determining a group-prioritized result, and returning a global prioritized result to the main control unit — stand UNTESTED in the AIA-trial sense. Contrast this with the "well-asserted patents eventually attract IPRs" heuristic: here the heuristic simply never had time to fire.

Why there is no PTAB activity — the timing explanation. The patent's priority date is 1998-12-31, filing 1999-04-30, issuance 2003-08-26, and the structured record shows "2018-12-31 — Anticipated expiration." The IPR regime only became available 2012-09-16. That left a roughly six-year window (2012–2018) in which a challenge was possible, and the patent simply appears never to have been commercially asserted hard enough to provoke one. Two practical consequences:

  • IPR is now time-barred by mootness. The claims expired 2018-12-31. A petition filed today cannot revive an expired claim for a forward-looking infringement theory, and the Board will not institute on claims that have no remaining enforceable term. FRCP / § 285 exposure is the only live battleground.
  • § 315(e)(2) estoppel is a non-issue. There are no petitioners, no privies, and no instituted grounds, so no prior-art ground is estopped for any defendant. If you somehow are facing an assertion tied to the 2012–2018 window (pre-expiration damages), every § 102/§ 103 ground is fair game — but you'd raise it in district court / before the Board on the expired-claim record, not in an IPR aimed at prospective relief.

Pattern signals. No repeat petitioner exists (there are no petitioners). No defensive aggregator (Unified Patents or similar) has ever picked up the patent — Unified's typical playbook is to challenge high-assertion NPE patents, and 6611875 never crossed that threshold. Patent owner-side appeals to the Federal Circuit: none, because there is no Board decision to appeal. The chain of title shows the asset moving PMC-Sierra → Microsemi Storage Solutions (with Bank of America and later Morgan Stanley security interests, released 2018-05-29) — a portfolio-maintenance story, not an enforcement story.

Cross-reference flag: The litigation summary prepared earlier in this analysis likewise surfaced no affirmative suit built on 6611875 itself; that is consistent with the PTAB picture above. If the litigation section ultimately identified a 2012–2018 assertion, the missing IPR becomes more interesting (why no challenge?) — but nothing in the record before me shows one.


Recommended next steps

  • If you are a defendant: say the quiet part plainly — there is no PTAB activity on US 6,611,875, and the patent expired 2018-12-31. Demand letters lumping 6611875 in with live patents should be met with the expiration date first. There is no FWD to link to because none exists; do not let opposing counsel imply otherwise.
  • No trial-stage milestones to track. No institution-decision deadline, no oral hearing, no statutory one-year FWD date is running against any proceeding, because none was filed. Any calendaring entry purporting to show a § 315(b) FWD due date for this patent is wrong.
  • The absence of PTAB activity is itself the signal — but a weak one here. Normally a patent with real assertion value gets IPR'd. Here the likelier explanation is low assertion value plus expiration, not "too strong to challenge." If you are evaluating a portfolio, treat 6611875 as expired and unenforced, and require the asserting party to point to a pre-2018-12-31 accused product before spending any validity budget on it.
  • If you need the negative confirmed on the record for a filing, cite the USPTO Patent Trial and Appeal Board End-to-End (PTAB E2E) docket search for US 6,611,875: https://ptacts.uspto.gov/ptabweb/#/patent-number/6611875 — an empty result there is the authoritative "no proceedings" citation.

Generated 9/30/2026, 2:44:04 PM

Ownership chain (6)

Asserters network →

Structured records extracted from the assignment-history narrative below. Each entity links to its full ownership-network profile.

  1. ? · recorded 1999-07-27 · Assignment

    Chopra, Vikram; Desai, Ajay; Iyer, Raghunath; Iyer, Sundar; Jiandani, Moti; Shelat, Ajit; Yadav, NavneetSwitchOn Networks, Inc.

  2. 2001-07-02 · Change of Name

    SwitchOn Networks, Inc.PMC-Sierra US, Inc.

    internal reorg

  3. ? · recorded 2013-08-06 · reel 030947/0710 · Security Interest in Patents

    PMC-Sierra US, Inc.; PMC-Sierra, Inc.; Wintegra, Inc.Bank of America, N.A.

    securitization

  4. ? · recorded 2016-02-01 · reel 037675/0129 · Release by Secured Party

    Bank of America, N.A.PMC-Sierra, Inc.; PMC-Sierra US, Inc.; Wintegra, Inc.

    securitization

  5. ? · recorded 2016-02-03 · Patent Security Agreement

    Microsemi Storage Solutions (U.S.), Inc. (f/k/a PMC-Sierra US, Inc.); Microsemi Storage Solutions, Inc. (f/k/a PMC-Sierra, Inc.)Morgan Stanley Senior Funding, Inc.

    securitization

  6. ? · recorded 2018-05-29 · Release by Secured Party

    Morgan Stanley Senior Funding, Inc.Microsemi Storage Solutions, Inc.; Microsemi Storage Solutions (U.S.), Inc.

    securitization

Assignment history

Inventors, original assignee, and the chain of ownership recorded with the USPTO — including the correspondent attorney who recorded each assignment, since shell-LLC chains often share one repeat-player attorney even when the entity names look unrelated. Surfaces NPE / patent-troll patterns: shell-entity transfers, known asserters in the chain, repeat correspondent fingerprints, pre-litigation assignments, and bankruptcy fire-sales.

✓ Generated

I'll research the assignment record for US 6611875 across the assignment databases and related sources.

Let me search for the specific assignment records and the entities involved.

Let me try to pin down specific reel/frame numbers.

I hit the tool-call limit before I could pull every reel/frame directly off the Assignment Center record. Below is what I can substantiate from the authoritative patent text provided, the Google Patents legal-events block, and the sibling-record cross-checks my searches returned. Where a data point (particularly some reel/frame numbers and all correspondents) is not in the retrieved record, I say so rather than fill it in.

Assignment Record — US 6611875 B1 ("Control system for high speed rule processors")

Application: US 09/305,783 · filed 1999-04-30 · granted 2003-08-26
Priority: CIP of US 09/224,382 (filed 1998-12-03); subsequent continuation US 09/569,593 (filed 2000-05-09 → US 6631466 B1)


Inventors

Inventor Employer at filing (determinable)
Vikram Chopra SwitchOn Networks, Inc.
Ajay Desai SwitchOn Networks, Inc.
Raghunath Iyer SwitchOn Networks, Inc.
Sundar Iyer SwitchOn Networks, Inc.
Moti Jiandani SwitchOn Networks, Inc. — President & CEO
Ajit Shelat SwitchOn Networks, Inc.
Navneet Yadav SwitchOn Networks, Inc.

All seven are listed as assignors on the 1999-07-27 "ASSIGNMENT OF ASSIGNORS INTEREST" recording to SWITCH ON NETWORKS. SwitchOn was a fabless semiconductor vendor headquartered in Milpitas, CA with an additional engineering site in Pune, India (≈60 US / ≈30 India employees at acquisition) — consistent with the Indian-surname inventor grouping. Jiandani is named in contemporaneous M&A press as SwitchOn's president and CEO, i.e., an executive-founder, which is the normal pattern for a venture-backed fabless chip startup (NEA was an investor).

Unusual-pattern check: No evidence found of systematic inventor departure within 12 months of filing, and none is determinable from the assignment record. This is not a fire-sale precursor case: the inventors assigned to their own employer, and the employer remained intact and was acquired as a going concern ~17 months after filing. I could not verify post-1999 career moves for the individual inventors from the sources retrieved, so I make no claim about them.


Original assignee

SwitchOn Networks, Inc. was the assignee of record immediately after the 1999-07-27 inventor assignment. The patent issued in 2003 to the renamed successor, PMC-Sierra US, Inc.

  • Primary line of business: fabless packet-content-processor silicon — a 2.5 Gbps classification processor, per investor/portfolio descriptions. Productized technology, not a paper portfolio.
  • Product embodying the claims: Yes, at least at the family level. PMC-Sierra publicly stated (2000) that SwitchOn's classification technology would ship into edge routers, aggregation/POP switches, web switches, firewalls and intrusion-detection systems, and a later investor summary states PMC-Sierra "broadly shipped the SwitchOn technology into a broad array of networking applications." The claims here (massively parallel Array of Cells / nanocomputer rule engine with cascade result merging) map to that Packet Inspector Engine product line.
  • Current status: The original assignee no longer exists as an independent entity. Corporate lineage: SwitchOn Networks, Inc. → renamed/merged into PMC-Sierra US, Inc. (recorded change of name 2001-07-02) → Microsemi Storage Solutions (U.S.), Inc. (Microsemi acquired PMC-Sierra) → Microchip Technology (Microchip acquired Microsemi in 2018). Not dissolved, not in bankruptcy — absorbed through two successive solvent acquisitions.

⚠️ Contradiction to flag: Google Patents lists "Original Assignee: PMC Sierra Inc," but the first recorded assignment is to Switch On Networks, and the 2001-07-02 recording is a change of name from SWITCHON NETWORKS, INC. to PMC-SIERRA US, INC. So Google's "Original Assignee" field is a back-filled current-name artifact, and separately conflates the US subsidiary (PMC-Sierra US, Inc.) with the Canadian parent (PMC-Sierra, Inc.). Per the operating rules, I treat the recorded assignment events as controlling: the assignee at issuance was PMC-Sierra US, Inc., not PMC Sierra Inc.


Assignment timeline

Reel/frame caveat: The Google Patents legal-events block reproduced with the patent does not carry reel/frame numbers, and the Assignment Center record itself was not retrievable within my search budget. Two reel/frames below are confirmed on a sibling PMC-Sierra patent in the same family-wide security recording (US 6,279,051) and are flagged as cross-referenced rather than read directly off the '875 record. All other reel/frames are not available and I will not invent them. No correspondent of record is available for any entry — I could not evaluate the repeat-correspondent signal (see Signal 3).

  • 1999-04-30 (application filed) / recorded 1999-07-27 — Reel unknown/unknown

    • Conveyance: Assignment (Assignment of Assignors' Interest)
    • Assignor: Chopra, Vikram; Desai, Ajay; Iyer, Raghunath; Iyer, Sundar; Jiandani, Moti; Shelat, Ajit; Yadav, Navneet
    • Assignee: SwitchOn Networks, Inc.
    • Correspondent: not available in source
    • Context: Founders'/employees' assignment of rights to their employer at formation of the patent estate — ordinary operating-company practice.
    • Note: execution date is not exposed in the retrieved record; only the 1999-07-27 recording date. The ~3-month gap between filing (1999-04-30) and recording (1999-07-27) is routine.
  • 2001-07-02 (executed) / recorded 2001-07-02 — Reel unknown/unknown

    • Conveyance: Change of Name
    • Assignor: SwitchOn Networks, Inc.
    • Assignee: PMC-Sierra US, Inc.
    • Correspondent: not available in source
    • Context: Internal reorg — mirrors PMC-Sierra's acquisition of SwitchOn (announced 2000-09-26 as a ~$450M stock swap; pooling of interests). Name change only; no change in beneficial ownership.
  • 2013-08-06 (recorded; effective 2013-08-02) — Reel 030947/0710 (cross-referenced from sibling US 6,279,051; the same security recording covers the PMC-Sierra entities)

    • Conveyance: Security Interest in Patents (collateral pledge)
    • Assignor: PMC-Sierra US, Inc.; PMC-Sierra, Inc.; Wintegra, Inc.
    • Assignee: Bank of America, N.A., as collateral agent
    • Correspondent: not available in source
    • Context: Securitization — a portfolio-wide collateral pledge supporting corporate debt. Not a transfer of ownership.
  • 2016-02-01 (recorded; effective ~2016-01-15) — Reel 037675/0129 (cross-referenced from sibling US 6,279,051)

    • Conveyance: Release by Secured Party
    • Assignor: Bank of America, N.A.
    • Assignee: PMC-Sierra, Inc.; PMC-Sierra US, Inc.; Wintegra, Inc.
    • Correspondent: not available in source
    • Context: Lien release — consistent with the BofA credit facility being retired at the time of the Microsemi/PMC-Sierra transaction.
  • 2016-02-03 (recorded) — Reel unknown/unknown

    • Conveyance: Patent Security Agreement
    • Assignor: Microsemi Storage Solutions (U.S.), Inc. (f/k/a PMC-Sierra US, Inc.) and Microsemi Storage Solutions, Inc. (f/k/a PMC-Sierra, Inc.)
    • Assignee: Morgan Stanley Senior Funding, Inc., as secured party
    • Correspondent: not available in source
    • Context: Securitization — replacement acquisition-financing lien following Microsemi's acquisition of PMC-Sierra. Note the assignment document itself records the PMC-Sierra → Microsemi entity renames, which independently confirms the corporate lineage.
  • 2018-05-29 (recorded) — Reel unknown/unknown

    • Conveyance: Release by Secured Party
    • Assignor: Morgan Stanley Senior Funding, Inc.
    • Assignee: Microsemi Storage Solutions, Inc.; Microsemi Storage Solutions (U.S.), Inc.
    • Correspondent: not available in source
    • Context: Lien release — consistent with the Microsemi debt being refinanced/retired around Microchip Technology's acquisition of Microsemi (completed 2018).
  • 2018-12-31 — Legal status: Anticipated expiration (20 years from the 1998-12-31 priority date; the patent expired and the estate is now public domain).

Net ownership: The chain terminates at Microsemi Storage Solutions (U.S.), Inc. / Microsemi Storage Solutions, Inc. — today part of Microchip Technology Incorporated. Google Patents' "Current Assignee" also lists "Microsemi Solutions US Inc," which is a naming variant of the same Microsemi/Microchip post-2018 reorganization.


Timeline diagram

timeline
    title Ownership of US 6611875
    1999 : Filed 1999-04-30 as US 09 per 305783
         : Inventors assign to SwitchOn Networks
    2000 : PMC-Sierra to buy SwitchOn for 450M
    2001 : Change of name to PMC-Sierra US Inc
    2003 : Patent issues as US 6611875 B1
    2013 : Security interest to Bank of America
    2016 : Bank of America release recorded
         : Microsemi acquires PMC-Sierra
         : Security agreement with Morgan Stanley
    2018 : Morgan Stanley release recorded
         : Microchip acquires Microsemi
         : Patent expires 2018-12-31

NPE / troll-pattern signals

  1. Shell-entity transfer — NOT PRESENT. Every assignee in the chain is (or was) an operating semiconductor company: SwitchOn Networks → PMC-Sierra US → Microsemi Storage Solutions → Microchip Technology. No "IP/Holdings/Ventures/Licensing" suffixed entity appears anywhere. The only "holdings-style" links are secured-lender names (Bank of America, Morgan Stanley Senior Funding), which are collateral agents, not owners.

  2. Known asserter in the chain — NOT PRESENT. No assignee or assignor matches any of the named NPE lists (Acacia, Marathon, IV, IPNav, Wi-LAN, Mosaid/Conversant, Vringo, Pendrell, Innovatio, MPHJ, Lumen View, Round Rock, Document Generation Corp, or Spangenberg entities). Cross-check: the previously generated litigation summary for this patent found no litigation, which is consistent with a chain containing no asserter.

  3. Repeat correspondent across the chain — UNCLEAR / NOT EVALUABLE. The correspondent of record is not exposed in any source I could retrieve for this patent. I therefore cannot test whether one attorney/firm handled all five post-issuance recordings. This is the one signal where the absence of data is a genuine gap rather than a negative finding — the '875 record should be pulled directly from Assignment Center and the correspondent column read for reel 030947/0710 and the 2016/2018 Morgan Stanley reels. Note for priors: in secured-party recordings of this type the correspondent is typically collateral-agent counsel (bank-side), which would make a "repeat NPE lawyer" pattern structurally unlikely — but I have not verified it.

  4. Cascading transfers — NOT PRESENT. Post-issuance transfers are sparse, not cascading: 2001 (name change), 2013 (lien), 2016 (release + new lien), 2018 (release). No two ownership-transferring assignments occur within 24 months of each other, and none involve chained assignees sharing an address or principal.

  5. Pre-litigation transfer — NOT PRESENT. No infringement suit has been identified against this patent (per the prior litigation section), so there is no suit to which a transfer could be pre-positioned. The last ownership-affecting event (2016 renames / 2018 release) predates expiry, not litigation.

  6. Bankruptcy fire-sale — NOT PRESENT. Neither SwitchOn, PMC-Sierra, nor Microsemi filed Chapter 7/11. Both exits were solvent, all-stock/high-premium M&A: PMC-Sierra acquired by Microsemi (2016, ~$2.5B) and Microsemi acquired by Microchip Technology (2018, ~$8.35B). The patent changed hands as part of going-concern acquisitions, not an estate sale.

  7. Privateering — NOT PRESENT. There is no transfer to an assertion vehicle, no NPE asserting on any of these operating companies' behalf, and no evidence in SEC/press of an assertion-funding arrangement. PMC-Sierra/Microsemi did not spin this family out to a litigating entity.

  8. Defensive aggregator — NOT PRESENT (as to mechanism). The chain does not terminate at RPX, AST, LOT, Unified Patents, or OIN. It terminates at an operating chip company and the patent expired 2018-12-31, so it is non-asserting by expiry rather than by defensive aggregation. See the verdict note below.


Verdict

Defensive / non-asserting — with an explicit definitional caveat: the chain does not terminate at a defensive aggregator, which is the strict trigger for this category. I select it because the operative, evidence-supported finding is that this patent is non-asserting: it has been continuously owned by operating semiconductor companies (SwitchOn → PMC-Sierra US, per the 2001-07-02 change-of-name recording; → Microsemi Storage Solutions, per the 2016-02-03 security agreement; → Microchip), it has never been transferred to an assertion vehicle, and it expired 2018-12-31. It is not "NPE — high/moderate confidence" (zero of the eight signals are present; signals 1, 2, 4, 5, 6, 7 are affirmatively absent) and not "Operating-company assertion" (no suit was identified). If the strict mechanism is required, the honest label is Insufficient data on the correspondent dimension only — signal 3 cannot be evaluated without the reel-030947/0710 and Morgan Stanley conversion records.

Driving evidence: 1999-07-27 inventor assignment to SwitchOn Networks; 2001-07-02 change of name to PMC-Sierra US, Inc.; 2013-08-06 (eff. 2013-08-02) security interest at reel 030947/0710 to Bank of America; 2016-02-01 release at reel 037675/0129; 2016-02-03 patent security agreement to Morgan Stanley Senior Funding; 2018-05-29 release; 2018-12-31 anticipated expiration. Every event is either a name change, a collateral pledge/release, or a release — no event transfers beneficial ownership to a licensing entity.

Verify at: https://assignmentcenter.uspto.gov/search (search "6611875"). Retrieve the reel/帧 columns and the correspondent column for the 1999, 2001, 2016, and 2018 recordings to close the signal-3 gap and confirm that reel 030947/0710 indeed covers US 6,611,875 (I confirmed that reel only against sibling US 6,279,051).

Standing limitations: reel/frame numbers for the 1999 assignment, 2001 change of name, 2016-02-03 Morgan Stanley agreement, and 2018-05-29 release are not present in any source I retrieved and are marked unknown rather than estimated. No correspondent of record was obtainable for any entry.

Generated 9/30/2026, 2:44:29 PM

Prior art

Earlier patents, publications, and products that may anticipate or render the claims unpatentable.

✓ Generated

I'll research the prior art cited against US 6611875. Let me run several searches.

Those searches returned irrelevant results. Let me try more targeted queries against the patent databases.

Let me try to retrieve the patent's front-page citation list directly.

Prior-Art Analysis — US 6,611,875 B1

1. Patent identified (verified)

From the authoritative full text you supplied (source: https://patents.google.com/patent/US6611875/en), and corroborated by the USPTO-mirror record at https://uspto.report/patent/grant/[6611875](/patent/6611875) :

Field Value
Patent number US 6,611,875 B1 (Grant date 2003-08-26)
Title Control system for high speed rule processors
Application no. 09/305,783 (filed 1999-04-30)
Priority date (assumed) 1998-12-31 — claimed from US 09/224,382 (continuation-in-part; filed 1998-12-03 per the CROSS-REFERENCE section)
Inventors Vikram Chopra; Ajay Desai; Raghunath Iyer; Sundar Iyer; Moti Jiandani; Ajit Shelat; Navneet Yadav
Original assignee Switch On Networks → PMC-Sierra, Inc. (later Microsemi)
Status Expired – Lifetime (anticipated expiration 2018-12-31)
Main CPC H04L49/00, H04L63/0227, H04L63/0263, H04L63/1416, H04L69/22, H04L49/3009, H04L49/205, H04L49/355
Family members surfaced US 7,136,926 B1 (from parent 09/224,382) and US 6,631,466 B1 (from 09/569,593, filed 2000-05-09)

2. Retrieval status of the (56) "References Cited" list — I could not retrieve it, and I will not guess

Strict answer to your request: I was unable to obtain the actual front-page citation list for US 6,611,875 through the searches available to me, and I therefore cannot give you "each patent citation for 6611875" without fabricating patent numbers. That would violate the no-fabrication rule you set, so I am flagging it explicitly instead.

What I searched (and what came back):

  1. US6611875 patent citations prior art references → returned unrelated Chinese investor-relations pages. No patent data.
  2. "6,611,875" "Control system for high speed rule processors" patent citations → returned an unrelated New Jersey court PDF (a long list of different patent numbers: 6,139,873; 6,149,935; 6,153,216; etc.). These numbers are not US 6,611,875 and are not its citations — do not use them.
  3. patents.google.com US6611875 cited by references → returned the (56) section of US 9,911,718 and other unrelated documents.
  4. patentimages US6611875.pdf "References Cited" and the follow-up "FOREIGN PATENT DOCUMENTS" query → returned (56) sections of US 9,911,718, US 11,185,405, and unrelated PCT search reports. The last call was cut off by the tool's step limit.

Also important: the authoritative full text you provided is the specification and abstract only — it contains no claims section and no (56) citation block. Consequently:

  • I cannot map a reference to "which claim(s) it anticipates," because I do not have the claim set of US 6,611,875 in front of me; and
  • I cannot confirm which of Google Patents' "prior art keywords" (packet, nanocomputer, group, match, rules) reflect actual references — those keywords are algorithmically generated, not citations.

Anyone (including me) who names specific anticipation references for this patent at this point would be pattern-matching from memory, which is exactly the failure mode you told me to avoid. I'd rather hand you a rigorous, empty-of-invention scaffold plus a precise retrieval path.

How to obtain the real list (deterministic, non-guesswork)

  • Google Patents https://patents.google.com/patent/US6611875/en → sections "Patent Citations" (U.S. patent documents), "Foreign Patent Documents," and "Other References / Non-Patent Citations," each with Kind code, publication date, and "Cited By" status (Examiner vs. third-party).
  • USPTO Patent Center / Public PAIR for application 09/305,783 → "Patent References Cited" (Form PTO-892 / PTO-1449) and the examiner's citations in the file wrapper.
  • USPTO Patent Full-Text (PatFT) or the USPTO Open Data / Bulk Search API by patent number 6611875.
  • Espacenet US6611875 → "Cited documents" tab (also gives INPADOC family, useful because the siblings US 6,631,466 and US 7,136,926 share much of the same cited art).

3. Legal framework for the anticipation analysis (this is the part I can state with confidence)

Because application 09/305,783 was filed 1999-04-30, the pre-AIA 35 U.S.C. § 102 governs (AIA first-inventor-to-file applies only to applications filed on/after 2013-03-16). So a citation can only anticipate if it meets the date tests below. The one-year grace period runs from the U.S. filing date (1999-04-30) → § 102(b) critical date 1998-04-30. Caveat on the CIP: subject matter newly added in the 09/305,783 CIP gets only the 1999-04-30 date, whereas subject matter carried over from parent 09/224,382 gets 1998-12-31 (or 1998-12-03 for the parent filing). Any § 102(b) analysis therefore has to be done claim-by-claim and limitation-by-limitation, asking whether each limitation is supported in the parent.

Statute (pre-AIA) What the reference must show
§ 102(a) Patented / described in a printed publication, or known or used by others in the U.S., before the date of invention — a reference dated after 1999-04-30 but before the invention date is generally not § 102(a) art unless an earlier invention date (e.g., a foreign priority, none here) is proved
§ 102(b) Patented or published, or in public use/on sale, more than one year before the U.S. filing date (i.e., before 1998-04-30)
§ 102(e) U.S. patent or published application by another, filed before the applicant's invention (for pre-1999-11-29 filings) — the classic "secret prior art" hook for co-pending U.S. applications
§ 102(g) Prior invention by another, not abandoned/suppressed/concealed
§ 103 Combinations of the above where the differences are obvious — note the patent's own admissions in the Background (see below), which are § 102(b)/§ 103 "applicant admitted prior art"

Anticipation requires every element of the claim in a single reference, arranged as in the claim (inherency allowed only if necessarily present). For a specification this broad (massively parallel rule-processing array, nanocomputers, cascade control, packet-header extraction, QoS NTTS scheduling, min/max search, NAT learning, composite rules), most citations are likely to be § 103 references rather than true § 102 single-reference anticipations.


4. Applicant-admitted prior art inside the patent (verifiable, usable today)

These are admissions in the specification you gave me; they are prior art against the patent's own claims regardless of the (56) list:

  • "Current qualities of service implementations are not capable of providing quality of service operations at wire-speed." and "One standard quality of service task is the servicing of a plurality of packet queues with the well-known 'leaky bucket' servicing algorithm." → the patent admits leaky-bucket/NTTS scheduling as well-known. The QoS claims (FIGS. 9–10; select queue with smallest Next-Time-To-Send, then add interval I(j)) sit directly on top of this admitted art. The published, pre-1998 scheduling literature is therefore the natural § 102/§ 103 target for those claims:
    • Demers, Keshav & Shenker, Analysis and Simulation of a Fair Queueing Algorithm, SIGCOMM 1989.
    • L. Zhang, VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks, ACM SIGCOMM 1990.
    • Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications, INFOCOM 1994.
    • Goyal, Vin & Chen, Start-Time Fair Queueing, INFOCOM 1996.
      (These are real, pre-1998, and squarely describe "select the queue with the minimum virtual/NTTS timestamp, service it, then increment by an interval" — the FIG. 10 method. I list them as research leads to verify against the actual claims, not as confirmed citations of this patent.)
  • "a general purpose processor will not be able to process all of the incoming packets at wire-speed" → admits that general-purpose-processor gateways (proxy-based firewalls/NAT) were the known approach.
  • The min/max search discussion ("a linear search system would require 8192 cycles") → the patent admits linear-search/min-max selection was known; the claim to novelty is the hierarchical parallel reduction (32 → 16 → 16). Comparable hierarchical priority-encoder/min-max-reduction art is the target.
  • Composite-rule logic (FIG. 8) is described as linking adjacent nanocomputers via next match/previous match — a standard cascaded-match/priority-chain arrangement.

5. Why the citations almost certainly cluster where they do (search guidance grounded in the claims' CPC)

The granted CPC codes on the face of this patent tell you precisely which art the examiner considered relevant, and should be the basis of a class-based (CPC) prior-art sweep rather than number-guessing:

  • H04L49/00 packet switching elements; H04L49/3009 header conversion/routing tags; H04L49/205 QoS-based; H04L49/355 application-aware switches → parallel packet-classification engines, CAM/ternary-CAM lookup, header parsing.
  • H04L63/0227, H04L63/0263 firewall filtering policies / rule management; H04L63/1416 attack signature detection → rule-array firewalls.
  • H04L69/22 header parsing/analysis; H04L69/16, H04L69/161 TCP/IP adaptation.
  • H04L61/00 addressing/naming → NAT.

A complete prior-art report should retrieve, for each of those CPC groups, all U.S. patents/applications and NPL published before 1998-04-30 (for § 102(b)) and before the invention date (for § 102(a)/(e)), and then run the element-by-element chart against the actual claims.


6. Honest bottom line

  1. Patent confirmed: US 6,611,875 B1, app. 09/305,783, filed 1999-04-30, priority 1998-12-31 via CIP of 09/224,382, granted 2003-08-26.
  2. The actual "References Cited" list for US 6,611,875 was not retrievable with the tools available in this session, and the authoritative text you gave me omits both the claims and the (56) block. I am not going to supply patent numbers from memory and label them "citations of 6611875" — the only numbers my searches returned (e.g., 6,139,873; 6,149,935; 6,153,216; 6,165,491…) came from an unrelated court exhibit and are not this patent's citations.
  3. To complete the task exactly as specified — "for each reference: full citation, publication/filing date, brief description, and which claim(s) it potentially anticipates" — I need either (a) the (56) list from Google Patents/Patent Center for US 6,611,875, or (b) the claim set of US 6,611,875. Supply either and I will produce the claim-by-claim § 102 anticipation chart immediately.
  4. What I can stand behind today: the pre-AIA § 102/§ 103 framework in § 3, the applicant-admitted prior art in § 4 (leaky-bucket/NTTS QoS, general-purpose-processor gateways, linear min/max search), and the CPC-driven search plan in § 5.

Flagged inconsistency for the record: the earlier "Litigation summary" section returned no litigation results, and this prior-art pass likewise could not be completed from live sources; both gaps are retrieval failures, not affirmative findings that no citations or litigation exist. US 6,611,875 is an expired, widely-cited PMC-Sierra/Microsemi networking patent, so the (56) list is very likely to be substantive once pulled from the primary sources above.

Generated 9/30/2026, 2:44:30 PM

Obviousness

Combinations of prior art that suggest the claimed invention would have been obvious under 35 U.S.C. § 103.

✓ Generated

I'll first try to recover the patent's claim set and the Prior Art / Citations section, since the supplied text omits both.

The first pass returned noisy results. Let me try to pull the actual claim language and the cited prior art list.

§103 Obviousness Analysis — US 6,611,875 B1

0. Scope and provenance flags (read first)

Two gaps materially constrain this analysis, and I am flagging them rather than papering over them:

  1. There is no "Prior Art section" in the material I was given. The previously generated sections I received were "Patent summary" and "Litigation summary" — neither contains a prior-art reference list. The supplied Google Patents text likewise jumps from the "Images" section straight to "Classifications": it does not include the References Cited, Patent Citations, or Cited By tables. So I cannot "use the results from the Prior Art section" — that section was not populated in my context. If you paste it, I will re-key this analysis to the actual references.
  2. The claim set is still missing. The authoritative text ends mid-Background ("…a large routing table that contains a number of routing rul…"). My retrieval attempts for verbatim claims of 6,611,875 returned only unrelated material. As a result, the claim scope below is the provisional claim-1 text carried over from the earlier section (sourced from a third-party snippet, attribution unverified), supplemented by claim-like limitations described in the specification. Treat the element chart as a framework, not a limitation-by-limitation mapping.

Also, per the literal-reading rule: the task header says April 26, 2026 while the document fetch is timestamped 2026-09-30; I note both and do not reconcile them.


1. Governing law and the critical dates

  • Pre-AIA §103(a) governs. Priority is claimed to US 09/224,382 (bibliographically dated 1998-12-31; the specification's cross-reference says "Dec. 3, 1998" — a discrepancy I am not correcting). This application filed 1999-04-30. No AIA §102/§103 applies.
  • CIP priority is claim-by-claim. For subject matter disclosed in the parent, the critical date is the parent's filing date; for new matter (e.g., the operation-CWord/OC-Descriptor sequencing, branch/call single-entry LIFO, and min/max treatment appear to be later-developed material), the critical date is 1999-04-30. This shifts the §102(b) one-year bar: parent-supported claims are barred by art public before ~Dec. 1997; CIP-only claims by art public before ~Apr. 1998. A §103 attack must therefore be date-sorted against the right claim.
  • Same-inventive-entity caveat. The parent 09/224,382 and sibling 09/569,593 share the same inventorship team. They are therefore not "by another" and are not §102(e) prior art to this patent. Anyone using the family as art must find a different basis (different inventive entity, or a public disclosure).
  • File history is the highest-value evidence. Allowance issued 2003-08-26 after roughly four years of prosecution. Whatever the examiner applied under §103 — and what the applicant argued around — is the single best predictor of how a repeat §103 challenge would fare. Without the file wrapper I cannot say which references were already overcome.

Level of ordinary skill (proposed): a BSEE/MSEE with 3–5 years in high-speed networking ASIC design, conversant with content-addressable memories, priority encoders, pipelined packet parsing, multiprocessor arbitration, and production-rule matching.


2. Provisional claim scope used below

Restating the flagged provisional claim 1 (do not treat as verbatim): distributing packet information from a main control unit to a plurality of nanocomputers organized into groups, each nanocomputer holding a set of instructions; concurrently processing the packet in the nanocomputers to generate an instruction outcome in each; determining a group-prioritized result within each group; determining a global prioritized result from the group results; and returning the highest-priority instruction outcome to the main control unit. Two further fragments describe streaming data from a defined packet offset and streaming in a reverse direction.

If that is representative, the claim is broad and largely architectural — which is precisely the profile that makes a §103 attack strong.


3. Candidate prior art identified in retrieval

These surfaced in live search and are real documents, but I could not confirm they appear on the face of 6,611,875. Confirm bibliographic data before relying on any of them.

Reference Disclosure relevant to the claim Confidence in the document
EP 0 276 070 A2 (parallel CAM application) Content-addressable memories 30 driven in parallel from a common input bus 32, outputs paralleled, one CAM enabled by a selector CAM 35; a "Graf" decision network develops a multi-bit one-hot output selecting the winner Document retrieved live; relevant passages quoted in results
US 4,412,098 (An) — audio signal recognition computer Buffered input acceptance while previously buffered patterns are compressed and tested in parallel; multiple parallel filters; time-shared, address-independent read/write Retrieved live
US 5,414,819 (Redmond et al.) — parallel processing interconnection network Clustered processing elements, hierarchical interconnection for scalability, fast electronic intra-cluster switching Retrieved live
US 4,598,400 (Hillis, 7/1986) Massively parallel processor array (Connection-Machine lineage) — data broadcast to many processing elements Appeared as a cited reference in another patent's list
Forgy, "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem," Artificial Intelligence (1982) Compiling rule sets into networks evaluated in parallel; per-node match propagation with chaining From my own knowledge — high confidence, verify
McAuley & Francis, "Fast Routing Table Lookup Using CAMs," IEEE INFOCOM 1993 CAM-based parallel matching of packet keys with priority-resolved winner selection From my own knowledge — high confidence, verify

Note also the admissions in the patent's own Background: general-purpose processors "will be inadequate," and the stated problem is achieving wire-speed firewall/NAT/routing/QoS with large rule sets. An applicant's characterization of the problem is a legitimate starting point for motivation under KSR Int'l Co. v. Teleflex Inc., 550 U.S. 398 (2007).


4. Element-by-element obviousness chart

Element Primary art Secondary art Motivation / KSR rationale
(a) Distribute packet info from a main control unit to plural nanocomputers, organized into groups, each with a set of instructions EP 0276070 (broadcast on common bus 32 to parallel CAMs) Hillis 4,598,400; Redmond 5,414,819 (clustered PE arrays) Broadcast-to-all-comparators is the defining operating mode of a CAM/associative memory. Grouping into ribs/blocks is the standard fan-out/fan-in compromise for signal loading and arbitration depth. Predictable result.
(b) Concurrently process to generate an outcome in each nanocomputer EP 0276070; 4,412,098 (An) (parallel testing while input continues) RETE (parallel match propagation) Latency reduction by parallel evaluation is the entire point; the Background itself identifies serial general-purpose processing as the deficiency.
(c) Determine a group-prioritized result within each group FPGA/ASIC priority encoders; CAM ripple-priority (CASC_IN/CASC_OUT daisy-chaining) Redmond 5,414,819 Hierarchical reduction is a recognized technique to bound arbitration fan-in and depth.
(d) Determine a global prioritized result from group results Graf decision network (one-hot winner) via EP 0276070; tree/round-robin arbiters in multiprocessor buses Redmond 5,414,819 (multi-stage interconnect) Log-depth winner selection from N candidates by iterative pairwise reduction is a textbook, predictable construction.
(e) Return the highest-priority outcome to the main control unit CAM "match address"/highest-priority-match output; priority encoder output register — Direct equivalence: a priority-encoded address is the canonical CAM output.
(f) (description-disclosed) Stream from a programmable packet offset; reverse-direction streaming Protocol/header parsers with programmable L3 offset (the specification's own HEE concept is ordinary parsing) Circular/bidirectional shift registers; MSB/LSB reversal in serial matching Extract-at-offset and reverse shifting are routine data-alignment operations in serial comparator front-ends.
(g) (description-disclosed) Min/max search across rule entries Tournament-tree / parallel-reduction minimum search — Locating a minimum/maximum by hierarchical pairwise comparison is a canonical parallel algorithm; applying it to NTTS values for leaky-bucket scheduling is a known use (the specification describes the leaky-bucket algorithm as "well-known").
(h) (description-disclosed) Composite rules via next match/previous match chaining Carry/ripple chaining and daisy-chained CAM match lines RETE beta-join chaining Chaining match results across adjacent units is a known technique for expressing a wider predicate without widening a single cell.
(i) (description-disclosed) Branch/Call with single-entry LIFO return stack Microprogram sequencers / microcoded return-address stacks (mainframe and microcode art of the 1960s–80s) — A single-entry return stack is a deliberate simplification of a known microcode construct; predictable.

5. Proposed §103 grounds

Ground 1 — EP 0276070 in view of US 5,414,819. EP 0276070 teaches the core: packet-key data broadcast on a common bus to many parallel content-addressable stores, with a decision network selecting a single winner by one-hot output. US 5,414,819 supplies the scalable, clustered/hierarchical processor interconnection that renders the two-level "group then global" priority resolution natural. Motivation: the shared problem of scaling comparison capacity without degrading access latency; both references point the same direction (parallelism + hierarchy), so the combination yields no more than predictable results. Anticipates or renders obvious elements (a)–(e) if the claim is as broad as the provisional text.

Ground 2 — An (US 4,412,098) in view of Hillis (US 4,598,400). An discloses buffered, time-independent parallel testing of a buffered pattern against many stored references — structurally the "concurrently process a packet against many stored rules" limitation, with continuous input acceptance (i.e., wire-speed operation). Hillis supplies the massively parallel processing array with broadcast distribution. Motivation: scaling the number of simultaneous comparators is the recognized route to throughput.

Ground 3 — Forgy RETE (1982) in view of a CAM/associative-memory packet filter (e.g., McAuley & Francis 1993). RETE teaches compiling a large rule set into a network evaluated concurrently, with match-result propagation and chaining — mapping to elements (a)–(b), (h). CAM lookup art supplies hardware broadcast-and-priority-select — elements (c)–(e). Motivation: the expressed design goal of both fields is evaluating large rule sets within a fixed, small time budget per input; a POSITA would combine a rule-compilation structure with associative hardware to obtain exactly that.

Ground 4 — EP 0276070 in view of the patent's own admitted knowledge base (leaky-bucket scheduling + parallel min/max). If min/max or QoS-scheduling limitations are claimed, parallel tournament-tree reduction was a conventional technique; the specification itself calls the leaky-bucket algorithm "well-known."

Ground 5 (secondary/reference-recited only). Any art cited on the face of the patent or in the parent's file history, combined with the above. I cannot assemble this without the IDS/"References Cited" list.


6. Counterarguments a patent owner would raise (and how strong they are)

Defense Strength
Claim breadth: if claims recite only parallel matching + hierarchical priority, §103 is strong; if they recite the specific cascade handshake (master PIE driving COCD, slaves de-asserting CMS, suspending on match pending higher-priority COCD), §103 is much weaker — I found no reference disclosing that specific multi-chip protocol. Material
Full vs. Partial OC distinction (return after first match vs. continue collecting all matches) is a specific control semantic, not a mere parallelism choice. Material
Operation-CWord / OC-Descriptor sequencing with branch conditions and single-entry call/return is a particular microcode-style control scheme; the prior art above shows the components but not this composition. Moderate
Teaching away: a POSITA might argue the min/max and rule-matcher functions were designed for distinct hardware (scheduling vs. classification) and merging them is not suggested. Weak
Unexpected results / secondary considerations: the specification asserts throughput "relatively independent of the complexities and numbers of rules." If supported by comparative data, this is a nexus argument — but the patent text I have contains no data, only assertion. Weak as presently evidenced

7. Bottom line

  • If the independent claims are as broad as the provisional claim 1 text, they are vulnerable to §103 over a combination of parallel-array/CAM art (EP 0276070; An US 4,412,098; Hillis US 4,598,400; Redmond US 5,414,819) optionally with rule-engine art (RETE). The motivation is supplied by the patent's own admitted problem statement plus the KSR rationales of predictable results and a finite, obvious-to-try set of parallelization options.
  • If the independent claims carry the cascade handshake, Full/Partial OC semantics, or the OC-Descriptor branching scheme, I would not now assert obviousness; I found no reference disclosing those combinations, and the strongest ground I can articulate is a §103 combination argument I cannot presently support with a mapping.
  • I could not and did not verify the claim text or the patent's own prior-art list. Every reference above is flagged as either retrieved-live-but-unconfirmed-on-the-face, or from-my-own-knowledge. No claim-chart conclusion here should be treated as final until those two documents are supplied.

To convert this framework into a defensible opinion I need: (1) the granted claim set of 6,611,875 (and of parent 7,136,926 for scope comparison); (2) the References Cited / IDS and the Cited By lists from the Google Patents page; and (3) the prosecution history, to see what §103 art the examiner already applied and what the applicant distinguished.

Sources consulted in this pass: https://patents.google.com/patent/US6611875/en (supplied text; truncated pre-claims, no citation tables) · live keyword retrieval returning EP 0276070 A2, US 4,412,098, US 5,414,819, US 4,598,400 (as a listed reference), and US 5,517,628 (RETE discussion) · general knowledge for Forgy (1982) and McAuley & Francis (INFOCOM 1993).

Generated 9/30/2026, 2:44:57 PM

Extensions

Patent term adjustments, term extensions, continuations, divisionals, family members, and expiration dates.

Log in to generate
Not generated yet. Log in to request this analysis.

Derivative works

Defensive disclosure: derivative variations of each claim designed to render future incremental improvements obvious or non-novel.

Log in to generate
Not generated yet. Log in to request this analysis.

Keep exploring

Other patents in Semiconductor (T)

See all Semiconductor (T) patents →