00001 /* 00002 * Copyright (c) 2006-2007 by the Protocol Engineering Lab, U of Delaware 00003 * All rights reserved. 00004 * 00005 * Protocol Engineering Lab web page : http://pel.cis.udel.edu/ 00006 * 00007 * Paul D. Amer <amer@@cis,udel,edu> 00008 * Armando L. Caro Jr. <acaro@@cis,udel,edu> 00009 * 00010 * Redistribution and use in source and binary forms, with or without 00011 * modification, are permitted provided that the following conditions 00012 * are met: 00013 * 00014 * 1. Redistributions of source code must retain the above copyright 00015 * notice, this list of conditions and the following disclaimer. 00016 * 00017 * 2. Redistributions in binary form must reproduce the above copyright 00018 * notice, this list of conditions and the following disclaimer in the 00019 * documentation and/or other materials provided with the distribution. 00020 * 00021 * 3. Neither the name of the University nor of the Laboratory may be used 00022 * to endorse or promote products derived from this software without 00023 * specific prior written permission. 00024 * 00025 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00026 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00028 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00029 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00030 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00031 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00032 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00033 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00034 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00035 * SUCH DAMAGE. 00036 * 00037 * @(#) $Header: /cvsroot/nsnam/ns-2/sctp/sctp-timestamp.h,v 1.4 2007/06/17 21:44:44 tom_henderson Exp $ (UD/PEL) 00038 */ 00039 00040 /* Timestamp extension adds a TIMESTAMP chunk into every packet with DATA 00041 * or SACK chunk(s). The timestamps allow RTT measurements to be made per 00042 * packet on both original transmissiosn and retransmissions. Thus, Karn's 00043 * algorithm is no longer needed. 00044 */ 00045 00046 #ifndef ns_sctp_timestamp_h 00047 #define ns_sctp_timestamp_h 00048 00049 #include "sctp.h" 00050 00051 /* Timestamp Specific Flags 00052 */ 00053 #define SCTP_TIMESTAMP_FLAG_TS 0x01 // indicates a timestamp in the chunk 00054 #define SCTP_TIMESTAMP_FLAG_ECHO 0x02 // indicates a timestamp echo in chunk 00055 00056 typedef struct SctpTimestampChunk_S 00057 { 00058 SctpChunkHdr_S sHdr; 00059 float fTimestamp; 00060 float fEcho; 00061 }; 00062 00063 class TimestampSctpAgent : public virtual SctpAgent 00064 { 00065 public: 00066 TimestampSctpAgent(); 00067 00068 protected: 00069 virtual void delay_bind_init_all(); 00070 virtual int delay_bind_dispatch(const char *varName, const char *localName, 00071 TclObject *tracer); 00072 00073 /* initialization stuff 00074 */ 00075 virtual void OptionReset(); 00076 virtual u_int ControlChunkReservation(); 00077 00078 /* chunk generation functions 00079 */ 00080 virtual int BundleControlChunks(u_char *); 00081 00082 /* sending functions 00083 */ 00084 virtual void AddToSendBuffer(SctpDataChunkHdr_S *, int, u_int, SctpDest_S *); 00085 virtual void SendBufferDequeueUpTo(u_int); 00086 virtual void RtxMarkedChunks(SctpRtxLimit_E); 00087 00088 /* process functions 00089 */ 00090 virtual Boolean_E ProcessGapAckBlocks(u_char *, Boolean_E); 00091 virtual void ProcessOptionChunk(u_char *); 00092 void ProcessTimestampChunk(SctpTimestampChunk_S *); 00093 00094 Boolean_E eNeedTimestampEcho; // does next pkt need timestamp echo? 00095 float fOutTimestampEcho; // outgoing timestamp chunk will carry this echo 00096 float fInTimestampEcho; // incoming timestamp echoed back to sender 00097 }; 00098 00099 #endif
1.7.1