churneventgenerator.h

P2P模拟器

/*
 * Copyright (c) 2003-2005 Thomer M. Gil ([e-mail])
 *                    Massachusetts Institute of Technology
 * 
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 *
 * HOWTO:

In your events file, include the line:

generator ChurnEventGenerator [arg1=val1 [arg2=val2 [...]]]

Where args can currently be the following:
name            default         description
---------------------------------------------------------------------------
wkn             1               the ip of the wellknown node (bootstrapper)
proto                           the name of the protocol (i.e. "Chord")
lifemean        100000          average time (ms) a node is alive at a time
deathmean       lifemean        average time (ms) a node is dead at a time
lookupmean      10000           average time (ms) between lookups per node
exittime        200000          length of the experiment (in ms)
ipkeys          false           generate lookups where keys are node IPs
datakeys        false           generate lookups where keys are data items      
Join, crash, and lookup events will be exponentially distributed about the
means given above.
 */

#ifndef __CHURN_EVENT_GENERATOR_H
#define __CHURN_EVENT_GENERATOR_H

#include "p2psim/eventgenerator.h"
#include "p2psim/p2psim.h"
#include "p2psim/args.h"
#include <unistd.h>
using namespace std;

class ChurnEventGenerator : public EventGenerator {

  friend class ChurnFileEventGenerator;

public:
  ChurnEventGenerator(Args *);
  virtual void kick(Observed *, ObserverInfo*);
  virtual void run();

private:
  IPAddress _wkn;
  string _wkn_string;
  unsigned _lifemean;
  unsigned _deathmean;
  unsigned _lookupmean;
  string _exittime_string;
  Time _exittime;
  double _alpha;
  unsigned _beta;
  unsigned _pareto;
  unsigned _uniform;
  bool _ipkeys;
  bool _datakeys;
  vector<IPAddress> *_ips;

  Time next_exponential(u_int mean);
  Time next_uniform(u_int mean);
  Time next_pareto(double a, u_int b);
  string get_lookup_key();

};

#endif // __CHURN_EVENT_GENERATOR_H