11
NR-SACKs for SCTP (Non-Renegable SACKs) draft-natarajan-tsvwg-sctp- nrsack-01 Preethi Natarajan Paul Amer Ertugrul Yilmaz University of Delaware Randall Stewart The Research Group Janardhan Iyengar Franklin and Marshall College

NR-SACKs for SCTP ( N on- R enegable SACKs )

Embed Size (px)

DESCRIPTION

NR-SACKs for SCTP ( N on- R enegable SACKs ). draft-natarajan-tsvwg-sctp-nrsack-01. Reneging and SCTP. Retransmission queue (RtxQ) – Portion of send buffer containing copies of transmitted data Receiver cannot reneg on cum-acked / delivered data sender discards cum-acked data from rtxq - PowerPoint PPT Presentation

Citation preview

Page 1: NR-SACKs for SCTP ( N on- R enegable  SACKs )

NR-SACKs for SCTP (Non-Renegable SACKs)

draft-natarajan-tsvwg-sctp-nrsack-01

Preethi NatarajanPaul Amer

Ertugrul Yilmaz

University of Delaware

Randall Stewart

The Research Group

Janardhan Iyengar

Franklin and Marshall College

Page 2: NR-SACKs for SCTP ( N on- R enegable  SACKs )

2

Reneging and SCTP• Retransmission queue (RtxQ) – Portion of send buffer containing

copies of transmitted data• Receiver cannot reneg on cum-acked / delivered data

– sender discards cum-acked data from rtxq• Receiver may reneg on gap-acked data

– due to buffer overbooking– sender does not discard gap-acked data

Page 3: NR-SACKs for SCTP ( N on- R enegable  SACKs )

3

Unordered Data Transfer

With SACKs

sacked, but still in RtxQ

Page 4: NR-SACKs for SCTP ( N on- R enegable  SACKs )

4

Proposal: NR-SACKs for SCTP

• Peers negotiate NR-SACK capability at INIT time• Replace SACKs with NR-SACKs during transfer• Sender is expected to perform congestion and flow

control as it would with SACKs• NR-SACKs contain non-renegable gap-ack blocks;

sender can use NR-SACK info to free buffer• (see draft for more on structure and use cases)

Page 5: NR-SACKs for SCTP ( N on- R enegable  SACKs )

5

Unordered Data Transfer

With SACKs With NR-SACKs

sacked, but still in RtxQ

nr-sacked data removed;

more data flowing

Page 6: NR-SACKs for SCTP ( N on- R enegable  SACKs )

6

Simulation Setup

• Dumb-bell topology [1]– Access link topology – Application-level cross-traffic generation– More details in [2]

• Unordered SCTP transfer using SACKs vs. NR-SACKs[1] L. Andrew et. al., ”Towards a Common TCP Evaluation Suite,” In PFLDnet 2008, March 2008[2] P. Natarajan et. al., “Non-Renegable Selective Acknowledgments (NR-SACKs) for SCTP,” TR, CIS Dept., Univ of Delaware, April 2008.

Page 7: NR-SACKs for SCTP ( N on- R enegable  SACKs )

7

Retransmission Queue Utilization

• Two types of data in retransmission queue (RtxQ) – Necessary: Necessary to maintain these data

copies: data in-flight or received but renegable– Unnecessary: Data received and non-renegable

(ex: TSNs 12-18 in slide 2).– Rtxq is most efficiently utilized when all data in

rtxq are necessary

• RtxQ_Util– Fraction of RtxQ utilized efficiently

Page 8: NR-SACKs for SCTP ( N on- R enegable  SACKs )

8

RtxQ_Util_L: Utilization during Loss Recovery

• SCTP with SACKs wastes ~50% of RtxQ during loss recovery• NR-SACKs always utilize RtxQ most efficiently

SACKs and NR-SACKs differ in RtxQ_Util only when data received out-of-order ─ during loss

Page 9: NR-SACKs for SCTP ( N on- R enegable  SACKs )

9

RtxQ_Util during Complete Transfer

• As frequency of loss events and loss recovery durations increase, SCTP with SACKs wastes more of RtxQ

• The amount of wasted memory increases as the number of transport connections increase

Page 10: NR-SACKs for SCTP ( N on- R enegable  SACKs )

10

Questions…

• Questions• Is this acceptable as a working group

document (just say yes ) ?

Page 11: NR-SACKs for SCTP ( N on- R enegable  SACKs )

11

Retransmission Queue (Rtxq) Utilization

• Efficient utilization at time t = k/r – k = # necessary (in flight or renegable) TPDUs

in the rtxq– r = size of the rtxq

• Efficient utilization for the entire file transfer

– ki/ri = efficient rtxq utilization during ti

– T = File Transfer time

( )∑∑ =÷⎟⎟⎠⎞

⎜⎜⎝⎛

×= TtTrktUtilRtxQ ii

ii ;_