开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > Windows编程 > 通讯编程 > 查看源码
fsm.cc
资源名称：ns-allinone-2.33.tar.gz　[点击查看]
上传用户：rrhhcc
上传日期：2015-12-11
资源大小：54129k
文件大小：73k
源码类别：

通讯编程

开发平台：

Visual C++

fsm.cc：源码内容
  1. /* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
  3. /*
  4.  * Copyright (C) 1999 by the University of Southern California
  5.  * $Id: fsm.cc,v 1.12 2005/08/25 18:58:02 johnh Exp $
  6.  *
  7.  * This program is free software; you can redistribute it and/or
  8.  * modify it under the terms of the GNU General Public License,
  9.  * version 2, as published by the Free Software Foundation.
  10.  *
  11.  * This program is distributed in the hope that it will be useful,
  12.  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14.  * GNU General Public License for more details.
  15.  *
  16.  * You should have received a copy of the GNU General Public License along
  17.  * with this program; if not, write to the Free Software Foundation, Inc.,
  18.  * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
  19.  *
  20.  *
  21.  * The copyright of this module includes the following
  22.  * linking-with-specific-other-licenses addition:
  23.  *
  24.  * In addition, as a special exception, the copyright holders of
  25.  * this module give you permission to combine (via static or
  26.  * dynamic linking) this module with free software programs or
  27.  * libraries that are released under the GNU LGPL and with code
  28.  * included in the standard release of ns-2 under the Apache 2.0
  29.  * license or under otherwise-compatible licenses with advertising
  30.  * requirements (or modified versions of such code, with unchanged
  31.  * license).  You may copy and distribute such a system following the
  32.  * terms of the GNU GPL for this module and the licenses of the
  33.  * other code concerned, provided that you include the source code of
  34.  * that other code when and as the GNU GPL requires distribution of
  35.  * source code.
  36.  *
  37.  * Note that people who make modified versions of this module
  38.  * are not obligated to grant this special exception for their
  39.  * modified versions; it is their choice whether to do so.  The GNU
  40.  * General Public License gives permission to release a modified
  41.  * version without this exception; this exception also makes it
  42.  * possible to release a modified version which carries forward this
  43.  * exception.
  44.  *
  45.  */
  47. /* 
  48.  * Contributed by Polly Huang (USC/ISI), http://www-scf.usc.edu/~bhuang
  49.  * 
  50.  * @(#) $Header: /cvsroot/nsnam/ns-2/common/fsm.cc,v 1.12 2005/08/25 18:58:02 johnh Exp $ (LBL)
  51.  */
  53. /*
  54.  * The contents of this file are described in the paper:
  55.  *   Polly Huang and John Heidemann.
  56.  *     Capturing TCP Burstiness in Light-weight Simulations.
  57.  *     In Proceedings of the SCS Conference on Communication Networks and Distributed Systems Modeling and Simulation, pp. 90-96.
  58.  *     Phoenix, Arizona, USA, USC/Information Sciences Institute, Society for Computer Simulation.
  59.  *     January, 2001.
  60.  *     <http://www.isi.edu/~johnh/PAPERS/Huang01a.html>.
  61.  *
  62.  * (Although this code talks about FSMs or Finite-State Machines,
  63.  * the paper uses the term FSA or Finite-State Automoton.)
  64.  */
  66. #include "fsm.h"
  67. #include <assert.h>
  70. #ifndef MAX
  71. #define MAX(a, b)  (((a) > (b)) ? (a) : (b))
  72. #endif
  73. #ifndef MIN
  74. #define MIN(a, b)  (((a) < (b)) ? (a) : (b))
  75. #endif
  78. FSM* FSM::instance_;
  79. TahoeAckFSM* TahoeAckFSM::instance_;
  80. RenoAckFSM* RenoAckFSM::instance_;
  81. TahoeDelAckFSM* TahoeDelAckFSM::instance_;
  82. RenoDelAckFSM* RenoDelAckFSM::instance_;
  86. void
  87. FSMState::number_all()
  88. {
  89. if (processed())
  90. return;
  91. static int next_i = 0;
  92. print_i_ = ++next_i;
  93. //
  94. int i;
  95. for (i = 0; i < 17; i++)
  96. if (drop_[i])
  97. drop_[i]->number_all();
  98. }
  100. void
  101. FSMState::reset_all_processed()
  102. {
  103. if (print_i_ == 0)
  104. number_all();
  105. // requires a full traversal always to work
  106. if (!processed())
  107. return;
  108. print_i_ = -print_i_;
  109. int i;
  110. for (i = 0; i < 17; i++)
  111. if (drop_[i])
  112. drop_[i]->reset_all_processed();
  113. }
  115. void
  116. FSMState::print_all(int level)
  117. {
  118. if (processed())
  119. return;
  121. const int SPACES_PER_LEVEL = 2;
  122. printf("#%-2d %*s %d:n", print_i_, level * SPACES_PER_LEVEL + 1, " ", batch_size_);
  123. int i;
  124. for (i = 0; i <= batch_size_; i++) {
  125. static char *delay_names[] = {"done", "error", "RTT", "timeout" };
  126. assert(transition_[i] >= -1 && transition_[i] <= TIMEOUT);
  127. printf("   %*s %d %s -> #%dn", level * SPACES_PER_LEVEL + 3, " ",
  128.        i,
  129.        delay_names[transition_[i]+1],
  130.        drop_[i] ? drop_[i]->print_i_ : 0);
  131. if (drop_[i])
  132. drop_[i]->print_all(level + 1);
  133. };
  134. }
  136. static void
  137. report_stat_terminus(int desired_pkts, // # needed
  138.   int pkts,       // # got so far
  139.   int rtts, // # of rtt events
  140.   int timeouts, // # of to events
  141.   int ps, // # of times taken a prob. p event (pkt received OK)
  142.   int qs, // # of times taken a prob. q event (pkt dropped OK)
  143.   int num_states, // size of the stack
  144.   int num_state_names,
  145.      FSMState **states,
  146.      char *state_names)
  147. {
  148. // print states and probability
  149. printf("%s: p^%d*q^%d, %d rtt, %d timeouts, %d states:",
  150.        (pkts > desired_pkts ? "exceeded-pkts" :
  151.         (pkts == desired_pkts ? "desired_pkts" : "unimplemented-qs")),
  152.        ps, qs,
  153.        rtts, timeouts,
  154.        num_states);
  155. char ch = ' ';
  156. int i;
  157. for (i = 0; i < num_states; i++) {
  158. printf ("%c#%d", ch, states[i]->print_i_);
  159. ch = ',';
  160. };
  161. printf(" [%.*s]n", num_state_names, state_names);
  162. }
  164. /*
  165.  * FSMState::print_all_stats:
  166.  * Walk through the tcp state table exhaustively.
  167.  * Recurse to handle errors.
  168.  * Very hairy.
  169.  * johnh.
  170.  */
  171. void
  172. FSMState::print_all_stats(int desired_pkts_total, // # needed
  173.   int pkts,       // # got so far
  174.   int rtts, // # of rtt events
  175.   int timeouts, // # of to events
  176.   int ps, // # of times taken a prob. p event (pkt received OK)
  177.   int qs, // # of times taken a prob. q event (pkt dropped OK)
  178.   int num_states, // size of the stack
  179.   int num_state_names)
  180. {
  181. int i;
  182. #define LARGER_NUMBER_OF_STATES 31   // was 17
  183. static FSMState *states[LARGER_NUMBER_OF_STATES];
  184. static char state_names[LARGER_NUMBER_OF_STATES*4]; // xxx: this is just some random big size :-(
  186. if (pkts >= desired_pkts_total || qs > 5) {
  187. // done; print states and probability
  188. // (give up when we're where we want to be [good],
  189. // or we've taken too many losses [to prevent recursion])
  190. report_stat_terminus(desired_pkts_total, pkts, rtts, timeouts, ps, qs, num_states, num_state_names, states, state_names);
  191. return;
  192. };
  194. // remember us!
  195. states[num_states] = this;
  196. num_states++;
  199. // xxx: doesn't handle TCP tail behavior
  201. //
  202. // first, consider the no-loss case
  203. //
  204. int desired_pkts_remaining = desired_pkts_total - pkts;
  205. int desired_pkts_this_round = MIN(desired_pkts_remaining, batch_size_);
  206. for (i = 0; i< desired_pkts_this_round; i++)
  207. state_names[num_state_names + i] = 's';
  208. if (desired_pkts_remaining > desired_pkts_this_round) {
  209. // more to do?  take a rtt hit and keep going
  210. state_names[num_state_names + desired_pkts_this_round] = '.';
  211. drop_[0]->print_all_stats(desired_pkts_total,
  212.   pkts + desired_pkts_this_round,
  213.   rtts + 1, timeouts,
  214.   ps + desired_pkts_this_round, qs,
  215.   num_states,
  216.   num_state_names + desired_pkts_this_round + 1);
  217. } else {
  218. // no more to do... report out
  219. report_stat_terminus(desired_pkts_total,
  220.      pkts + desired_pkts_this_round,
  221.      rtts, timeouts,
  222.      ps + desired_pkts_this_round, qs,
  223.      num_states,
  224.      num_state_names + desired_pkts_this_round,
  225.      states,
  226.      state_names);
  227. };
  229. //
  230. // now consider losses
  231. //
  232. int desired_pkts_with_loss = MAX(desired_pkts_this_round - 1, 0);
  233. // loop through losing the i'th packet for all possible i's.
  234. // Can't loop through more than we could have sent.
  235. for (i = 1; i <= desired_pkts_this_round; i++) {
  236. // keep track of sending patterns
  237. if (i > 1)
  238. state_names[num_state_names + i - 2] = 's';
  239. state_names[num_state_names + i - 1] = 'd';
  240. state_names[num_state_names + desired_pkts_this_round] = (transition_[i] == RTT ? '.' : '-');
  241. // can we even have any?
  242. if (qs) {
  243. // not if we already had one!
  244. report_stat_terminus(desired_pkts_total,
  245.      pkts + i - 1,
  246.      rtts, timeouts,
  247.      ps + i - 1, qs + 1,
  248.      num_states,
  249.      num_state_names + i,
  250.      states,
  251.      state_names);
  252. } else {
  253. // recurse... assume the rest made it
  254. drop_[i]->print_all_stats(desired_pkts_total, pkts + desired_pkts_with_loss,
  255.   rtts + (transition_[i] == RTT ? 1 : 0),
  256.   timeouts + (transition_[i] == TIMEOUT ? 1 : 0),
  257.   ps + desired_pkts_with_loss, qs + 1,
  258.   num_states,
  259.   num_state_names + desired_pkts_this_round + 1);
  260. // 2nd drop somewhere in this round?
  261. int remaining_pkts_this_round = desired_pkts_this_round - i;
  262. if (qs == 0 && remaining_pkts_this_round > 0) {
  263. // yes, generate the probs
  264. int j;
  265. for (j = i+1; j <= desired_pkts_this_round; j++) {
  266. if (j > i+1)
  267. state_names[num_state_names + j - 1] = 's';
  268. state_names[num_state_names + j] = 'd';
  269. report_stat_terminus(desired_pkts_total,
  270.      pkts + j - 2,
  271.      rtts, timeouts,
  272.      ps + j - 2, qs + 2,
  273.      num_states,
  274.      num_state_names + j,
  275.      states,
  276.      state_names);
  277. };
  278. };
  279. };
  280. };
  281. }
  284. void
  285. FSM::print_FSM(FSMState* state)
  286. {
  287. #if 0
  288. int i;
  290. if (state != NULL) {
  291. for (i=0; i<17; i++) {
  292. if (state->drop_[i] != NULL) {
  293. if (i==0) 
  294. printf("%d->(%d) ", state->transition_[i], state->drop_[i]->batch_size_);
  295. else
  296. printf("n%d->(%d) ", state->transition_[i], state->drop_[i]->batch_size_);
  297. print_FSM(state->drop_[i]);
  298. }
  299. }
  300. }
  301. #else /* ! 0 */
  302. state->reset_all_processed();
  303. state->print_all(0);
  304. #endif /* 0 */
  305. }
  307. void
  308. FSM::print_FSM_stats(FSMState* state, int n)
  309. {
  310. state->reset_all_processed();
  311. state->print_all_stats(n);
  312. fflush(stdout);
  313. }
  315. static class TahoeAckFSMClass : public TclClass {
  316. public:
  317.         TahoeAckFSMClass() : TclClass("FSM/TahoeAck") {}
  318.         TclObject* create(int , const char*const*) {
  319.                 return (new TahoeAckFSM);
  320.         }
  321. } class_tahoeackfsm;
  323. static class RenoAckFSMClass : public TclClass {
  324. public:
  325.         RenoAckFSMClass() : TclClass("FSM/RenoAck") {}
  326.         TclObject* create(int , const char*const*) {
  327.                 return (new RenoAckFSM);
  328.         }
  329. } class_renoackfsm;
  331. static class TahoeDelAckFSMClass : public TclClass {
  332. public:
  333.         TahoeDelAckFSMClass() : TclClass("FSM/TahoeDelAck") {}
  334.         TclObject* create(int , const char*const*) {
  335.                 return (new TahoeDelAckFSM);
  336.         }
  337. } class_tahoedelackfsm;
  339. static class RenoDelAckFSMClass : public TclClass {
  340. public:
  341.         RenoDelAckFSMClass() : TclClass("FSM/RenoDelAck") {}
  342.         TclObject* create(int , const char*const*) {
  343.                 return (new RenoDelAckFSM);
  344.         }
  345. } class_renodelackfsm;
  348. // ***********************************************
  349. // Tahoe-Ack TCP Connection Finite State Machine *
  350. // ***********************************************
  351. TahoeAckFSM::TahoeAckFSM() : FSM(), start_state_(NULL) 
  352. {
  353. int i;
  354. FSMState* tmp;
  357. instance_ = this;
  358. // (wnd, ssh) == (1, 20)
  359. start_state_ = new FSMState;
  360. //printf("creating Tahoe Ack FSMn"); 
  361. for (i=0; i<17; i++) {
  362. start_state_->drop_[i] = NULL;
  363. start_state_->transition_[i] = -1;
  364. }
  365. start_state_->batch_size_ = 1;
  367. // (wnd, ssh) == (2, 20)
  368. tmp = new FSMState;
  369. for (i=0; i<17; i++) {
  370. tmp->drop_[i] = NULL;
  371. tmp->transition_[i] = -1;
  372. }
  373. tmp->batch_size_ = 2;
  374. start_state_->drop_[0] = tmp;
  375. start_state_->transition_[0] = RTT;
  377. tmp = new FSMState;
  378. for (i=0; i<17; i++) {
  379. tmp->drop_[i] = NULL;
  380. tmp->transition_[i] = -1;
  381. }
  382. tmp->batch_size_ = 2;
  383. start_state_->drop_[0]->drop_[2] = tmp;
  384. start_state_->drop_[0]->transition_[2] = RTT;
  386. // (wnd, ssh) == (4, 20)
  387. tmp = new FSMState;
  388. for (i=0; i<17; i++) {
  389. tmp->drop_[i] = NULL;
  390. tmp->transition_[i] = -1;
  391. }
  392. tmp->batch_size_ = 4;
  393. start_state_->drop_[0]->drop_[0] = tmp;
  394. start_state_->drop_[0]->transition_[0] = RTT;
  396. tmp = new FSMState;
  397. for (i=0; i<17; i++) {
  398. tmp->drop_[i] = NULL;
  399. tmp->transition_[i] = -1;
  400. }
  401. tmp->batch_size_ = 2;
  402. start_state_->drop_[0]->drop_[0]->drop_[2] = tmp;
  403. start_state_->drop_[0]->drop_[0]->transition_[2] = RTT;
  405. tmp = new FSMState;
  406. for (i=0; i<17; i++) {
  407. tmp->drop_[i] = NULL;
  408. tmp->transition_[i] = -1;
  409. }
  410. tmp->batch_size_ = 4;
  411. start_state_->drop_[0]->drop_[0]->drop_[3] = tmp;
  412. start_state_->drop_[0]->drop_[0]->transition_[3] = RTT;
  414. tmp = new FSMState;
  415. for (i=0; i<17; i++) {
  416. tmp->drop_[i] = NULL;
  417. tmp->transition_[i] = -1;
  418. }
  419. tmp->batch_size_ = 6;
  420. start_state_->drop_[0]->drop_[0]->drop_[4] = tmp;
  421. start_state_->drop_[0]->drop_[0]->transition_[4] = RTT;
  423. //(wnd, ssh) == (8, 20)
  424. tmp = new FSMState;
  425. for (i=0; i<17; i++) {
  426. tmp->drop_[i] = NULL;
  427. tmp->transition_[i] = -1;
  428. }
  429. tmp->batch_size_ = 8;
  430. start_state_->drop_[0]->drop_[0]->drop_[0] = tmp;
  431. start_state_->drop_[0]->drop_[0]->transition_[0] = RTT;
  433. tmp = new FSMState;
  434. for (i=0; i<17; i++) {
  435. tmp->drop_[i] = NULL;
  436. tmp->transition_[i] = -1;
  437. }
  438. tmp->batch_size_ = 2;
  439. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  440. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  442. tmp = new FSMState;
  443. for (i=0; i<17; i++) {
  444. tmp->drop_[i] = NULL;
  445. tmp->transition_[i] = -1;
  446. }
  447. tmp->batch_size_ = 4;
  448. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  449. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  451. tmp = new FSMState;
  452. for (i=0; i<17; i++) {
  453. tmp->drop_[i] = NULL;
  454. tmp->transition_[i] = -1;
  455. }
  456. tmp->batch_size_ = 6;
  457. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  458. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  460. tmp = new FSMState;
  461. for (i=0; i<17; i++) {
  462. tmp->drop_[i] = NULL;
  463. tmp->transition_[i] = -1;
  464. }
  465. tmp->batch_size_ = 8;
  466. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  467. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  469. tmp = new FSMState;
  470. for (i=0; i<17; i++) {
  471. tmp->drop_[i] = NULL;
  472. tmp->transition_[i] = -1;
  473. }
  474. tmp->batch_size_ = 10;
  475. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6] = tmp;
  476. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[6] = RTT;
  478. tmp = new FSMState;
  479. for (i=0; i<17; i++) {
  480. tmp->drop_[i] = NULL;
  481. tmp->transition_[i] = -1;
  482. }
  483. tmp->batch_size_ = 12;
  484. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7] = tmp;
  485. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[7] = RTT;
  487. tmp = new FSMState;
  488. for (i=0; i<17; i++) {
  489. tmp->drop_[i] = NULL;
  490. tmp->transition_[i] = -1;
  491. }
  492. tmp->batch_size_ = 14;
  493. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8] = tmp;
  494. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[8] = RTT;
  496. //(wnd, ssh) == (16, 20)
  497. tmp = new FSMState;
  498. for (i=0; i<17; i++) {
  499. tmp->drop_[i] = NULL;
  500. tmp->transition_[i] = -1;
  501. }
  502. tmp->batch_size_ = 16;
  503. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  504. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  506. tmp = new FSMState;
  507. for (i=0; i<17; i++) {
  508. tmp->drop_[i] = NULL;
  509. tmp->transition_[i] = -1;
  510. }
  511. tmp->batch_size_ = 1;
  512. for (i=1; i<17; i++) start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[i] = tmp;
  513. for (i=1; i<14; i++)
  514. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = RTT;
  515. for (i=14; i<17; i++)
  516. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = TIMEOUT;
  519. //(wnd, ssh) == (1, 2), timeout
  520. tmp = new FSMState;
  521. for (i=0; i<17; i++) {
  522. tmp->drop_[i] = NULL;
  523. tmp->transition_[i] = -1;
  524. }
  525. tmp->batch_size_ = 1;
  526. start_state_->drop_[1] = tmp;
  527. start_state_->transition_[1] = TIMEOUT;
  528. start_state_->drop_[0]->drop_[1] = tmp;
  529. start_state_->drop_[0]->transition_[1] = TIMEOUT;
  530. start_state_->drop_[0]->drop_[2]->drop_[0] = tmp;
  531. start_state_->drop_[0]->drop_[2]->transition_[0] = TIMEOUT;
  532. start_state_->drop_[0]->drop_[0]->drop_[1] = tmp;
  533. start_state_->drop_[0]->drop_[0]->transition_[1] = RTT;
  534. start_state_->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  535. start_state_->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  537. //(wnd, ssh) == (2, 2)
  538. tmp = new FSMState;
  539. for (i=0; i<17; i++) {
  540. tmp->drop_[i] = NULL;
  541. tmp->transition_[i] = -1;
  542. }
  543. tmp->batch_size_ = 2;
  544. start_state_->drop_[1]->drop_[0] = tmp;
  545. start_state_->drop_[1]->transition_[0] = RTT;
  547. //(wnd, ssh) == (2.5, 2)
  548. tmp = new FSMState;
  549. for (i=0; i<17; i++) {
  550. tmp->drop_[i] = NULL;
  551. tmp->transition_[i] = -1;
  552. }
  553. tmp->batch_size_ = 2;
  554. start_state_->drop_[1]->drop_[0]->drop_[0] = tmp;
  555. start_state_->drop_[1]->drop_[0]->transition_[0] = RTT;
  557. //(wnd, ssh) == (3, 2)
  558. tmp = new FSMState;
  559. for (i=0; i<17; i++) {
  560. tmp->drop_[i] = NULL;
  561. tmp->transition_[i] = -1;
  562. }
  563. tmp->batch_size_ = 3;
  564. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  565. start_state_->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  567. //(wnd, ssh) == (4, 2)
  568. tmp = new FSMState;
  569. for (i=0; i<17; i++) {
  570. tmp->drop_[i] = NULL;
  571. tmp->transition_[i] = -1;
  572. }
  573. tmp->batch_size_ = 4;
  574. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  575. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  577. //(wnd, ssh) == (5, 2)
  578. tmp = new FSMState;
  579. for (i=0; i<17; i++) {
  580. tmp->drop_[i] = NULL;
  581. tmp->transition_[i] = -1;
  582. }
  583. tmp->batch_size_ = 5;
  584. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  585. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  587. //(wnd, ssh) == (6, 2)
  588. tmp = new FSMState;
  589. for (i=0; i<17; i++) {
  590. tmp->drop_[i] = NULL;
  591. tmp->transition_[i] = -1;
  592. }
  593. tmp->batch_size_ = 6;
  594. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  595. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  597. //(wnd, ssh) == (7, 2)
  598. tmp = new FSMState;
  599. for (i=0; i<17; i++) {
  600. tmp->drop_[i] = NULL;
  601. tmp->transition_[i] = -1;
  602. }
  603. tmp->batch_size_ = 7;
  604. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  605. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  607. //(wnd, ssh) == (7, 2)
  608. tmp = new FSMState;
  609. for (i=0; i<17; i++) {
  610. tmp->drop_[i] = NULL;
  611. tmp->transition_[i] = -1;
  612. }
  613. tmp->batch_size_ = 7;
  614. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  615. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  618. //(wnd, ssh) == (1, 3)
  619. tmp = new FSMState;
  620. for (i=0; i<17; i++) {
  621. tmp->drop_[i] = NULL;
  622. tmp->transition_[i] = -1;
  623. }
  624. tmp->batch_size_ = 1;
  625. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  626. start_state_->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  627. start_state_->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  628. start_state_->drop_[0]->drop_[0]->drop_[4]->transition_[0] = RTT;
  630. tmp = new FSMState;
  631. for (i=0; i<17; i++) {
  632. tmp->drop_[i] = NULL;
  633. tmp->transition_[i] = -1;
  634. }
  635. tmp->batch_size_ = 2;
  636. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  637. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  639. tmp = new FSMState;
  640. for (i=0; i<17; i++) {
  641. tmp->drop_[i] = NULL;
  642. tmp->transition_[i] = -1;
  643. }
  644. tmp->batch_size_ = 3;
  645. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  646. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  648. tmp = new FSMState;
  649. for (i=0; i<17; i++) {
  650. tmp->drop_[i] = NULL;
  651. tmp->transition_[i] = -1;
  652. }
  653. tmp->batch_size_ = 4;
  654. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  655. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  657. tmp = new FSMState;
  658. for (i=0; i<17; i++) {
  659. tmp->drop_[i] = NULL;
  660. tmp->transition_[i] = -1;
  661. }
  662. tmp->batch_size_ = 5;
  663. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  664. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  666. tmp = new FSMState;
  667. for (i=0; i<17; i++) {
  668. tmp->drop_[i] = NULL;
  669. tmp->transition_[i] = -1;
  670. }
  671. tmp->batch_size_ = 5;
  672. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  673. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  675. tmp = new FSMState;
  676. for (i=0; i<17; i++) {
  677. tmp->drop_[i] = NULL;
  678. tmp->transition_[i] = -1;
  679. }
  680. tmp->batch_size_ = 6;
  681. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  682. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  684. //(wnd, ssh) == (1, 4)
  685. tmp = new FSMState;
  686. for (i=0; i<17; i++) {
  687. tmp->drop_[i] = NULL;
  688. tmp->transition_[i] = -1;
  689. }
  690. tmp->batch_size_ = 1;
  691. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  692. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  693. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  694. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->transition_[0] = 0;
  696. tmp = new FSMState;
  697. for (i=0; i<17; i++) {
  698. tmp->drop_[i] = NULL;
  699. tmp->transition_[i] = -1;
  700. }
  701. tmp->batch_size_ = 2;
  702. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0] = tmp;
  703. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->transition_[0] = RTT;
  706. tmp = new FSMState;
  707. for (i=0; i<17; i++) {
  708. tmp->drop_[i] = NULL;
  709. tmp->transition_[i] = -1;
  710. }
  711. tmp->batch_size_ = 4;
  712. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0] = tmp;
  713. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->transition_[0] = RTT;
  715. tmp = new FSMState;
  716. for (i=0; i<17; i++) {
  717. tmp->drop_[i] = NULL;
  718. tmp->transition_[i] = -1;
  719. }
  720. tmp->batch_size_ = 4;
  721. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  722. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  724. tmp = new FSMState;
  725. for (i=0; i<17; i++) {
  726. tmp->drop_[i] = NULL;
  727. tmp->transition_[i] = -1;
  728. }
  729. tmp->batch_size_ = 5;
  730. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  731. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  733. tmp = new FSMState;
  734. for (i=0; i<17; i++) {
  735. tmp->drop_[i] = NULL;
  736. tmp->transition_[i] = -1;
  737. }
  738. tmp->batch_size_ = 6;
  739. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  740. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  742. //(wnd, ssh) == (1, 5)
  743. tmp = new FSMState;
  744. for (i=0; i<17; i++) {
  745. tmp->drop_[i] = NULL;
  746. tmp->transition_[i] = -1;
  747. }
  748. tmp->batch_size_ = 1;
  749. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  750. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = 0;
  751. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  752. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = 0;
  754. tmp = new FSMState;
  755. for (i=0; i<17; i++) {
  756. tmp->drop_[i] = NULL;
  757. tmp->transition_[i] = -1;
  758. }
  759. tmp->batch_size_ = 2;
  760. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  761. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  763. tmp = new FSMState;
  764. for (i=0; i<17; i++) {
  765. tmp->drop_[i] = NULL;
  766. tmp->transition_[i] = -1;
  767. }
  768. tmp->batch_size_ = 4;
  769. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  770. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  772. tmp = new FSMState;
  773. for (i=0; i<17; i++) {
  774. tmp->drop_[i] = NULL;
  775. tmp->transition_[i] = -1;
  776. }
  777. tmp->batch_size_ = 5;
  778. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  779. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  781. tmp = new FSMState;
  782. for (i=0; i<17; i++) {
  783. tmp->drop_[i] = NULL;
  784. tmp->transition_[i] = -1;
  785. }
  786. tmp->batch_size_ = 6;
  787. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  788. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  790. //(wnd, ssh) == (1, 6)
  791. tmp = new FSMState;
  792. for (i=0; i<17; i++) {
  793. tmp->drop_[i] = NULL;
  794. tmp->transition_[i] = -1;
  795. }
  796. tmp->batch_size_ = 1;
  797. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  798. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = 0;
  799. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0] = tmp;
  800. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->transition_[0] = RTT;
  802. tmp = new FSMState;
  803. for (i=0; i<17; i++) {
  804. tmp->drop_[i] = NULL;
  805. tmp->transition_[i] = -1;
  806. }
  807. tmp->batch_size_ = 2;
  808. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0] = tmp;
  809. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->transition_[0] = RTT;
  811. tmp = new FSMState;
  812. for (i=0; i<17; i++) {
  813. tmp->drop_[i] = NULL;
  814. tmp->transition_[i] = -1;
  815. }
  816. tmp->batch_size_ = 4;
  817. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->drop_[0] = tmp;
  818. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->transition_[0] = RTT;
  820. tmp = new FSMState;
  821. for (i=0; i<17; i++) {
  822. tmp->drop_[i] = NULL;
  823. tmp->transition_[i] = -1;
  824. }
  825. tmp->batch_size_ = 6;
  826. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  827. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  829. //(wnd, ssh) == (1, 7)
  830. tmp = new FSMState;
  831. for (i=0; i<17; i++) {
  832. tmp->drop_[i] = NULL;
  833. tmp->transition_[i] = -1;
  834. }
  835. tmp->batch_size_ = 1;
  836. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0] = tmp;
  837. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->transition_[0] = RTT;
  838. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0] = tmp;
  839. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8]->transition_[0] = RTT;
  841. tmp = new FSMState;
  842. for (i=0; i<17; i++) {
  843. tmp->drop_[i] = NULL;
  844. tmp->transition_[i] = -1;
  845. }
  846. tmp->batch_size_ = 2;
  847. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0]->drop_[0] = tmp;
  848. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0]->transition_[0] = RTT;
  850. tmp = new FSMState;
  851. for (i=0; i<17; i++) {
  852. tmp->drop_[i] = NULL;
  853. tmp->transition_[i] = -1;
  854. }
  855. tmp->batch_size_ = 4;
  856. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0]->drop_[0]->drop_[0] = tmp;
  857. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0]->drop_[0]->transition_[0] = RTT;
  859. //print_FSM(start_state_);
  860. //printf("n");
  861. }
  863. // **********************************************
  864. // Reno-ACK TCP Connection Finite State Machine *
  865. // **********************************************
  866. RenoAckFSM::RenoAckFSM() : FSM(), start_state_(NULL) 
  867. {
  868. int i;
  869. FSMState* tmp;
  870. //printf("creating Reno Ack FSMn");
  872. instance_ = this;
  873. // (wnd, ssh) == (1, 20)
  874. start_state_ = new FSMState;
  875. for (i=0; i<17; i++) {
  876. start_state_->drop_[i] = NULL;
  877. start_state_->transition_[i] = -1;
  878. }
  879. start_state_->batch_size_ = 1;
  881. // (wnd, ssh) == (2, 20)
  882. tmp = new FSMState;
  883. for (i=0; i<17; i++) {
  884. tmp->drop_[i] = NULL;
  885. tmp->transition_[i] = -1;
  886. }
  887. tmp->batch_size_ = 2;
  888. start_state_->drop_[0] = tmp;
  889. start_state_->transition_[0] = RTT;
  891. tmp = new FSMState;
  892. for (i=0; i<17; i++) {
  893. tmp->drop_[i] = NULL;
  894. tmp->transition_[i] = -1;
  895. }
  896. tmp->batch_size_ = 2;
  897. start_state_->drop_[0]->drop_[2] = tmp;
  898. start_state_->drop_[0]->transition_[2] = RTT;
  900. // (wnd, ssh) == (4, 20)
  901. tmp = new FSMState;
  902. for (i=0; i<17; i++) {
  903. tmp->drop_[i] = NULL;
  904. tmp->transition_[i] = -1;
  905. }
  906. tmp->batch_size_ = 4;
  907. start_state_->drop_[0]->drop_[0] = tmp;
  908. start_state_->drop_[0]->transition_[0] = RTT;
  910. tmp = new FSMState;
  911. for (i=0; i<17; i++) {
  912. tmp->drop_[i] = NULL;
  913. tmp->transition_[i] = -1;
  914. }
  915. tmp->batch_size_ = 2;
  916. start_state_->drop_[0]->drop_[0]->drop_[2] = tmp;
  917. start_state_->drop_[0]->drop_[0]->transition_[2] = RTT;
  919. tmp = new FSMState;
  920. for (i=0; i<17; i++) {
  921. tmp->drop_[i] = NULL;
  922. tmp->transition_[i] = -1;
  923. }
  924. tmp->batch_size_ = 4;
  925. start_state_->drop_[0]->drop_[0]->drop_[3] = tmp;
  926. start_state_->drop_[0]->drop_[0]->transition_[3] = RTT;
  928. tmp = new FSMState;
  929. for (i=0; i<17; i++) {
  930. tmp->drop_[i] = NULL;
  931. tmp->transition_[i] = -1;
  932. }
  933. tmp->batch_size_ = 6;
  934. start_state_->drop_[0]->drop_[0]->drop_[4] = tmp;
  935. start_state_->drop_[0]->drop_[0]->transition_[4] = RTT;
  937. //(wnd, ssh) == (8, 20)
  938. tmp = new FSMState;
  939. for (i=0; i<17; i++) {
  940. tmp->drop_[i] = NULL;
  941. tmp->transition_[i] = -1;
  942. }
  943. tmp->batch_size_ = 8;
  944. start_state_->drop_[0]->drop_[0]->drop_[0] = tmp;
  945. start_state_->drop_[0]->drop_[0]->transition_[0] = RTT;
  947. tmp = new FSMState;
  948. for (i=0; i<17; i++) {
  949. tmp->drop_[i] = NULL;
  950. tmp->transition_[i] = -1;
  951. }
  952. tmp->batch_size_ = 4;
  953. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  954. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  956. tmp = new FSMState;
  957. for (i=0; i<17; i++) {
  958. tmp->drop_[i] = NULL;
  959. tmp->transition_[i] = -1;
  960. }
  961. tmp->batch_size_ = 6;
  962. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  963. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  965. tmp = new FSMState;
  966. for (i=0; i<17; i++) {
  967. tmp->drop_[i] = NULL;
  968. tmp->transition_[i] = -1;
  969. }
  970. tmp->batch_size_ = 8;
  971. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  972. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  974. tmp = new FSMState;
  975. for (i=0; i<17; i++) {
  976. tmp->drop_[i] = NULL;
  977. tmp->transition_[i] = -1;
  978. }
  979. tmp->batch_size_ = 10;
  980. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6] = tmp;
  981. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[6] = RTT;
  984. tmp = new FSMState;
  985. for (i=0; i<17; i++) {
  986. tmp->drop_[i] = NULL;
  987. tmp->transition_[i] = -1;
  988. }
  989. tmp->batch_size_ = 6;
  990. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0] = tmp;
  991. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->transition_[0] = RTT;
  993. tmp = new FSMState;
  994. for (i=0; i<17; i++) {
  995. tmp->drop_[i] = NULL;
  996. tmp->transition_[i] = -1;
  997. }
  998. tmp->batch_size_ = 12;
  999. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7] = tmp;
  1000. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[7] = RTT;
  1002. tmp = new FSMState;
  1003. for (i=0; i<17; i++) {
  1004. tmp->drop_[i] = NULL;
  1005. tmp->transition_[i] = -1;
  1006. }
  1007. tmp->batch_size_ = 14;
  1008. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8] = tmp;
  1009. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[8] = RTT;
  1011. //(wnd, ssh) == (16, 20)
  1012. tmp = new FSMState;
  1013. for (i=0; i<17; i++) {
  1014. tmp->drop_[i] = NULL;
  1015. tmp->transition_[i] = -1;
  1016. }
  1017. tmp->batch_size_ = 16;
  1018. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1019. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1021. tmp = new FSMState;
  1022. for (i=0; i<17; i++) {
  1023. tmp->drop_[i] = NULL;
  1024. tmp->transition_[i] = -1;
  1025. }
  1026. tmp->batch_size_ = 1;
  1027. for (i=1; i<17; i++) start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[i] = tmp;
  1028. for (i=1; i<14; i++)
  1029. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = RTT;
  1030. for (i=14; i<17; i++)
  1031. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = TIMEOUT;
  1033. //(wnd, ssh) == (1, 2), timeout
  1034. tmp = new FSMState;
  1035. for (i=0; i<17; i++) {
  1036. tmp->drop_[i] = NULL;
  1037. tmp->transition_[i] = -1;
  1038. }
  1039. tmp->batch_size_ = 1;
  1040. start_state_->drop_[1] = tmp;
  1041. start_state_->transition_[1] = TIMEOUT;
  1042. start_state_->drop_[0]->drop_[1] = tmp;
  1043. start_state_->drop_[0]->transition_[1] = TIMEOUT;
  1044. start_state_->drop_[0]->drop_[2]->drop_[0] = tmp;
  1045. start_state_->drop_[0]->drop_[2]->transition_[0] = TIMEOUT;
  1047. //(wnd, ssh) == (2, 2)
  1048. tmp = new FSMState;
  1049. for (i=0; i<17; i++) {
  1050. tmp->drop_[i] = NULL;
  1051. tmp->transition_[i] = -1;
  1052. }
  1053. tmp->batch_size_ = 2;
  1054. start_state_->drop_[1]->drop_[0] = tmp;
  1055. start_state_->drop_[1]->transition_[0] = RTT;
  1056. start_state_->drop_[0]->drop_[0]->drop_[1] = tmp;
  1057. start_state_->drop_[0]->drop_[0]->transition_[1] = RTT;
  1058. start_state_->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1059. start_state_->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  1061. //(wnd, ssh) == (2.5, 2)
  1062. tmp = new FSMState;
  1063. for (i=0; i<17; i++) {
  1064. tmp->drop_[i] = NULL;
  1065. tmp->transition_[i] = -1;
  1066. }
  1067. tmp->batch_size_ = 2;
  1068. start_state_->drop_[1]->drop_[0]->drop_[0] = tmp;
  1069. start_state_->drop_[1]->drop_[0]->transition_[0] = RTT;
  1071. //(wnd, ssh) == (3, 2)
  1072. tmp = new FSMState;
  1073. for (i=0; i<17; i++) {
  1074. tmp->drop_[i] = NULL;
  1075. tmp->transition_[i] = -1;
  1076. }
  1077. tmp->batch_size_ = 3;
  1078. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1079. start_state_->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1081. //(wnd, ssh) == (4, 2)
  1082. tmp = new FSMState;
  1083. for (i=0; i<17; i++) {
  1084. tmp->drop_[i] = NULL;
  1085. tmp->transition_[i] = -1;
  1086. }
  1087. tmp->batch_size_ = 4;
  1088. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1089. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1091. //(wnd, ssh) == (5, 2)
  1092. tmp = new FSMState;
  1093. for (i=0; i<17; i++) {
  1094. tmp->drop_[i] = NULL;
  1095. tmp->transition_[i] = -1;
  1096. }
  1097. tmp->batch_size_ = 5;
  1098. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1099. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1101. //(wnd, ssh) == (6, 2)
  1102. tmp = new FSMState;
  1103. for (i=0; i<17; i++) {
  1104. tmp->drop_[i] = NULL;
  1105. tmp->transition_[i] = -1;
  1106. }
  1107. tmp->batch_size_ = 6;
  1108. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1109. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1111. //(wnd, ssh) == (7, 2)
  1112. tmp = new FSMState;
  1113. for (i=0; i<17; i++) {
  1114. tmp->drop_[i] = NULL;
  1115. tmp->transition_[i] = -1;
  1116. }
  1117. tmp->batch_size_ = 7;
  1118. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1119. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1121. //(wnd, ssh) == (7.5, 2)
  1122. tmp = new FSMState;
  1123. for (i=0; i<17; i++) {
  1124. tmp->drop_[i] = NULL;
  1125. tmp->transition_[i] = -1;
  1126. }
  1127. tmp->batch_size_ = 7;
  1128. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1129. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1132. //(wnd, ssh) == (3, 3)
  1133. tmp = new FSMState;
  1134. for (i=0; i<17; i++) {
  1135. tmp->drop_[i] = NULL;
  1136. tmp->transition_[i] = -1;
  1137. }
  1138. tmp->batch_size_ = 3;
  1139. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1140. start_state_->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  1141. start_state_->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  1142. start_state_->drop_[0]->drop_[0]->drop_[4]->transition_[0] = RTT;
  1144. tmp = new FSMState;
  1145. for (i=0; i<17; i++) {
  1146. tmp->drop_[i] = NULL;
  1147. tmp->transition_[i] = -1;
  1148. }
  1149. tmp->batch_size_ = 3;
  1150. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  1151. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  1153. tmp = new FSMState;
  1154. for (i=0; i<17; i++) {
  1155. tmp->drop_[i] = NULL;
  1156. tmp->transition_[i] = -1;
  1157. }
  1158. tmp->batch_size_ = 4;
  1159. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1160. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1162. tmp = new FSMState;
  1163. for (i=0; i<17; i++) {
  1164. tmp->drop_[i] = NULL;
  1165. tmp->transition_[i] = -1;
  1166. }
  1167. tmp->batch_size_ = 5;
  1168. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1169. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1171. tmp = new FSMState;
  1172. for (i=0; i<17; i++) {
  1173. tmp->drop_[i] = NULL;
  1174. tmp->transition_[i] = -1;
  1175. }
  1176. tmp->batch_size_ = 6;
  1177. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1178. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1182. //(wnd, ssh) == (4, 4)
  1183. tmp = new FSMState;
  1184. for (i=0; i<17; i++) {
  1185. tmp->drop_[i] = NULL;
  1186. tmp->transition_[i] = -1;
  1187. }
  1188. tmp->batch_size_ = 4;
  1189. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  1190. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  1191. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  1192. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  1194. tmp = new FSMState;
  1195. for (i=0; i<17; i++) {
  1196. tmp->drop_[i] = NULL;
  1197. tmp->transition_[i] = -1;
  1198. }
  1199. tmp->batch_size_ = 4;
  1200. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0] = tmp;
  1201. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->transition_[0] = RTT;
  1204. tmp = new FSMState;
  1205. for (i=0; i<17; i++) {
  1206. tmp->drop_[i] = NULL;
  1207. tmp->transition_[i] = -1;
  1208. }
  1209. tmp->batch_size_ = 5;
  1210. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0] = tmp;
  1211. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->transition_[0] = RTT;
  1213. tmp = new FSMState;
  1214. for (i=0; i<17; i++) {
  1215. tmp->drop_[i] = NULL;
  1216. tmp->transition_[i] = -1;
  1217. }
  1218. tmp->batch_size_ = 6;
  1219. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1220. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1223. //(wnd, ssh) == (5, 5)
  1224. tmp = new FSMState;
  1225. for (i=0; i<17; i++) {
  1226. tmp->drop_[i] = NULL;
  1227. tmp->transition_[i] = -1;
  1228. }
  1229. tmp->batch_size_ = 1;
  1230. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1231. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = 0;
  1232. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  1233. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = 0;
  1235. tmp = new FSMState;
  1236. for (i=0; i<17; i++) {
  1237. tmp->drop_[i] = NULL;
  1238. tmp->transition_[i] = -1;
  1239. }
  1240. tmp->batch_size_ = 5;
  1241. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  1242. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  1244. tmp = new FSMState;
  1245. for (i=0; i<17; i++) {
  1246. tmp->drop_[i] = NULL;
  1247. tmp->transition_[i] = -1;
  1248. }
  1249. tmp->batch_size_ = 6;
  1250. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1251. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1253. tmp = new FSMState;
  1254. for (i=0; i<17; i++) {
  1255. tmp->drop_[i] = NULL;
  1256. tmp->transition_[i] = -1;
  1257. }
  1258. tmp->batch_size_ = 7;
  1259. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1260. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1262. //(wnd, ssh) == (6, 6)
  1263. tmp = new FSMState;
  1264. for (i=0; i<17; i++) {
  1265. tmp->drop_[i] = NULL;
  1266. tmp->transition_[i] = -1;
  1267. }
  1268. tmp->batch_size_ = 1;
  1269. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  1270. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = 0;
  1272. tmp = new FSMState;
  1273. for (i=0; i<17; i++) {
  1274. tmp->drop_[i] = NULL;
  1275. tmp->transition_[i] = -1;
  1276. }
  1277. tmp->batch_size_ = 6;
  1278. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0] = tmp;
  1279. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->transition_[0] = RTT;
  1280. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0]->drop_[0] = tmp;
  1281. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0]->transition_[0] = RTT;
  1283. tmp = new FSMState;
  1284. for (i=0; i<17; i++) {
  1285. tmp->drop_[i] = NULL;
  1286. tmp->transition_[i] = -1;
  1287. }
  1288. tmp->batch_size_ = 7;
  1289. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1290. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1292. //(wnd, ssh) == (7, 7)
  1293. tmp = new FSMState;
  1294. for (i=0; i<17; i++) {
  1295. tmp->drop_[i] = NULL;
  1296. tmp->transition_[i] = -1;
  1297. }
  1298. tmp->batch_size_ = 7;
  1299. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0] = tmp;
  1300. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[7]->transition_[0] = RTT;
  1301. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0] = tmp;
  1302. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[8]->transition_[0] = RTT;
  1304. //print_FSM(start_state_);
  1305. //printf("n");
  1307. }
  1309. // *****************************************************
  1310. // Tahoe-Delay Ack TCP Connection Finite State Machine *
  1311. // *****************************************************
  1312. TahoeDelAckFSM::TahoeDelAckFSM() : FSM(), start_state_(NULL) 
  1313. {
  1314. int i;
  1315. FSMState* tmp;
  1316. //printf("creating Tahoe DelAck FSMn");
  1318. instance_ = this;
  1319. // (wnd, ssh) == (1, 20)
  1320. start_state_ = new FSMState;
  1321. for (i=0; i<17; i++) {
  1322. start_state_->drop_[i] = NULL;
  1323. start_state_->transition_[i] = -1;
  1324. }
  1325. start_state_->batch_size_ = 1;
  1327. // (wnd, ssh) == (2, 20)
  1328. tmp = new FSMState;
  1329. for (i=0; i<17; i++) {
  1330. tmp->drop_[i] = NULL;
  1331. tmp->transition_[i] = -1;
  1332. }
  1333. tmp->batch_size_ = 2;
  1334. start_state_->drop_[0] = tmp;
  1335. start_state_->transition_[0] = RTT;
  1337. tmp = new FSMState;
  1338. for (i=0; i<17; i++) {
  1339. tmp->drop_[i] = NULL;
  1340. tmp->transition_[i] = -1;
  1341. }
  1342. tmp->batch_size_ = 2;
  1343. start_state_->drop_[0]->drop_[2] = tmp;
  1344. start_state_->drop_[0]->transition_[2] = RTT;
  1346. // (wnd, ssh) == (3, 20)
  1347. tmp = new FSMState;
  1348. for (i=0; i<17; i++) {
  1349. tmp->drop_[i] = NULL;
  1350. tmp->transition_[i] = -1;
  1351. }
  1352. tmp->batch_size_ = 3;
  1353. start_state_->drop_[0]->drop_[0] = tmp;
  1354. start_state_->drop_[0]->transition_[0] = RTT;
  1356. tmp = new FSMState;
  1357. for (i=0; i<17; i++) {
  1358. tmp->drop_[i] = NULL;
  1359. tmp->transition_[i] = -1;
  1360. }
  1361. tmp->batch_size_ = 2;
  1362. start_state_->drop_[0]->drop_[0]->drop_[2] = tmp;
  1363. start_state_->drop_[0]->drop_[0]->transition_[2] = RTT;
  1365. tmp = new FSMState;
  1366. for (i=0; i<17; i++) {
  1367. tmp->drop_[i] = NULL;
  1368. tmp->transition_[i] = -1;
  1369. }
  1370. tmp->batch_size_ = 3;
  1371. start_state_->drop_[0]->drop_[0]->drop_[3] = tmp;
  1372. start_state_->drop_[0]->drop_[0]->transition_[3] = RTT;
  1374. //(wnd, ssh) == (5, 20)
  1375. tmp = new FSMState;
  1376. for (i=0; i<17; i++) {
  1377. tmp->drop_[i] = NULL;
  1378. tmp->transition_[i] = -1;
  1379. }
  1380. tmp->batch_size_ = 5;
  1381. start_state_->drop_[0]->drop_[0]->drop_[0] = tmp;
  1382. start_state_->drop_[0]->drop_[0]->transition_[0] = RTT;
  1384. tmp = new FSMState;
  1385. for (i=0; i<17; i++) {
  1386. tmp->drop_[i] = NULL;
  1387. tmp->transition_[i] = -1;
  1388. }
  1389. tmp->batch_size_ = 2;
  1390. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  1391. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  1393. tmp = new FSMState;
  1394. for (i=0; i<17; i++) {
  1395. tmp->drop_[i] = NULL;
  1396. tmp->transition_[i] = -1;
  1397. }
  1398. tmp->batch_size_ = 3;
  1399. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  1400. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  1402. tmp = new FSMState;
  1403. for (i=0; i<17; i++) {
  1404. tmp->drop_[i] = NULL;
  1405. tmp->transition_[i] = -1;
  1406. }
  1407. tmp->batch_size_ = 5;
  1408. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  1409. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  1411. tmp = new FSMState;
  1412. for (i=0; i<17; i++) {
  1413. tmp->drop_[i] = NULL;
  1414. tmp->transition_[i] = -1;
  1415. }
  1416. tmp->batch_size_ = 6;
  1417. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  1418. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  1420. //(wnd, ssh) == (8, 20)
  1421. tmp = new FSMState;
  1422. for (i=0; i<17; i++) {
  1423. tmp->drop_[i] = NULL;
  1424. tmp->transition_[i] = -1;
  1425. }
  1426. tmp->batch_size_ = 8;
  1427. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1428. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1430. tmp = new FSMState;
  1431. for (i=0; i<17; i++) {
  1432. tmp->drop_[i] = NULL;
  1433. tmp->transition_[i] = -1;
  1434. }
  1435. tmp->batch_size_ = 2;
  1436. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  1437. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  1439. tmp = new FSMState;
  1440. for (i=0; i<17; i++) {
  1441. tmp->drop_[i] = NULL;
  1442. tmp->transition_[i] = -1;
  1443. }
  1444. tmp->batch_size_ = 3;
  1445. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  1446. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  1448. tmp = new FSMState;
  1449. for (i=0; i<17; i++) {
  1450. tmp->drop_[i] = NULL;
  1451. tmp->transition_[i] = -1;
  1452. }
  1453. tmp->batch_size_ = 5;
  1454. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  1455. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  1457. tmp = new FSMState;
  1458. for (i=0; i<17; i++) {
  1459. tmp->drop_[i] = NULL;
  1460. tmp->transition_[i] = -1;
  1461. }
  1462. tmp->batch_size_ = 6;
  1463. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  1464. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  1466. tmp = new FSMState;
  1467. for (i=0; i<17; i++) {
  1468. tmp->drop_[i] = NULL;
  1469. tmp->transition_[i] = -1;
  1470. }
  1471. tmp->batch_size_ = 8;
  1472. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6] = tmp;
  1473. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[6] = RTT;
  1475. tmp = new FSMState;
  1476. for (i=0; i<17; i++) {
  1477. tmp->drop_[i] = NULL;
  1478. tmp->transition_[i] = -1;
  1479. }
  1480. tmp->batch_size_ = 9;
  1481. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7] = tmp;
  1482. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[7] = RTT;
  1484. tmp = new FSMState;
  1485. for (i=0; i<17; i++) {
  1486. tmp->drop_[i] = NULL;
  1487. tmp->transition_[i] = -1;
  1488. }
  1489. tmp->batch_size_ = 11;
  1490. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8] = tmp;
  1491. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[8] = RTT;
  1493. //(wnd, ssh) == (12, 20)
  1494. tmp = new FSMState;
  1495. for (i=0; i<17; i++) {
  1496. tmp->drop_[i] = NULL;
  1497. tmp->transition_[i] = -1;
  1498. }
  1499. tmp->batch_size_ = 12;
  1500. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1501. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1503. tmp = new FSMState;
  1504. for (i=0; i<17; i++) {
  1505. tmp->drop_[i] = NULL;
  1506. tmp->transition_[i] = -1;
  1507. }
  1508. tmp->batch_size_ = 1;
  1509. for (i=1; i<13; i++) start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[i] = tmp;
  1510. for (i=1; i<10; i++)
  1511. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = RTT;
  1512. for (i=10; i<13; i++)
  1513. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = TIMEOUT;
  1516. //(wnd, ssh) == (1, 2), timeout
  1517. tmp = new FSMState;
  1518. for (i=0; i<17; i++) {
  1519. tmp->drop_[i] = NULL;
  1520. tmp->transition_[i] = -1;
  1521. }
  1522. tmp->batch_size_ = 1;
  1523. start_state_->drop_[1] = tmp;
  1524. start_state_->transition_[1] = TIMEOUT;
  1525. start_state_->drop_[0]->drop_[1] = tmp;
  1526. start_state_->drop_[0]->transition_[1] = TIMEOUT;
  1527. start_state_->drop_[0]->drop_[2]->drop_[0] = tmp;
  1528. start_state_->drop_[0]->drop_[2]->transition_[0] = TIMEOUT;
  1530. start_state_->drop_[0]->drop_[0]->drop_[1] = tmp;
  1531. start_state_->drop_[0]->drop_[0]->transition_[1] = TIMEOUT;
  1532. start_state_->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1533. start_state_->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  1534. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1535. start_state_->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  1537. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  1538. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  1540. //(wnd, ssh) == (2, 2)
  1541. tmp = new FSMState;
  1542. for (i=0; i<17; i++) {
  1543. tmp->drop_[i] = NULL;
  1544. tmp->transition_[i] = -1;
  1545. }
  1546. tmp->batch_size_ = 2;
  1547. start_state_->drop_[1]->drop_[0] = tmp;
  1548. start_state_->drop_[1]->transition_[0] = RTT;
  1550. //(wnd, ssh) == (2.5, 2)
  1551. tmp = new FSMState;
  1552. for (i=0; i<17; i++) {
  1553. tmp->drop_[i] = NULL;
  1554. tmp->transition_[i] = -1;
  1555. }
  1556. tmp->batch_size_ = 2;
  1557. start_state_->drop_[1]->drop_[0]->drop_[0] = tmp;
  1558. start_state_->drop_[1]->drop_[0]->transition_[0] = RTT;
  1560. //(wnd, ssh) == (2.9, 2)
  1561. tmp = new FSMState;
  1562. for (i=0; i<17; i++) {
  1563. tmp->drop_[i] = NULL;
  1564. tmp->transition_[i] = -1;
  1565. }
  1566. tmp->batch_size_ = 2;
  1567. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1568. start_state_->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1570. //(wnd, ssh) == (3, 2)
  1571. tmp = new FSMState;
  1572. for (i=0; i<17; i++) {
  1573. tmp->drop_[i] = NULL;
  1574. tmp->transition_[i] = -1;
  1575. }
  1576. tmp->batch_size_ = 3;
  1577. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1578. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1580. //(wnd, ssh) == (3.3, 2)
  1581. tmp = new FSMState;
  1582. for (i=0; i<17; i++) {
  1583. tmp->drop_[i] = NULL;
  1584. tmp->transition_[i] = -1;
  1585. }
  1586. tmp->batch_size_ = 3;
  1587. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1588. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1590. //(wnd, ssh) == (4, 2)
  1591. tmp = new FSMState;
  1592. for (i=0; i<17; i++) {
  1593. tmp->drop_[i] = NULL;
  1594. tmp->transition_[i] = -1;
  1595. }
  1596. tmp->batch_size_ = 4;
  1597. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1598. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1600. //(wnd, ssh) == (4.7, 2)
  1601. tmp = new FSMState;
  1602. for (i=0; i<17; i++) {
  1603. tmp->drop_[i] = NULL;
  1604. tmp->transition_[i] = -1;
  1605. }
  1606. tmp->batch_size_ = 4;
  1607. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1608. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1610. //(wnd, ssh) == (5, 2)
  1611. tmp = new FSMState;
  1612. for (i=0; i<17; i++) {
  1613. tmp->drop_[i] = NULL;
  1614. tmp->transition_[i] = -1;
  1615. }
  1616. tmp->batch_size_ = 5;
  1617. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1618. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1620. //(wnd, ssh) == (6, 2)
  1621. tmp = new FSMState;
  1622. for (i=0; i<17; i++) {
  1623. tmp->drop_[i] = NULL;
  1624. tmp->transition_[i] = -1;
  1625. }
  1626. tmp->batch_size_ = 6;
  1627. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1628. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1631. //(wnd, ssh) == (1, 3)
  1632. tmp = new FSMState;
  1633. for (i=0; i<17; i++) {
  1634. tmp->drop_[i] = NULL;
  1635. tmp->transition_[i] = -1;
  1636. }
  1637. tmp->batch_size_ = 1;
  1638. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1639. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  1640. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1641. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  1642. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  1643. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = RTT;
  1644. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  1645. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = RTT;
  1647. tmp = new FSMState;
  1648. for (i=0; i<17; i++) {
  1649. tmp->drop_[i] = NULL;
  1650. tmp->transition_[i] = -1;
  1651. }
  1652. tmp->batch_size_ = 2;
  1653. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  1654. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  1656. tmp = new FSMState;
  1657. for (i=0; i<17; i++) {
  1658. tmp->drop_[i] = NULL;
  1659. tmp->transition_[i] = -1;
  1660. }
  1661. tmp->batch_size_ = 3;
  1662. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1663. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1665. tmp = new FSMState;
  1666. for (i=0; i<17; i++) {
  1667. tmp->drop_[i] = NULL;
  1668. tmp->transition_[i] = -1;
  1669. }
  1670. tmp->batch_size_ = 3;
  1671. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1672. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1674. tmp = new FSMState;
  1675. for (i=0; i<17; i++) {
  1676. tmp->drop_[i] = NULL;
  1677. tmp->transition_[i] = -1;
  1678. }
  1679. tmp->batch_size_ = 4;
  1680. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1681. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1683. tmp = new FSMState;
  1684. for (i=0; i<17; i++) {
  1685. tmp->drop_[i] = NULL;
  1686. tmp->transition_[i] = -1;
  1687. }
  1688. tmp->batch_size_ = 4;
  1689. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1690. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1692. tmp = new FSMState;
  1693. for (i=0; i<17; i++) {
  1694. tmp->drop_[i] = NULL;
  1695. tmp->transition_[i] = -1;
  1696. }
  1697. tmp->batch_size_ = 5;
  1698. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1699. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1701. //(wnd, ssh) == (1, 4)
  1702. tmp = new FSMState;
  1703. for (i=0; i<17; i++) {
  1704. tmp->drop_[i] = NULL;
  1705. tmp->transition_[i] = -1;
  1706. }
  1707. tmp->batch_size_ = 1;
  1708. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  1709. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  1710. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1711. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->transition_[0] = 0;
  1712. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1713. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = 0;
  1715. tmp = new FSMState;
  1716. for (i=0; i<17; i++) {
  1717. tmp->drop_[i] = NULL;
  1718. tmp->transition_[i] = -1;
  1719. }
  1720. tmp->batch_size_ = 2;
  1721. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0] = tmp;
  1722. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->transition_[0] = RTT;
  1725. tmp = new FSMState;
  1726. for (i=0; i<17; i++) {
  1727. tmp->drop_[i] = NULL;
  1728. tmp->transition_[i] = -1;
  1729. }
  1730. tmp->batch_size_ = 3;
  1731. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0] = tmp;
  1732. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->transition_[0] = RTT;
  1734. tmp = new FSMState;
  1735. for (i=0; i<17; i++) {
  1736. tmp->drop_[i] = NULL;
  1737. tmp->transition_[i] = -1;
  1738. }
  1739. tmp->batch_size_ = 4;
  1740. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1741. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1743. tmp = new FSMState;
  1744. for (i=0; i<17; i++) {
  1745. tmp->drop_[i] = NULL;
  1746. tmp->transition_[i] = -1;
  1747. }
  1748. tmp->batch_size_ = 4;
  1749. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1750. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1753. //(wnd, ssh) == (1, 5)
  1754. tmp = new FSMState;
  1755. for (i=0; i<17; i++) {
  1756. tmp->drop_[i] = NULL;
  1757. tmp->transition_[i] = -1;
  1758. }
  1759. tmp->batch_size_ = 1;
  1760. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  1761. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = 0;
  1762. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  1763. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = 0;
  1764. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0] = tmp;
  1765. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6]->transition_[0] = RTT;
  1766. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0] = tmp;
  1767. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7]->transition_[0] = RTT;
  1770. tmp = new FSMState;
  1771. for (i=0; i<17; i++) {
  1772. tmp->drop_[i] = NULL;
  1773. tmp->transition_[i] = -1;
  1774. }
  1775. tmp->batch_size_ = 2;
  1776. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0] = tmp;
  1777. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->transition_[0] = RTT;
  1779. tmp = new FSMState;
  1780. for (i=0; i<17; i++) {
  1781. tmp->drop_[i] = NULL;
  1782. tmp->transition_[i] = -1;
  1783. }
  1784. tmp->batch_size_ = 3;
  1785. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1786. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1788. tmp = new FSMState;
  1789. for (i=0; i<17; i++) {
  1790. tmp->drop_[i] = NULL;
  1791. tmp->transition_[i] = -1;
  1792. }
  1793. tmp->batch_size_ = 5;
  1794. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1795. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1798. //(wnd, ssh) == (1, 6)
  1799. tmp = new FSMState;
  1800. for (i=0; i<17; i++) {
  1801. tmp->drop_[i] = NULL;
  1802. tmp->transition_[i] = -1;
  1803. }
  1804. tmp->batch_size_ = 1;
  1805. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0] = tmp;
  1806. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->transition_[0] = RTT;
  1808. tmp = new FSMState;
  1809. for (i=0; i<17; i++) {
  1810. tmp->drop_[i] = NULL;
  1811. tmp->transition_[i] = -1;
  1812. }
  1813. tmp->batch_size_ = 2;
  1814. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0]->drop_[0] = tmp;
  1815. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0]->transition_[0] = RTT;
  1818. //print_FSM(start_state_);
  1819. //printf("n");
  1820. }
  1822. // ****************************************************
  1823. // Reno-Delay Ack TCP Connection Finite State Machine *
  1824. // ****************************************************
  1825. RenoDelAckFSM::RenoDelAckFSM() : FSM(), start_state_(NULL) 
  1826. {
  1827. int i;
  1828. FSMState* tmp;
  1829. //printf("creating Reno DelAck FSMn");
  1831. instance_ = this;
  1832. // (wnd, ssh) == (1, 20)
  1833. start_state_ = new FSMState;
  1834. for (i=0; i<17; i++) {
  1835. start_state_->drop_[i] = NULL;
  1836. start_state_->transition_[i] = -1;
  1837. }
  1838. start_state_->batch_size_ = 1;
  1840. // (wnd, ssh) == (2, 20)
  1841. tmp = new FSMState;
  1842. for (i=0; i<17; i++) {
  1843. tmp->drop_[i] = NULL;
  1844. tmp->transition_[i] = -1;
  1845. }
  1846. tmp->batch_size_ = 2;
  1847. start_state_->drop_[0] = tmp;
  1848. start_state_->transition_[0] = RTT;
  1850. tmp = new FSMState;
  1851. for (i=0; i<17; i++) {
  1852. tmp->drop_[i] = NULL;
  1853. tmp->transition_[i] = -1;
  1854. }
  1855. tmp->batch_size_ = 2;
  1856. start_state_->drop_[0]->drop_[2] = tmp;
  1857. start_state_->drop_[0]->transition_[2] = RTT;
  1859. // (wnd, ssh) == (3, 20)
  1860. tmp = new FSMState;
  1861. for (i=0; i<17; i++) {
  1862. tmp->drop_[i] = NULL;
  1863. tmp->transition_[i] = -1;
  1864. }
  1865. tmp->batch_size_ = 3;
  1866. start_state_->drop_[0]->drop_[0] = tmp;
  1867. start_state_->drop_[0]->transition_[0] = RTT;
  1869. tmp = new FSMState;
  1870. for (i=0; i<17; i++) {
  1871. tmp->drop_[i] = NULL;
  1872. tmp->transition_[i] = -1;
  1873. }
  1874. tmp->batch_size_ = 2;
  1875. start_state_->drop_[0]->drop_[0]->drop_[2] = tmp;
  1876. start_state_->drop_[0]->drop_[0]->transition_[2] = RTT;
  1878. tmp = new FSMState;
  1879. for (i=0; i<17; i++) {
  1880. tmp->drop_[i] = NULL;
  1881. tmp->transition_[i] = -1;
  1882. }
  1883. tmp->batch_size_ = 3;
  1884. start_state_->drop_[0]->drop_[0]->drop_[3] = tmp;
  1885. start_state_->drop_[0]->drop_[0]->transition_[3] = RTT;
  1887. //(wnd, ssh) == (5, 20)
  1888. tmp = new FSMState;
  1889. for (i=0; i<17; i++) {
  1890. tmp->drop_[i] = NULL;
  1891. tmp->transition_[i] = -1;
  1892. }
  1893. tmp->batch_size_ = 5;
  1894. start_state_->drop_[0]->drop_[0]->drop_[0] = tmp;
  1895. start_state_->drop_[0]->drop_[0]->transition_[0] = RTT;
  1897. tmp = new FSMState;
  1898. for (i=0; i<17; i++) {
  1899. tmp->drop_[i] = NULL;
  1900. tmp->transition_[i] = -1;
  1901. }
  1902. tmp->batch_size_ = 2;
  1903. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  1904. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  1906. tmp = new FSMState;
  1907. for (i=0; i<17; i++) {
  1908. tmp->drop_[i] = NULL;
  1909. tmp->transition_[i] = -1;
  1910. }
  1911. tmp->batch_size_ = 3;
  1912. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  1913. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  1915. tmp = new FSMState;
  1916. for (i=0; i<17; i++) {
  1917. tmp->drop_[i] = NULL;
  1918. tmp->transition_[i] = -1;
  1919. }
  1920. tmp->batch_size_ = 5;
  1921. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  1922. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  1924. tmp = new FSMState;
  1925. for (i=0; i<17; i++) {
  1926. tmp->drop_[i] = NULL;
  1927. tmp->transition_[i] = -1;
  1928. }
  1929. tmp->batch_size_ = 6;
  1930. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  1931. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  1933. tmp = new FSMState;
  1934. for (i=0; i<17; i++) {
  1935. tmp->drop_[i] = NULL;
  1936. tmp->transition_[i] = -1;
  1937. }
  1938. tmp->batch_size_ = 2;
  1939. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1940. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  1941. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  1942. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = RTT;
  1944. tmp = new FSMState;
  1945. for (i=0; i<17; i++) {
  1946. tmp->drop_[i] = NULL;
  1947. tmp->transition_[i] = -1;
  1948. }
  1949. tmp->batch_size_ = 3;
  1950. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1951. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  1952. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  1953. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = RTT;
  1955. //(wnd, ssh) == (8, 20)
  1956. tmp = new FSMState;
  1957. for (i=0; i<17; i++) {
  1958. tmp->drop_[i] = NULL;
  1959. tmp->transition_[i] = -1;
  1960. }
  1961. tmp->batch_size_ = 8;
  1962. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  1963. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  1965. tmp = new FSMState;
  1966. for (i=0; i<17; i++) {
  1967. tmp->drop_[i] = NULL;
  1968. tmp->transition_[i] = -1;
  1969. }
  1970. tmp->batch_size_ = 3;
  1971. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2] = tmp;
  1972. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[2] = RTT;
  1974. tmp = new FSMState;
  1975. for (i=0; i<17; i++) {
  1976. tmp->drop_[i] = NULL;
  1977. tmp->transition_[i] = -1;
  1978. }
  1979. tmp->batch_size_ = 4;
  1980. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3] = tmp;
  1981. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[3] = RTT;
  1983. tmp = new FSMState;
  1984. for (i=0; i<17; i++) {
  1985. tmp->drop_[i] = NULL;
  1986. tmp->transition_[i] = -1;
  1987. }
  1988. tmp->batch_size_ = 4;
  1989. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  1990. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->transition_[0] = RTT;
  1991. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  1992. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  1995. tmp = new FSMState;
  1996. for (i=0; i<17; i++) {
  1997. tmp->drop_[i] = NULL;
  1998. tmp->transition_[i] = -1;
  1999. }
  2000. tmp->batch_size_ = 1;
  2001. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4] = tmp;
  2002. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[4] = RTT;
  2004. tmp = new FSMState;
  2005. for (i=0; i<17; i++) {
  2006. tmp->drop_[i] = NULL;
  2007. tmp->transition_[i] = -1;
  2008. }
  2009. tmp->batch_size_ = 2;
  2010. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5] = tmp;
  2011. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[5] = RTT;
  2013. tmp = new FSMState;
  2014. for (i=0; i<17; i++) {
  2015. tmp->drop_[i] = NULL;
  2016. tmp->transition_[i] = -1;
  2017. }
  2018. tmp->batch_size_ = 8;
  2019. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6] = tmp;
  2020. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[6] = RTT;
  2022. tmp = new FSMState;
  2023. for (i=0; i<17; i++) {
  2024. tmp->drop_[i] = NULL;
  2025. tmp->transition_[i] = -1;
  2026. }
  2027. tmp->batch_size_ = 9;
  2028. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7] = tmp;
  2029. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[7] = RTT;
  2031. tmp = new FSMState;
  2032. for (i=0; i<17; i++) {
  2033. tmp->drop_[i] = NULL;
  2034. tmp->transition_[i] = -1;
  2035. }
  2036. tmp->batch_size_ = 11;
  2037. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8] = tmp;
  2038. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[8] = RTT;
  2040. //(wnd, ssh) == (12, 20)
  2041. tmp = new FSMState;
  2042. for (i=0; i<17; i++) {
  2043. tmp->drop_[i] = NULL;
  2044. tmp->transition_[i] = -1;
  2045. }
  2046. tmp->batch_size_ = 12;
  2047. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2048. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2050. tmp = new FSMState;
  2051. for (i=0; i<17; i++) {
  2052. tmp->drop_[i] = NULL;
  2053. tmp->transition_[i] = -1;
  2054. }
  2055. tmp->batch_size_ = 1;
  2056. for (i=1; i<13; i++) start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[i] = tmp;
  2057. for (i=1; i<10; i++)
  2058. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = RTT;
  2059. for (i=10; i<13; i++)
  2060. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[i] = TIMEOUT;
  2063. //(wnd, ssh) == (1, 2), timeout
  2064. tmp = new FSMState;
  2065. for (i=0; i<17; i++) {
  2066. tmp->drop_[i] = NULL;
  2067. tmp->transition_[i] = -1;
  2068. }
  2069. tmp->batch_size_ = 1;
  2070. start_state_->drop_[1] = tmp;
  2071. start_state_->transition_[1] = TIMEOUT;
  2072. start_state_->drop_[0]->drop_[1] = tmp;
  2073. start_state_->drop_[0]->transition_[1] = TIMEOUT;
  2074. start_state_->drop_[0]->drop_[2]->drop_[0] = tmp;
  2075. start_state_->drop_[0]->drop_[2]->transition_[0] = TIMEOUT;
  2077. start_state_->drop_[0]->drop_[0]->drop_[1] = tmp;
  2078. start_state_->drop_[0]->drop_[0]->transition_[1] = TIMEOUT;
  2079. start_state_->drop_[0]->drop_[0]->drop_[2]->drop_[0] = tmp;
  2080. start_state_->drop_[0]->drop_[0]->drop_[2]->transition_[0] = TIMEOUT;
  2082. //(wnd, ssh) == (2, 2)
  2083. tmp = new FSMState;
  2084. for (i=0; i<17; i++) {
  2085. tmp->drop_[i] = NULL;
  2086. tmp->transition_[i] = -1;
  2087. }
  2088. tmp->batch_size_ = 2;
  2089. start_state_->drop_[1]->drop_[0] = tmp;
  2090. start_state_->drop_[1]->transition_[0] = RTT;
  2092. //(wnd, ssh) == (2.5, 2)
  2093. tmp = new FSMState;
  2094. for (i=0; i<17; i++) {
  2095. tmp->drop_[i] = NULL;
  2096. tmp->transition_[i] = -1;
  2097. }
  2098. tmp->batch_size_ = 2;
  2099. start_state_->drop_[1]->drop_[0]->drop_[0] = tmp;
  2100. start_state_->drop_[1]->drop_[0]->transition_[0] = RTT;
  2102. //(wnd, ssh) == (2.9, 2)
  2103. tmp = new FSMState;
  2104. for (i=0; i<17; i++) {
  2105. tmp->drop_[i] = NULL;
  2106. tmp->transition_[i] = -1;
  2107. }
  2108. tmp->batch_size_ = 2;
  2109. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2110. start_state_->drop_[1]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2112. //(wnd, ssh) == (3, 2)
  2113. tmp = new FSMState;
  2114. for (i=0; i<17; i++) {
  2115. tmp->drop_[i] = NULL;
  2116. tmp->transition_[i] = -1;
  2117. }
  2118. tmp->batch_size_ = 3;
  2119. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2120. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2122. //(wnd, ssh) == (3.3, 2)
  2123. tmp = new FSMState;
  2124. for (i=0; i<17; i++) {
  2125. tmp->drop_[i] = NULL;
  2126. tmp->transition_[i] = -1;
  2127. }
  2128. tmp->batch_size_ = 3;
  2129. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2130. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2132. //(wnd, ssh) == (4, 2)
  2133. tmp = new FSMState;
  2134. for (i=0; i<17; i++) {
  2135. tmp->drop_[i] = NULL;
  2136. tmp->transition_[i] = -1;
  2137. }
  2138. tmp->batch_size_ = 4;
  2139. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2140. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2142. //(wnd, ssh) == (4.7, 2)
  2143. tmp = new FSMState;
  2144. for (i=0; i<17; i++) {
  2145. tmp->drop_[i] = NULL;
  2146. tmp->transition_[i] = -1;
  2147. }
  2148. tmp->batch_size_ = 4;
  2149. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2150. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2152. //(wnd, ssh) == (5, 2)
  2153. tmp = new FSMState;
  2154. for (i=0; i<17; i++) {
  2155. tmp->drop_[i] = NULL;
  2156. tmp->transition_[i] = -1;
  2157. }
  2158. tmp->batch_size_ = 5;
  2159. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2160. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2162. //(wnd, ssh) == (6, 2)
  2163. tmp = new FSMState;
  2164. for (i=0; i<17; i++) {
  2165. tmp->drop_[i] = NULL;
  2166. tmp->transition_[i] = -1;
  2167. }
  2168. tmp->batch_size_ = 6;
  2169. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2170. start_state_->drop_[1]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2173. //(wnd, ssh) == (2, 2), rtt
  2174. tmp = new FSMState;
  2175. for (i=0; i<17; i++) {
  2176. tmp->drop_[i] = NULL;
  2177. tmp->transition_[i] = -1;
  2178. }
  2179. tmp->batch_size_ = 2;
  2180. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0] = tmp;
  2181. start_state_->drop_[0]->drop_[0]->drop_[3]->transition_[0] = RTT;
  2182. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  2183. start_state_->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  2185. //(wnd, ssh) == (2.5, 2)
  2186. tmp = new FSMState;
  2187. for (i=0; i<17; i++) {
  2188. tmp->drop_[i] = NULL;
  2189. tmp->transition_[i] = -1;
  2190. }
  2191. tmp->batch_size_ = 2;
  2192. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  2193. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  2195. //(wnd, ssh) == (3, 2)
  2196. tmp = new FSMState;
  2197. for (i=0; i<17; i++) {
  2198. tmp->drop_[i] = NULL;
  2199. tmp->transition_[i] = -1;
  2200. }
  2201. tmp->batch_size_ = 3;
  2202. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2203. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2205. //(wnd, ssh) == (4, 2)
  2206. tmp = new FSMState;
  2207. for (i=0; i<17; i++) {
  2208. tmp->drop_[i] = NULL;
  2209. tmp->transition_[i] = -1;
  2210. }
  2211. tmp->batch_size_ = 4;
  2212. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2213. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2215. //(wnd, ssh) == (4.3, 2)
  2216. tmp = new FSMState;
  2217. for (i=0; i<17; i++) {
  2218. tmp->drop_[i] = NULL;
  2219. tmp->transition_[i] = -1;
  2220. }
  2221. tmp->batch_size_ = 4;
  2222. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2223. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2225. //(wnd, ssh) == (4.7, 2)
  2226. tmp = new FSMState;
  2227. for (i=0; i<17; i++) {
  2228. tmp->drop_[i] = NULL;
  2229. tmp->transition_[i] = -1;
  2230. }
  2231. tmp->batch_size_ = 4;
  2232. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2233. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2235. //(wnd, ssh) == (5, 2)
  2236. tmp = new FSMState;
  2237. for (i=0; i<17; i++) {
  2238. tmp->drop_[i] = NULL;
  2239. tmp->transition_[i] = -1;
  2240. }
  2241. tmp->batch_size_ = 5;
  2242. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2243. start_state_->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2246. //(wnd, ssh) == (3.3, 3)
  2247. tmp = new FSMState;
  2248. for (i=0; i<17; i++) {
  2249. tmp->drop_[i] = NULL;
  2250. tmp->transition_[i] = -1;
  2251. }
  2252. tmp->batch_size_ = 3;
  2253. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0] = tmp;
  2254. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->transition_[0] = RTT;
  2255. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->drop_[0] = tmp;
  2256. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[3]->drop_[0]->transition_[0] = RTT;
  2258. tmp = new FSMState;
  2259. for (i=0; i<17; i++) {
  2260. tmp->drop_[i] = NULL;
  2261. tmp->transition_[i] = -1;
  2262. }
  2263. tmp->batch_size_ = 4;
  2264. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2265. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2267. tmp = new FSMState;
  2268. for (i=0; i<17; i++) {
  2269. tmp->drop_[i] = NULL;
  2270. tmp->transition_[i] = -1;
  2271. }
  2272. tmp->batch_size_ = 4;
  2273. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2274. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2276. tmp = new FSMState;
  2277. for (i=0; i<17; i++) {
  2278. tmp->drop_[i] = NULL;
  2279. tmp->transition_[i] = -1;
  2280. }
  2281. tmp->batch_size_ = 5;
  2282. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2283. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2285. tmp = new FSMState;
  2286. for (i=0; i<17; i++) {
  2287. tmp->drop_[i] = NULL;
  2288. tmp->transition_[i] = -1;
  2289. }
  2290. tmp->batch_size_ = 5;
  2291. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2292. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2294. //(wnd, ssh) == (4, 4)
  2295. tmp = new FSMState;
  2296. for (i=0; i<17; i++) {
  2297. tmp->drop_[i] = NULL;
  2298. tmp->transition_[i] = -1;
  2299. }
  2300. tmp->batch_size_ = 4;
  2301. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1] = tmp;
  2302. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->transition_[1] = RTT;
  2304. tmp = new FSMState;
  2305. for (i=0; i<17; i++) {
  2306. tmp->drop_[i] = NULL;
  2307. tmp->transition_[i] = -1;
  2308. }
  2309. tmp->batch_size_ = 4;
  2310. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0] = tmp;
  2311. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->transition_[0] = RTT;
  2312. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->drop_[0] = tmp;
  2313. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[2]->drop_[0]->transition_[0] = RTT;
  2316. tmp = new FSMState;
  2317. for (i=0; i<17; i++) {
  2318. tmp->drop_[i] = NULL;
  2319. tmp->transition_[i] = -1;
  2320. }
  2321. tmp->batch_size_ = 5;
  2322. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->drop_[0] = tmp;
  2323. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[1]->drop_[0]->transition_[0] = RTT;
  2326. //(wnd, ssh) == (5, 5)
  2327. tmp = new FSMState;
  2328. for (i=0; i<17; i++) {
  2329. tmp->drop_[i] = NULL;
  2330. tmp->transition_[i] = -1;
  2331. }
  2332. tmp->batch_size_ = 5;
  2333. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0] = tmp;
  2334. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->transition_[0] = 0;
  2335. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5]->drop_[0] = tmp;
  2336. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[5]->transition_[0] = 0;
  2337. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6]->drop_[0] = tmp;
  2338. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[6]->transition_[0] = RTT;
  2339. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7]->drop_[0] = tmp;
  2340. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[7]->transition_[0] = RTT;
  2343. tmp = new FSMState;
  2344. for (i=0; i<17; i++) {
  2345. tmp->drop_[i] = NULL;
  2346. tmp->transition_[i] = -1;
  2347. }
  2348. tmp->batch_size_ = 5;
  2349. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0] = tmp;
  2350. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->transition_[0] = RTT;
  2352. tmp = new FSMState;
  2353. for (i=0; i<17; i++) {
  2354. tmp->drop_[i] = NULL;
  2355. tmp->transition_[i] = -1;
  2356. }
  2357. tmp->batch_size_ = 5;
  2358. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->drop_[0] = tmp;
  2359. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[4]->drop_[0]->drop_[0]->transition_[0] = RTT;
  2361. //(wnd, ssh) == (6, 6)
  2362. tmp = new FSMState;
  2363. for (i=0; i<17; i++) {
  2364. tmp->drop_[i] = NULL;
  2365. tmp->transition_[i] = -1;
  2366. }
  2367. tmp->batch_size_ = 6;
  2368. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->drop_[0] = tmp;
  2369. start_state_->drop_[0]->drop_[0]->drop_[0]->drop_[0]->drop_[8]->transition_[0] = RTT;
  2371. //print_FSM(start_state_);
  2372. //printf("n");
  2373. }