Statistics.cc

// Copyright 2008 Michael Marsh, University of Maryland.
//
// This file is part of pydtn.
//
// pydtn is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// pydtn is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with pydtn.  If not, see <http://www.gnu.org/licenses/>.
//
// The views and conclusions contained in the software and documentation
// are those of the authors and should not be interpreted as representing
// official policies, either expressed or implied, of the University
// of Maryland.
//
// pydtn extends and embeds the Python interpreter, which is
// Copyright 2001-2006 Python Software Foundation, All Rights Reserved,
// and is released under the PSF License Agreement.
//
// RANLUX random number generation uses the Boost library,
// Copyright 1994-2006 by various authors (details in individual files),
// which is released under the Boost Software License, Version 1.0.

#include "Statistics.h"
#include "dtn/Bundle.h"
#include "dtn/Node.h"
#include <math.h>
#include <netinet/in.h>

double
Stat::mean() const
{
   return ( 1.0 * m_s ) / m_n;
}

double
Stat::var() const
{
   double m = mean();
   double v = ( 1.0 * m_w ) / m_n;
   return v - m*m;
}

double
Stat::sigma() const
{
   return sqrt(var());
}

void
Stat::add( unsigned long val )
{
   ++m_n;
   m_s += val;
   m_w += val*val;
}

void
Stat::reset()
{
   m_n = 0;
   m_s = 0;
   m_w = 0;
}

UniqueStat::UniqueStat()
{
}

UniqueStat::~UniqueStat()
{
}

void
UniqueStat::add( const DTN::Bundle& b )
{
   unsigned long int length = b.size();
   if ( m_seen[b.source()].add( ntohl(b.seqNum()) ) )
   {
      m_unique.add(length);
   }
   else
   {
      m_duplicate.add(length);
   }
}

void
UniqueStat::reset()
{
   m_unique.reset();
   m_duplicate.reset();
}

void
StatCollection::addOriginated( const DTN::Bundle& b )
{
   m_originated.add(b);
}

void
StatCollection::addSent( unsigned long int val )
{
   m_sent.add(val);
}

void
StatCollection::addReceived( unsigned long int val )
{
   m_received.add(val);
}

void
StatCollection::addDelivered( const DTN::Bundle& b )
{
   m_delivered.add(b);
   m_deliverHops.add(b.hopCount());
}

void
StatCollection::addDropped( const DTN::Bundle& b )
{
   m_dropped.add(b.size());
   m_dropHops.add(b.hopCount());
}

void
StatCollection::reset()
{
   m_originated.reset();
   m_sent.reset();
   m_received.reset();
   m_delivered.reset();
   m_dropped.reset();
   m_exhausted = false;
}

Statistics::Statistics( DTN::Node* owner ) :
   DTN::Consumer( owner )
{
}

Statistics::~Statistics()
{
}

void
Statistics::operator()( const DTN::Bundle& b )
{
   if ( DTN::Bundle::kACK & b.type() )
   {
      return;
   }

   if ( DTN::Bundle::kData & b.type() )
   {
      m_since.addDelivered( b );
      m_total.addDelivered( b );
   }
}

void
Statistics::drop( const DTN::Bundle& b, const DTN::DropCause& c )
{
   m_since.addDropped( b );
   m_total.addDropped( b );
}

void
Statistics::custody( const DTN::Bundle& b )
{
}

void
Statistics::persistentStore( const DTN::Bundle& b )
{
   if ( 0 == m_owner ) return;

   unsigned long int cap  = m_owner->persistentCap();
   unsigned long int used = m_owner->usedPersistentCap();
   if ( used >= cap )
   {
      m_since.setExhausted();
      m_total.setExhausted();
   }
}

void
Statistics::testOrigin( const DTN::Bundle& b )
{
   bool origin = false;
   if ( !( DTN::Bundle::kACK & b.type()) )
   {
      origin = b.send() == b.source();
   }

   if ( origin )
   {
      m_since.addOriginated( b );
      m_total.addOriginated( b );
   }
}

void
Statistics::persistentRemove( const DTN::Bundle& b, bool cleanup )
{
}

void
Statistics::send( const DTN::Bundle& b )
{
   unsigned long int length = b.size();
   m_since.addSent( length );
   m_total.addSent( length );

   testOrigin(b);
}

void
Statistics::recv( const DTN::Bundle& b )
{
   unsigned long int length = b.size();
   m_since.addReceived( length );
   m_total.addReceived( length );
}

void
Statistics::exhausted( const DTN::Bundle& b )
{
   m_since.setExhausted();
   m_total.setExhausted();
}

unsigned long int
Statistics::used() const
{
   if ( 0 == m_owner ) return 0;
   return m_owner->usedPersistentCap();
}

unsigned long int
Statistics::capacity() const
{
   if ( 0 == m_owner ) return 0;
   return m_owner->persistentCap();
}

---