CLAMP: Maximizing the performance of TCP over low bandwidth variable rate access links Article Swipe
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.25916/sut.26263871.v1
This paper presents CLAMP, a distributed algorithm to enhance the performance of TCP connections that terminate in a wireless access network. CLMAP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit. Coupled with existing TCP sender side implementations and active queue management, CLAMP provides a complete end-to-end flow control scheme optimised for wireless access networks. CLAMP provides explicit control over wireless link utilisation and queueing delay, and allows a controlled proportion of the link capacity to be allocated to each flow sharing the same radio bearer. The only information required from the access network is the aggregate bottleneck queue size; specifically, it does not rely on propagation delay estimates. No modifications are required to the sender side or the core network. The performance of CLMAP is investigated under a range of network conditions and conditions for convergence are found.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- http://hdl.handle.net/1959.3/213128
- OA Status
- green
- Cited By
- 7
- References
- 51
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W1788610607
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W1788610607Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.25916/sut.26263871.v1Digital Object Identifier
- Title
-
CLAMP: Maximizing the performance of TCP over low bandwidth variable rate access linksWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-01-01Full publication date if available
- Authors
-
Lachlan L. H. Andrew, Stephen V. Hanly, Rami G. MukhtarList of authors in order
- Landing page
-
https://hdl.handle.net/1959.3/213128Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- Concepts
-
Variable (mathematics), Computer science, Clamp, Computer network, Mathematics, Mathematical analysis, Clamping, Computer visionTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
7Total citation count in OpenAlex
- References (count)
-
51Number of works referenced by this work
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W1788610607 |
|---|---|
| doi | https://doi.org/10.25916/sut.26263871.v1 |
| ids.doi | https://doi.org/10.25916/sut.26263871 |
| ids.mag | 1788610607 |
| ids.openalex | https://openalex.org/W1788610607 |
| fwci | |
| type | article |
| title | CLAMP: Maximizing the performance of TCP over low bandwidth variable rate access links |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10138 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Network Traffic and Congestion Control |
| topics[1].id | https://openalex.org/T11409 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9998000264167786 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Advanced Wireless Network Optimization |
| topics[2].id | https://openalex.org/T10575 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9987999796867371 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Wireless Communication Networks Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C182365436 |
| concepts[0].level | 2 |
| concepts[0].score | 0.4676005244255066 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q50701 |
| concepts[0].display_name | Variable (mathematics) |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.4524073898792267 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C2776161997 |
| concepts[2].level | 3 |
| concepts[2].score | 0.44224807620048523 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q846600 |
| concepts[2].display_name | Clamp |
| concepts[3].id | https://openalex.org/C31258907 |
| concepts[3].level | 1 |
| concepts[3].score | 0.40359875559806824 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[3].display_name | Computer network |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.17697769403457642 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C134306372 |
| concepts[5].level | 1 |
| concepts[5].score | 0.0 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[5].display_name | Mathematical analysis |
| concepts[6].id | https://openalex.org/C84111939 |
| concepts[6].level | 2 |
| concepts[6].score | 0.0 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q5125465 |
| concepts[6].display_name | Clamping |
| concepts[7].id | https://openalex.org/C31972630 |
| concepts[7].level | 1 |
| concepts[7].score | 0.0 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q844240 |
| concepts[7].display_name | Computer vision |
| keywords[0].id | https://openalex.org/keywords/variable |
| keywords[0].score | 0.4676005244255066 |
| keywords[0].display_name | Variable (mathematics) |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.4524073898792267 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/clamp |
| keywords[2].score | 0.44224807620048523 |
| keywords[2].display_name | Clamp |
| keywords[3].id | https://openalex.org/keywords/computer-network |
| keywords[3].score | 0.40359875559806824 |
| keywords[3].display_name | Computer network |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.17697769403457642 |
| keywords[4].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:researchbank.swinburne.edu.au:e4ce58ab-44e3-4d02-848c-b8047b643d02/1 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S4306401157 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[0].source.host_organization | https://openalex.org/I57093077 |
| locations[0].source.host_organization_name | Swinburne University of Technology |
| locations[0].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | CUBIN Technical Report |
| locations[0].landing_page_url | http://hdl.handle.net/1959.3/213128 |
| locations[1].id | pmh:oai:CiteSeerX.psu:10.1.1.11.4562 |
| locations[1].is_oa | False |
| locations[1].source | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | text |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | http://www.ee.mu.oz.au/pgrad/rgmukht/html/../docs/June2002_infocom.pdf |
| locations[1].landing_page_url | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.4562 |
| locations[2].id | pmh:oai:CiteSeerX.psu:10.1.1.9.6418 |
| locations[2].is_oa | False |
| locations[2].source | |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | text |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | http://www.ee.mu.oz.au/staff/lha/abstract/clamp_tr-2004-02-01.pdf |
| locations[2].landing_page_url | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6418 |
| locations[3].id | pmh:oai:figshare.com:article/26263871 |
| locations[3].is_oa | True |
| locations[3].source.id | https://openalex.org/S4306400572 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | False |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | OPAL (Open@LaTrobe) (La Trobe University) |
| locations[3].source.host_organization | https://openalex.org/I196829312 |
| locations[3].source.host_organization_name | La Trobe University |
| locations[3].source.host_organization_lineage | https://openalex.org/I196829312 |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | submittedVersion |
| locations[3].raw_type | Text |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | False |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | |
| locations[4].id | mag:1788610607 |
| locations[4].is_oa | False |
| locations[4].source | |
| locations[4].license | |
| locations[4].pdf_url | |
| locations[4].version | |
| locations[4].raw_type | |
| locations[4].license_id | |
| locations[4].is_accepted | False |
| locations[4].is_published | |
| locations[4].raw_source_name | |
| locations[4].landing_page_url | https://researchbank.swinburne.edu.au/file/e4ce58ab-44e3-4d02-848c-b8047b643d02/1/PDF (13 pages).pdf |
| locations[5].id | doi:10.25916/sut.26263871 |
| locations[5].is_oa | True |
| locations[5].source.id | https://openalex.org/S4306401157 |
| locations[5].source.issn | |
| locations[5].source.type | repository |
| locations[5].source.is_oa | False |
| locations[5].source.issn_l | |
| locations[5].source.is_core | False |
| locations[5].source.is_in_doaj | False |
| locations[5].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[5].source.host_organization | https://openalex.org/I57093077 |
| locations[5].source.host_organization_name | Swinburne University of Technology |
| locations[5].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[5].license | |
| locations[5].pdf_url | |
| locations[5].version | |
| locations[5].raw_type | report |
| locations[5].license_id | |
| locations[5].is_accepted | False |
| locations[5].is_published | |
| locations[5].raw_source_name | |
| locations[5].landing_page_url | https://doi.org/10.25916/sut.26263871 |
| locations[6].id | doi:10.25916/sut.26263871.v1 |
| locations[6].is_oa | True |
| locations[6].source.id | https://openalex.org/S4306401157 |
| locations[6].source.issn | |
| locations[6].source.type | repository |
| locations[6].source.is_oa | False |
| locations[6].source.issn_l | |
| locations[6].source.is_core | False |
| locations[6].source.is_in_doaj | False |
| locations[6].source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| locations[6].source.host_organization | https://openalex.org/I57093077 |
| locations[6].source.host_organization_name | Swinburne University of Technology |
| locations[6].source.host_organization_lineage | https://openalex.org/I57093077 |
| locations[6].license | |
| locations[6].pdf_url | |
| locations[6].version | |
| locations[6].raw_type | report |
| locations[6].license_id | |
| locations[6].is_accepted | False |
| locations[6].is_published | |
| locations[6].raw_source_name | |
| locations[6].landing_page_url | https://doi.org/10.25916/sut.26263871.v1 |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5011921013 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0267-1062 |
| authorships[0].author.display_name | Lachlan L. H. Andrew |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Lachlan L. H. Andrew |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5033806253 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0524-9927 |
| authorships[1].author.display_name | Stephen V. Hanly |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Stephen V. Hanly |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5088407695 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Rami G. Mukhtar |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Rami G. Mukhtar |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | CLAMP: Maximizing the performance of TCP over low bandwidth variable rate access links |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10138 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Network Traffic and Congestion Control |
| related_works | https://openalex.org/W2375493946, https://openalex.org/W2163712359, https://openalex.org/W1589896992, https://openalex.org/W2275747336, https://openalex.org/W1993835026, https://openalex.org/W2103818827, https://openalex.org/W24266577, https://openalex.org/W17274590, https://openalex.org/W2161653283, https://openalex.org/W3039750764, https://openalex.org/W2946837383, https://openalex.org/W2040625013, https://openalex.org/W1984241452, https://openalex.org/W2141787740, https://openalex.org/W1982603410, https://openalex.org/W2054044377, https://openalex.org/W1995042891, https://openalex.org/W2403908944, https://openalex.org/W1564349017, https://openalex.org/W3139859623 |
| cited_by_count | 7 |
| locations_count | 7 |
| best_oa_location.id | pmh:oai:figshare.com:article/26263871 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400572 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | OPAL (Open@LaTrobe) (La Trobe University) |
| best_oa_location.source.host_organization | https://openalex.org/I196829312 |
| best_oa_location.source.host_organization_name | La Trobe University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I196829312 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | |
| primary_location.id | pmh:oai:researchbank.swinburne.edu.au:e4ce58ab-44e3-4d02-848c-b8047b643d02/1 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S4306401157 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Swinburne Research Bank (Swinburne University of Technology) |
| primary_location.source.host_organization | https://openalex.org/I57093077 |
| primary_location.source.host_organization_name | Swinburne University of Technology |
| primary_location.source.host_organization_lineage | https://openalex.org/I57093077 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | CUBIN Technical Report |
| primary_location.landing_page_url | http://hdl.handle.net/1959.3/213128 |
| publication_date | 2024-01-01 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W2154893370, https://openalex.org/W2101214690, https://openalex.org/W2160031999, https://openalex.org/W2125031537, https://openalex.org/W2138543759, https://openalex.org/W1543975439, https://openalex.org/W2021085547, https://openalex.org/W2108086149, https://openalex.org/W2159715570, https://openalex.org/W2115470694, https://openalex.org/W2164798485, https://openalex.org/W1585188069, https://openalex.org/W2114882680, https://openalex.org/W2126956578, https://openalex.org/W2107689535, https://openalex.org/W2078595922, https://openalex.org/W2155393670, https://openalex.org/W2162405374, https://openalex.org/W2167743412, https://openalex.org/W1894486190, https://openalex.org/W2258157321, https://openalex.org/W2150652605, https://openalex.org/W2037710455, https://openalex.org/W1905547596, https://openalex.org/W2174430759, https://openalex.org/W2125837860, https://openalex.org/W2161872841, https://openalex.org/W2112495447, https://openalex.org/W2140490525, https://openalex.org/W2005283346, https://openalex.org/W2113021292, https://openalex.org/W2753542457, https://openalex.org/W1989225545, https://openalex.org/W1997517797, https://openalex.org/W2049729019, https://openalex.org/W2148275477, https://openalex.org/W1763580265, https://openalex.org/W2159949949, https://openalex.org/W2098653737, https://openalex.org/W2121896432, https://openalex.org/W1557351565, https://openalex.org/W2101659471, https://openalex.org/W2147271266, https://openalex.org/W2056429635, https://openalex.org/W2128520603, https://openalex.org/W1949452912, https://openalex.org/W2147524058, https://openalex.org/W2101182788, https://openalex.org/W2158733823, https://openalex.org/W2114035993, https://openalex.org/W1609176311 |
| referenced_works_count | 51 |
| abstract_inverted_index.a | 4, 17, 24, 28, 52, 76, 136 |
| abstract_inverted_index.No | 117 |
| abstract_inverted_index.at | 23 |
| abstract_inverted_index.be | 84 |
| abstract_inverted_index.by | 31 |
| abstract_inverted_index.in | 16 |
| abstract_inverted_index.is | 102, 133 |
| abstract_inverted_index.it | 109 |
| abstract_inverted_index.of | 11, 79, 131, 138 |
| abstract_inverted_index.on | 113 |
| abstract_inverted_index.or | 125 |
| abstract_inverted_index.to | 7, 26, 83, 86, 121 |
| abstract_inverted_index.TCP | 12, 29, 34, 42 |
| abstract_inverted_index.The | 94, 129 |
| abstract_inverted_index.and | 46, 71, 74, 141 |
| abstract_inverted_index.are | 119, 145 |
| abstract_inverted_index.for | 59, 143 |
| abstract_inverted_index.not | 111 |
| abstract_inverted_index.the | 9, 33, 80, 90, 99, 103, 122, 126 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.core | 127 |
| abstract_inverted_index.does | 110 |
| abstract_inverted_index.each | 87 |
| abstract_inverted_index.flow | 55, 88 |
| abstract_inverted_index.from | 98 |
| abstract_inverted_index.link | 69, 81 |
| abstract_inverted_index.only | 95 |
| abstract_inverted_index.over | 67 |
| abstract_inverted_index.rely | 112 |
| abstract_inverted_index.same | 91 |
| abstract_inverted_index.side | 44, 124 |
| abstract_inverted_index.that | 14 |
| abstract_inverted_index.with | 40 |
| abstract_inverted_index.CLAMP | 50, 63 |
| abstract_inverted_index.CLMAP | 21, 132 |
| abstract_inverted_index.delay | 115 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.queue | 48, 106 |
| abstract_inverted_index.radio | 92 |
| abstract_inverted_index.range | 137 |
| abstract_inverted_index.size; | 107 |
| abstract_inverted_index.under | 135 |
| abstract_inverted_index.works | 22 |
| abstract_inverted_index.CLAMP, | 3 |
| abstract_inverted_index.access | 19, 61, 100 |
| abstract_inverted_index.active | 47 |
| abstract_inverted_index.allows | 75 |
| abstract_inverted_index.delay, | 73 |
| abstract_inverted_index.found. | 146 |
| abstract_inverted_index.limit. | 38 |
| abstract_inverted_index.scheme | 57 |
| abstract_inverted_index.sender | 30, 43, 123 |
| abstract_inverted_index.window | 37 |
| abstract_inverted_index.Coupled | 39 |
| abstract_inverted_index.bearer. | 93 |
| abstract_inverted_index.control | 27, 56, 66 |
| abstract_inverted_index.enhance | 8 |
| abstract_inverted_index.network | 101, 139 |
| abstract_inverted_index.setting | 32 |
| abstract_inverted_index.sharing | 89 |
| abstract_inverted_index.capacity | 82 |
| abstract_inverted_index.complete | 53 |
| abstract_inverted_index.existing | 41 |
| abstract_inverted_index.explicit | 65 |
| abstract_inverted_index.network. | 20, 128 |
| abstract_inverted_index.presents | 2 |
| abstract_inverted_index.provides | 51, 64 |
| abstract_inverted_index.queueing | 72 |
| abstract_inverted_index.receiver | 25 |
| abstract_inverted_index.required | 97, 120 |
| abstract_inverted_index.wireless | 18, 60, 68 |
| abstract_inverted_index.aggregate | 104 |
| abstract_inverted_index.algorithm | 6 |
| abstract_inverted_index.allocated | 85 |
| abstract_inverted_index.networks. | 62 |
| abstract_inverted_index.optimised | 58 |
| abstract_inverted_index.terminate | 15 |
| abstract_inverted_index.advertised | 36 |
| abstract_inverted_index.bottleneck | 105 |
| abstract_inverted_index.conditions | 140, 142 |
| abstract_inverted_index.controlled | 77 |
| abstract_inverted_index.end-to-end | 54 |
| abstract_inverted_index.estimates. | 116 |
| abstract_inverted_index.proportion | 78 |
| abstract_inverted_index.receiver's | 35 |
| abstract_inverted_index.connections | 13 |
| abstract_inverted_index.convergence | 144 |
| abstract_inverted_index.distributed | 5 |
| abstract_inverted_index.information | 96 |
| abstract_inverted_index.management, | 49 |
| abstract_inverted_index.performance | 10, 130 |
| abstract_inverted_index.propagation | 114 |
| abstract_inverted_index.utilisation | 70 |
| abstract_inverted_index.investigated | 134 |
| abstract_inverted_index.modifications | 118 |
| abstract_inverted_index.specifically, | 108 |
| abstract_inverted_index.implementations | 45 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/7 |
| sustainable_development_goals[0].score | 0.6000000238418579 |
| sustainable_development_goals[0].display_name | Affordable and clean energy |
| citation_normalized_percentile |