Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://dx.doi.org/10.18419/opus-2468
Langanzeige der Metadaten
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Maihöfer, Christian | de |
dc.contributor.author | Rothermel, Kurt | de |
dc.date.accessioned | 2001-06-06 | de |
dc.date.accessioned | 2016-03-31T07:58:15Z | - |
dc.date.available | 2001-06-06 | de |
dc.date.available | 2016-03-31T07:58:15Z | - |
dc.date.issued | 2001 | de |
dc.identifier.other | 092319742 | de |
dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-8364 | de |
dc.identifier.uri | http://elib.uni-stuttgart.de/handle/11682/2485 | - |
dc.identifier.uri | http://dx.doi.org/10.18419/opus-2468 | - |
dc.description.abstract | We present a comparative delay analysis of tree-based reliable multicast protocols and show the influence of varying sending rates, group sizes, packet loss probabilities and branching factors of the control tree. Besides the average delivery delay we consider the delay to reliably deliver all packets and the round trip delay. The former two examines the delay between generation of a packet at the sender and correct reception at a randomly chosen receiver or all receivers, respectively. The latter is the delay between generation of a packet at the sender and reception of all acknowledgment packets at the sender. Our numerical results show that all tree-based protocols provide low delays and good scalability. From the four considered protocol classes, NAK-based protocols achieve the best scalability but ACK-based protocols achieve the lowest delays. An important aspect of our work is to be of practical relevance rather than being of only theoretical nature. Therefore, we have compared the analytical results with a RMTP and TMTP simulation. Both show similar results which confirms that our analysis can help to choose a suitable protocol and to tune them for improved performance. | en |
dc.language.iso | en | de |
dc.relation.ispartofseries | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2001,3 | de |
dc.rights | info:eu-repo/semantics/openAccess | de |
dc.subject.classification | Multicast-Protokoll , Verzögerungszeit <Informatik> | de |
dc.subject.ddc | 004 | de |
dc.subject.other | reliable multicast , delay analysis , branching factor , tree-based | en |
dc.title | A delay analysis of tree-based reliable multicast protocols | en |
dc.type | workingPaper | de |
dc.date.updated | 2013-07-04 | de |
ubs.fakultaet | Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
ubs.institut | Institut für Parallele und Verteilte Systeme | de |
ubs.opusid | 836 | de |
ubs.publikation.typ | Arbeitspapier | de |
ubs.schriftenreihe.name | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
Enthalten in den Sammlungen: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
TR-2001-03.pdf | 553,47 kB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.