00001 /* 00002 * AdolfoFilter.cc : part of the Mace toolkit for building distributed systems 00003 * 00004 * Copyright (c) 2007, Charles Killian, Dejan Kostic, Ryan Braud, James W. Anderson, John Fisher-Ogden, Calvin Hubble, Duy Nguyen, Justin Burke, David Oppenheimer, Amin Vahdat, Adolfo Rodriguez, Sooraj Bhat 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions are met: 00009 * 00010 * * Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * * Redistributions in binary form must reproduce the above copyright 00013 * notice, this list of conditions and the following disclaimer in 00014 * the documentation and/or other materials provided with the 00015 * distribution. 00016 * * Neither the names of Duke University nor The University of 00017 * California, San Diego, nor the names of the authors or contributors 00018 * may be used to endorse or promote products derived from 00019 * this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00022 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00023 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00024 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE 00025 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00026 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 00027 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00028 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00029 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE 00030 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00031 * 00032 * ----END-OF-LEGAL-STUFF---- */ 00033 #include "TimeUtil.h" 00034 #include "AdolfoFilter.h" 00035 // #include <stdio.h> 00036 // #include "Scheduler.h" 00037 // #include "mace.h" 00038 #include "params.h" 00039 00040 using std::list; 00041 00042 //const int adolfo_filter::HISTORY_VALUE = 4000; 00043 adolfo_filter::adolfo_filter( ) : GenericFilter(), data_packet_size(params::get("data_packet_size", 1500)) 00044 { } 00045 00046 adolfo_filter::~adolfo_filter() 00047 { 00048 } 00049 00050 // ---------------------------------------------- 00051 // getValue 00052 // ---------------------------------------------- 00053 00054 double adolfo_filter::getValue () 00055 { 00056 check(); 00057 return value; 00058 } 00059 00060 00061 // ---------------------------------------------- 00062 // clear 00063 // ---------------------------------------------- 00064 00065 void adolfo_filter::clear () 00066 { 00067 history.clear (); 00068 value = 0.0; 00069 } 00070 00071 00072 // ---------------------------------------------- 00073 // update 00074 // ---------------------------------------------- 00075 00076 void adolfo_filter::update () 00077 { 00078 history.push_back (TimeUtil::timeu()); 00079 // check(); 00080 } 00081 00082 00083 00084 // ---------------------------------------------- 00085 // check 00086 // ---------------------------------------------- 00087 00088 void adolfo_filter::check () 00089 { 00090 uint64_t end = TimeUtil::timeu() - BANDWIDTH_WINDOW; 00091 00092 while (history.size() > 0 && (history.front())< end) { 00093 history.pop_front(); 00094 } 00095 00096 if (history.size() == 0 ) { 00097 value = 0.0; 00098 } 00099 else { 00100 value = (double)(((data_packet_size*history.size())>>(BANDWIDTH_WINDOW_SBITS))<<3); //-3 to multiply by 8 for the number of bits per byte 00101 } 00102 } 00103 00104