Melola Discovery

← Melola Discovery

Jurnal SINTA 2

UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance

Journal of ICT Research and Applications (JICTRA) · Vol. 2 No. 1 (2013) · pp. 64–79

DOI
10.5614/itbj.ict.2008.2.1.4
ISSN
2338-5499, 2337-5787
Published
2013-09-13
Publisher
DRI - ITB
Language
eng

Abstract

Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peertopeer network maintains accurate routing tables with complete membership information. We present UnoHop, a novel DHT protocol with O(1) lookup performance. The protocol uses an efficient mechanism to distribute events through a dissemination tree that is constructed dynamically rooted at the node that detects the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.

Collaboration network of the authors

30 authors · 70 co-authorship links · 6 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Bandung Institute of Technology
  • Maranatha Christian University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Yoanes BandungBandung Institute of Technology4
Arry Akhmad ArmanBandung Institute of Technology2
Radiant Victor ImbarMaranatha Christian University2
Meliana Christianti JohanMaranatha Christian University2
Eko MarpanajiBandung Institute of Technology1
Adit KurniawanBandung Institute of Technology1
Bamba Riyanto TrilaksonoAffiliation unknown1
Andri MahendraBandung Institute of Technology1
Thay LiungBandung Institute of Technology1
Benhard SitohangBandung Institute of Technology1
Ahmad DahlanBandung Institute of Technology1
Dwi Hendratmo WidyantoroBandung Institute of Technology1
Ismail IsmailBandung Institute of Technology1
Hendrawan HendrawanBandung Institute of Technology1
Basuki Y. IskandarAffiliation unknown1
Budi SulistyoBandung Institute of Technology1
Budi RahardjoBandung Institute of Technology1
Dimitri MahayanaBandung Institute of Technology1
Sinung SuakantoBandung Institute of Technology1
Suhardi SuhardiBandung Institute of Technology1
Roberd SaragihBandung Institute of Technology1
Masayu Leylia KhodraBandung Institute of Technology1
Wahyudi WahyudiBandung Institute of Technology1
Ary Setijadi PrihatmantoBandung Institute of Technology1
Gina PurnamaBandung Institute of Technology1
Irma Amelia DewiBandung Institute of Technology1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance</dc:title>
	<dc:creator>Sitepu, Herry</dc:creator>
	<dc:creator>Machbub, Carmadi</dc:creator>
	<dc:creator>R. Langi, Armein Z.</dc:creator>
	<dc:creator>Supangkat, Suhono H.</dc:creator>
	<dc:description xml:lang="en-US">Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peertopeer network maintains accurate routing tables with complete membership information. We present UnoHop, a novel DHT protocol with O(1) lookup performance. The protocol uses an efficient mechanism to distribute events through a dissemination tree that is constructed dynamically rooted at the node that detects the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2013-09-13</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/175</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.2008.2.1.4</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 2 No. 1 (2008); 64-79</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/175/169</dc:relation>
</oai_dc:dc>