Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Evaluating graph theoretic clustering algorithms for reliable multicasting
Luleå tekniska universitet.
2001 (English)In: Global Telecommunications Conference: GLOBECOM '01, IEEE Communications Society, 2001, 1688-1692 p.Conference paper, Published paper (Refereed)
Abstract [en]

In reliable multicast protocols, each data packet being sent must be acknowledged. Collecting the acknowledgments centrally at the sources can cause ACK-implosion and can result in poor scalability. To overcome this, clustering algorithms which use virtual structures to gather acknowledgments were proposed. In this work, we analyze the complexities of three such clustering algorithms: Lorax, k-degree, and Self-adjust. We compare the quality of the virtual structures produced by these! algorithms, focusing on the number of clusters, cluster size, cluster radius, and the optimal positioning of cluster leaders. Our simulation showed that the virtual structure produced by Self-adjust is better in terms of cluster radius and the location of cluster leaders. However, due to the self-adjusting nature of the algorithm, it might take longer time to compute than the other two algorithms

Place, publisher, year, edition, pages
IEEE Communications Society, 2001. 1688-1692 p.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-29477DOI: 10.1109/GLOCOM.2001.965867Local ID: 2faa27b0-86b3-11db-8975-000ea68e967bISBN: 0-7803-7206-9 (print)OAI: oai:DiVA.org:ltu-29477DiVA: diva2:1002701
Conference
Global Telecommunications Conference : 25/11/2001 - 29/11/2001
Note
Godkänd; 2001; 20061128 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-10-20Bibliographically approved

Open Access in DiVA

fulltext(70 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 70 kBChecksum SHA-512
5395bebea725c377bc9e354d5a898fe96d2d49a69051a2d3290de4b922617dfe31e74f5191f837e0a3556580e04cf500c2e3bd948fdf1cc3cf73521e891654c6
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Carr-Motyckova, Lenka
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf