@techreport{lcurley-moq-cluster-00,
    number =    {draft-lcurley-moq-cluster-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-lcurley-moq-cluster/00/},
    author =    {Luke Curley},
    title =     {{MoQ Cluster Extension}},
    pagetotal = 10,
    year =      2026,
    month =     aug,
    day =       3,
    abstract =  {This document defines a clustering extension for MoQ Transport {[}moqt{]}, used to build a mesh of relays. Each namespace advertisement carries the ordered list of Hop IDs it has traversed, starting with the original publisher, plus the accumulated cost of that path. A receiver uses the list to detect routing loops and to identify which advertisements come from the same publisher, and the cost to choose between paths. Each endpoint declares its own Hop ID during setup, and the peer uses it to avoid advertising or serving a path that already passed through that endpoint.},
}