diff --git a/packages/beacon-node/src/network/processor/gossipQueues/index.ts b/packages/beacon-node/src/network/processor/gossipQueues/index.ts
index 347458c91445..968c11501426 100644
--- a/packages/beacon-node/src/network/processor/gossipQueues/index.ts
+++ b/packages/beacon-node/src/network/processor/gossipQueues/index.ts
@@ -3,16 +3,8 @@ import {GossipType} from "../../gossip/interface.js";
 import {PendingGossipsubMessage} from "../types.js";
 import {getGossipAttestationIndex} from "../../../util/sszBytes.js";
 import {LinearGossipQueue} from "./linear.js";
-import {
-  DropType,
-  GossipQueue,
-  GossipQueueOpts,
-  QueueType,
-  isIndexedGossipQueueAvgTimeOpts,
-  isIndexedGossipQueueMinSizeOpts,
-} from "./types.js";
+import {DropType, GossipQueue, GossipQueueOpts, QueueType, isIndexedGossipQueueMinSizeOpts} from "./types.js";
 import {IndexedGossipQueueMinSize} from "./indexed.js";
-import {IndexedGossipQueueAvgTime} from "./indexedAvgTime.js";
 
 /**
  * In normal condition, the higher this value the more efficient the signature verification.
@@ -120,8 +112,6 @@ export function createGossipQueues(beaconAttestationBatchValidation = false): {
   return mapValues(gossipQueueOpts, (opts) => {
     if (isIndexedGossipQueueMinSizeOpts(opts)) {
       return new IndexedGossipQueueMinSize(opts);
-    } else if (isIndexedGossipQueueAvgTimeOpts(opts)) {
-      return new IndexedGossipQueueAvgTime(opts);
     } else {
       return new LinearGossipQueue<PendingGossipsubMessage>(opts);
     }
diff --git a/packages/beacon-node/src/network/processor/gossipQueues/indexedAvgTime.ts b/packages/beacon-node/src/network/processor/gossipQueues/indexedAvgTime.ts
deleted file mode 100644
index b7bba4c132bb..000000000000
--- a/packages/beacon-node/src/network/processor/gossipQueues/indexedAvgTime.ts
+++ /dev/null
@@ -1,129 +0,0 @@
-import {GossipQueue, IndexedGossipQueueOpts} from "./types.js";
-
-type ItemList<T> = {
-  items: T[];
-  avgRecvTimestampMs: number;
-};
-
-function listScore<T>(list: ItemList<T>): number {
-  return list.items.length / Math.max(1000, Date.now() - list.avgRecvTimestampMs);
-}
-
-/**
- * An implementation of GossipQueue that tries to run the batch with highest score first.
- * TODO: add unit tests
- * - index items by indexFn using a map
- * - compute avgRecvTimestampMs for each key every time we add new item
- * - on next, pick the key with the highest score (check the score function above)
- */
-export class IndexedGossipQueueAvgTime<T extends {indexed?: string}> implements GossipQueue<T> {
-  private _length = 0;
-  private indexedItems: Map<string, ItemList<T>> = new Map();
-
-  constructor(private readonly opts: IndexedGossipQueueOpts<T>) {}
-
-  get length(): number {
-    return this._length;
-  }
-
-  get keySize(): number {
-    return this.indexedItems.size;
-  }
-
-  clear(): void {
-    this.indexedItems = new Map();
-    this._length = 0;
-  }
-
-  // not implemented for this gossip queue
-  getDataAgeMs(): number[] {
-    return [];
-  }
-
-  /**
-   * Add item to gossip queue. If queue is full, drop first item of first key.
-   * Return number of items dropped
-   */
-  add(item: T): number {
-    const key = this.opts.indexFn(item);
-    if (key == null) {
-      // this comes from getAttDataBase64FromAttestationSerialized() return type
-      // should not happen
-      return 0;
-    }
-    item.indexed = key;
-    let list = this.indexedItems.get(key);
-    if (list == null) {
-      list = {
-        items: [],
-        avgRecvTimestampMs: Date.now(),
-      };
-      this.indexedItems.set(key, list);
-    } else {
-      list.avgRecvTimestampMs = (list.avgRecvTimestampMs * list.items.length + Date.now()) / (list.items.length + 1);
-      list.items.push(item);
-    }
-    this._length++;
-    if (this._length <= this.opts.maxLength) {
-      return 0;
-    }
-
-    // overload, need to drop more items
-    const firstKey = this.indexedItems.keys().next().value as string;
-    // there should be at least 1 key
-    if (firstKey == null) {
-      return 0;
-    }
-    const firstList = this.indexedItems.get(firstKey);
-    // should not happen
-    if (firstList == null) {
-      return 0;
-    }
-
-    const deletedItem = firstList.items.shift();
-    if (deletedItem != null) {
-      this._length--;
-      if (firstList.items.length === 0) {
-        this.indexedItems.delete(firstKey);
-      }
-      return 1;
-    } else {
-      return 0;
-    }
-  }
-
-  /**
-   * Try to get list of items of the same key with highest score
-   */
-  next(): T[] | null {
-    let maxScore = 0;
-    let maxScoreKey: string | undefined;
-    for (const [key, list] of this.indexedItems) {
-      const score = listScore(list);
-      if (score > maxScore) {
-        maxScore = score;
-        maxScoreKey = key;
-      }
-    }
-
-    if (maxScoreKey == null) {
-      return null;
-    }
-    const items = this.indexedItems.get(maxScoreKey)?.items;
-    if (items == null) {
-      // should not happen
-      return null;
-    }
-    this.indexedItems.delete(maxScoreKey);
-    this._length = Math.max(0, this._length - items.length);
-    return items;
-  }
-
-  getAll(): T[] {
-    const items: T[] = [];
-    for (const list of this.indexedItems.values()) {
-      items.push(...list.items);
-    }
-    return items;
-  }
-}
diff --git a/packages/beacon-node/src/network/processor/gossipQueues/types.ts b/packages/beacon-node/src/network/processor/gossipQueues/types.ts
index 448f44c3f5d7..58034e82ed06 100644
--- a/packages/beacon-node/src/network/processor/gossipQueues/types.ts
+++ b/packages/beacon-node/src/network/processor/gossipQueues/types.ts
@@ -1,4 +1,4 @@
-export type GossipQueueOpts<T> = LinearGossipQueueOpts | IndexedGossipQueueOpts<T> | IndexedGossipQueueMinSizeOpts<T>;
+export type GossipQueueOpts<T> = LinearGossipQueueOpts | IndexedGossipQueueMinSizeOpts<T>;
 
 export type LinearGossipQueueOpts = {
   type: QueueType;
@@ -25,15 +25,6 @@ export function isIndexedGossipQueueMinSizeOpts<T>(opts: GossipQueueOpts<T>): op
   );
 }
 
-export function isIndexedGossipQueueAvgTimeOpts<T>(opts: GossipQueueOpts<T>): opts is IndexedGossipQueueOpts<T> {
-  const avgTimeOpts = opts as IndexedGossipQueueMinSizeOpts<T>;
-  return (
-    avgTimeOpts.indexFn !== undefined &&
-    avgTimeOpts.minChunkSize === undefined &&
-    avgTimeOpts.maxChunkSize === undefined
-  );
-}
-
 export interface GossipQueue<T> {
   length: number;
   keySize: number;