/usr/include/ns3.27/ns3/aodv-rqueue.h is in libns3-dev 3.27+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2009 IITP RAS
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Based on
* NS-2 AODV model developed by the CMU/MONARCH group and optimized and
* tuned by Samir Das and Mahesh Marina, University of Cincinnati;
*
* AODV-UU implementation by Erik Nordström of Uppsala University
* http://core.it.uu.se/core/index.php/AODV-UU
*
* Authors: Elena Buchatskaia <borovkovaes@iitp.ru>
* Pavel Boyko <boyko@iitp.ru>
*/
#ifndef AODV_RQUEUE_H
#define AODV_RQUEUE_H
#include <vector>
#include "ns3/ipv4-routing-protocol.h"
#include "ns3/simulator.h"
namespace ns3 {
namespace aodv {
/**
* \ingroup aodv
* \brief AODV Queue Entry
*/
class QueueEntry
{
public:
/// IPv4 routing unicast forward callback typedef
typedef Ipv4RoutingProtocol::UnicastForwardCallback UnicastForwardCallback;
/// IPv4 routing error callback typedef
typedef Ipv4RoutingProtocol::ErrorCallback ErrorCallback;
/**
* constructor
*
* \param pa the packet to add to the queue
* \param h the Ipv4Header
* \param ucb the UnicastForwardCallback function
* \param ecb the ErrorCallback function
* \param exp the expiration time
*/
QueueEntry (Ptr<const Packet> pa = 0, Ipv4Header const & h = Ipv4Header (),
UnicastForwardCallback ucb = UnicastForwardCallback (),
ErrorCallback ecb = ErrorCallback (), Time exp = Simulator::Now ())
: m_packet (pa),
m_header (h),
m_ucb (ucb),
m_ecb (ecb),
m_expire (exp + Simulator::Now ())
{
}
/**
* \brief Compare queue entries
* \param o QueueEntry to compare
* \return true if equal
*/
bool operator== (QueueEntry const & o) const
{
return ((m_packet == o.m_packet) && (m_header.GetDestination () == o.m_header.GetDestination ()) && (m_expire == o.m_expire));
}
// Fields
/**
* Get unicast forward callback
* \returns unicast callback
*/
UnicastForwardCallback GetUnicastForwardCallback () const
{
return m_ucb;
}
/**
* Set unicast forward callback
* \param ucb The unicast callback
*/
void SetUnicastForwardCallback (UnicastForwardCallback ucb)
{
m_ucb = ucb;
}
/**
* Get error callback
* \returns the error callback
*/
ErrorCallback GetErrorCallback () const
{
return m_ecb;
}
/**
* Set error callback
* \param ecb The error callback
*/
void SetErrorCallback (ErrorCallback ecb)
{
m_ecb = ecb;
}
/**
* Get packet from entry
* \returns the packet
*/
Ptr<const Packet> GetPacket () const
{
return m_packet;
}
/**
* Set packet in entry
* \param p The packet
*/
void SetPacket (Ptr<const Packet> p)
{
m_packet = p;
}
/**
* Get IPv4 header
* \returns the IPv4 header
*/
Ipv4Header GetIpv4Header () const
{
return m_header;
}
/**
* Set IPv4 header
* \param h the IPv4 header
*/
void SetIpv4Header (Ipv4Header h)
{
m_header = h;
}
/**
* Set expire time
* \param exp The expiration time
*/
void SetExpireTime (Time exp)
{
m_expire = exp + Simulator::Now ();
}
/**
* Get expire time
* \returns the expiration time
*/
Time GetExpireTime () const
{
return m_expire - Simulator::Now ();
}
private:
/// Data packet
Ptr<const Packet> m_packet;
/// IP header
Ipv4Header m_header;
/// Unicast forward callback
UnicastForwardCallback m_ucb;
/// Error callback
ErrorCallback m_ecb;
/// Expire time for queue entry
Time m_expire;
};
/**
* \ingroup aodv
* \brief AODV route request queue
*
* Since AODV is an on demand routing we queue requests while looking for route.
*/
class RequestQueue
{
public:
/**
* constructor
*
* \param maxLen the maximum length
* \param routeToQueueTimeout the route to queue timeout
*/
RequestQueue (uint32_t maxLen, Time routeToQueueTimeout)
: m_maxLen (maxLen),
m_queueTimeout (routeToQueueTimeout)
{
}
/**
* Push entry in queue, if there is no entry with the same packet and destination address in queue.
* \param entry the queue entry
* \returns true if the entry is queued
*/
bool Enqueue (QueueEntry & entry);
/**
* Return first found (the earliest) entry for given destination
*
* \param dst the destination IP address
* \param entry the queue entry
* \returns true if the entry is dequeued
*/
bool Dequeue (Ipv4Address dst, QueueEntry & entry);
/**
* Remove all packets with destination IP address dst
* \param dst the destination IP address
*/
void DropPacketWithDst (Ipv4Address dst);
/**
* Finds whether a packet with destination dst exists in the queue
*
* \param dst the destination IP address
* \returns true if an entry with the IP address is found
*/
bool Find (Ipv4Address dst);
/**
* \returns the number of entries
*/
uint32_t GetSize ();
// Fields
/**
* Get maximum queue length
* \returns the maximum queue length
*/
uint32_t GetMaxQueueLen () const
{
return m_maxLen;
}
/**
* Set maximum queue length
* \param len The maximum queue length
*/
void SetMaxQueueLen (uint32_t len)
{
m_maxLen = len;
}
/**
* Get queue timeout
* \returns the queue timeout
*/
Time GetQueueTimeout () const
{
return m_queueTimeout;
}
/**
* Set queue timeout
* \param t The queue timeout
*/
void SetQueueTimeout (Time t)
{
m_queueTimeout = t;
}
private:
/// The queue
std::vector<QueueEntry> m_queue;
/// Remove all expired entries
void Purge ();
/**
* Notify that packet is dropped from queue by timeout
* \param en the queue entry to drop
* \param reason the reason to drop the entry
*/
void Drop (QueueEntry en, std::string reason);
/// The maximum number of packets that we allow a routing protocol to buffer.
uint32_t m_maxLen;
/// The maximum period of time that a routing protocol is allowed to buffer a packet for, seconds.
Time m_queueTimeout;
/**
* Determine if queue matches a destination address
* \param en The queue entry
* \param dst The destination IPv4 address
* \returns true if the queue entry matches the desination address
*/
static bool IsEqual (QueueEntry en, const Ipv4Address dst)
{
return (en.GetIpv4Header ().GetDestination () == dst);
}
};
} // namespace aodv
} // namespace ns3
#endif /* AODV_RQUEUE_H */
|