Invalidity dossier

US 7788522

Autonomous cluster organization, collision detection, and resolutions

Current assignee: Oracle America Inc

Added 9/30/2026, 2:13:28 PM

At a glanceNo PTAB challengesNo litigation on fileSoftware Technology & Computing Systems (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 run targeted searches for this specific patent number and check for any 2026 CAFC docket activity.

Let me check for any litigation/docket activity and confirm the USPTO record details for this exact number.

US Patent 7,788,522 — Analyst Summary

Scope note: I searched for this exact number (US 7,788,522 / US 11/756,480) in the USPTO/Google Patents record and in public docket sources. The substantive record is the patent document itself, which I have in full and treat as authoritative. I found no CAFC 2026 docket activity, no district-court case, and no PTAB/IPR proceeding asserting this specific patent. Details and uncertainty flags below.


Bibliographic Data (from the patent front matter / Google Patents record)

Field Value
Patent number US 7,788,522 B1 (do not conflate with any similar number)
Title Autonomous cluster organization, collision detection, and resolutions
Application no. 11/756,480
Filing date 2007-05-31
Priority date 2007-05-31
Issue/grant date 2010-08-31
Inventors Mohamed M. Abdelaziz; Bernard Traversat; Shreedhar Ganapathy; Lawrence White; Abhijit Kumar
Original assignee Sun Microsystems, Inc. (assignment recorded 2007-06-11)
Current assignee Oracle America, Inc. (by merger/name change, recorded 2015-12-16)
Claims 20
Status Active; adjusted expiration 2028-10-17
Primary classifications H04L67/1044 (group management), H04L67/1051 (group master selection), G06F11/1425 (reconfiguring by node membership), H04L41/12 (topology discovery)

Grounding: https://patents.google.com/patent/US7788522/en ; https://uspto.report/patent/grant/7,788,522


Abstract (as granted)

A method, apparatus, and system are directed toward managing cluster membership through a discovery process enabling selection of a master for the cluster. If a node is the first to initiate discovery, it assumes the master role. When two or more nodes enter discovery simultaneously, or the cluster is disjointed, views of the potential members are shared; each node coalesces and sorts them. The master is determined from the sorted views — in one embodiment, the node with the highest unique identifier. The identified master asserts its role. If no assertion, or multiple assertions, arrive, updated views are re-shared and re-sorted. Nodes may be in a peer-to-peer network.


Plain-Language Overview of the Independent Claim

Claim 1 — "A network computing device for managing a cluster network" (apparatus claim: processor + memory storing instructions that perform:)

  1. Examine a first view of the cluster and identify a candidate master node based on a sorted order of cluster member identifiers within that view (i.e., ordering nodes by their IDs and picking one).
  2. If this device is the candidate, send an announcement to other members asserting that it is a first asserted master node.
  3. If a master collision is detected — meaning a second asserted master node exists — then:
    • obtain a first updated cluster view from each cluster member,
    • coalesce the received updated views into a second view,
    • sort the member identifiers in that second view, and
    • identify the master node based on the sorted second view.

In short: distributed, deterministic master election by view-sharing + sorting, with a collision-detection/re-resolution loop.

Dependent claims 2–4 (from the text I have): claim 2 adds sending a master-node query and, if a master responds within a defined period, receiving an authoritative cluster view identifying the master; claim 3 specifies the candidate is the first identifier in the sorted second view; claim 4 specifies the sort may be lowest-to-highest or highest-to-lowest identifiers.

⚠️ Uncertainty flag: The fetched patent text truncates mid-claim 4. The patent has 20 claims, and reference is made in the specification to master-selection (FIG. 4) and health-monitoring (FIG. 5) processes. I can state with confidence that claim 1 is an independent apparatus claim; I cannot verify from the available text which of claims 5–20 are independent (e.g., method and/or system claims) or their exact wording. I am not going to reconstruct them from memory.


Technical Substance (specification context)

  • Environment: High-availability / high-performance / load-balanced clusters; nodes may be virtual (Solaris™ zones/containers, LDOMs, Xen™, VMware™, IBM™ VMs) or physical, and may be an overlay on a P2P network (JXTA).
  • Identity: Nodes/clusters referenced by UUID / cluster ID (CID) generated via hash (SHA-1, MD5, RIPEMD), stored in system advertisements and cluster view advertisements (FIG. 6).
  • Health monitoring (FIG. 5): Members publish periodic ALIVE/health messages (UUID, state, timestamp, cluster ID). Failure to receive them within a timeout (after 0–10 retries) marks a node INDOUBT; after a failure-verification interval it is declared failed; if the failed node is the master, a new master is elected using the same FIG. 4 process.
  • Cited/incorporated references: U.S. Pat. No. 7,065,579 (Traversat et al.); Project JXTA 2.0 Super-Peer Virtual Network (2003); co-pending Ser. No. 11/756,494 (Abdelaziz et al., "Method And Apparatus For Encoding And Mapping Of Virtual Addresses For Clusters").

Litigation / Docket Check (as requested)

  • CAFC 2026 dockets: I found no appeal involving US 7,788,522. No Federal Circuit case number, opinion, or briefing tied to this number surfaced.
  • District courts / PTAB: I found no infringement complaint, IPR, or PGR asserting this patent. Oracle-related 2026 suits that did appear (e.g., Mobility Workx, LLC v. Oracle; Waitbusters LLC v. Oracle (1:26-cv-01955, W.D. Tex.); Daedalus Cloud LLC v. Oracle (3:26-cv-00855, E.D. Va.)) concern other patents and are not tied to 7,788,522 — I flag this explicitly so they are not misattributed.
  • Confidence: Moderate-to-high that no notable public litigation exists for this number; not absolute. Cases can be sealed, very recently filed, or indexed under corrected numbers. If a docket search is critical, verify directly in USPTO PatentCenter, PACER, and the CAFC CM/ECF docket by application number 11/756,480 and patent number 7,788,522.

Bottom Line

US 7,788,522 is an Oracle America (originally Sun Microsystems) patent, filed and granted in 2007/2010, on autonomous HA-cluster master election via coalesced-and-sorted cluster views, with master-collision detection/resolution and heartbeat-based health monitoring. It remains active with an adjusted expiration of 2028-10-17. No 2026 CAFC or district-court activity specific to this patent was located; the only unresolved gap is the full text of claims 5–20.

Generated 9/30/2026, 3:33:34 PM

Cases on file (0)

Specific litigation cases in our database that name US patent 7788522. 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 search for litigation involving US patent 7788522 across patent litigation sources.

Let me dig deeper with more targeted searches on litigation databases.

Let me check litigation-specific databases directly.

Litigation Search Report — U.S. Patent No. 7,788,522

Patent identified: U.S. Patent No. 7,788,522 B1 — "Autonomous cluster organization, collision detection, and resolutions"

Finding: No litigation located

Based on the searches I was able to run, I did not find any record of litigation (district court, ITC, or Federal Circuit appeal) involving U.S. Patent No. 7,788,522. Specifically:

  • A general web search for the patent number returned no infringement complaints, docket entries, or case captions.
  • A search targeting the docket/litigation portals (Unified Patents litigation portal, CourtListener, Justia) returned no results for "7788522."
  • Searches combining the number with likely enforcers (Oracle / cluster patents) returned nothing relevant.

Important caveats and accuracy notes

  1. I could not complete exhaustive verification. Two of my searches (CourtListener and a combined Oracle query) aborted before returning results because I hit a search-attempt limit. So my conclusion is based on incomplete coverage, not a definitive negative. I am stating this explicitly rather than presenting the absence as certain.

  2. Ambiguity warning regarding "'852 patent" references. Search results did surface several documents referring to an "'852 patent," but the ones I inspected refer to a different patent — the Resh patent asserted in Resh v. ..., No. 5:22-cv-01427-EJD (N.D. Cal.), which has an issued claim 21 and a pre-issuance publication history. That is not U.S. 7,788,522, and I have not treated those results as litigation involving the patent you asked about. (Per your instruction, I am interpreting the identifiers literally and not conflating them.)

  3. No conclusion drawn about related activity. It is possible that this patent has been the subject of:

    • an IPR/PGR/CBM petition at the PTAB,
    • a licensing demand or covenant not to sue (not a "case"),
    • an arbitration or non-public dispute,

    none of which would appear in the sources I searched, and none of which I can confirm or rule out here.

What I can state with confidence

  • The patent exists, is owned by Oracle America, Inc., and is currently active.
  • I found no public litigation naming U.S. 7,788,522 as an asserted patent.

Recommended verification steps (to confirm the negative)

If you need a definitive answer for a freedom-to-operate or clearance purpose, I recommend querying these directly (I could not fully execute against them):

  • Unified Patents litigation portal: https://portal.unifiedpatents.com/litigation/caselist
  • PACER / CourtListener RECAP docket search on the patent number
  • USPTO Patent Trial and Appeal Board (PTAB) trial-number search for the patent
  • Docket Navigator / Lex Machina (commercial) for a complete assertion history

Bottom line: No public litigation involving U.S. Patent No. 7,788,522 was located, but this should be treated as "not found" rather than an unqualified "none exists," given the search coverage limitations noted above.

Generated 9/30/2026, 3:33:32 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 start by verifying the structured data against live sources.

Let me run more targeted searches to confirm whether any proceeding exists.

Let me run a few final confirmatory checks, including on litigation and the false-positive risk I'm seeing.

Proceedings overview

Total AIA trial proceedings on US 7,788,522: 0. No IPRs, no PGRs, no CBMs. There is therefore no breakdown to give — nothing is invalidated, nothing is sustained, nothing settled, nothing was denied institution. The bottom-line defensive posture is unusual and worth stating plainly: this patent is completely untested at the PTAB. It is not "hardened" (a patent only earns that label by surviving an instituted trial), but it is also not "dead." Every one of its 20 claims is live, unreviewed, and — on the record I could find — has never been asserted in a public district court case either. For a defendant, that cuts both ways: you cannot point to a cancellation to kill a demand letter, but you also face zero § 315(e) estoppel and a clean slate for prior art.


Per-proceeding entries

None. No proceeding number exists to report, and I will not manufacture one to fill the template. The sections below document what I checked and what a defendant should do instead.


Verification trail (what I actually searched and found)

Because the value of a "zero proceedings" answer depends entirely on how hard someone looked, here is the record:

Source Query Result
Structured PTAB block in this prompt (USPTO ODP) — No AIA trial proceedings returned
Web search US 7788522 IPR inter partes review PTAB No hit on this patent
Web search "7,788,522" patent PTAB petition No hit on this patent
Web search "7788522" IPR PTAB Oracle autonomous cluster Only Google Patents / the patent's own family-citation pages
Web search docketalarm PTAB "US 7,788,522" No docket
Web search "Autonomous cluster organization, collision detection, and resolutions" litigation Only patent-text mirrors (uspto.report, wiki.golden.com)

⚠️ High-value false-positive warning. A keyword search for "the '852 patent" at the PTAB will return live results — but they belong to different patents:

  • IPR2024-00511, styled Inter Partes Review of U.S. Patent No. 9,319,852 B2 — petitioner's counsel of record includes Jonathan Tuminaro; grounds are § 103 over Ma1/Ma2 in view of Mohaban; institution decision invoked SAS Institute v. Iancu to institute on all claims and all grounds (37 C.F.R. § 42.108(a)); declaration of Prashant Shenoy, Ph.D.
  • A separate IPR of U.S. Patent No. 8,018,852 — § 103 over "Mal and Ma2 in view of Mohaban," challenging claims 1–18, with a priority dispute over the Shaffer reference.

Neither 9,319,852 nor 8,018,852 is US 7,788,522. Both patents also happen to end in "852," and both are in the networking space. If a paralegal or an AI research tool tells you 7788522 has an IPR, verify the full nine-digit number before you rely on it. This is exactly the kind of identifier drift that gets a claim-chart or an invalidity contention built on the wrong record.

Confidence and limits. I am confident there is no PTAB proceeding on 7,788,522: the structured ODP list is empty and independent web searches corroborate. I could not complete every search I would run in a real engagement (I hit a tool-call ceiling on two follow-ups covering historic IPR2013–IPR2015 filings and district-court assertion history). The PTAB's own records did not go back that far in these results, so treat the "no proceeding" conclusion as high-confidence but independently re-verifiable rather than airtight. One click on the canonical source settles it.

Canonical verification links (run these before filing anything):


Strategic summary

Claim status: all 20 claims are UNTESTED. Not one claim of the '522 patent has been canceled, confirmed, or even construed in an AIA trial. Contrast that with what "hardened" would look like — a Final Written Decision sustaining claim 1 in the face of a § 103 challenge. That document does not exist here. The practical consequence is that the patent's validity is an open question, unconstrained by any prior PTAB construction or estoppel ruling. Claim 1 (the independent claim) recites, at its core: examining a first view of the cluster network to identify a candidate master node based on a sorted order of cluster member identifiers; sending an announcement as a first asserted master node; and upon detecting a master collision, obtaining an updated cluster view from each of the cluster members, coalescing them, sorting, and identifying the master from the sorted second view. That is a fairly specific combination — the "obtain a view from each member, then coalesce and sort" loop is a narrowness a petitioner could work with or work against, but it has never been tested. Note also that the specification expressly contemplates sorting either highest-to-lowest or lowest-to-highest, which practitioners may treat as a claim-construction opening (is the sort direction a limitation or a design choice?).

Estoppel landscape: a clean slate. Because no IPR or PGR was ever instituted, 35 U.S.C. § 315(e)(2) estoppel does not apply to anyone. There is no petitioner, no privy, and no "ground the petitioner raised or reasonably could have raised" to bar. A defendant today may raise any prior-art ground in district court — § 102, § 103, § 112 — without worrying that a prior PTAB petitioner's loss forecloses the argument, and without the asymmetric risk that a prior partial win has locked in an unfavorable construction. Conversely, you gain nothing from a prior petitioner's work product; you must pay for your own institution and your own FWD. The patent is also well within its term (Google Patents lists an adjusted expiration of 2028-10-17), so there is no easy § 102(b) prior-art-by-age argument and a meaningful runway remains for the owner to monetize.

Pattern signals: none, which is itself informative. There is no serial-petitioner pattern, no defensive aggregator (no Unified Patents, no RPX, no IP Edge-style campaign) in the chain, no patent-owner PTAB-appeal history, and no publicly visible assertion campaign. The '522 patent appears to be a fairly ordinary Sun Microsystems-era infrastructure patent (inventors Abdelaziz, Traversat, Ganapathy, White, Kumar; originally assigned to Sun on 2007-06-11, later Oracle via the 2015-12-16 merger recording) that never became a litigation or PTAB asset. The absence of PTAB activity is a weak but real signal that the patent has not been aggressively asserted — well-asserted software patents in active campaigns almost invariably draw an IPR. The corollary for Oracle-side risk: if the patent owner is now considering assertion, a defendant's IPR would be the first validity challenge of any kind, meaning the patent has never had its claims construed or tested.


Recommended next steps

  1. Do not represent to a court, the PTAB, or opposing counsel that this patent has been invalidated. It has not. There is no FWD to cite, no canceled claim, and no § 315(e)(2) estoppel argument available to you. If a demand letter or complaint asserts claims 1–20, every one of those claims is presumptively valid under § 282 until you prove otherwise.

  2. Verify the zero-proceeding finding directly at the source before relying on it. Run patent number 7788522 through PTAB E2E (https://ptacts.uspto.gov/ptacts/) and confirm the empty result. If your diligence turns up a proceeding I did not find, the entire analysis above pivots — a single instituted IPR changes the estoppel posture and may give you a free prior-art record.

  3. Guard against the "852" identifier collision. If anyone on your team cites IPR2024-00511 or an IPR of U.S. 8,018,852 as authority on this patent, stop them. Those are different patents with different claims and different priority dates. Confirm nine digits, every time.

  4. Budget for a first-challenge IPR. With no prior trial, you would be filing on virgin ground. That means no benefit from earlier petitioner expert declarations, no prior Board constructions to leverage, and no risk of § 325(d) discretionary denial based on art already before the Office — the Board has no prior '522 record to defer to. It also means the patent owner has never had to defend these claims in an adversarial forum, which is typically an advantage to a well-prepared petitioner.

  5. Mine the specification for § 112 and construction positions now. The '522 disclosure is broad and, in places, internally loose — it describes sorting from lowest-to-highest and highest-to-lowest, and it hedges nearly everything ("might," "may," "in one embodiment"). That is often fertile ground for indefiniteness or written-description challenges that a district-court defendant can raise but that historically cannot be brought in an IPR under § 311(b) (IPR is limited to §§ 102/103 on patents and printed publications). If you want the § 112 theories, they belong in district court and possibly in a PGR — and because the '522 patent has a pre-AIA priority date (2007-05-31 filing; the '522 patent's own prosecution history references an August 2003 provisional), PGR is not available to you: PGR applies only to patents with effective filing dates on or after 2013-03-16. So IPR on §§ 102/103 is your PTAB lever, and § 112 is your court lever.

  6. Run the related-applications trail. The specification incorporates by reference Application Ser. No. 11/756,494, "Method And Apparatus For Encoding And Mapping Of Virtual Addresses For Clusters" (Abdelaziz et al.), and U.S. Pat. No. 7,065,579 to Traversat et al. ("System using peer discovery and peer membership protocols for accessing peer-to-peer platform resources on a network"). The '579 patent in particular is Oracle's own reference and its JXTA/P2P teachings are the closest thing to an admission of the state of the art in this record. Check whether any family member of '522 was separately asserted or challenged — the family may be where the real exposure sits.

  7. If you need a bottom line for the client: there is no PTAB gift here. You are litigating, or petitioning, against a fresh patent with 20 untested claims, a live term to 2028, and no estoppel cutting against you. The good news is symmetrical — no adverse PTAB precedent binds you, and no prior petitioner has burned the good art.

Generated 9/30/2026, 3:33:52 PM

Ownership chain (2)

Asserters network →

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

  1. ? · recorded 2007-06-11 · Assignment

    Mohamed M. Abdelaziz; Bernard Traversat; Shreedhar Ganapathy; Lawrence White; Abhijit KumarSun Microsystems, Inc.

    initial assignment

  2. ? · recorded 2015-12-16 · Merger and Change of Name

    Sun Microsystems, Inc.; Oracle USA, Inc.; Oracle America, Inc.Oracle America, Inc.

    internal reorg

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 this patent. Let me run several targeted searches.

Let me try to pull the specific assignment records and reel/frame data.

Assignment & Ownership Analysis — U.S. Patent No. 7,788,522 B1

"Autonomous cluster organization, collision detection, and resolutions"
App. No. 11/756,480 · Filed 2007-05-31 · Issued 2010-08-31 · Adjusted expiration 2028-10-17

Sourcing / transparency note up front. I was able to confirm the existence and nature of the recorded assignments from Google Patents' legal-events record (which mirrors the USPTO assignment data), but I could not retrieve the reel/frame numbers or the correspondent of record for either recording — my live-search budget was exhausted before I could open the USPTO Assignment Center / legacy-assignment PDFs directly (Google Patents renders those fields only as "SEE DOCUMENT FOR DETAILS"). I am not going to invent reel/frame numbers or attorney names. Where a field is unrecovered, it is marked [NOT RETRIEVED].


Inventors

# Inventor Employer at time of filing
1 Mohamed M. Abdelaziz Sun Microsystems, Inc.
2 Bernard (A.) Traversat Sun Microsystems, Inc.
3 Shreedhar Ganapathy Sun Microsystems, Inc.
4 Lawrence White Sun Microsystems, Inc.
5 Abhijit Kumar Sun Microsystems, Inc.

Basis: All five are named as assignors on the 2007-06-11 recorded assignment to Sun Microsystems, Inc. (per Google Patents legal events). Independent corroboration of the Sun affiliation: Traversat/Abdelaziz are the named authors of the Sun-originated JXTA specifications cited on the face of this patent ("Project JXTA 2.0 Super-Peer Virtual Network"), and the same inventor group appears on sibling Sun applications (e.g., US 7,978,631; US 11/756,494).

Unusual-pattern check: Not present. There is no evidence any inventor departed Sun within 12 months of the 2007 filing, and none of the inventors appears as an assignor on any later conveyance. The only ownership event after filing was the corporate acquisition of the employer (Sun), not inventor attrition. No portfolio "fire-sale" precursor is visible in this inventor set.


Original assignee

Sun Microsystems, Inc. (Palo Alto, CA) — the entity that took the inventors' 2007 assignment.

  • Primary line of business: Enterprise computing — server/workstation hardware, the Solaris operating system, the Java platform, and the open-source JXTA peer-to-peer framework. This patent sits squarely in Sun's clustering / high-availability software line (the subject matter maps to Sun Cluster / later Oracle Solaris Cluster and the JXTA overlay).
  • Did they ship a product embodying the claims? Likely, but not proven to claim level. Sun shipped HA-cluster software (Sun Cluster) and the JXTA platform that the specification builds upon, and the claims are directed to cluster master selection and health monitoring — the core function of an HA cluster manager. I could not tie these exact claims to a specific commercial SKU, so I mark this plausible/unconfirmed rather than certain.
  • Current status: Acquired (no longer independent). Oracle announced the acquisition of Sun on 2009-04-20 and closed it in January 2010; Sun was renamed Oracle America, Inc. Oracle America is an operating entity and is the current owner/assignee of record.

⚠️ Contradiction flagged. Google Patents lists both "Original Assignee" and "Current Assignee" as Oracle America Inc. That "original assignee" rendering is an artifact of the later name change — the legal-events record shows the 2007 assignment went to SUN MICROSYSTEMS, INC., not to an entity named Oracle. The true original assignee is Sun Microsystems, Inc. I have used the assignment record rather than the Google Patents header field.


Assignment timeline

Two recordings appear in the record. Both are internal/corporate in nature; neither is a transfer outside the Sun→Oracle corporate family.

1. 2007-06-11 (recorded) — Reel [NOT RETRIEVED]/[NOT RETRIEVED]

  • Conveyance: Assignment — "ASSIGNMENT OF ASSIGNORS INTEREST" (inventors' initial conveyance)
  • Assignor: Mohamed M. Abdelaziz; Bernard Traversat; Shreedhar Ganapathy; Lawrence White; Abhijit Kumar
  • Assignee: Sun Microsystems, Inc.
  • Correspondent: [NOT RETRIEVED] — cannot confirm recurrence.
  • Context: Ordinary initial assignment of employee-inventor rights to the employer at filing.

2. 2015-12-16 (recorded) — Reel [NOT RETRIEVED]/[NOT RETRIEVED]

  • Conveyance: Merger and Change of Name (blanket portfolio recording)
  • Assignor: Sun Microsystems, Inc.; Oracle USA, Inc.; Oracle America, Inc.
  • Assignee: Oracle America, Inc.
  • Correspondent: [NOT RETRIEVED] — cannot confirm recurrence.
  • Context: Internal corporate reorganization. Oracle acquired Sun (closed Jan 2010) and renamed it Oracle America; this recording memorializes the merger/name change across the portfolio. Note the ~6-year lag between the merger close (Jan 2010) and the recording (Dec 2015) — consistent with a bulk cleanup filing, not a transactional transfer.

No other assignments exist in the record. There is no post-issuance transfer to any LLC, no security interest, no license record, and no terminal assignment to a third party.

Cross-checks:

  • SEC / corporate: Oracle's Form 10-K for FY2009 (filed 2009) documents the Sun merger; the Oracle v. Google record (N.D. Cal. 3:10-cv-03561) contains Oracle's own statement that "Sun's name changed to Oracle America" upon the January 2010 acquisition — corroborating recording #2 as a pure name-change.
  • Litigation: That same Oracle v. Google case asserted the Java patents '476, '520, '104, '205, '702, '720 — none of which is US 7,788,522. This patent is not among the patents Oracle has asserted, consistent with the prior litigation section's "no litigation located" finding.

Timeline diagram

timeline
    title Ownership of US 7788522
    2007 : Filed by five inventors
         : Assigned to Sun Microsystems
    2010 : Patent issued
         : Oracle acquires Sun
    2015 : Merger recorded to Oracle America

NPE / troll-pattern signals

1. Shell-entity transfer — NOT PRESENT.
No assignee in the chain carries an "IP / Patents / Licensing / Holdings / Ventures" suffix, and no LLC appears at all. Both assignees are well-known operating corporations (Sun Microsystems, Inc.; Oracle America, Inc.). No registered-agent-service address, no single-purpose entity. No reel/frame supports this signal.

2. Known asserter in the chain — NOT PRESENT.
Neither assignee matches any public NPE list (Acacia, Marathon Patent Group, Intellectual Ventures, IPNav, Wi-LAN, Mosaid/Conversant, Vringo, Pendrell, Innovatio, MPHJ, Lumen View, Round Rock, Document Generation Corp, Spangenberg entities, or any Unified Patents / RPX high-frequency plaintiff). Oracle is a practicing operating company; while it is a documented patent plaintiff on other patents (Oracle v. Google, Oracle v. SAP, Oracle v. Rimini Street), it is a classic operating-company enforcer, not an NPE. No reel/frame in this chain names any NPE.

3. Repeat correspondent across the chain — UNCLEAR (no data).
This is the one signal I could not test. The correspondent of record for both recordings is [NOT RETRIEVED], so I cannot assess whether a single attorney/firm handled both links (or recurs elsewhere). I am not inferring an NPE handler from the absence of data — this signal is genuinely unresolved, not "negative by default."

4. Cascading transfers — NOT PRESENT.
Only two recordings over ~8 years (2007 and 2015), and the second is a merger/name change rather than a beneficial conveyance. There is no chain of LLCs, no shared-correspondent clustering, and no sub-24-month conveyor belt.

5. Pre-litigation transfer — NOT PRESENT.
No infringement suit naming this patent has been located (see prior section), so there is no assignment "within 6 months before" a suit. The only post-issue recording (2015) postdates issuance by five years and is unrelated to any assertion.

6. Bankruptcy fire-sale — NOT PRESENT (with a nuance).
The Sun→Oracle event was a going-concern acquisition, not a Chapter 7/11 sale of the type seen with Kodak, Nortel, or Polaroid. Sun was financially distressed and the deal was consummated in a distressed climate, but the transfer of this patent occurred through a corporate merger/name change (recording #2), not through a bankruptcy estate sale. It therefore does not meet the "bankruptcy fire-sale" definition.

7. Privateering — NOT PRESENT.
No transfer to an NPE asserting on Oracle's behalf. The patent has never left the original corporate family; there is no operating-company→NPE hand-off.

8. Defensive aggregator (anti-NPE) — NOT PRESENT.
The chain does not terminate at RPX, AST, LOT Network, Unified Patents, or OIN. (So the patent is not "neutralized" by a defensive aggregator — it simply remains an operating-company asset.)


Verdict

Operating-company assertion.

Justification: The record contains exactly two conveyances — the inventors' original assignment to Sun Microsystems, Inc. (recorded 2007-06-11) and a merger/change-of-name recording to Oracle America, Inc. (recorded 2015-12-16). Beneficial ownership has never left the original corporate family, and no NPE-shell, cascading-LLC, correspondent-recurrence, or fire-sale evidence appears in any reel/frame. The current owner is a large operating company, so this is not an NPE file.

Caveat for accuracy: the "assertion" prong is not independently established for this specific patent — the prior litigation section found no suit naming US 7,788,522. Oracle is, however, a documented operating-company patent enforcer generally. If the reader requires a proven-assertion finding rather than an ownership finding, the strict alternative reading is "Insufficient data" (the chain is, in substance, just the original assignment plus a non-transferring name-change). Either way, there is no NPE involvement — that is the operative conclusion, and it is driven by the 2007-06-11 (→ Sun) and 2015-12-16 (merger → Oracle America) recordings.

Verify at USPTO Assignment Center: https://assignmentcenter.uspto.gov/ (select "Patent Assignment Search," query 7788522) — also indexed at https://assignment.uspto.gov/patent/index.html. When you open the two records, capture the reel/frame and the correspondent of record; those two fields are the only gaps in this analysis and would conclusively settle signal #3.

Generated 9/30/2026, 3:34:27 PM

Prior art

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

✓ Generated

I'll search for the USPTO record and the cited prior art references for US 7,788,522.

Let me search for the specific citation tables and related references.

Let me try alternative databases that mirror the citation list.

Method note and a hard limitation (read first)

I attempted to retrieve the examiner's front-page "References Cited / U.S. Patent Documents" table for US 7,788,522 from Google Patents, USPTO.report, and a citation-mirror query. I could not retrieve that table. The Google Patents fetch truncates before the citation tables render, and two follow-up citation queries aborted at the search-step limit. I will not reconstruct the examiner's citation list from memory — doing so would risk fabricating references.

What I can ground authoritatively is the set of references that appear inside the patent's own text (the specification and its incorporation-by-reference clauses). Those are reproduced verbatim in the patent document I was given, so I treat them as verified. I separate these clearly from a second, clearly-labeled group of field-level prior art known to me generally, which I flag as not verified as record citations for this patent.


A. References appearing in the patent text (verified)

# Full citation Date Where it appears
A1 U.S. Pat. No. 7,065,579 B2 — "System using peer discovery and peer membership protocols for accessing peer-to-peer platform resources on a network," to Traversat et al. Filed ~2001 (JXTA-era); issued 2006 Expressly incorporated by reference in the Detailed Description
A2 Project JXTA 2.0 Super-Peer Virtual Network, by Bernard Traversat et al. May 25, 2003 Non-patent literature, incorporated by reference
A3 U.S. Application Ser. No. 11/756,494 — "Method And Apparatus For Encoding And Mapping Of Virtual Addresses For Clusters," to Mohamed M. Abdelaziz et al. Filed 2007 (co-pending at time of filing) Expressly incorporated by reference
A4 RFC 793 (Transmission Control Protocol), IETF September 1981 Cited in the definitions section (background only)

Also named in the Background (as products, not documentary citations): Veritas™ Cluster Server, HP Serviceguard, Microsoft Cluster Server — recited only to establish the general cluster-art context.


B. § 102 analysis — reference by reference

A reminder on the standard I'm applying: anticipation under 35 U.S.C. § 102 requires that a single reference disclose every element of a claim, arranged as claimed. Partial disclosures are § 103 (obviousness) material, not § 102 material. Claim 1's elements are (i) examining a first cluster view to identify a candidate master via a sorted order of member identifiers; (ii) sending an assertion announcement; and (iii) on master collision, obtaining/coalescing/sorting updated views from every member and re-identifying the master.

A1 — U.S. Pat. No. 7,065,579 B2 (Traversat et al.)

  • Brief description: Peer discovery and peer-membership protocols for a peer-to-peer platform (JXTA); peers publish/query advertisements to discover each other and join/leave peer groups; group membership is maintained through advertised group metadata.
  • Claims it potentially anticipates: None of claims 1–4 as a complete anticipation. It is a discovery/membership teaching, not a deterministic master-election-by-sorted-identifier teaching, and it does not disclose the master-collision message → re-query → coalesce → re-sort loop that is the core of claim 1(iii).
  • Where it is relevant: it is the closest record reference for the claim 2 discovery/query/response step ("sending a master node query message… receiving at least one authoritative cluster view"). Even there, the mapping is imperfect, so a § 102 anticipation of claim 2 is doubtful; a § 103 combination is more likely than a § 102 hit.
  • Confidence: High on the reference's general subject matter; moderate on the exact issue date (I could not re-verify the precise day in this session — my search returned classification data but not the grant date).

A2 — Project JXTA 2.0 Super-Peer Virtual Network (Traversat et al., May 25, 2003)

  • Brief description: Describes JXTA's super-peer (rendezvous/relay) topology, peer-group membership, and advertisement model.
  • Claims it potentially anticipates: None. It is architectural/background NPL. It supports the JXTA overlay-network context and the membership/advertisement mechanics referenced in claim 2, but discloses no sorted-identifier master election and no collision-resolution loop. Not a standalone § 102 reference against any claim.
  • Note: This is the reference most likely to coincide with a printed publication date (2003) that predates the 2007 filing by ~4 years, so it is unambiguously available as prior art under § 102(a)/(b) if it disclosed the claimed subject matter — which, on the record before me, it does not.

A3 — U.S. App. Ser. No. 11/756,494 (Abdelaziz et al.)

  • Brief description: Encoding and mapping of virtual addresses for clusters (the JXTA-based cluster addressing companion filing).
  • Claims it potentially anticipates: None. Different subject matter (address encoding/mapping). It is incorporated to supply the cluster-addressing context, not the election mechanism. Because it is a co-pending, commonly-owned application incorporated by reference, it would also be subject to § 102(e)/§ 103(c) considerations in any event.

A4 — RFC 793 (TCP)

  • Brief description: The TCP specification, cited only to define "network connection."
  • Claims it potentially anticipates: None. Pure background/terminology.

C. Forward citations — explicitly not prior art to US 7,788,522

My searches surfaced documents that cite US 7,788,522 as prior art against them. These are forward citations and must not be confused with prior art for this patent, but they are useful for showing how the patent is later characterized and for finding the same field:

  • CN 107111457 B (NetApp; "Non-disruptive controller replacement in a cross-cluster redundancy configuration," app. 201580072388.9) lists US7788522 B1, 2010.08.31 among its 对比文件 (references), alongside WO2011149665 A1, US2012233117 A1, and US2014047263 A1.

⚠️ Identifier warning (per your literal-interpretation rule): several search hits referenced an "'852 patent" / "US 7788522" inside unrelated search-report boilerplate (e.g., robotics and food-science EPO search reports, Systems and methods for dispersing and clustering a plurality of robotic devices / US 7,844,364). Those are different documents and different numbers and I have not treated them as citations of US 7,788,522.


D. Field-level prior art I know generally — flagged as UNVERIFIED for this record

I could not confirm that any of the following were cited on the face of US 7,788,522. I list them because they are the references a competent § 102/§ 103 analysis of this claim set would look for, but treat them as leads to verify, not as the patent's citation list:

  • The "bully" election algorithm — Garcia-Molina, "Elections in a Distributed Computing System," IEEE Trans. Computers, 1982. Elects the highest-numbered process as coordinator and re-runs election on failure. This is the single closest conceptual analog to claim 1's "sorted order of cluster member identifiers" + "highest unique identifier" master selection. It does not show the cluster-view coalescing from every member or the explicit master-collision message mechanism, so it is a § 103 (not § 102) threat at most — and again, I have not verified it as a record citation for US 7,788,522.
  • JXTA cluster-master / membership references in the same Oracle/Sun family (e.g., the JXTA peer-group protocols) — potentially § 102(a)/(b) on the claim 2 discovery elements.

I deliberately stop there rather than name specific U.S. patent numbers I cannot verify.


E. Bottom line

  1. The patent's own text cites four references (A1–A4 above), all of which are either background/context (A2, A4) or unrelated companion subject matter (A3), or a discovery/membership teaching that does not reach the collision-resolution core of claim 1 (A1).
  2. On the record I can verify, no cited reference anticipates claim 1 under § 102. Claim 1's distinctive limitation (obtain an updated view from each member → coalesce → sort → re-identify on collision) is not shown by any of A1–A4.
  3. The genuine § 102/§ 103 exposure, if any, sits in the examiner's front-page citation list that I could not retrieve — and possibly in NPL like the bully algorithm (Section D), which I flag as unverified.
  4. This is a "not found / not retrievable," not a definitive "none exists." My citation-table retrieval failed; the patent simply has 20 claims and I have full text only for claims 1–4.

To close the gap (recommended): pull the front-page "References Cited" directly from USPTO PatentCenter for application 11/756,480, and the "Citations / Cited By" tabs on the Google Patents page (https://patents.google.com/patent/US7788522/en) rendered in a browser rather than via truncated fetch; cross-check against Espacenet (https://worldwide.espacenet.com/) and the patent's file wrapper. Those sources will give the exact examiner-cited U.S. patent documents and NPL that this report is currently missing.

Generated 9/30/2026, 3:34:09 PM

Obviousness

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

✓ Generated

I'll ground this analysis in actual prior-art references. First, let me note a problem and then run targeted searches.

Gap flag: The task says to "use the results from the Prior Art section of this page," but no Prior Art section was included in the material provided to me — the only prior-art information I have is what is cited inside the patent itself (U.S. 7,065,579 to Traversat; JXTA 2.0; co-pending Ser. No. 11/756,494) plus the background's mention of Veritas Cluster Server / HP Serviceguard / Microsoft Cluster Server, and the truncated claim text. I'll do my own prior-art searches to build the obviousness case, and I'll flag where I'm inferring.

Good — I have strong candidates. Let me pin down dates and check a few more clusters of prior art (membership-view coalescing, and "in-doubt" health semantics).

Obviousness Analysis — U.S. Patent No. 7,788,522 B1 (35 U.S.C. § 103)

0. Scope, inputs, and two flags

Flag 1 — the "Prior Art section" was not actually provided. The task instructs me to use "the results from the Prior Art section of this page," but no such section was included in my materials. What I do have is (a) the full specification/abstract/background, (b) the prior-art references cited on the face of the patent and incorporated by reference (Traversat U.S. 7,065,579; JXTA 2.0; co-pending Ser. No. 11/756,494), and (c) the background's admissions about Veritas Cluster Server, HP Serviceguard, and Microsoft Cluster Server. To make the §103 case concrete I ran independent prior-art searches. If you have a specific prior-art list, send it and I will re-chart against it — my analysis is a substitute, not a reading of your list.

Flag 2 — correction to the earlier sections (claim text). The previously generated sections stated that claims 5–20 could not be verified. My searches recovered substantial text of claims 5–11 and the opening of independent claim 12 (from the granted-PDF snippet). Two things follow:

  • Claim 12 is a second independent claim — "A computer readable medium comprising computer readable code for managing a network cluster…" (CRM/ Beauregard-style claim).
  • Claims 13–20 remain unavailable to me. I will not reconstruct them. All statements below about claims 12–20 are therefore limited.

Source for the claim text recovered: http://patentimages.storage.googleapis.com/2d/10/67/10e75ffc0447d6/US7788522.pdf


1. Legal framework

  • Governing law: The application was filed 2007-05-31, so pre-AIA 35 U.S.C. § 103(a) applies. Priority art must predate the invention (and, for printed publications, generally the §102(b) one-year bar).
  • Standard: Under Graham v. John Deere, obviousness turns on (1) the scope/content of the prior art, (2) the differences between the prior art and the claims, (3) the PHOSITA's level of ordinary skill, and (4) objective indicia (secondary considerations).
  • Combination rule: Under KSR Int'l v. Teleflex (2007), a claim is obvious where it combines known elements according to known methods to yield predictable results, or where there was a "design need or market pressure" and a finite number of identified, predictable solutions. A teaching, suggestion, or motivation to combine is not required — a reasoned rationale suffices.

Postscript already incorporated: For this patent, the specification itself incorporates U.S. 7,065,579 and the JXTA 2.0 specification by reference, which imports those teachings as if set forth.


2. PHOSITA

A person of ordinary skill in the art as of May 2007 would be a software/systems engineer with a bachelor's degree in CS/EE and ~3–5 years' experience designing distributed or high-availability clustered systems, familiar with (i) leader-election algorithms, (ii) cluster membership/heartbeat protocols (Veritas, Serviceguard, MSCS, Sun Cluster), and (iii) peer-to-peer discovery frameworks (JXTA). This is a routine-skill, applied-systems patent; the PHOSITA is expressly presumed to know the well-known engineering toolbox (KSR).


3. Prior-art references relied upon

Ref Reference Key date Relevance
A Garcia-Molina, Elections in a Distributed Computing System, IEEE Trans. Computers, C-30(1):48–59 (Jan. 1982) ("bully" algorithm) 1982 (printed pub.) Coordinator elected as the process with the highest unique ID; competing/near-simultaneous elections resolved deterministically. Source: https://ieeexplore.ieee.org/abstract/document/7030789/references; textbook treatments at http://www.inf.fu-berlin.de/lehre/SS05/VS/folien/vs5.3.pdf
B U.S. 6,363,416 B1, Naeimi et al., System and method for automatic election of a representative node… with built-in redundancy, 3Com Corp.; filed 1998-08-28, granted 2002-03-26 1998/2002 Master discovery (MDReq/MDResp), heartbeat + timeout, master election & negotiation, master-claim (MC) announcement, simultaneous competing masters and arbitration, tie-break by identifier (lower physical address wins). Source: https://patents.google.com/patent/US6363416B1
C U.S. 7,065,579 B2, Traversat et al., Sun Microsystems (granted 2006-06-20; filed 2002-01-22) — cited on the face of the patent and incorporated by reference 2002/2006 P2P platform with peer discovery + peer membership protocols, advertisements, unique peer identifiers (UUIDs), peer groups, bootstrap nodes. Source: https://patents.google.com/patent/US7065579
D U.S. 7,401,153 B2 / US 2002/0147771 A1, Traversat et al., Peer-to-peer computing architecture 2002/2008 Peers discover each other, form peer groups, publish advertisements (XML metadata w/ UUIDs), rendezvous peers cache/re-propagate. Source: .../US7401153.pdf
E JXTA v2.0 Protocols Specification, Duigou, IETF Internet-Draft draft-duigou-jxta-protocols-05 (2004-06-29); Project JXTA 2.0 Super-Peer Virtual Network (Traversat et al., May 25, 2003 — cited in the patent) 2003/2004 Six protocols standardizing how peers "self-organize into peergroups, publish and discover peer resources, communicate, and monitor each other"; Peer Information Protocol (peer status), Rendezvous Protocol (propagation). Source: https://marc.info/?l=ietf-announce&m=108854078922014
F U.S. 8,189,461 / US 2009/0129397, Cluster bring-up in a distributed topology liveness system date unverified ⚠️ Ranks all nodes by IP address; highest IP address → highest rank; "PROCLAIM" messages; goal is "a single group with all the nodes, and that group has a single group leader." Source: https://patents.google.com/patent/US20090129397 — flagged: I could not confirm its priority date is before 2007-05-31, so I do not rely on it as primary art.
G OSPF Designated-Router election, RFC 2328 §9.4 (Moy, Apr. 1998) 1998 Routers on a broadcast network elect a DR by highest Router Priority, ties broken by highest Router ID — deterministic election by ordering of identifiers. ⚠️ General knowledge; not fetched in this session.
Background Patent's own admission (col. 1): Veritas Cluster Server, HP Serviceguard, Microsoft Cluster Server; "Selection of the master … is of major concern"; "Traditional dynamic approaches…" — Admissions/known art context.

4. Claim chart — independent claims

Claim 1 (apparatus)

Element Grounding prior art Reasoning
a) "examine a first view of the cluster … identify a candidate master based on a sorted order of cluster member identifiers" A (elect highest unique ID); G (order-by-ID election); C/D/E (membership "view" = set of advertisements, each carrying a UUID) Garcia-Molina discloses electing the coordinator as the node with the highest unique identifier; sorting a member list by ID and taking an endpoint is the direct implementation. JXTA/Traversat supplies the "view" abstraction (peer group advertisement set keyed by UUIDs).
b) "when … identified as candidate … sending an announcement … first asserted master node" B (master-claim / MC message announced over the network) B expressly broadcasts an MC message declaring the sender the new master.
c) "upon detecting a master collision … second asserted master: obtain first updated cluster view from each member, coalesce, sort, identify master" B (multiple simultaneous masters → negotiation/arbitration & re-election); A (simultaneous elections); C/D/E (advertisements/view re-shared and re-propagated) B teaches exactly the triggering event ("multiple nodes may realize the absence of a master at about the same time") and a resolution protocol. Combining B's collision trigger with A's ordering rule and JXTA's view-sharing yields the claimed elements. Coalescing multiple received views into one sorted list is the natural union of a set of advertisement caches.

Verdict: Claim 1 is strongly suggestive of obviousness over B + A + C/D/E.

Claim 12 (computer-readable medium)

Same subject matter in CRM form. Under In re Beauregard, a CRM claim covering the same process is obvious whenever the underlying process is — the same chart governs.


5. Claim chart — the dependent claims I can read (2–11)

Claim Element Prior art Reasoning / motivation
2 Send master-node query; if master responds within a defined period, receive authoritative cluster view identifying the master B (MDReq/MDResp with a heartbeat timeout period, "the requesting node continues waiting until a response is received or until a heartbeat timeout period has expired"); E (Peer Discovery/Resolver Protocols) B's master-discovery handshake maps essentially 1:1.
3 Candidate = first identifier in sorted second view A; G Direct consequence of ordering by ID; trivial.
4 Sort lowest→highest OR highest→lowest A; G Both directions are the two obvious orderings; KSR ("finite number of predictable solutions").
5 Receive health message; determine member failed; device not master; obtain updated authoritative view excluding the failed member B (heartbeat/timeout failure detection); E (PIP — peer status/uptime); JXTA membership Failure detection + membership-view pruning is the disclosed function of cluster membership services (Veritas/Serviceguard/MSCS) and JXTA.
6 If no collision: announce master, assume cluster-management role, send authoritative view B (MC message + master message loop broadcasting heartbeats/config); C (peer group / bootstrap leadership) B's elected master enters a "master message loop" and asserts presence — same role.
7 Master failed → receive second updated cluster view from each member, coalesce & sort → third view → identify new candidate master B (loss of heartbeat → re-run master-discovery/election); A; C/D/E B's processes 200/300/500 re-initiate discovery/election on heartbeat loss; substituting the sorted-view rule of A yields the claim.
8 Updated views received via a cluster-view advertisement C/D/E (advertisements carrying peer/group metadata + UUIDs) Explicitly the JXTA mechanism the patent borrows.
9 Identifiers generated via secure hash (SHA) of a string name C/D/E (string→UUID naming/binding); SHA-1 is a notorious, conventional hash Using a secure hash to mint a collision-resistant node/cluster ID was conventional (DHTs, JXTA ID generation). This is the most "specific" limitation — see §7.
10 View comprises a cluster ID + ≥1 member ID C/D/E (peer-group advertisement = CID + peer IDs); D (content-id = peer-group UUID + name) Direct read.
11 Monitor health; on missed timeout (if master) send "in doubt" message; after a failure-verification interval send authoritative view declaring the member failed B (heartbeat timeout, multiple tolerated timeouts, "backoff"); known suspect→failed two-phase membership protocols The suspect/​"in doubt" → failed two-phase pattern is a well-known false-positive mitigation; B even teaches tolerating multiple heartbeat timeouts. Motivation: avoid prematurely evicting a node due to a transient network glitch.

Claims 13–20: not available to me — cannot chart. (Flagging explicitly per operating rules.)


6. Motivation to combine (the §103 "why")

A PHOSITA would have been motivated to combine these references for several independent reasons — any one of which supports the combination:

  1. Same field, same problem. All references address leader/coordinator selection and liveness in a group of cooperating network nodes. KSR: "familiar elements according to known methods."
  2. Express incorporation and common assignee. The patent incorporates U.S. 7,065,579 (Ref C) and JXTA 2.0 (Ref E) by reference, and Sun/​Traversat is a co-assignee of that family. That is the strongest possible motivation peg — the applicant itself told the world these teachings belonged in the specification.
  3. A finite, predictable set of solutions for the tie-break. Choosing the leader by an ordered identifier (bully/OSPF-style) is one of a handful of standard election schemes; using it to resolve a collision is "a predictable variation" (KSR).
  4. Design need / market pressure. The patent's own Background concedes the industry needed autonomous, human-free, fault-tolerant master selection. That pressure drives a designer straight to (a) deterministic election (Garcia-Molina/OSPF) + (b) collision handling (3Com) + (c) an advertisement/view substrate (JXTA).
  5. Collision handling is the stated problem to be solved by the combination. Because the chosen rule only works if all nodes see the same view, a designer is led to "obtain the view from each member, coalesce, and re-sort" — i.e., the final claim element is the natural consequence, not an inventive leap.

KSR summary: Claims 1–11 and 12 are, at bottom, the assembly of (i) a known election rule, (ii) a known collision-detection/announcement scheme, and (iii) a known advertisement/view transport — a combination whose results are predictable and which the field plainly prompted.


7. Where a non-obviousness (defense) argument could be made

To be balanced and honest, these are the weakest joints in the obviousness case and the arguments a patentee would press:

  • Claim 9 (SHA-hash of a string name). The prior-art mapping is by convention rather than by an explicit teaching. A patentee could argue no reference expressly ties a secure hash of a string-based name to the member identifier used in the sorted-view election. Expect a §103 rebuttal here — but KSR's "predictable results" and the JXTA string→UUID naming largely neutralize it.
  • The "coalesce the views from each member" limitation (claim 1). 3Com's arbitration is pairwise (competing nodes), not a global union of every member's view followed by re-sort. A patentee would argue this is the inventive core. Counter: Garcia-Molina's election is inherently all-nodes, and JXTA propagation yields exactly a coalesced view; the combination is nonetheless reasoned.
  • "INDOUBT" + "failure-verification interval" two-phase semantics (claim 11). If you cannot produce a reference that expressly teaches the labeled two-phase suspect→failed transition with a verification interval, this claim may survive on its own. (I did not verify a specific reference for this in-session — flag as a gap.)
  • Objective indicia. I found no evidence of secondary considerations (no long-felt-need testimony, no licensing/industry-praise record, and no litigation specific to 7,788,522 — consistent with the earlier sections). Absent such evidence, the obviousness case is not rebutted on Graham factor 4.
  • Ref F and Ref G caution. Ref F's date is unverified; Ref G (OSPF) is asserted from general knowledge, not fetched this session. Do not lead with either. Ref B + A + C/D/E is the load-bearing combination.

8. Bottom line

  • Strongest attack: U.S. 6,363,416 (3Com) as primary art (collision detection/resolution + heartbeat + master-claim), in view of Garcia-Molina 1982 (elect highest unique ID) and the JXTA/Traversat family (Refs C/D/E — expressly incorporated by the patent itself) for the advertisement/view substrate. This combination renders claim 1 and claim 12 and dependent claims 2–8 and 10 obvious under KSR; claim 9 is obvious-by-convention (weaker); claim 11 is the most defensible but still vulnerable to the known suspect→failed membership pattern.
  • What I could not do: analyze claims 13–20 (text unavailable), confirm Ref F's priority date, and verify Ref G in-session.
  • Standing caveat: This is a technical/analyst §103 opinion, not a legal conclusion. Actual validity depends on the prosecution history, the full claim set (13–20), and the complete prior-art-of-record, none of which I fully have.

If you can supply (a) the "Prior Art section" you referenced and (b) the text of claims 13–20, I will re-run the chart against that exact art and complete the claim-by-claim analysis.

Generated 9/30/2026, 3:34:34 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 Software Technology & Computing Systems (T)

See all Software Technology & Computing Systems (T) patents →