00001 /* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */ 00002 /* 00003 * Copyright (c) 1997 Regents of the University of California. 00004 * All rights reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 1. Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * 2. Redistributions in binary form must reproduce the above copyright 00012 * notice, this list of conditions and the following disclaimer in the 00013 * documentation and/or other materials provided with the distribution. 00014 * 3. All advertising materials mentioning features or use of this software 00015 * must display the following acknowledgement: 00016 * This product includes software developed by the Daedalus Research 00017 * Group at the University of California Berkeley. 00018 * 4. Neither the name of the University nor of the Research Group may be 00019 * used to endorse or promote products derived from this software without 00020 * specific prior written permission. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00023 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00024 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00025 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00026 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00027 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00028 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00029 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00031 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00032 * SUCH DAMAGE. 00033 * 00034 * Contributed by the Daedalus Research Group, U.C.Berkeley 00035 * http://daedalus.cs.berkeley.edu 00036 */ 00037 00038 #ifndef TCPINT_H 00039 #define TCPINT_H 00040 00041 #include "tcp.h" 00042 #include "nilist.h" 00043 00044 /*class CorresHost;*/ 00045 class CorresHost; 00046 class TcpSessionAgent; 00047 class Segment; 00048 00049 class IntTcpAgent : public TcpAgent, public slink { 00050 friend class CorresHost; 00051 friend class TcpSessionAgent; 00052 public: 00053 IntTcpAgent(); 00054 int command(int argc, const char*const* argv); 00055 void createTcpSession(); 00056 void send_much(int force, int reason, int maxburst = 0); 00057 void send_one(int sessionSeqno); 00058 void recv(Packet *pkt, Handler *); 00059 void opencwnd(); 00060 void closecwnd(int how); 00061 Segment *rxmit_last(int reason, int seqno, int sessionSeqno, double ts); 00062 void output(int seqno, int reason = 0); 00063 void output_helper(Packet *p); 00064 int data_left_to_send(); 00065 void newack(Packet* pkt); 00066 00067 protected: 00068 class TcpSessionAgent *session_; 00069 int uniqTS_; 00070 int rightEdge_; 00071 double closecwTS_; 00072 double lastTS_; 00073 double winMult_; 00074 int winInc_; 00075 int count_; /* used in window increment algorithms */ 00076 int daddr_; 00077 int dport_; 00078 int sport_; 00079 int shift_; 00080 int mask_; 00081 int wt_; 00082 int dynWt_; 00083 int wndIncSeqno_; /* used to mark RTTs for window inc. algorithm */ 00084 int num_thresh_dupack_segs_; 00085 }; 00086 #endif
1.7.1