A Discrete-Event Network Simulator
API
codel-queue-disc.cc
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2012 Andrew McGregor
4  *
5  * This program is free software; you can redistribute it and/or modify
6  * it under the terms of the GNU General Public License version 2 as
7  * published by the Free Software Foundation;
8  *
9  * This program is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12  * GNU General Public License for more details.
13  *
14  * You should have received a copy of the GNU General Public License
15  * along with this program; if not, write to the Free Software
16  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17  *
18  * Codel, the COntrolled DELay Queueing discipline
19  * Based on ns2 simulation code presented by Kathie Nichols
20  *
21  * This port based on linux kernel code by
22  * Authors: Dave Täht <d@taht.net>
23  * Eric Dumazet <edumazet@google.com>
24  *
25  * Ported to ns-3 by: Andrew McGregor <andrewmcgr@gmail.com>
26 */
27 
28 #include "ns3/log.h"
29 #include "ns3/enum.h"
30 #include "ns3/uinteger.h"
31 #include "ns3/abort.h"
32 #include "codel-queue-disc.h"
33 #include "ns3/object-factory.h"
34 #include "ns3/drop-tail-queue.h"
35 #include "ns3/net-device-queue-interface.h"
36 
37 namespace ns3 {
38 
39 NS_LOG_COMPONENT_DEFINE ("CoDelQueueDisc");
40 
48 /* borrowed from the linux kernel */
49 static inline uint32_t ReciprocalDivide (uint32_t A, uint32_t R)
50 {
51  return (uint32_t)(((uint64_t)A * R) >> 32);
52 }
53 
54 /* end kernel borrowings */
55 
60 static uint32_t CoDelGetTime (void)
61 {
62  Time time = Simulator::Now ();
63  uint64_t ns = time.GetNanoSeconds ();
64 
65  return static_cast<uint32_t>(ns >> CODEL_SHIFT);
66 }
67 
68 
69 NS_OBJECT_ENSURE_REGISTERED (CoDelQueueDisc);
70 
72 {
73  static TypeId tid = TypeId ("ns3::CoDelQueueDisc")
74  .SetParent<QueueDisc> ()
75  .SetGroupName ("TrafficControl")
76  .AddConstructor<CoDelQueueDisc> ()
77  .AddAttribute ("MaxSize",
78  "The maximum number of packets/bytes accepted by this queue disc.",
83  .AddAttribute ("MinBytes",
84  "The CoDel algorithm minbytes parameter.",
85  UintegerValue (1500),
87  MakeUintegerChecker<uint32_t> ())
88  .AddAttribute ("Interval",
89  "The CoDel algorithm interval",
90  StringValue ("100ms"),
92  MakeTimeChecker ())
93  .AddAttribute ("Target",
94  "The CoDel algorithm target queue delay",
95  StringValue ("5ms"),
97  MakeTimeChecker ())
98  .AddTraceSource ("Count",
99  "CoDel count",
101  "ns3::TracedValueCallback::Uint32")
102  .AddTraceSource ("LastCount",
103  "CoDel lastcount",
105  "ns3::TracedValueCallback::Uint32")
106  .AddTraceSource ("DropState",
107  "Dropping state",
109  "ns3::TracedValueCallback::Bool")
110  .AddTraceSource ("DropNext",
111  "Time until next packet drop",
113  "ns3::TracedValueCallback::Uint32")
114  ;
115 
116  return tid;
117 }
118 
121  m_count (0),
122  m_lastCount (0),
123  m_dropping (false),
124  m_recInvSqrt (~0U >> REC_INV_SQRT_SHIFT),
125  m_firstAboveTime (0),
126  m_dropNext (0),
127  m_state1 (0),
128  m_state2 (0),
129  m_state3 (0),
130  m_states (0)
131 {
132  NS_LOG_FUNCTION (this);
133 }
134 
136 {
137  NS_LOG_FUNCTION (this);
138 }
139 
140 void
142 {
143  NS_LOG_FUNCTION (this);
144  uint32_t invsqrt = ((uint32_t) m_recInvSqrt) << REC_INV_SQRT_SHIFT;
145  uint32_t invsqrt2 = ((uint64_t) invsqrt * invsqrt) >> 32;
146  uint64_t val = (3ll << 32) - ((uint64_t) m_count * invsqrt2);
147 
148  val >>= 2; /* avoid overflow */
149  val = (val * invsqrt) >> (32 - 2 + 1);
150  m_recInvSqrt = static_cast<uint16_t>(val >> REC_INV_SQRT_SHIFT);
151 }
152 
153 uint32_t
155 {
156  NS_LOG_FUNCTION (this);
158 }
159 
160 bool
162 {
163  NS_LOG_FUNCTION (this << item);
164 
165  if (GetCurrentSize () + item > GetMaxSize ())
166  {
167  NS_LOG_LOGIC ("Queue full -- dropping pkt");
169  return false;
170  }
171 
172  bool retval = GetInternalQueue (0)->Enqueue (item);
173 
174  // If Queue::Enqueue fails, QueueDisc::DropBeforeEnqueue is called by the
175  // internal queue because QueueDisc::AddInternalQueue sets the trace callback
176 
177  NS_LOG_LOGIC ("Number packets " << GetInternalQueue (0)->GetNPackets ());
178  NS_LOG_LOGIC ("Number bytes " << GetInternalQueue (0)->GetNBytes ());
179 
180  return retval;
181 }
182 
183 bool
185 {
186  NS_LOG_FUNCTION (this);
187  bool okToDrop;
188 
189  if (!item)
190  {
191  m_firstAboveTime = 0;
192  return false;
193  }
194 
195  Time delta = Simulator::Now () - item->GetTimeStamp ();
196  NS_LOG_INFO ("Sojourn time " << delta.ToDouble (Time::MS) << "ms");
197  uint32_t sojournTime = Time2CoDel (delta);
198 
199  if (CoDelTimeBefore (sojournTime, Time2CoDel (m_target))
201  {
202  // went below so we'll stay below for at least q->interval
203  NS_LOG_LOGIC ("Sojourn time is below target or number of bytes in queue is less than minBytes; packet should not be dropped");
204  m_firstAboveTime = 0;
205  return false;
206  }
207  okToDrop = false;
208  if (m_firstAboveTime == 0)
209  {
210  /* just went above from below. If we stay above
211  * for at least q->interval we'll say it's ok to drop
212  */
213  NS_LOG_LOGIC ("Sojourn time has just gone above target from below, need to stay above for at least q->interval before packet can be dropped. ");
215  }
216  else if (CoDelTimeAfter (now, m_firstAboveTime))
217  {
218  NS_LOG_LOGIC ("Sojourn time has been above target for at least q->interval; it's OK to (possibly) drop packet.");
219  okToDrop = true;
220  ++m_state1;
221  }
222  return okToDrop;
223 }
224 
227 {
228  NS_LOG_FUNCTION (this);
229 
230  Ptr<QueueDiscItem> item = GetInternalQueue (0)->Dequeue ();
231  if (!item)
232  {
233  // Leave dropping state when queue is empty
234  m_dropping = false;
235  NS_LOG_LOGIC ("Queue empty");
236  return 0;
237  }
238  uint32_t now = CoDelGetTime ();
239 
240  NS_LOG_LOGIC ("Popped " << item);
241  NS_LOG_LOGIC ("Number packets remaining " << GetInternalQueue (0)->GetNPackets ());
242  NS_LOG_LOGIC ("Number bytes remaining " << GetInternalQueue (0)->GetNBytes ());
243 
244  // Determine if item should be dropped
245  bool okToDrop = OkToDrop (item, now);
246 
247  if (m_dropping)
248  { // In the dropping state (sojourn time has gone above target and hasn't come down yet)
249  // Check if we can leave the dropping state or next drop should occur
250  NS_LOG_LOGIC ("In dropping state, check if it's OK to leave or next drop should occur");
251  if (!okToDrop)
252  {
253  /* sojourn time fell below target - leave dropping state */
254  NS_LOG_LOGIC ("Sojourn time goes below target, it's OK to leave dropping state.");
255  m_dropping = false;
256  }
257  else if (CoDelTimeAfterEq (now, m_dropNext))
258  {
259  m_state2++;
260  while (m_dropping && CoDelTimeAfterEq (now, m_dropNext))
261  {
262  // It's time for the next drop. Drop the current packet and
263  // dequeue the next. The dequeue might take us out of dropping
264  // state. If not, schedule the next drop.
265  // A large amount of packets in queue might result in drop
266  // rates so high that the next drop should happen now,
267  // hence the while loop.
268  NS_LOG_LOGIC ("Sojourn time is still above target and it's time for next drop; dropping " << item);
270 
271  ++m_count;
272  NewtonStep ();
273  item = GetInternalQueue (0)->Dequeue ();
274 
275  if (item)
276  {
277  NS_LOG_LOGIC ("Popped " << item);
278  NS_LOG_LOGIC ("Number packets remaining " << GetInternalQueue (0)->GetNPackets ());
279  NS_LOG_LOGIC ("Number bytes remaining " << GetInternalQueue (0)->GetNBytes ());
280  }
281 
282  if (!OkToDrop (item, now))
283  {
284  /* leave dropping state */
285  NS_LOG_LOGIC ("Leaving dropping state");
286  m_dropping = false;
287  }
288  else
289  {
290  /* schedule the next drop */
291  NS_LOG_LOGIC ("Running ControlLaw for input m_dropNext: " << (double)m_dropNext / 1000000);
293  NS_LOG_LOGIC ("Scheduled next drop at " << (double)m_dropNext / 1000000);
294  }
295  }
296  }
297  }
298  else
299  {
300  // Not in the dropping state
301  // Decide if we have to enter the dropping state and drop the first packet
302  NS_LOG_LOGIC ("Not in dropping state; decide if we have to enter the state and drop the first packet");
303  if (okToDrop)
304  {
305  // Drop the first packet and enter dropping state unless the queue is empty
306  NS_LOG_LOGIC ("Sojourn time goes above target, dropping the first packet " << item << " and entering the dropping state");
308 
309  item = GetInternalQueue (0)->Dequeue ();
310 
311  if (item)
312  {
313  NS_LOG_LOGIC ("Popped " << item);
314  NS_LOG_LOGIC ("Number packets remaining " << GetInternalQueue (0)->GetNPackets ());
315  NS_LOG_LOGIC ("Number bytes remaining " << GetInternalQueue (0)->GetNBytes ());
316  }
317 
318  OkToDrop (item, now);
319  m_dropping = true;
320  ++m_state3;
321  /*
322  * if min went above target close to when we last went below it
323  * assume that the drop rate that controlled the queue on the
324  * last cycle is a good starting point to control it now.
325  */
326  int delta = m_count - m_lastCount;
327  if (delta > 1 && CoDelTimeBefore (now - m_dropNext, 16 * Time2CoDel (m_interval)))
328  {
329  m_count = delta;
330  NewtonStep ();
331  }
332  else
333  {
334  m_count = 1;
336  }
338  NS_LOG_LOGIC ("Running ControlLaw for input now: " << (double)now);
339  m_dropNext = ControlLaw (now);
340  NS_LOG_LOGIC ("Scheduled next drop at " << (double)m_dropNext / 1000000 << " now " << (double)now / 1000000);
341  }
342  }
343  ++m_states;
344  return item;
345 }
346 
347 Time
349 {
350  return m_target;
351 }
352 
353 Time
355 {
356  return m_interval;
357 }
358 
359 uint32_t
361 {
362  return m_dropNext;
363 }
364 
365 bool
366 CoDelQueueDisc::CoDelTimeAfter (uint32_t a, uint32_t b)
367 {
368  return ((int)(a) - (int)(b) > 0);
369 }
370 
371 bool
372 CoDelQueueDisc::CoDelTimeAfterEq (uint32_t a, uint32_t b)
373 {
374  return ((int)(a) - (int)(b) >= 0);
375 }
376 
377 bool
378 CoDelQueueDisc::CoDelTimeBefore (uint32_t a, uint32_t b)
379 {
380  return ((int)(a) - (int)(b) < 0);
381 }
382 
383 bool
384 CoDelQueueDisc::CoDelTimeBeforeEq (uint32_t a, uint32_t b)
385 {
386  return ((int)(a) - (int)(b) <= 0);
387 }
388 
389 uint32_t
391 {
392  return static_cast<uint32_t>(t.GetNanoSeconds () >> CODEL_SHIFT);
393 }
394 
395 bool
397 {
398  NS_LOG_FUNCTION (this);
399  if (GetNQueueDiscClasses () > 0)
400  {
401  NS_LOG_ERROR ("CoDelQueueDisc cannot have classes");
402  return false;
403  }
404 
405  if (GetNPacketFilters () > 0)
406  {
407  NS_LOG_ERROR ("CoDelQueueDisc cannot have packet filters");
408  return false;
409  }
410 
411  if (GetNInternalQueues () == 0)
412  {
413  // add a DropTail queue
415  ("MaxSize", QueueSizeValue (GetMaxSize ())));
416  }
417 
418  if (GetNInternalQueues () != 1)
419  {
420  NS_LOG_ERROR ("CoDelQueueDisc needs 1 internal queue");
421  return false;
422  }
423 
424  return true;
425 }
426 
427 void
429 {
430  NS_LOG_FUNCTION (this);
431 }
432 
433 } // namespace ns3
434 
virtual void InitializeParams(void)
Initialize parameters (if any) before the first packet is enqueued.
Simulation virtual time values and global simulation resolution.
Definition: nstime.h:102
uint32_t GetNPackets(void) const
Get the number of packets stored by the queue disc.
Definition: queue-disc.cc:440
virtual bool DoEnqueue(Ptr< QueueDiscItem > item)
Add a packet to the queue.
Smart pointer class similar to boost::intrusive_ptr.
Definition: ptr.h:73
#define NS_LOG_FUNCTION(parameters)
If log level LOG_FUNCTION is enabled, this macro will output all input parameters separated by "...
static constexpr const char * TARGET_EXCEEDED_DROP
Sojourn time above target.
Class for representing queue sizes.
Definition: queue-size.h:94
void DropBeforeEnqueue(Ptr< const QueueDiscItem > item, const char *reason)
Perform the actions required when the queue disc is notified of a packet dropped before enqueue...
Definition: queue-disc.cc:712
#define NS_OBJECT_ENSURE_REGISTERED(type)
Register an Object subclass with the TypeId system.
Definition: object-base.h:45
Hold variables of type string.
Definition: string.h:41
uint32_t GetDropNext(void)
Get the time for next packet drop while in the dropping state.
TracedValue< uint32_t > m_count
Number of packets dropped since entering drop state.
QueueSize GetCurrentSize(void)
Get the current size of the queue disc in bytes, if operating in bytes mode, or packets, otherwise.
Definition: queue-disc.cc:523
static constexpr const char * OVERLIMIT_DROP
Overlimit dropped packet.
virtual bool CheckConfig(void)
Check whether the current configuration is correct.
Time GetInterval(void)
Get the interval.
#define NS_LOG_COMPONENT_DEFINE(name)
Define a Log component with a specific name.
Definition: log.h:202
double ToDouble(enum Unit unit) const
Get the Time value expressed in a particular unit.
Definition: nstime.h:505
bool CoDelTimeAfterEq(uint32_t a, uint32_t b)
Check if CoDel time a is successive or equal to b.
uint32_t GetNBytes(void) const
Get the amount of bytes stored by the queue disc.
Definition: queue-disc.cc:447
#define NS_LOG_INFO(msg)
Use NS_LOG to output a message of level LOG_INFO.
Definition: log.h:278
QueueDisc is an abstract base class providing the interface and implementing the operations common to...
Definition: queue-disc.h:182
uint32_t ControlLaw(uint32_t t)
Determine the time for next drop CoDel control law is t + m_interval/sqrt(m_count).
bool CoDelTimeAfter(uint32_t a, uint32_t b)
Check if CoDel time a is successive to b.
Ptr< const TraceSourceAccessor > MakeTraceSourceAccessor(T a)
Create a TraceSourceAccessor which will control access to the underlying trace source.
Ptr< const AttributeChecker > MakeTimeChecker(const Time min, const Time max)
Helper to make a Time checker with bounded range.
Definition: time.cc:446
TracedValue< bool > m_dropping
True if in dropping state.
bool OkToDrop(Ptr< QueueDiscItem > item, uint32_t now)
Determine whether a packet is OK to be dropped.
void AddInternalQueue(Ptr< InternalQueue > queue)
Add an internal queue to the tail of the list of queues.
Definition: queue-disc.cc:567
Ptr< T > CreateObjectWithAttributes(std::string n1="", const AttributeValue &v1=EmptyAttributeValue(), std::string n2="", const AttributeValue &v2=EmptyAttributeValue(), std::string n3="", const AttributeValue &v3=EmptyAttributeValue(), std::string n4="", const AttributeValue &v4=EmptyAttributeValue(), std::string n5="", const AttributeValue &v5=EmptyAttributeValue(), std::string n6="", const AttributeValue &v6=EmptyAttributeValue(), std::string n7="", const AttributeValue &v7=EmptyAttributeValue(), std::string n8="", const AttributeValue &v8=EmptyAttributeValue(), std::string n9="", const AttributeValue &v9=EmptyAttributeValue())
Allocate an Object on the heap and initialize with a set of attributes.
uint32_t m_states
Total number of times we are in state 1, state 2, or state 3.
uint32_t m_firstAboveTime
Time to declare sojourn time above target.
uint32_t m_state2
Number of times we perform next drop while in dropping state.
bool CoDelTimeBefore(uint32_t a, uint32_t b)
Check if CoDel time a is preceding b.
Ptr< InternalQueue > GetInternalQueue(std::size_t i) const
Get the i-th internal queue.
Definition: queue-disc.cc:587
Hold an unsigned integer type.
Definition: uinteger.h:44
Time m_target
5 ms target queue delay
CoDelQueueDisc()
CoDelQueueDisc Constructor.
Ptr< const AttributeAccessor > MakeQueueSizeAccessor(T1 a1)
Definition: queue-size.h:221
TracedValue< uint32_t > m_lastCount
Last number of packets dropped since entering drop state.
Time m_interval
100 ms sliding minimum time window width
Introspection did not find any typical Config paths.
Ptr< const AttributeChecker > MakeQueueSizeChecker(void)
Definition: queue-size.cc:29
virtual Ptr< QueueDiscItem > DoDequeue(void)
Remove a packet from queue based on the current state If we are in dropping state, check if we could leave the dropping state or if we should perform next drop If we are not currently in dropping state, check if we need to enter the state and drop the first packet.
Every class exported by the ns3 library is enclosed in the ns3 namespace.
uint16_t m_recInvSqrt
Reciprocal inverse square root.
int64_t GetNanoSeconds(void) const
Get an approximation of the time stored in this instance in the indicated unit.
Definition: nstime.h:367
std::size_t GetNQueueDiscClasses(void) const
Get the number of queue disc classes.
Definition: queue-disc.cc:652
#define REC_INV_SQRT_SHIFT
Time GetTarget(void)
Get the target queue delay.
#define DEFAULT_CODEL_LIMIT
void NewtonStep(void)
Calculate the reciprocal square root of m_count by using Newton&#39;s method http://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Iterative_methods_for_reciprocal_square_roots m_recInvSqrt (new) = (m_recInvSqrt (old) / 2) * (3 - m_count * m_recInvSqrt^2)
A CoDel packet queue disc.
static const int CODEL_SHIFT
Number of bits discarded from the time representation.
Ptr< const AttributeAccessor > MakeTimeAccessor(T1 a1)
Create an AttributeAccessor for a class data member, or a lone class get functor or set method...
Definition: nstime.h:1077
static Time Now(void)
Return the current simulation virtual time.
Definition: simulator.cc:249
NS_LOG_LOGIC("Net device "<< nd<< " is not bridged")
QueueSize GetMaxSize(void) const
Get the maximum size of the queue disc.
Definition: queue-disc.cc:454
uint32_t m_state3
Number of times we enter drop state and drop the fist packet.
uint32_t Time2CoDel(Time t)
Return the unsigned 32-bit integer representation of the input Time object.
QueueDiscSizePolicy
Enumeration of the available policies to handle the queue disc size.
Definition: queue-disc.h:104
static TypeId GetTypeId(void)
Get the type ID.
bool CoDelTimeBeforeEq(uint32_t a, uint32_t b)
Check if CoDel time a is preceding or equal to b.
Used by queue discs with single internal queue.
Definition: queue-disc.h:106
uint32_t m_minBytes
Minimum bytes in queue to allow a packet drop.
static uint32_t ReciprocalDivide(uint32_t A, uint32_t R)
Performs a reciprocal divide, similar to the Linux kernel reciprocal_divide function.
static uint32_t CoDelGetTime(void)
Returns the current time translated in CoDel time representation.
std::size_t GetNPacketFilters(void) const
Get the number of packet filters.
Definition: queue-disc.cc:614
bool SetMaxSize(QueueSize size)
Set the maximum size of the queue disc.
Definition: queue-disc.cc:482
void DropAfterDequeue(Ptr< const QueueDiscItem > item, const char *reason)
Perform the actions required when the queue disc is notified of a packet dropped after dequeue...
Definition: queue-disc.cc:751
uint32_t m_state1
Number of times packet sojourn goes above target for interval.
#define NS_LOG_ERROR(msg)
Use NS_LOG to output a message of level LOG_ERROR.
Definition: log.h:254
millisecond
Definition: nstime.h:115
Ptr< const AttributeAccessor > MakeUintegerAccessor(T1 a1)
Create an AttributeAccessor for a class data member, or a lone class get functor or set method...
Definition: uinteger.h:45
Use number of bytes for queue size.
Definition: queue-size.h:45
a unique identifier for an interface.
Definition: type-id.h:58
TypeId SetParent(TypeId tid)
Set the parent TypeId.
Definition: type-id.cc:915
TracedValue< uint32_t > m_dropNext
Time to drop next packet.
std::size_t GetNInternalQueues(void) const
Get the number of internal queues.
Definition: queue-disc.cc:594