Premium
τ‐AIMD for asynchronous receiver feedback
Author(s) -
Lahanas Adrian,
Tsaoussidis Vassilis
Publication year - 2004
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.622
Subject(s) - asynchronous communication , computer science , computer network , scheme (mathematics) , channel (broadcasting) , distributed computing , mathematical analysis , mathematics
In this work we first describe an asynchronous‐feedback model which corresponds to the diverse roundtrip times (RTTs) of competing flows within the same communication channel. We show that even when the feedback of the receivers/network is asynchronous, the duration of a congestion epoch represents ‘common knowledge’ for the competing flows. Based on this property, we propose a diverse linear increase scheme in proportion to the RTT of each flow and we adjust periodically the windows of the competing flows accordingly, in order to enhance fairness of asynchronous‐feedback environments. We name this scheme τ‐AIMD and show that fairness of flows in asynchronous systems is improved since the increase‐rate diversity of long and short RTT flows is largely canceled. We use the max–min notion of fairness to show that τ‐AIMD can constitute the foundation for other window‐based, end‐to‐end algorithms that target a good balance between efficiency and fairness. Copyright © 2004 John Wiley & Sons, Ltd.