Alexander Afanasyev | b5e77d8 | 2013-04-10 15:55:26 -0700 | [diff] [blame] | 1 | /* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /* |
| 3 | * Copyright (c) 2012-2013 University of California, Los Angeles |
| 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: Alexander Afanasyev <alexander.afanasyev@ucla.edu> |
| 19 | */ |
| 20 | // ndn-simple-with-pit-count-stats.cc |
| 21 | #include "ns3/core-module.h" |
| 22 | #include "ns3/network-module.h" |
| 23 | #include "ns3/point-to-point-module.h" |
| 24 | #include "ns3/ndnSIM-module.h" |
| 25 | |
| 26 | using namespace ns3; |
| 27 | |
| 28 | /** |
| 29 | * This scenario simulates a very simple network topology: |
| 30 | * |
| 31 | * |
| 32 | * +----------+ 1Mbps +--------+ 1Mbps +----------+ |
| 33 | * | consumer | <------------> | router | <------------> | producer | |
| 34 | * +----------+ 10ms +--------+ 10ms +----------+ |
| 35 | * |
| 36 | * |
| 37 | * Consumer requests data from producer with frequency 10 interests per second |
| 38 | * (interests contain constantly increasing sequence number). |
| 39 | * |
| 40 | * For every received interest, producer replies with a data packet, containing |
| 41 | * 1024 bytes of virtual payload. |
| 42 | * |
| 43 | * To run scenario and see what is happening, use the following command: |
| 44 | * |
| 45 | * ./waf --run=ndn-simple-with-pit-count-stats |
| 46 | */ |
| 47 | |
| 48 | void |
| 49 | PeriodicStatsPrinter (Ptr<Node> node, Time next) |
| 50 | { |
| 51 | Ptr<ndn::Pit> pit = node->GetObject<ndn::Pit> (); |
| 52 | |
| 53 | std::cout << Simulator::Now ().ToDouble (Time::S) << "\t" |
| 54 | << node->GetId () << "\t" |
| 55 | << Names::FindName (node) << "\t" |
| 56 | << pit->GetSize () << "\n"; |
| 57 | |
| 58 | Simulator::Schedule (next, PeriodicStatsPrinter, node, next); |
| 59 | } |
| 60 | |
| 61 | int |
| 62 | main (int argc, char *argv[]) |
| 63 | { |
| 64 | // setting default parameters for PointToPoint links and channels |
| 65 | Config::SetDefault ("ns3::PointToPointNetDevice::DataRate", StringValue ("1Mbps")); |
| 66 | Config::SetDefault ("ns3::PointToPointChannel::Delay", StringValue ("10ms")); |
| 67 | Config::SetDefault ("ns3::DropTailQueue::MaxPackets", StringValue ("20")); |
| 68 | |
| 69 | // Read optional command-line parameters (e.g., enable visualizer with ./waf --run=<> --visualize |
| 70 | CommandLine cmd; |
| 71 | cmd.Parse (argc, argv); |
| 72 | |
| 73 | // Creating nodes |
| 74 | NodeContainer nodes; |
| 75 | nodes.Create (3); |
| 76 | |
| 77 | // Connecting nodes using two links |
| 78 | PointToPointHelper p2p; |
| 79 | p2p.Install (nodes.Get (0), nodes.Get (1)); |
| 80 | p2p.Install (nodes.Get (1), nodes.Get (2)); |
| 81 | |
| 82 | // see more http://www.nsnam.org/doxygen/classns3_1_1_names.html |
| 83 | Names::Add ("consumer", nodes.Get (0)); |
| 84 | Names::Add ("router", nodes.Get (1)); |
| 85 | Names::Add ("producer", nodes.Get (2)); |
| 86 | |
| 87 | // Install CCNx stack on all nodes |
| 88 | ndn::StackHelper ndnHelper; |
| 89 | ndnHelper.SetDefaultRoutes (true); |
| 90 | ndnHelper.SetPit ("ns3::ndn::pit::Persistent::AggregateStats"); |
| 91 | ndnHelper.InstallAll (); |
| 92 | |
| 93 | // set up periodic PIT stats printer on node 1 |
| 94 | std::cout << "Time" << "\t" |
| 95 | << "NodeId" << "\t" |
| 96 | << "NodeName" << "\t" |
| 97 | << "Inserts" << "\t" |
| 98 | << "Lookups" << "\t" |
| 99 | << "NumberOfPitEntries" << "\n"; |
| 100 | Simulator::Schedule (Seconds (1), PeriodicStatsPrinter, nodes.Get (0), Seconds (1)); |
| 101 | Simulator::Schedule (Seconds (1), PeriodicStatsPrinter, nodes.Get (1), Seconds (1)); |
| 102 | Simulator::Schedule (Seconds (1), PeriodicStatsPrinter, nodes.Get (2), Seconds (1)); |
| 103 | |
| 104 | // Installing applications |
| 105 | |
| 106 | // Consumer |
| 107 | ndn::AppHelper consumerHelper ("ns3::ndn::ConsumerCbr"); |
| 108 | // Consumer will request /prefix/0, /prefix/1, ... |
| 109 | consumerHelper.SetPrefix ("/prefix"); |
| 110 | consumerHelper.SetAttribute ("Frequency", StringValue ("10")); // 10 interests a second |
| 111 | consumerHelper.Install (nodes.Get (0)); // first node |
| 112 | |
| 113 | // Producer |
| 114 | ndn::AppHelper producerHelper ("ns3::ndn::Producer"); |
| 115 | // Producer will reply to all requests starting with /prefix |
| 116 | producerHelper.SetPrefix ("/prefix"); |
| 117 | producerHelper.SetAttribute ("PayloadSize", StringValue("1024")); |
| 118 | producerHelper.Install (nodes.Get (2)); // last node |
| 119 | |
| 120 | Simulator::Stop (Seconds (20.0)); |
| 121 | |
| 122 | Simulator::Run (); |
| 123 | Simulator::Destroy (); |
| 124 | |
| 125 | return 0; |
| 126 | } |