blob: bbb8e868cc2869605c6ae614fea36b700dc138c2 [file] [log] [blame]
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -08001/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
2/*
3 * Copyright (c) 2011-2012 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-grid-topo-plugin.cc
21#include "ns3/core-module.h"
22#include "ns3/network-module.h"
23#include "ns3/ndnSIM-module.h"
24
25using namespace ns3;
26
27/**
28 * This scenario simulates a grid topology (using topology reader module)
29 *
30 * (consumer) -- ( ) ----- ( )
31 * | | |
32 * ( ) ------ ( ) ----- ( )
33 * | | |
34 * ( ) ------ ( ) -- (producer)
35 *
36 * All links are 1Mbps with propagation 10ms delay.
37 *
38 * FIB is populated using NdnGlobalRoutingHelper.
39 *
40 * Consumer requests data from producer with frequency 10 interests per second
41 * (interests contain constantly increasing sequence number).
42 *
43 * For every received interest, producer replies with a data packet, containing
44 * 1024 bytes of virtual payload.
45 *
46 * To run scenario and see what is happening, use the following command:
47 *
48 * NS_LOG=ndn.Consumer:ndn.Producer ./waf --run=ndn-grid-topo-plugin
49 */
50
51int
52main (int argc, char *argv[])
53{
54 CommandLine cmd;
55 cmd.Parse (argc, argv);
56
57 AnnotatedTopologyReader topologyReader ("", 25);
Alexander Afanasyeve095f0f2012-11-21 17:43:32 -080058 topologyReader.SetFileName ("src/ndnSIM/examples/topologies/topo-grid-3x3.txt");
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080059 topologyReader.Read ();
60
Alexander Afanasyev9fb2e3d2013-03-30 21:11:07 -070061 // Install NDN stack on all nodes
62 ndn::StackHelper ndnHelper;
63 ndnHelper.SetForwardingStrategy ("ns3::ndn::fw::BestRoute");
64 ndnHelper.InstallAll ();
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080065
66 // Installing global routing interface on all nodes
Alexander Afanasyev9fb2e3d2013-03-30 21:11:07 -070067 ndn::GlobalRoutingHelper ndnGlobalRoutingHelper;
68 ndnGlobalRoutingHelper.InstallAll ();
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080069
70 // Getting containers for the consumer/producer
71 Ptr<Node> producer = Names::Find<Node> ("Node8");
72 NodeContainer consumerNodes;
73 consumerNodes.Add (Names::Find<Node> ("Node0"));
74
Alexander Afanasyev9fb2e3d2013-03-30 21:11:07 -070075 // Install NDN applications
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080076 std::string prefix = "/prefix";
77
78 ndn::AppHelper consumerHelper ("ns3::ndn::ConsumerCbr");
79 consumerHelper.SetPrefix (prefix);
80 consumerHelper.SetAttribute ("Frequency", StringValue ("100")); // 100 interests a second
81 consumerHelper.Install (consumerNodes);
82
83 ndn::AppHelper producerHelper ("ns3::ndn::Producer");
84 producerHelper.SetPrefix (prefix);
85 producerHelper.SetAttribute ("PayloadSize", StringValue("1024"));
86 producerHelper.Install (producer);
87
88 // Add /prefix origins to ndn::GlobalRouter
Alexander Afanasyev9fb2e3d2013-03-30 21:11:07 -070089 ndnGlobalRoutingHelper.AddOrigins (prefix, producer);
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080090
91 // Calculate and install FIBs
Alexander Afanasyev9fb2e3d2013-03-30 21:11:07 -070092 ndn::GlobalRoutingHelper::CalculateRoutes ();
Alexander Afanasyevaa1c4c32012-11-21 16:17:03 -080093
94 Simulator::Stop (Seconds (20.0));
95
96 Simulator::Run ();
97 Simulator::Destroy ();
98
99 return 0;
100}