Throughput analysis of Non-Renegable Selective Acknowledgments (NR-SACKs) for SCTP

  • Authors:

  • Ertugrul Yilmaz;Nasif Ekiz;Preethi Natarajan;Paul D. Amer;Jonathan T. Leighton;Fred Baker;Randall R. Stewart

  • Affiliations:

  • CIS Dept., University of Delaware, United States;CIS Dept., University of Delaware, United States;Cisco Systems, 425 East Tasman Drive, San Jose, CA 95134, USA;CIS Dept., University of Delaware, United States;CIS Dept., University of Delaware, United States;Cisco Systems, 1121 Via Del Rey, Santa Barbara, CA 93117 USA;Huawei Technologies, Chapin, SC 29036, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.24

Visualization

Abstract

Preliminary work introduced Non-Renegable Selective Acknowledgments (NR-SACKs) and showed they (i) better utilize a data sender's memory in both SCTP and CMT, and (ii) improve throughput in CMT. In this paper, we provide the latest specification of NR-SACKs, and extend the investigation of throughput improvements that NR-SACKs can provide. Using ns-2 simulation, for various loss conditions and bandwidth-delay combinations, we show that the throughput observed with NR-SACKs is at least equal and sometimes better than the throughput observed with SACKs. We introduce ''region of gain'' which defines for a given bandwidth, delay, and send buffer size combination, what range of loss rates results in significant throughput improvement when NR-SACKs are used instead of SACKs. In both SCTP and CMT, NR-SACKs provide greater throughput improvement as the send buffer size decreases, and as end-to-end delay decreases. Provided that the bandwidth-delay product (BDP) = send buffer size, additional bandwidth does not increase NR-SACKs' throughput improvements for either SCTP or CMT. For BDPs