Skip to main content

Why do valid pages appear in the 'Excluded' section of GSC, and what should be your next step?

Valid pages can appear in the “Excluded” section of Google Search Console (GSC) for several reasons, even if they are live and accessible. The “Excluded” category means Google is aware of the page but has chosen not to index it, or can't index it due to specific conditions.

Why do valid pages appear in the 'Excluded' section of GSC, and what should be your next step?

๐Ÿ” Common Reasons Valid Pages Are 'Excluded'

1. Crawled - Currently Not Indexed

  • Google crawled the page but decided not to index it yet.

  • Common for:

    • Thin content

    • Duplicate or low-quality pages

    • New or recently updated content

Next step: Improve content quality and usefulness; then request reindexing.

2. Discovered – Currently Not Indexed

  • Google knows about the page (e.g., from a sitemap or internal link) but hasn’t crawled it yet.

  • Often due to:

    • Crawl budget limits

    • New websites or large sitemaps

Next step: Build internal links to the page and monitor crawl activity.

3. Alternate Page with Proper Canonical Tag

  • The page is marked with a canonical pointing to another URL.

  • Google chooses to index the canonical page, not the alternate.

Next step: Check if the canonical is correct and intentional.

4. Duplicate Without User-Selected Canonical

  • Google detected it as a duplicate, even if you didn’t set a canonical.

  • It picked a different URL to index.

Next step: Set a canonical tag explicitly to control which version is indexed.

5. Excluded by ‘noindex’ Tag

  • The page has a <meta name="robots" content="noindex">.

Next step: Remove the noindex tag if you want the page indexed.

6. Blocked by robots.txt

  • Page is disallowed from crawling, so it can’t be indexed.

Next step: Update robots.txt to allow crawling if you want it indexed.

7. Soft 404

  • Page returns content, but Google considers it "empty" or not useful enough.

Next step: Add meaningful content and ensure proper status codes.

What Should Be Your Next Step?

๐Ÿ›  Use the URL Inspection Tool

  • Inspect the excluded URL to see:

    • Crawlability

    • Indexing decision

    • Canonical URL

    • Live test result

✅ Decide Intent

  • Ask: Should this page be indexed?

    • If yes: Fix issues (e.g., improve content, fix canonical/noindex/robots).

    • If no: You can safely ignore it.

๐Ÿ“ค Request Indexing (After Fixes)

Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. ๐Ÿ”„ How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . ๐Ÿ” What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . ๐Ÿšซ Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. ๐Ÿ” Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: ๐Ÿ”ง 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. ๐Ÿง  2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. ๐Ÿง  What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. ๐Ÿ” Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...