Explicit rate congestion control with binary notifications

Explicit congestion control based on 1-bit probabilistic marking

“…The proposed algorithm was originally devised for explicit-rate congestion control, where routers send multi-byte feedback messages to sources. However, we have also presented alternative signaling mechanisms, based on binary feedback, that can be used in an efficient way, while exhibiting a close performance to that obtained with explicit-rate sources [37,38]. In particular, the results obtained with these binary schemes show that the oscillations of source rates are very small, when compared to other binary schemes, and sources are able to sense the network variations with accuracy.…”

“…In [57] the authors present a general additive increase, multiplicative decrease scheme, that essentially provides ground for the dynamic adjustment of source parameters (instead of using constant parameters). In terms of objectives for the source behavior, our proposal in [38] is similar, although with control actions centered at the routers. The mechanism proposed in this paper is also an alternative to the AIMD algorithm, in the sense that sources adapt dynamically their parameters for rate adjustment, according to the received feedback.…”

“…Also, the approach in [37,38] is deterministic (both in the marking procedure at the routers and the source adaptation functions), while the mechanism proposed here is based on a new strategy that involves probabilistic marking and leads to a less complex source algorithm.…”

Προσαρμοστικός Έλεγχος Συμφόρησης Και Δικαιοσύνης Σε Δίκτυα Υπολογιστών

“…Στη ϐιβλιογραφία παρουσιάστηκαν πολλοί µηχανισµοί ένδειξης κατάστασης δικτύου [2,[43][44][45][46][47]. Σε αυτή την ενότητα παρουσιάζουµε τους σηµαντικότερους µηχανισµούς ένδειξης κατάστασης, οι οποίοι ικανοποιούν τον ϐασικότερο περιορισµό στο σχεδιασµό αλγορίθµων σύνδεσης, που είναι ότι πρέπει να χαρακτηρί-Ϲονται από την απλότητά τους.…”