sctp-multipleFastRtx.h
上传用户:rrhhcc
上传日期:2015-12-11
资源大小:54129k
文件大小:3k
- /*
- * Copyright (c) 2006-2007 by the Protocol Engineering Lab, U of Delaware
- * All rights reserved.
- *
- * Protocol Engineering Lab web page : http://pel.cis.udel.edu/
- *
- * Paul D. Amer <amer@@cis,udel,edu>
- * Armando L. Caro Jr. <acaro@@cis,udel,edu>
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * 3. Neither the name of the University nor of the Laboratory may be used
- * to endorse or promote products derived from this software without
- * specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- * @(#) $Header: /cvsroot/nsnam/ns-2/sctp/sctp-multipleFastRtx.h,v 1.3 2007/06/17 21:44:41 tom_henderson Exp $ (UD/PEL)
- */
- /* MultipleFastRtx extension implements the Caro Multiple Fast Retransmit
- * Algorithm. Caro's Algorithm introduces a fastRtxRecover state variable
- * per TSN in the send buffer. Any time a TSN is retransmitted, its
- * fastRtxRecover is set to the highest TSN outstanding at the time of
- * retransmit. That way, only missing reports triggered by TSNs beyond
- * fastRtxRecover may trigger yet another fast retransmit.
- */
- #ifndef ns_sctp_multipleFastRtx_h
- #define ns_sctp_multipleFastRtx_h
- #include "sctp.h"
- class MultipleFastRtxSctpAgent : public virtual SctpAgent
- {
- public:
- MultipleFastRtxSctpAgent();
- protected:
- virtual void delay_bind_init_all();
- virtual int delay_bind_dispatch(const char *varName, const char *localName,
- TclObject *tracer);
- /* tracing functions
- */
- virtual void TraceVar(const char*);
- virtual void TraceAll();
- /* sending functions
- */
- virtual void AddToSendBuffer(SctpDataChunkHdr_S *, int, u_int, SctpDest_S *);
- virtual void SendBufferDequeueUpTo(u_int);
-
- /* processing functions
- */
- virtual Boolean_E ProcessGapAckBlocks(u_char *, Boolean_E);
- TracedInt tiMfrCount; // trace each time MFR gets triggered
- };
- #endif