<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>DTN Reference Implementation: LinkScheduleEstimator.cc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.8 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>LinkScheduleEstimator.cc</h1><a href="LinkScheduleEstimator_8cc.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright 2005-2006 Intel Corporation</span>
<a name="l00003"></a>00003 <span class="comment"> * </span>
<a name="l00004"></a>00004 <span class="comment"> * Licensed under the Apache License, Version 2.0 (the "License");</span>
<a name="l00005"></a>00005 <span class="comment"> * you may not use this file except in compliance with the License.</span>
<a name="l00006"></a>00006 <span class="comment"> * You may obtain a copy of the License at</span>
<a name="l00007"></a>00007 <span class="comment"> * </span>
<a name="l00008"></a>00008 <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span>
<a name="l00009"></a>00009 <span class="comment"> * </span>
<a name="l00010"></a>00010 <span class="comment"> * Unless required by applicable law or agreed to in writing, software</span>
<a name="l00011"></a>00011 <span class="comment"> * distributed under the License is distributed on an "AS IS" BASIS,</span>
<a name="l00012"></a>00012 <span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span>
<a name="l00013"></a>00013 <span class="comment"> * See the License for the specific language governing permissions and</span>
<a name="l00014"></a>00014 <span class="comment"> * limitations under the License.</span>
<a name="l00015"></a>00015 <span class="comment"> */</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#ifdef HAVE_CONFIG_H</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor"># include <<a class="code" href="dtn-config_8h.html">dtn-config.h</a>></span>
<a name="l00019"></a>00019 <span class="preprocessor">#endif</span>
<a name="l00020"></a>00020 <span class="preprocessor"></span>
<a name="l00021"></a>00021 <span class="preprocessor">#include<stdio.h></span>
<a name="l00022"></a>00022 <span class="preprocessor">#include<string.h></span>
<a name="l00023"></a>00023 <span class="preprocessor">#include<stdlib.h></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include<assert.h></span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="preprocessor">#include "<a class="code" href="LinkScheduleEstimator_8h.html">LinkScheduleEstimator.h</a>"</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>dtn {
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="comment">// dist holds a temporary distance array for the dynamic programming algorithm</span>
<a name="l00031"></a><a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">00031</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> **<a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>;
<a name="l00032"></a>00032
<a name="l00033"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#cfee9ac8dfeba476eaecbef83af396c6">00033</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#cfee9ac8dfeba476eaecbef83af396c6">LinkScheduleEstimator::LinkScheduleEstimator</a>()
<a name="l00034"></a>00034 : <a class="code" href="classoasys_1_1Logger.html">Logger</a>(<span class="stringliteral">"LinkScheduleEstimator"</span>, <span class="stringliteral">"/dtn/route/linkstate/estimator"</span>)
<a name="l00035"></a>00035 {}
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="comment">/*</span>
<a name="l00038"></a>00038 <span class="comment"> * compute the distance between two log entries.</span>
<a name="l00039"></a>00039 <span class="comment"> * a_offset, b_offset is used for comparing subsequences</span>
<a name="l00040"></a>00040 <span class="comment"> * at different places in the log.</span>
<a name="l00041"></a>00041 <span class="comment"> *</span>
<a name="l00042"></a>00042 <span class="comment"> * Distances larger than the window size are given the cost of the</span>
<a name="l00043"></a>00043 <span class="comment"> * minimum duration smaller distances just use the actual distance.</span>
<a name="l00044"></a>00044 <span class="comment"> */</span>
<a name="l00045"></a>00045 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00046"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#9bdc8a6a5b4cd5b4cd06f6d7555cce95">00046</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#9bdc8a6a5b4cd5b4cd06f6d7555cce95">LinkScheduleEstimator::entry_dist</a>(Log &a, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a_index, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a_offset,
<a name="l00047"></a>00047 Log &b, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b_index, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b_offset,
<a name="l00048"></a>00048 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> warping_window)
<a name="l00049"></a>00049 {
<a name="l00050"></a>00050 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> diff=<a class="code" href="LinkScheduleEstimator_8h.html#e64a9d9db36a4799b748b089556ce693">absdiff</a>(a[a_index].start-a_offset,b[b_index].start-b_offset);
<a name="l00051"></a>00051 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> minduration=oasys::min(a[a_index].duration, b[b_index].duration);
<a name="l00052"></a>00052 <span class="keywordflow">if</span>(diff > warping_window)
<a name="l00053"></a>00053 <span class="keywordflow">return</span> minduration;
<a name="l00054"></a>00054 <span class="keywordflow">else</span> <span class="keywordflow">return</span> oasys::min(diff, minduration);
<a name="l00055"></a>00055 }
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="comment">/*</span>
<a name="l00058"></a>00058 <span class="comment"> * Recursive internal function of log_dist.</span>
<a name="l00059"></a>00059 <span class="comment"> */</span>
<a name="l00060"></a>00060 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00061"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">00061</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">LinkScheduleEstimator::log_dist_r</a>(Log &a, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a_index, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a_offset,
<a name="l00062"></a>00062 Log &b, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b_index, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b_offset,
<a name="l00063"></a>00063 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> warping_window)
<a name="l00064"></a>00064 {
<a name="l00065"></a>00065 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mindist;
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="comment">// can't compute values outside the boundaries.</span>
<a name="l00068"></a>00068 <span class="comment">//XXX/jakob - why did we get here anyway?</span>
<a name="l00069"></a>00069 <span class="comment">// XXX/demmer this is a bogus compariosn</span>
<a name="l00070"></a>00070 <span class="comment">//if(a_index<0 || b_index<0) return MAX_DIST;</span>
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="comment">// if we've already computed the dist, return it</span>
<a name="l00073"></a>00073 <span class="keywordflow">if</span>(<a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[a_index][b_index]<<a class="code" href="LinkScheduleEstimator_8h.html#e4f6058c45a018de2c45bc43f0c405ae">MAX_DIST</a>)
<a name="l00074"></a>00074 <span class="keywordflow">return</span> <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[a_index][b_index];
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="comment">// no use going outside boundaries</span>
<a name="l00077"></a>00077 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(a_index==0)
<a name="l00078"></a>00078 mindist=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a_index,a_offset,
<a name="l00079"></a>00079 b,b_index-1,b_offset,
<a name="l00080"></a>00080 warping_window);
<a name="l00081"></a>00081 <span class="comment">// no use going outside boundaries</span>
<a name="l00082"></a>00082 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(b_index==0)
<a name="l00083"></a>00083 mindist=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a_index-1,a_offset,
<a name="l00084"></a>00084 b,b_index,b_offset,
<a name="l00085"></a>00085 warping_window);
<a name="l00086"></a>00086 <span class="comment">// find the minimum cost neighboring cell</span>
<a name="l00087"></a>00087 <span class="keywordflow">else</span> {
<a name="l00088"></a>00088 mindist = oasys::min(oasys::min(<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a_index-1,a_offset,
<a name="l00089"></a>00089 b,b_index-1,b_offset,warping_window),
<a name="l00090"></a>00090 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a_index-1,a_offset,
<a name="l00091"></a>00091 b,b_index,b_offset,warping_window)),
<a name="l00092"></a>00092 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a_index,a_offset,
<a name="l00093"></a>00093 b,b_index-1,b_offset,warping_window));
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> entrydist=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#9bdc8a6a5b4cd5b4cd06f6d7555cce95">entry_dist</a>(a,a_index,a_offset,
<a name="l00097"></a>00097 b,b_index,b_offset,
<a name="l00098"></a>00098 warping_window);
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[a_index][b_index]=entrydist+mindist;
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keywordflow">return</span> <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[a_index][b_index];
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="comment">/*</span>
<a name="l00106"></a>00106 <span class="comment"> * determines the distance between logs a and b using dynamic programming.</span>
<a name="l00107"></a>00107 <span class="comment"> *</span>
<a name="l00108"></a>00108 <span class="comment"> */</span>
<a name="l00109"></a>00109 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00110"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#4f92af378017bf063a3b5144dd3680ee">00110</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#4f92af378017bf063a3b5144dd3680ee">LinkScheduleEstimator::log_dist</a>(Log &a, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> a_offset,
<a name="l00111"></a>00111 Log &b, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> b_offset,
<a name="l00112"></a>00112 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> warping_window, <span class="keywordtype">int</span> print_table)
<a name="l00113"></a>00113 {
<a name="l00114"></a>00114 <span class="comment">/*</span>
<a name="l00115"></a>00115 <span class="comment"> * Initialize a cost matrix for the DP algorithm</span>
<a name="l00116"></a>00116 <span class="comment"> */</span>
<a name="l00117"></a>00117 <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>**)malloc(a.size()*<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> int));
<a name="l00118"></a>00118 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<a.size();i++)
<a name="l00119"></a>00119 {
<a name="l00120"></a>00120 <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[i]=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>*)malloc(b.size()*<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> int));
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0;j<b.size();j++)
<a name="l00123"></a>00123 <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[i][j]=<a class="code" href="LinkScheduleEstimator_8h.html#e4f6058c45a018de2c45bc43f0c405ae">MAX_DIST</a>;
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[0][0]=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#9bdc8a6a5b4cd5b4cd06f6d7555cce95">entry_dist</a>(a,0,a_offset,b,0,b_offset,warping_window);
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="comment">/*</span>
<a name="l00129"></a>00129 <span class="comment"> * Call inner function for progressively larger parts of the array.</span>
<a name="l00130"></a>00130 <span class="comment"> * Goes from 0,0 to n,n along the diagonal.</span>
<a name="l00131"></a>00131 <span class="comment"> */</span>
<a name="l00132"></a>00132 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> d;
<a name="l00133"></a>00133 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<oasys::min(a.size(),b.size());i++)
<a name="l00134"></a>00134 d=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,i,a_offset,b,i,b_offset,warping_window);
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="comment">// compute the actual distance with a final call</span>
<a name="l00137"></a>00137 d=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#fb24f952b197b3d1bd6f7ba5ba33da35">log_dist_r</a>(a,a.size()-1,a_offset,
<a name="l00138"></a>00138 b,b.size()-1,b_offset,
<a name="l00139"></a>00139 warping_window);
<a name="l00140"></a>00140
<a name="l00141"></a>00141 <span class="keywordflow">if</span>(print_table)
<a name="l00142"></a>00142 {
<a name="l00143"></a>00143 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<a.size();i++)
<a name="l00144"></a>00144 {
<a name="l00145"></a>00145 log_debug(<span class="stringliteral">"%d\t| "</span>,a[a.size()-i-1].start-a_offset);
<a name="l00146"></a>00146 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j=0;j<b.size();j++)
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 log_debug(<span class="stringliteral">"%d\t"</span>,<a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>[a.size()-i-1][j]);
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 log_debug(<span class="stringliteral">"\n"</span>);
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 log_debug(<span class="stringliteral">"---------------------------------------------------\n\t "</span>);
<a name="l00153"></a>00153 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<b.size();i++)
<a name="l00154"></a>00154 log_debug(<span class="stringliteral">"%d\t| "</span>,b[i].start-b_offset);
<a name="l00155"></a>00155 log_debug(<span class="stringliteral">"\n\t "</span>);
<a name="l00156"></a>00156 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<b.size();i++)
<a name="l00157"></a>00157 log_debug(<span class="stringliteral">"%d\t| "</span>,b[i].duration);
<a name="l00158"></a>00158 log_debug(<span class="stringliteral">"\n\n"</span>);
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00161"></a>00161 free(<a class="code" href="namespacedtn.html#aa3afad96f02027576db568d46c348b3">dist</a>);
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keywordflow">return</span> d;
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165
<a name="l00166"></a>00166 <span class="comment">/*</span>
<a name="l00167"></a>00167 <span class="comment"> * Computes the distance between l and l shifted phase time</span>
<a name="l00168"></a>00168 <span class="comment"> * steps. This is actually the inverse autocorrelation function...</span>
<a name="l00169"></a>00169 <span class="comment"> */</span>
<a name="l00170"></a>00170
<a name="l00171"></a>00171 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00172"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#a61e879bc1ff9495bca8c0ae83d9c3a6">00172</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#a61e879bc1ff9495bca8c0ae83d9c3a6">LinkScheduleEstimator::autocorrelation</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> phase, <span class="keywordtype">int</span> print_table)
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a> clone(log.size());
<a name="l00175"></a>00175 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=phase;i<log.size();i++) {
<a name="l00176"></a>00176 clone[i-phase].start=log[i].start-log[phase].start;
<a name="l00177"></a>00177 clone[i-phase].duration=log[i].duration;
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<phase;i++) {
<a name="l00181"></a>00181 clone[i+(log.size()-phase)].start=
<a name="l00182"></a>00182 log[i].start+log[log.size()-1].start-log[phase-1].start;
<a name="l00183"></a>00183 clone[i+(log.size()-phase)].duration=log[i].duration;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> d = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#4f92af378017bf063a3b5144dd3680ee">log_dist</a>(log, log[0].start, <span class="comment">// a_offset</span>
<a name="l00187"></a>00187 clone, clone[0].start,
<a name="l00188"></a>00188 (<span class="keywordtype">int</span>)((log[log.size()].start+
<a name="l00189"></a>00189 log[log.size()].duration)*<a class="code" href="LinkScheduleEstimator_8h.html#cc9f39477dafecc1ae1915ed6e80c949">WARPING_WINDOW</a>),
<a name="l00190"></a>00190 print_table);
<a name="l00191"></a>00191
<a name="l00192"></a>00192
<a name="l00193"></a>00193 <span class="keywordflow">return</span> d;
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordtype">void</span>
<a name="l00197"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#bd21da2cc439402e70d7fc0cf2a2c6ca">00197</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#bd21da2cc439402e70d7fc0cf2a2c6ca">LinkScheduleEstimator::print_log</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">int</span> relative_dates)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> offset=0;
<a name="l00200"></a>00200 <span class="keywordflow">if</span>(relative_dates)
<a name="l00201"></a>00201 offset=log[0].start;
<a name="l00202"></a>00202
<a name="l00203"></a>00203 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<log.size();i++) {
<a name="l00204"></a>00204 log_debug(<span class="stringliteral">"(%d, %d)"</span>,log[i].start-offset,log[i].duration);
<a name="l00205"></a>00205 <span class="keywordflow">if</span>(i<log.size()-1)
<a name="l00206"></a>00206 log_debug(<span class="stringliteral">", "</span>);
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208 log_debug(<span class="stringliteral">"\n"</span>);
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210
<a name="l00211"></a>00211
<a name="l00212"></a>00212 <span class="comment">/*</span>
<a name="l00213"></a>00213 <span class="comment"> * Generates a randomized periodic log given a schedule and a jitter level.</span>
<a name="l00214"></a>00214 <span class="comment"> *</span>
<a name="l00215"></a>00215 <span class="comment"> */</span>
<a name="l00216"></a>00216
<a name="l00217"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#b8b4ab28ded6c1b5dba2d97cfbe02c51">00217</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a>* <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#b8b4ab28ded6c1b5dba2d97cfbe02c51">LinkScheduleEstimator::generate_samples</a>(Log &schedule,
<a name="l00218"></a>00218 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> log_size,
<a name="l00219"></a>00219 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start_jitter,
<a name="l00220"></a>00220 <span class="keywordtype">double</span> duration_jitter)
<a name="l00221"></a>00221 {
<a name="l00222"></a>00222 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a> *output = <span class="keyword">new</span> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>(log_size);
<a name="l00223"></a>00223 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> schedule_index = 0;
<a name="l00224"></a>00224 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start_time_offset = 0;
<a name="l00225"></a>00225 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<log_size;i++)
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 <span class="comment">/*</span>
<a name="l00228"></a>00228 <span class="comment"> * The last schedule entry is assumed to be identical to the</span>
<a name="l00229"></a>00229 <span class="comment"> * first entry</span>
<a name="l00230"></a>00230 <span class="comment"> */</span>
<a name="l00231"></a>00231
<a name="l00232"></a>00232 <span class="keywordflow">if</span>(schedule_index == schedule.size() - 1) {
<a name="l00233"></a>00233 start_time_offset = start_time_offset +
<a name="l00234"></a>00234 schedule[schedule.size()-1].start +
<a name="l00235"></a>00235 schedule[schedule.size()-1].duration;
<a name="l00236"></a>00236 schedule_index = 0;
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238
<a name="l00239"></a>00239 (*output)[i].start = (<span class="keywordtype">unsigned</span> int) oasys::max((<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)0,(start_time_offset +
<a name="l00240"></a>00240 schedule[schedule_index].start -
<a name="l00241"></a>00241 start_jitter / 2 +
<a name="l00242"></a>00242 (<span class="keywordtype">unsigned</span> int)(random() % start_jitter)));
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> duration_jitter_abs = (int)(duration_jitter*
<a name="l00245"></a>00245 schedule[schedule_index].duration);
<a name="l00246"></a>00246
<a name="l00247"></a>00247 (*output)[i].duration=schedule[schedule_index].duration -
<a name="l00248"></a>00248 duration_jitter_abs / 2 +
<a name="l00249"></a>00249 random() % duration_jitter_abs;
<a name="l00250"></a>00250 schedule_index++;
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252
<a name="l00253"></a>00253 <span class="keywordflow">return</span> output;
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="comment">/*</span>
<a name="l00258"></a>00258 <span class="comment"> * Calculate the (inverse) autocorrelation function for the log, then</span>
<a name="l00259"></a>00259 <span class="comment"> * look for the deepest valley. If there second smallest value is</span>
<a name="l00260"></a>00260 <span class="comment"> * 2*period away, we have found our period.</span>
<a name="l00261"></a>00261 <span class="comment"> *</span>
<a name="l00262"></a>00262 <span class="comment"> * This is a pretty simple heuristic, should be possible to do better.</span>
<a name="l00263"></a>00263 <span class="comment"> */</span>
<a name="l00264"></a>00264 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00265"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d265c8f04daa7f58afe62733465fc747">00265</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d265c8f04daa7f58afe62733465fc747">LinkScheduleEstimator::estimate_period</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>)
<a name="l00266"></a>00266 {
<a name="l00267"></a>00267 <span class="keywordtype">int</span>* autoc=(<span class="keywordtype">int</span>*)malloc(log.size()*<span class="keyword">sizeof</span>(int));
<a name="l00268"></a>00268 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1;i<log.size();i++) {
<a name="l00269"></a>00269 autoc[i]=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#a61e879bc1ff9495bca8c0ae83d9c3a6">autocorrelation</a>(log,i,0);
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="comment">// first find the best autocorrelation period</span>
<a name="l00273"></a>00273 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> candidate=1;
<a name="l00274"></a>00274 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1;i<log.size();i++)
<a name="l00275"></a>00275 <span class="keywordflow">if</span>(autoc[i]<autoc[candidate])
<a name="l00276"></a>00276 candidate=i;
<a name="l00277"></a>00277
<a name="l00278"></a>00278 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> candidate2=1;
<a name="l00279"></a>00279 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=1;i<log.size();i++)
<a name="l00280"></a>00280 <span class="keywordflow">if</span>(i!=candidate && autoc[i]<autoc[candidate2])
<a name="l00281"></a>00281 candidate2=i;
<a name="l00282"></a>00282
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="keywordtype">double</span> should_be_2=log[candidate2].start/(double)log[candidate].start;
<a name="l00285"></a>00285
<a name="l00286"></a>00286 <span class="keywordflow">if</span>(<a class="code" href="LinkScheduleEstimator_8h.html#e64a9d9db36a4799b748b089556ce693">absdiff</a>(should_be_2,2)<2*<a class="code" href="LinkScheduleEstimator_8h.html#84a4dcaf53749e9e0b0cff22345a29c3">PERIOD_TOLERANCE</a>)
<a name="l00287"></a>00287 <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)(log[candidate2].start+log[candidate].start)/3;
<a name="l00288"></a>00288 <span class="keywordflow">else</span>
<a name="l00289"></a>00289 <span class="keywordflow">return</span> 0;
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00295"></a>00295 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00296"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#1735a8401a37cf5e7f7473f797c16cb7">00296</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#1735a8401a37cf5e7f7473f797c16cb7" title="return the index of the closest log entry at or before the given date.">LinkScheduleEstimator::seek_to_before_date</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> date)
<a name="l00297"></a>00297 {
<a name="l00298"></a>00298 <span class="keywordflow">for</span>( <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0 ; i < log.size() ; i++ )
<a name="l00299"></a>00299 <span class="keywordflow">if</span>( log[i].start > date )
<a name="l00300"></a>00300 <span class="keywordflow">return</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>)oasys::max(0,(<span class="keywordtype">int</span>)i-1);
<a name="l00301"></a>00301 <span class="keywordflow">return</span> 0;
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303
<a name="l00307"></a>00307 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00308"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d">00308</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">LinkScheduleEstimator::closest_entry_to_date</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> date)
<a name="l00309"></a>00309 {
<a name="l00310"></a>00310 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#1735a8401a37cf5e7f7473f797c16cb7" title="return the index of the closest log entry at or before the given date.">seek_to_before_date</a>(log, date);
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keywordflow">if</span>(<a class="code" href="LinkScheduleEstimator_8h.html#e64a9d9db36a4799b748b089556ce693">absdiff</a>(log[i].start,date)<<a class="code" href="LinkScheduleEstimator_8h.html#e64a9d9db36a4799b748b089556ce693">absdiff</a>(log[i+1].start,date))
<a name="l00313"></a>00313 <span class="keywordflow">return</span> i;
<a name="l00314"></a>00314 <span class="keywordflow">else</span>
<a name="l00315"></a>00315 <span class="keywordflow">return</span> i+1;
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="keywordflow">return</span> 0;
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a>*
<a name="l00322"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d682bec963c07b745a074e0f9227e4c4">00322</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d682bec963c07b745a074e0f9227e4c4">LinkScheduleEstimator::clone_subsequence</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="num2sdnv_8c.html#fed088663f8704004425cdae2120b9b3">len</a>)
<a name="l00323"></a>00323 {
<a name="l00324"></a>00324 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a> *out = <span class="keyword">new</span> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>(len);
<a name="l00325"></a>00325 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i=0;i<len;i++) {
<a name="l00326"></a>00326 (*out)[i].start=log[i+start].start;
<a name="l00327"></a>00327 (*out)[i].duration=log[i+start].duration;
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="keywordflow">return</span> out;
<a name="l00331"></a>00331 }
<a name="l00332"></a>00332
<a name="l00333"></a>00333 <span class="comment">/*</span>
<a name="l00334"></a>00334 <span class="comment"> * Match the pattern against the log, one pattern_len at a time.</span>
<a name="l00335"></a>00335 <span class="comment"> * returns the sum of the distances.</span>
<a name="l00336"></a>00336 <span class="comment"> */</span>
<a name="l00337"></a>00337 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00338"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#500562bbb64e252746e50df3bf6b7ef7">00338</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#500562bbb64e252746e50df3bf6b7ef7">LinkScheduleEstimator::badness_of_match</a>(Log &<a class="code" href="dtnperf-client_8c.html#71808395b2460b32d8b1048e44faef6e">pattern</a>,
<a name="l00339"></a>00339 Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>,
<a name="l00340"></a>00340 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> warping_window,
<a name="l00341"></a>00341 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> period)
<a name="l00342"></a>00342 {
<a name="l00343"></a>00343 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> badness=0;
<a name="l00344"></a>00344 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> date=0; date<log[log.size()-pattern.size()].start; date+=period)
<a name="l00345"></a>00345 {
<a name="l00346"></a>00346 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> start = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">closest_entry_to_date</a>(log,date);
<a name="l00347"></a>00347 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>* subsequence = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d682bec963c07b745a074e0f9227e4c4">clone_subsequence</a>(log, start,
<a name="l00348"></a>00348 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">closest_entry_to_date</a>(log,date) -
<a name="l00349"></a>00349 start+1);
<a name="l00350"></a>00350
<a name="l00351"></a>00351 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="dtnrecv_8c.html#c710c7bfde8686dcdfa07f1800ab01b5">change</a>=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#4f92af378017bf063a3b5144dd3680ee">log_dist</a>(pattern,
<a name="l00352"></a>00352 pattern[0].start,
<a name="l00353"></a>00353 *subsequence,
<a name="l00354"></a>00354 date,
<a name="l00355"></a>00355 warping_window,
<a name="l00356"></a>00356 0);
<a name="l00357"></a>00357
<a name="l00358"></a>00358 <span class="keyword">delete</span> subsequence;
<a name="l00359"></a>00359 badness+=change;
<a name="l00360"></a>00360 }
<a name="l00361"></a>00361 <span class="keywordflow">return</span> badness;
<a name="l00362"></a>00362 }
<a name="l00363"></a>00363
<a name="l00364"></a>00364
<a name="l00365"></a>00365 <span class="comment">/*</span>
<a name="l00366"></a>00366 <span class="comment"> * Given a period estimate, determine the schedule that best fits the</span>
<a name="l00367"></a>00367 <span class="comment"> * provided log.</span>
<a name="l00368"></a>00368 <span class="comment"> */</span>
<a name="l00369"></a>00369 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a>*
<a name="l00370"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#53c3d355d5d0f4c13365dfc5319f2cb8">00370</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#53c3d355d5d0f4c13365dfc5319f2cb8">LinkScheduleEstimator::extract_schedule</a>(Log &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> period_estimate)
<a name="l00371"></a>00371 {
<a name="l00372"></a>00372 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>* best_pattern=0;
<a name="l00373"></a>00373 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> best_pattern_badness=100000000;
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="comment">/*</span>
<a name="l00376"></a>00376 <span class="comment"> First find a canonical schedule approximation - the period that</span>
<a name="l00377"></a>00377 <span class="comment"> best matches all the other periods in this log. Once we have</span>
<a name="l00378"></a>00378 <span class="comment"> that, refine the period length and the schedule using all the</span>
<a name="l00379"></a>00379 <span class="comment"> other periods that match exactly.</span>
<a name="l00380"></a>00380 <span class="comment"> */</span>
<a name="l00381"></a>00381
<a name="l00382"></a>00382 <span class="comment">// find the period that best matches the rest of the log</span>
<a name="l00383"></a>00383 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> date=0;
<a name="l00384"></a>00384 date<=(log[log.size()-1].start-period_estimate);
<a name="l00385"></a>00385 date+=period_estimate)
<a name="l00386"></a>00386 {
<a name="l00387"></a>00387 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pattern_index=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">closest_entry_to_date</a>(log,date);
<a name="l00388"></a>00388 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pattern_len = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">closest_entry_to_date</a>(log,date+period_estimate) -
<a name="l00389"></a>00389 pattern_index+1;
<a name="l00390"></a>00390 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>* <a class="code" href="dtnperf-client_8c.html#71808395b2460b32d8b1048e44faef6e">pattern</a> = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d682bec963c07b745a074e0f9227e4c4">clone_subsequence</a>(log, pattern_index, pattern_len);
<a name="l00391"></a>00391
<a name="l00392"></a>00392 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> badness=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#500562bbb64e252746e50df3bf6b7ef7">badness_of_match</a>(*pattern,
<a name="l00393"></a>00393 log,
<a name="l00394"></a>00394 (<span class="keywordtype">int</span>)(period_estimate*<a class="code" href="LinkScheduleEstimator_8h.html#cc9f39477dafecc1ae1915ed6e80c949">WARPING_WINDOW</a>),
<a name="l00395"></a>00395 period_estimate);
<a name="l00396"></a>00396
<a name="l00397"></a>00397 <span class="keywordflow">if</span>(badness < best_pattern_badness)
<a name="l00398"></a>00398 {
<a name="l00399"></a>00399 <span class="keywordflow">if</span>(best_pattern)
<a name="l00400"></a>00400 <span class="keyword">delete</span> best_pattern;
<a name="l00401"></a>00401
<a name="l00402"></a>00402 best_pattern = pattern;
<a name="l00403"></a>00403 best_pattern_badness = badness;
<a name="l00404"></a>00404 }
<a name="l00405"></a>00405 <span class="keywordflow">else</span> <span class="keyword">delete</span> pattern;
<a name="l00406"></a>00406 }
<a name="l00407"></a>00407
<a name="l00408"></a>00408 log_debug(<span class="stringliteral">"And the best pattern is (%d): \n"</span>,best_pattern_badness);
<a name="l00409"></a>00409 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#bd21da2cc439402e70d7fc0cf2a2c6ca">print_log</a>(*best_pattern, 1);
<a name="l00410"></a>00410
<a name="l00411"></a>00411 <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">Log</a>(*best_pattern);
<a name="l00412"></a>00412
<a name="l00413"></a>00413 <span class="comment">/*</span>
<a name="l00414"></a>00414 <span class="comment"> // This part computes an average schedule based on all the</span>
<a name="l00415"></a>00415 <span class="comment"> // subsequences matching the pattern. apparently, it isn't</span>
<a name="l00416"></a>00416 <span class="comment"> // working as well as the "best pattern" thing is right now, so</span>
<a name="l00417"></a>00417 <span class="comment"> // it's commented until we can improve it.</span>
<a name="l00418"></a>00418 <span class="comment"></span>
<a name="l00419"></a>00419 <span class="comment"> unsigned int dist;</span>
<a name="l00420"></a>00420 <span class="comment"> unsigned int count=0;</span>
<a name="l00421"></a>00421 <span class="comment"> for ( unsigned int date=0 ;</span>
<a name="l00422"></a>00422 <span class="comment"> date<=(log[log.size()-1].start-period_estimate);</span>
<a name="l00423"></a>00423 <span class="comment"> date+=period_estimate )</span>
<a name="l00424"></a>00424 <span class="comment"> {</span>
<a name="l00425"></a>00425 <span class="comment"> unsigned int pattern_index=closest_entry_to_date(l,log.size(),date);</span>
<a name="l00426"></a>00426 <span class="comment"> unsigned int pattern_len =</span>
<a name="l00427"></a>00427 <span class="comment"> closest_entry_to_date(l,log.size(),date+period_estimate) -</span>
<a name="l00428"></a>00428 <span class="comment"> pattern_index;</span>
<a name="l00429"></a>00429 <span class="comment"></span>
<a name="l00430"></a>00430 <span class="comment"> if((pattern_len == best_pattern_len) &&</span>
<a name="l00431"></a>00431 <span class="comment"> !(dist=log_dist(best_pattern,,best_pattern_len,best_pattern[0].start,</span>
<a name="l00432"></a>00432 <span class="comment"> &(log[pattern_index]), pattern_len, date,</span>
<a name="l00433"></a>00433 <span class="comment"> (int)(period_estimate*WARPING_WINDOW),</span>
<a name="l00434"></a>00434 <span class="comment"> 0)))</span>
<a name="l00435"></a>00435 <span class="comment"> {</span>
<a name="l00436"></a>00436 <span class="comment"> log_debug("log at %d is good\n", date);</span>
<a name="l00437"></a>00437 <span class="comment"> count++;</span>
<a name="l00438"></a>00438 <span class="comment"></span>
<a name="l00439"></a>00439 <span class="comment"> for(unsigned int i=0;i<pattern_len;i++) {</span>
<a name="l00440"></a>00440 <span class="comment"> schedule[i].start+=log[pattern_index+i].start-date;</span>
<a name="l00441"></a>00441 <span class="comment"> schedule[i].duration+=log[pattern_index+i].duration;</span>
<a name="l00442"></a>00442 <span class="comment"> }</span>
<a name="l00443"></a>00443 <span class="comment"> }</span>
<a name="l00444"></a>00444 <span class="comment"> else</span>
<a name="l00445"></a>00445 <span class="comment"> log_debug("tried date %d (%d-%d): %d\n",</span>
<a name="l00446"></a>00446 <span class="comment"> date, pattern_index,pattern_len, dist);</span>
<a name="l00447"></a>00447 <span class="comment"></span>
<a name="l00448"></a>00448 <span class="comment"> }</span>
<a name="l00449"></a>00449 <span class="comment"></span>
<a name="l00450"></a>00450 <span class="comment"> for(unsigned int i=0;i<best_pattern_len;i++) {</span>
<a name="l00451"></a>00451 <span class="comment"> schedule[i].start/=count;</span>
<a name="l00452"></a>00452 <span class="comment"> schedule[i].duration/=count;</span>
<a name="l00453"></a>00453 <span class="comment"> }</span>
<a name="l00454"></a>00454 <span class="comment"></span>
<a name="l00455"></a>00455 <span class="comment"> log_debug("Extracted schedule is\n");</span>
<a name="l00456"></a>00456 <span class="comment"> print_log(schedule,best_pattern_len,1);</span>
<a name="l00457"></a>00457 <span class="comment">*/</span>
<a name="l00458"></a>00458 }
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="comment">/*</span>
<a name="l00461"></a>00461 <span class="comment"> * Given a period estimate, improve the estimate by fitting it</span>
<a name="l00462"></a>00462 <span class="comment"> * against the entire log data.</span>
<a name="l00463"></a>00463 <span class="comment"> *</span>
<a name="l00464"></a>00464 <span class="comment"> * XXX/jakob - if the last scheduled event doesn't occur in any given</span>
<a name="l00465"></a>00465 <span class="comment"> * period, the refined period will be way off! should check if the</span>
<a name="l00466"></a>00466 <span class="comment"> * data makes sense before using it.</span>
<a name="l00467"></a>00467 <span class="comment"> */</span>
<a name="l00468"></a>00468
<a name="l00469"></a>00469 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00470"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#72909ef9d3fdd911fd87e8756b554edd">00470</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#72909ef9d3fdd911fd87e8756b554edd">LinkScheduleEstimator::refine_period</a>(<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a> &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>,
<a name="l00471"></a>00471 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> period_estimate)
<a name="l00472"></a>00472 {
<a name="l00473"></a>00473 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> sum=0;
<a name="l00474"></a>00474 <span class="keywordtype">int</span> <a class="code" href="dtnping_8c.html#d43c3812e6d13e0518d9f8b8f463ffcf">count</a>=-1;
<a name="l00475"></a>00475 <span class="keywordtype">int</span> count2=0;
<a name="l00476"></a>00476
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> date=0 ;
<a name="l00479"></a>00479 date<=(log[log.size()-1].start-period_estimate) ;
<a name="l00480"></a>00480 date+=period_estimate)
<a name="l00481"></a>00481 {
<a name="l00482"></a>00482 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> pattern_index=<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#3a8b1347b7e2346fb47e9f3086eecd6d" title="return the index of the closest log entry to the given date">closest_entry_to_date</a>(log,date);
<a name="l00483"></a>00483 sum+=log[pattern_index].start;
<a name="l00484"></a>00484 count++;
<a name="l00485"></a>00485 count2+=count;
<a name="l00486"></a>00486 }
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="keywordflow">return</span> sum/count2;
<a name="l00489"></a>00489 }
<a name="l00490"></a>00490
<a name="l00494"></a>00494 <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a>*
<a name="l00495"></a><a class="code" href="classdtn_1_1LinkScheduleEstimator.html#375f63c7c9eb507a4eae17257ccef180">00495</a> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#04c89a1b33385566625dba0bcec80ac7">LinkScheduleEstimator::find_schedule</a>(<a class="code" href="classdtn_1_1LinkScheduleEstimator.html#03f2dd943b7f8c9b0edc879ee4edabdf">LinkScheduleEstimator::Log</a> &<a class="code" href="namespacedtn.html#68bf4270dd0a7e5e8390869b83889922">log</a>)
<a name="l00496"></a>00496 {
<a name="l00497"></a>00497 <span class="comment">// find a first estimate of the period. If there is a period, this</span>
<a name="l00498"></a>00498 <span class="comment">// will return a non-zero value.</span>
<a name="l00499"></a>00499
<a name="l00500"></a>00500 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> period = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#d265c8f04daa7f58afe62733465fc747">estimate_period</a>(log);
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="keywordflow">if</span>(period) {
<a name="l00503"></a>00503 <span class="comment">// now try to fit this period to the full log as closely as possible</span>
<a name="l00504"></a>00504 period = <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#72909ef9d3fdd911fd87e8756b554edd">refine_period</a>(log, period);
<a name="l00505"></a>00505 <span class="comment">// and then compute the best schedule for the given log and period</span>
<a name="l00506"></a>00506 <span class="keywordflow">return</span> <a class="code" href="classdtn_1_1LinkScheduleEstimator.html#53c3d355d5d0f4c13365dfc5319f2cb8">extract_schedule</a>(log, period);
<a name="l00507"></a>00507 }
<a name="l00508"></a>00508 <span class="keywordflow">else</span> <span class="keywordflow">return</span> 0;
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="comment">/*</span>
<a name="l00513"></a>00513 <span class="comment">int main(int argc, char** argv)</span>
<a name="l00514"></a>00514 <span class="comment">{</span>
<a name="l00515"></a>00515 <span class="comment"> Log f2(5);</span>
<a name="l00516"></a>00516 <span class="comment"> f2[0].start=0;</span>
<a name="l00517"></a>00517 <span class="comment"> f2[0].duration=1000;</span>
<a name="l00518"></a>00518 <span class="comment"></span>
<a name="l00519"></a>00519 <span class="comment"> f2[1].start=4000;</span>
<a name="l00520"></a>00520 <span class="comment"> f2[1].duration=500;</span>
<a name="l00521"></a>00521 <span class="comment"></span>
<a name="l00522"></a>00522 <span class="comment"> f2[2].start=9000;</span>
<a name="l00523"></a>00523 <span class="comment"> f2[2].duration=1000;</span>
<a name="l00524"></a>00524 <span class="comment"></span>
<a name="l00525"></a>00525 <span class="comment"> f2[3].start=14000;</span>
<a name="l00526"></a>00526 <span class="comment"> f2[3].duration=2000;</span>
<a name="l00527"></a>00527 <span class="comment"></span>
<a name="l00528"></a>00528 <span class="comment"> f2[4].start=19000;</span>
<a name="l00529"></a>00529 <span class="comment"> f2[4].duration=1000;</span>
<a name="l00530"></a>00530 <span class="comment"></span>
<a name="l00531"></a>00531 <span class="comment">// log f1[]={CONTACT(0,1023),</span>
<a name="l00532"></a>00532 <span class="comment">// CONTACT(5006,1040),</span>
<a name="l00533"></a>00533 <span class="comment">// CONTACT(10150,1002),</span>
<a name="l00534"></a>00534 <span class="comment">// CONTACT(20040, 956),</span>
<a name="l00535"></a>00535 <span class="comment">// CONTACT(25200, 896),</span>
<a name="l00536"></a>00536 <span class="comment">// CONTACT(26150, 350),</span>
<a name="l00537"></a>00537 <span class="comment">// CONTACT(29682, 1098),</span>
<a name="l00538"></a>00538 <span class="comment">// CONTACT(39780, 1035),</span>
<a name="l00539"></a>00539 <span class="comment">// CONTACT(45000, 987),</span>
<a name="l00540"></a>00540 <span class="comment">// CONTACT(50045, 907),</span>
<a name="l00541"></a>00541 <span class="comment">// CONTACT(60340, 1055),</span>
<a name="l00542"></a>00542 <span class="comment">// CONTACT(65000, 987),</span>
<a name="l00543"></a>00543 <span class="comment">// CONTACT(70045, 907),</span>
<a name="l00544"></a>00544 <span class="comment">// CONTACT(80340, 1055)};</span>
<a name="l00545"></a>00545 <span class="comment"></span>
<a name="l00546"></a>00546 <span class="comment"></span>
<a name="l00547"></a>00547 <span class="comment"> Log* best_schedule=0;</span>
<a name="l00548"></a>00548 <span class="comment"> int best_schedule_len;</span>
<a name="l00549"></a>00549 <span class="comment"> Log* schedule;</span>
<a name="l00550"></a>00550 <span class="comment"> int schedule_len;</span>
<a name="l00551"></a>00551 <span class="comment"></span>
<a name="l00552"></a>00552 <span class="comment"> int log_len=100;</span>
<a name="l00553"></a>00553 <span class="comment"> Log *full_log=generate_samples(f2,log_len,1000,.1);</span>
<a name="l00554"></a>00554 <span class="comment"></span>
<a name="l00555"></a>00555 <span class="comment"> int best_period=0;</span>
<a name="l00556"></a>00556 <span class="comment"> int best_cost=1000000;</span>
<a name="l00557"></a>00557 <span class="comment"></span>
<a name="l00558"></a>00558 <span class="comment"> for(int current_event=1;current_event<log_len;current_event++)</span>
<a name="l00559"></a>00559 <span class="comment"> {</span>
<a name="l00560"></a>00560 <span class="comment"> Log *log=clone_subsequence(*full_log, 0, current_event+1);</span>
<a name="l00561"></a>00561 <span class="comment"> int period=estimate_period((*log));</span>
<a name="l00562"></a>00562 <span class="comment"> if(period)</span>
<a name="l00563"></a>00563 <span class="comment"> {</span>
<a name="l00564"></a>00564 <span class="comment"> log_debug("At time %d (%d), estimated period is %d.\n",</span>
<a name="l00565"></a>00565 <span class="comment"> current_event,</span>
<a name="l00566"></a>00566 <span class="comment"> (*log)[current_event-1].start,</span>
<a name="l00567"></a>00567 <span class="comment"> period);</span>
<a name="l00568"></a>00568 <span class="comment"></span>
<a name="l00569"></a>00569 <span class="comment"></span>
<a name="l00570"></a>00570 <span class="comment"> period = refine_period((*log), period);</span>
<a name="l00571"></a>00571 <span class="comment"> log_debug("Period after refinement is %d\n",period);</span>
<a name="l00572"></a>00572 <span class="comment"></span>
<a name="l00573"></a>00573 <span class="comment"> schedule=extract_schedule((*log), period);</span>
<a name="l00574"></a>00574 <span class="comment"></span>
<a name="l00575"></a>00575 <span class="comment"> // XXX/jakob - this isn't fair. we're comparing the cost</span>
<a name="l00576"></a>00576 <span class="comment"> // of matching to a short interval to the cost of matching</span>
<a name="l00577"></a>00577 <span class="comment"> // to a long interval</span>
<a name="l00578"></a>00578 <span class="comment"> int cost=badness_of_match(*schedule,</span>
<a name="l00579"></a>00579 <span class="comment"> *log,</span>
<a name="l00580"></a>00580 <span class="comment"> (int)(period*WARPING_WINDOW),</span>
<a name="l00581"></a>00581 <span class="comment"> period);</span>
<a name="l00582"></a>00582 <span class="comment"></span>
<a name="l00583"></a>00583 <span class="comment"> if(cost<best_cost) {</span>
<a name="l00584"></a>00584 <span class="comment"> log_debug("Found a new best period %d and schedule at time %d, cost is %d.\n",</span>
<a name="l00585"></a>00585 <span class="comment"> period,</span>
<a name="l00586"></a>00586 <span class="comment"> (*log)[current_event].start,</span>
<a name="l00587"></a>00587 <span class="comment"> cost);</span>
<a name="l00588"></a>00588 <span class="comment"> if(best_schedule)</span>
<a name="l00589"></a>00589 <span class="comment"> delete best_schedule;</span>
<a name="l00590"></a>00590 <span class="comment"></span>
<a name="l00591"></a>00591 <span class="comment"> best_schedule=schedule;</span>
<a name="l00592"></a>00592 <span class="comment"> best_schedule_len=schedule_len;</span>
<a name="l00593"></a>00593 <span class="comment"> best_period=period;</span>
<a name="l00594"></a>00594 <span class="comment"> best_cost=cost;</span>
<a name="l00595"></a>00595 <span class="comment"> }</span>
<a name="l00596"></a>00596 <span class="comment"> else</span>
<a name="l00597"></a>00597 <span class="comment"> delete schedule;</span>
<a name="l00598"></a>00598 <span class="comment"> }</span>
<a name="l00599"></a>00599 <span class="comment"></span>
<a name="l00600"></a>00600 <span class="comment"> delete log;</span>
<a name="l00601"></a>00601 <span class="comment"> }</span>
<a name="l00602"></a>00602 <span class="comment"></span>
<a name="l00603"></a>00603 <span class="comment"> log_debug("Best period %d, cost %d, schedule: ",best_period,best_cost);</span>
<a name="l00604"></a>00604 <span class="comment"> print_log(*best_schedule, 1);</span>
<a name="l00605"></a>00605 <span class="comment"></span>
<a name="l00606"></a>00606 <span class="comment"> delete full_log;</span>
<a name="l00607"></a>00607 <span class="comment">}</span>
<a name="l00608"></a>00608 <span class="comment"></span>
<a name="l00609"></a>00609 <span class="comment">*/</span>
<a name="l00610"></a>00610
<a name="l00611"></a>00611 }
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Fri Jan 30 09:26:57 2009 for DTN Reference Implementation by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.8 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
29c369053a983cc5d8c880dc6e0a2237
>
files
>
388
