151 lines
3.9 KiB
C++
151 lines
3.9 KiB
C++
/* -*- 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>
|
|
*/
|
|
#include "aodv-rqueue.h"
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include "ns3/ipv4-route.h"
|
|
#include "ns3/socket.h"
|
|
#include "ns3/log.h"
|
|
|
|
NS_LOG_COMPONENT_DEFINE ("AodvRequestQueue");
|
|
|
|
namespace ns3
|
|
{
|
|
namespace aodv
|
|
{
|
|
uint32_t
|
|
RequestQueue::GetSize ()
|
|
{
|
|
Purge ();
|
|
return m_queue.size ();
|
|
}
|
|
|
|
bool
|
|
RequestQueue::Enqueue (QueueEntry & entry)
|
|
{
|
|
Purge ();
|
|
for (std::vector<QueueEntry>::const_iterator i = m_queue.begin (); i
|
|
!= m_queue.end (); ++i)
|
|
{
|
|
if ((i->GetPacket ()->GetUid () == entry.GetPacket ()->GetUid ())
|
|
&& (i->GetIpv4Header ().GetDestination ()
|
|
== entry.GetIpv4Header ().GetDestination ()))
|
|
return false;
|
|
}
|
|
entry.SetExpireTime (m_queueTimeout);
|
|
if (m_queue.size () == m_maxLen)
|
|
{
|
|
Drop (m_queue.front (), "Drop the most aged packet"); // Drop the most aged packet
|
|
m_queue.erase (m_queue.begin ());
|
|
}
|
|
m_queue.push_back (entry);
|
|
return true;
|
|
}
|
|
|
|
void
|
|
RequestQueue::DropPacketWithDst (Ipv4Address dst)
|
|
{
|
|
NS_LOG_FUNCTION (this << dst);
|
|
Purge ();
|
|
for (std::vector<QueueEntry>::iterator i = m_queue.begin (); i
|
|
!= m_queue.end (); ++i)
|
|
{
|
|
if (IsEqual (*i, dst))
|
|
{
|
|
Drop (*i, "DropPacketWithDst ");
|
|
}
|
|
}
|
|
m_queue.erase (std::remove_if (m_queue.begin (), m_queue.end (),
|
|
std::bind2nd (std::ptr_fun (RequestQueue::IsEqual), dst)), m_queue.end ());
|
|
}
|
|
|
|
bool
|
|
RequestQueue::Dequeue (Ipv4Address dst, QueueEntry & entry)
|
|
{
|
|
Purge ();
|
|
for (std::vector<QueueEntry>::iterator i = m_queue.begin (); i != m_queue.end (); ++i)
|
|
{
|
|
if (i->GetIpv4Header ().GetDestination () == dst)
|
|
{
|
|
entry = *i;
|
|
m_queue.erase (i);
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
RequestQueue::Find (Ipv4Address dst)
|
|
{
|
|
for (std::vector<QueueEntry>::const_iterator i = m_queue.begin (); i
|
|
!= m_queue.end (); ++i)
|
|
{
|
|
if (i->GetIpv4Header ().GetDestination () == dst)
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
struct IsExpired
|
|
{
|
|
bool
|
|
operator() (QueueEntry const & e) const
|
|
{
|
|
return (e.GetExpireTime () < Seconds (0));
|
|
}
|
|
};
|
|
|
|
void
|
|
RequestQueue::Purge ()
|
|
{
|
|
IsExpired pred;
|
|
for (std::vector<QueueEntry>::iterator i = m_queue.begin (); i
|
|
!= m_queue.end (); ++i)
|
|
{
|
|
if (pred (*i))
|
|
{
|
|
Drop (*i, "Drop outdated packet ");
|
|
}
|
|
}
|
|
m_queue.erase (std::remove_if (m_queue.begin (), m_queue.end (), pred),
|
|
m_queue.end ());
|
|
}
|
|
|
|
void
|
|
RequestQueue::Drop (QueueEntry en, std::string reason)
|
|
{
|
|
NS_LOG_LOGIC (reason << en.GetPacket ()->GetUid () << " " << en.GetIpv4Header ().GetDestination ());
|
|
en.GetErrorCallback () (en.GetPacket (), en.GetIpv4Header (),
|
|
Socket::ERROR_NOROUTETOHOST);
|
|
return;
|
|
}
|
|
|
|
}
|
|
}
|