Delay Aware Two-Step Timers for Large Groups Scalability

Achmad Husni THAMRIN; Hidetaka IZUMIYAMA; Hiroyuki KUSUMOTO; Jun MURAI

Delay Aware Two-Step Timers for Large Groups Scalability

Achmad Husni THAMRIN, Hidetaka IZUMIYAMA, Hiroyuki KUSUMOTO, Jun MURAI

Full Text Views

0

Share
Cite this

Summary :

This paper investigates modified random timers based on uniform and exponentially distributed timers for feedback scalability for large groups. We observe the widely-used probability distribution functions and propose new ones that are aware of network delays. The awareness of network delays of our proposed modified p.d.fs proves to be able to achieve lower expected number of messages compared to the original ones given that the parameters are optimized for the network variables: the number of receivers, and the network delay. In our analysis we derive an equation to estimate the optimized parameter based on these network variables. We also simulate the p.d.fs for heterogenous network delays and find that each receiver only needs to be aware of its network delay.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.3 pp.437-444

Publication Date: 2004/03/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Internet Technology IV)

Category: Implementation and Operation

Cite this

Copy

Achmad Husni THAMRIN, Hidetaka IZUMIYAMA, Hiroyuki KUSUMOTO, Jun MURAI, "Delay Aware Two-Step Timers for Large Groups Scalability" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 3, pp. 437-444, March 2004, doi: .
Abstract: This paper investigates modified random timers based on uniform and exponentially distributed timers for feedback scalability for large groups. We observe the widely-used probability distribution functions and propose new ones that are aware of network delays. The awareness of network delays of our proposed modified p.d.fs proves to be able to achieve lower expected number of messages compared to the original ones given that the parameters are optimized for the network variables: the number of receivers, and the network delay. In our analysis we derive an equation to estimate the optimized parameter based on these network variables. We also simulate the p.d.fs for heterogenous network delays and find that each receiver only needs to be aware of its network delay.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_3_437/_p

Copy

@ARTICLE{e87-b_3_437,
author={Achmad Husni THAMRIN, Hidetaka IZUMIYAMA, Hiroyuki KUSUMOTO, Jun MURAI, },
journal={IEICE TRANSACTIONS on Communications},
title={Delay Aware Two-Step Timers for Large Groups Scalability},
year={2004},
volume={E87-B},
number={3},
pages={437-444},
abstract={This paper investigates modified random timers based on uniform and exponentially distributed timers for feedback scalability for large groups. We observe the widely-used probability distribution functions and propose new ones that are aware of network delays. The awareness of network delays of our proposed modified p.d.fs proves to be able to achieve lower expected number of messages compared to the original ones given that the parameters are optimized for the network variables: the number of receivers, and the network delay. In our analysis we derive an equation to estimate the optimized parameter based on these network variables. We also simulate the p.d.fs for heterogenous network delays and find that each receiver only needs to be aware of its network delay.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Delay Aware Two-Step Timers for Large Groups Scalability
T2 - IEICE TRANSACTIONS on Communications
SP - 437
EP - 444
AU - Achmad Husni THAMRIN
AU - Hidetaka IZUMIYAMA
AU - Hiroyuki KUSUMOTO
AU - Jun MURAI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2004
AB - This paper investigates modified random timers based on uniform and exponentially distributed timers for feedback scalability for large groups. We observe the widely-used probability distribution functions and propose new ones that are aware of network delays. The awareness of network delays of our proposed modified p.d.fs proves to be able to achieve lower expected number of messages compared to the original ones given that the parameters are optimized for the network variables: the number of receivers, and the network delay. In our analysis we derive an equation to estimate the optimized parameter based on these network variables. We also simulate the p.d.fs for heterogenous network delays and find that each receiver only needs to be aware of its network delay.
ER -