Boise Standard Boise Standard
Record · Measure · Verify
◈ PROVENANCE STATUS
ENTITY CLASS RESEARCH
CORPUS RESEARCH
JURISDICTION global
CHARACTERS 134K
HELIX POSITION 1
ROOT-LD LIVE · INDEXED
PIPELINE BST-PIPELINE-1.0.0
MINTED 2026-06-29
global Jurisdiction
Enforcement Date
Penalty Provision
1 Helix Position

Unicast and Multicast Qos Routing with Soft Constraint Logic Programming

To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph (multicast), where the weight on a connector corresponds to the multidimensional cost of sending a packet on the related network link: each component of the weights vector represents a different QoS metric value (e.g.

Entity Class
Research
Jurisdiction
Global
Characters Indexed
134K
Minted
2026-06-29
Pipeline
BST-PIPELINE-1.0.0
◈ Canonical Citation — Copy These URLs ROOT-LD · MANIFEST · INDEX
◈ Document Body — Full Text · 134K CharactersFTS5 INDEXED
8002 rpA 12 ]OL.sc[ 3v3871.4070:viXra Unicast and Multicast QoS Routing with Soft Constraint Logic Programming STEFANO BISTARELLI Universit`a Chieti-Pescara, Istituto di Informatica e Telematica UGO MONTANARI Universit`a di Pisa FRANCESCA ROSSI Universit`a di Padova and FRANCESCO SANTINI IMT - Institute for Advanced Studies, Istituto di Informatica e Telematica We present a formal model to represent and solve the unicast/multicast routing problem in net- works with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph (multicast), where the weight on a connector corresponds to the multidimensional cost of sending a packet on the related network link: each component of the weights vector represents a different QoS metric value (e.g. band- width, cost, delay, packet loss). The second step consists in writing this graph as a program in Soft Constraint Logic Programming (SCLP): the engine of this framework is then able to find the best paths/trees by optimizing their costs and solving the constraints imposed on them (e.g. delay ≤ 40msec), thus finding a solution to QoS routing problems. Moreover, c-semiring struc- tures are a convenient tool to model QoS metrics. At last, we provide an implementation of the framework over scale-free networks and we suggest how the performance can be improved. Categories and Subject Descriptors: D.3.2 [Programming Languages]: Language Classifica- tions—Constraint and logic languages; D.3.3 [Programming Languages]: Language Constructs and Features—Constraints; C.2.3 [Computer-Communication Networks]: Network Opera- tions—Network management; F.4.1 [Mathematical Logic And Formal Languages]: Mathe- matical Logic—Logic and constraint programming General Terms: Languages, Measurement, Theory Author’s address: Stefano Bistarelli, Dipartimento di Scienze, Universit`a di Chieti-Pescara, Viale Pindaro 42, Pescara, 65127, Italy. bista@sci.unich.it. - Institute for Informatics and Telemat- ics, Via G. Moruzzi 1, 56100 Pisa, Italy. stefano.bistarelli@iit.cnr.it. Ugo Montanari, Dipartimento di Informatica, Universit`a di Pisa, Largo Bruno Pontecorvo 3, Pisa, 56127, Italy. ugo@di.unipi.it Francesca Rossi, Dipartimento di Matematica Pura e Applicata, Universit`a di Padova, Via Trieste 63 35121 Padova, Italy. frossi@math.unipd.it Francesco Santini, IMT - Institute for Advanced Studies, Piazza San Ponziano 6, 55100 Lucca, Italy. f.santini@imtlucca.it. - Institute for Informatics and Telematics, Via G. Moruzzi 1, 56100 Pisa, Italy. francesco.santini@iit.cnr.it. Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on
◈ Root-LD — Three-Layer Provenance Record HELIX POSITION 1
LAYER 1 — ANCHOR · IMMUTABLE · PROVENANCE CORE · FEDERATION ID · 2026-06-29
{
  "@type": "rld:Anchor",
  "rld:uuid": "4c68fd22-5f46-4366-88e7-df2c2189b29e",
  "rld:federationId": "bs-9225ec04",
  "rld:contentHash": "77cc59be6878237eab8f96a46f263850c3f3392c22d5aef104bac70efa6f4dbe",
  "rld:primarySource": "https://arxiv.org/abs/0704.1783",
  "rld:sourceDomain": "",
  "rld:sourceVerified": false,
  "rld:collectionMethod": "fetch",
  "rld:collectionDate": "2026-06-29T22:01:01.963519+00:00",
  "rld:generationMethod": "automated",
  "rld:humanVerified": false,
  "rld:specVersion": "1.0",
  "rld:mintedAt": "2026-06-29T22:03:23.236926+00:00",
  "rld:pipeline": "BST-PIPELINE-1.0.0",
  "rld:pipelineRunId": "BST-PIPELINE-1.0.0-2026-06-29T22:01:01Z",
  "rld:entityClass": "research",
  "rld:mintTier": "research",
  "rld:schemaType": "ScholarlyArticle",
  "rld:immutable": true,
  "rld:immutableNote": "This anchor is immutable after mint. Amendment or re-mint produces a new helix position. The prior record is preserved in rld:crawlRecord. Constitutional Law II: the timestamp is the record.",
  "rld:manifest": {
    "bs:entityClass": "research",
    "bs:mintTier": "research",
    "bs:schemaType": "ScholarlyArticle",
    "bs:hasBody": true,
    "bs:hasRegulatory": false,
    "bs:hasResearch": true,
    "bs:hasDomain": false,
    "bs:hasSupplyChain": false,
    "bs:hasEnforcementDate": false,
    "bs:hasPenaltyProvision": false,
    "bs:hasAuthors": false,
    "bs:hasDoi": false,
    "bs:jurisdiction": "global",
    "bs:corpusSlug": "research",
    "bs:charCount": 134324,
    "bs:pageCount": 45,
    "rld:toc": {
      "rootLd": "https://boisestandard.org/ai/research/0704.1783/root-ld.json",
      "manifest": "https://boisestandard.org/ai/research/0704.1783/manifest.json",
      "indexRecord": "https://boisestandard.org/ai/research/0704.1783/index.json",
      "body": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body",
      "anchor": "https://boisestandard.org/ai/research/0704.1783/#root-ld-anchor",
      "recursive": "https://boisestandard.org/ai/research/0704.1783/#root-ld-recursive",
      "regulatory": null,
      "research": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body/research",
      "domain": null,
      "supplyChain": null
    }
  },
  "rld:linkPod": {
    "bsCanonicalUrl": "https://boisestandard.org/ai/research/0704.1783/",
    "rootLdUrl": "https://boisestandard.org/ai/research/0704.1783/root-ld.json",
    "manifestUrl": "https://boisestandard.org/ai/research/0704.1783/manifest.json",
    "indexJsonUrl": "https://boisestandard.org/ai/research/0704.1783/index.json",
    "sourceUrl": "https://arxiv.org/abs/0704.1783",
    "corpusUrl": "https://boisestandard.org/corpus/research/",
    "vocabUrl": "https://boisestandard.org/vocab#"
  }
}
LAYER 2 — BODY · FROZEN AT MINT · COMPLETE MEASUREMENT SNAPSHOT · 134K CHARS
{
  "@type": "rld:Body",
  "@id": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body",
  "rld:frozenAt": "2026-06-29T22:03:23.236926+00:00",
  "rld:bodyType": "research_corpus",
  "bs:identity": {
    "@id": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body/identity",
    "title": "Unicast and Multicast Qos Routing with Soft Constraint Logic Programming",
    "slug": "",
    "entityClass": "research",
    "corpusSlug": "research",
    "bsCanonicalUrl": "https://boisestandard.org/ai/research/0704.1783/",
    "sourceUrl": "https://arxiv.org/abs/0704.1783"
  },
  "bs:research": {
    "@id": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body/research",
    "doi": "",
    "arxivId": "0704.1783",
    "authors": [],
    "venue": "",
    "publicationDate": "",
    "researchCategories": [],
    "abstract": "",
    "citationCount": 0,
    "openAccess": false,
    "license": "",
    "note": "Research corpus record. Every field traces to the source. arXiv API or Semantic Scholar as primary source. Constitutional Law I."
  },
  "bs:provenance": {
    "@id": "https://boisestandard.org/ai/research/0704.1783/#root-ld-body/provenance",
    "sourceUrl": "https://arxiv.org/abs/0704.1783",
    "collectionMethod": "api",
    "collectionDate": "2026-06-29T22:01:01.963519+00:00",
    "contentHash": "77cc59be6878237eab8f96a46f263850c3f3392c22d5aef104bac70efa6f4dbe",
    "pipelineVersion": "BST-PIPELINE-1.0.0",
    "mintedAt": "2026-06-29T22:03:23.236926+00:00"
  },
  "bs:textSummary": {
    "charCount": 134324,
    "fullBodyUrl": "https://boisestandard.org/ai/research/0704.1783/body.txt",
    "excerpt": "##PAGE:1##\n8002\nrpA\n12\n]OL.sc[\n3v3871.4070:viXra\nUnicast and Multicast QoS Routing with Soft\nConstraint Logic Programming\nSTEFANO BISTARELLI\nUniversit`a Chieti-Pescara, Istituto di Informatica e Telematica\nUGO MONTANARI\nUniversit`a di Pisa\nFRANCESCA ROSSI\nUniversit`a di Padova\nand\nFRANCESCO SANTINI\nIMT - Institute for Advanced Studies, Istituto di Informatica e Telematica\nWe present a formal model to represent and solve the unicast/multicast routing problem in net-\nworks with Quality of Service …"
  }
}
LAYER 3 — RECURSIVE · EMPTY AT MINT · GROWS THROUGH CORPUS PASSES · LAW VII TORUS
{
  "@type": "rld:Recursive",
  "@id": "https://boisestandard.org/ai/research/0704.1783/#root-ld-recursive",
  "rld:edgeCount": 0,
  "rld:edges": [],
  "rld:appendedAt": [],
  "rld:pendingSlots": [
    {
      "rld:slot": "related_entities",
      "rld:status": "pending",
      "rld:pass": "Bidirectional Corpus Pass",
      "rld:note": "BS entities with semantic connections to this record"
    },
    {
      "rld:slot": "law_corpus",
      "rld:status": "pending",
      "rld:pass": "Bidirectional Corpus Pass",
      "rld:note": "USC titles, CFR sections, EU AI Act, Idaho law governing this entity"
    },
    {
      "rld:slot": "research_corpus",
      "rld:status": "pending",
      "rld:pass": "Research Corpus Pass",
      "rld:note": "arXiv papers, Semantic Scholar records referencing this entity"
    },
    {
      "rld:slot": "supply_chain",
      "rld:status": "pending",
      "rld:pass": "Supply Chain Corpus Pass",
      "rld:note": "Supplier, manufacturer, distributor, retailer edges — the full chain"
    },
    {
      "rld:slot": "domain_entities",
      "rld:status": "pending",
      "rld:pass": "Domain Corpus Pass",
      "rld:note": "Web entities semantically connected to this record"
    }
  ],
  "rld:mintNote": "Recursive layer initialized at mint. Empty by design. Edges form through accumulated corpus passes. Law corpus, research corpus, domain graph, supply chain — every connection this entity has in the world accumulates here. The graph builds itself. Constitutional Law VII — Torus.",
  "rld:recursiveSpecUrl": "https://root-ld.org/spec/1.0/recursive",
  "rld:initializedAt": "2026-06-29T22:03:23.236926+00:00"
}