OLD | NEW |
(Empty) | |
| 1 /* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */ |
| 2 /* |
| 3 * Copyright (c) 2009 MIRKO BANCHI |
| 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 * Author: Mirko Banchi <mk.banchi@gmail.com> |
| 19 */ |
| 20 #include "ns3/test.h" |
| 21 #include "ns3/log.h" |
| 22 #include "qos-utils.h" |
| 23 #include <list> |
| 24 |
| 25 using namespace ns3; |
| 26 |
| 27 NS_LOG_COMPONENT_DEFINE ("BlockAckTest"); |
| 28 /** |
| 29 * This simple test verifies the correctness of buffering for packets received |
| 30 * under block ack. In order to completely understand this example is important
to cite |
| 31 * section 9.10.3 in IEEE802.11 standard: |
| 32 * |
| 33 * "[...] The sequence number space is considered divided into two parts, one of
which |
| 34 * is “old” and one of which is “new” by means of a boundary created by adding h
alf the |
| 35 * sequence number range to the current start of receive window (modulo 2^12)." |
| 36 */ |
| 37 //------------------------------------------------------------------------------
------- |
| 38 |
| 39 /* ----- = old packets |
| 40 * +++++ = new packets |
| 41 *·· |
| 42 * CASE A: startSeq < endSeq·· |
| 43 * - - + |
| 44 * initial buffer state: 0 16 56000 |
| 45 * |
| 46 *· |
| 47 * 0 4095 |
| 48 * |------|++++++++++++++++|-----| |
| 49 * ^ ^ |
| 50 * | startSeq | endSeq = 4000 |
| 51 * |
| 52 * first received packet's sequence control = 64016 (seqNum = 4001, fragNum = 0
) - |
| 53 * second received packet's sequence control = 63984 (seqNum = 3999, fragNum =
0) + |
| 54 * 4001 is older seq number so this packet should be inserted at the buffer's b
egin. |
| 55 * 3999 is previous element of older of new packets: it should be inserted at t
he end of buffer. |
| 56 *·· |
| 57 * expected buffer state: 64016 0 16 56000 63984 |
| 58 * |
| 59 */ |
| 60 class PacketBufferingCaseA : public TestCase |
| 61 { |
| 62 public: |
| 63 PacketBufferingCaseA (); |
| 64 virtual ~PacketBufferingCaseA (); |
| 65 private: |
| 66 virtual bool DoRun (void); |
| 67 std::list<uint16_t> m_expectedBuffer; |
| 68 }; |
| 69 |
| 70 PacketBufferingCaseA::PacketBufferingCaseA () |
| 71 : TestCase ("Check correct order of buffering when startSequence < endSeq") |
| 72 { |
| 73 m_expectedBuffer.push_back (64016); |
| 74 m_expectedBuffer.push_back (0); |
| 75 m_expectedBuffer.push_back (16); |
| 76 m_expectedBuffer.push_back (56000); |
| 77 m_expectedBuffer.push_back (63984); |
| 78 } |
| 79 |
| 80 PacketBufferingCaseA::~PacketBufferingCaseA () |
| 81 {} |
| 82 |
| 83 bool |
| 84 PacketBufferingCaseA::DoRun (void) |
| 85 { |
| 86 std::list<uint16_t> m_buffer; |
| 87 std::list<uint16_t>::iterator i,j; |
| 88 m_buffer.push_back (0); |
| 89 m_buffer.push_back (16); |
| 90 m_buffer.push_back (56000); |
| 91 |
| 92 uint16_t endSeq = 4000; |
| 93 ·· |
| 94 uint16_t receivedSeq = 4001 * 16; |
| 95 uint32_t mappedSeq = QosUtilsMapSeqControlToUniqueInteger (receivedSeq, endSeq
); |
| 96 for (i = m_buffer.begin (); i != m_buffer.end () && QosUtilsMapSeqControlToUni
queInteger ((*i), endSeq) < mappedSeq; i++); |
| 97 { |
| 98 m_buffer.insert (i, receivedSeq); |
| 99 } |
| 100 ·· |
| 101 receivedSeq = 3999 * 16; |
| 102 mappedSeq = QosUtilsMapSeqControlToUniqueInteger (receivedSeq, endSeq); |
| 103 for (i = m_buffer.begin (); i != m_buffer.end () && QosUtilsMapSeqControlToUni
queInteger ((*i), endSeq) < mappedSeq; i++); |
| 104 { |
| 105 m_buffer.insert (i, receivedSeq); |
| 106 } |
| 107 |
| 108 for (i = m_buffer.begin (), j = m_expectedBuffer.begin (); i != m_buffer.end (
); i++, j++) |
| 109 { |
| 110 NS_TEST_EXPECT_MSG_EQ (*i, *j, "error in buffer order"); |
| 111 } |
| 112 return GetErrorStatus (); |
| 113 } |
| 114 |
| 115 /* ----- = old packets |
| 116 * +++++ = new packets |
| 117 *·· |
| 118 * CASE B: startSeq > endSeq |
| 119 * - + + |
| 120 * initial buffer state: 256 64000 16 |
| 121 * |
| 122 * |
| 123 * 0 4095 |
| 124 * |++++++|----------------|++++++| |
| 125 * ^ ^ |
| 126 * | endSeq = 10 | startSeq |
| 127 * |
| 128 * first received packet's sequence control = 240 (seqNum = 15, fragNum = 0) - |
| 129 * second received packet's sequence control = 241 (seqNum = 15, fragNum = 1) - |
| 130 * third received packet's sequence control = 64800 (seqNum = 4050, fragNum = 0
) + |
| 131 * 240 is an old packet should be inserted at the buffer's begin. |
| 132 * 241 is an old packet: second segment of the above packet. |
| 133 * 4050 is a new packet: it should be inserted between 64000 and 16. |
| 134 *·· |
| 135 * expected buffer state: 240 241 256 64000 64800 16 |
| 136 * |
| 137 */ |
| 138 class PacketBufferingCaseB : public TestCase |
| 139 { |
| 140 public: |
| 141 PacketBufferingCaseB (); |
| 142 virtual ~PacketBufferingCaseB (); |
| 143 private: |
| 144 virtual bool DoRun (void); |
| 145 std::list<uint16_t> m_expectedBuffer; |
| 146 }; |
| 147 |
| 148 PacketBufferingCaseB::PacketBufferingCaseB () |
| 149 : TestCase ("Check correct order of buffering when startSequence > endSeq") |
| 150 { |
| 151 m_expectedBuffer.push_back (240); |
| 152 m_expectedBuffer.push_back (241); |
| 153 m_expectedBuffer.push_back (256); |
| 154 m_expectedBuffer.push_back (64000); |
| 155 m_expectedBuffer.push_back (64800); |
| 156 m_expectedBuffer.push_back (16); |
| 157 } |
| 158 |
| 159 PacketBufferingCaseB::~PacketBufferingCaseB () |
| 160 {} |
| 161 |
| 162 bool |
| 163 PacketBufferingCaseB::DoRun (void) |
| 164 { |
| 165 std::list<uint16_t> m_buffer; |
| 166 std::list<uint16_t>::iterator i,j; |
| 167 m_buffer.push_back (256); |
| 168 m_buffer.push_back (64000); |
| 169 m_buffer.push_back (16); |
| 170 |
| 171 uint16_t endSeq = 10; |
| 172 |
| 173 uint16_t receivedSeq = 15 * 16; |
| 174 uint32_t mappedSeq = QosUtilsMapSeqControlToUniqueInteger (receivedSeq, endSeq
); |
| 175 for (i = m_buffer.begin (); i != m_buffer.end () && QosUtilsMapSeqControlToUni
queInteger ((*i), endSeq) < mappedSeq; i++); |
| 176 { |
| 177 m_buffer.insert (i, receivedSeq); |
| 178 } |
| 179 |
| 180 receivedSeq = 15 * 16 + 1; |
| 181 mappedSeq = QosUtilsMapSeqControlToUniqueInteger (receivedSeq, endSeq); |
| 182 for (i = m_buffer.begin (); i != m_buffer.end () && QosUtilsMapSeqControlToUni
queInteger ((*i), endSeq) < mappedSeq; i++); |
| 183 { |
| 184 m_buffer.insert (i, receivedSeq); |
| 185 } |
| 186 |
| 187 receivedSeq = 4050 * 16; |
| 188 mappedSeq = QosUtilsMapSeqControlToUniqueInteger (receivedSeq, endSeq); |
| 189 for (i = m_buffer.begin (); i != m_buffer.end () && QosUtilsMapSeqControlToUni
queInteger ((*i), endSeq) < mappedSeq; i++); |
| 190 { |
| 191 m_buffer.insert (i, receivedSeq); |
| 192 } |
| 193 |
| 194 for (i = m_buffer.begin (), j = m_expectedBuffer.begin (); i != m_buffer.end (
); i++, j++) |
| 195 { |
| 196 NS_TEST_EXPECT_MSG_EQ (*i, *j, "error in buffer order"); |
| 197 } |
| 198 return GetErrorStatus (); |
| 199 } |
| 200 |
| 201 class BlockAckTestSuite : public TestSuite |
| 202 { |
| 203 public: |
| 204 BlockAckTestSuite (); |
| 205 }; |
| 206 |
| 207 BlockAckTestSuite::BlockAckTestSuite () |
| 208 : TestSuite ("wifi-block-ack", UNIT) |
| 209 { |
| 210 AddTestCase (new PacketBufferingCaseA); |
| 211 AddTestCase (new PacketBufferingCaseB); |
| 212 } |
| 213 |
| 214 BlockAckTestSuite g_blockAckTestSuite; |
OLD | NEW |