TMBoost Class Reference

#include <TMBoost.h>

Inheritance diagram for TMBoost:

List of all members.

Public Member Functions
	TMBoost ()
virtual	~TMBoost ()
virtual void	handleUpdate (TMPacket *pkt)
virtual void	write2gml (string fname)
virtual void	handleLinkStateUpdate (LSMPacket *pkt)
virtual void	calcFIDsFromTM_2_Nodes ()
virtual void	handleMetaDataUpdate (MetaDataPacket *pkt)
	DUMMY.
Protected Member Functions
virtual void	initialize (int stage)
virtual int	numInitStages () const
virtual void	handleMessage (cMessage *msg)
virtual void	finish ()
virtual void	initializeGraph ()
virtual Vertex	getVertex (string nodeid)
virtual bool	vertexExists (string nodeid)
virtual Edge	getEdge (string lid, bool &found)
virtual string	getFIDFromBoostResult_rec (Vertex src, Vertex dst, vector< Vertex > pre)
Protected Attributes
GraphWrapper< VertexProp, EdgeProp >	g
Private Types
typedef GraphWrapper < VertexProp, EdgeProp > ::Vertex	Vertex
typedef GraphWrapper < VertexProp, EdgeProp >::Edge	Edge
typedef GraphWrapper < VertexProp, EdgeProp > ::EdgePair	EdgePair
typedef GraphWrapper < VertexProp, EdgeProp > ::Graph	Graph

---

Detailed Description

A Dummy Boost Topology Manager Application. Assigns all the subscribers to the first publisher available.

---

Member Typedef Documentation

typedef GraphWrapper<VertexProp,EdgeProp>::Edge TMBoost::Edge [private]

typedef GraphWrapper<VertexProp,EdgeProp>::EdgePair TMBoost::EdgePair [private]

typedef GraphWrapper<VertexProp,EdgeProp>::Graph TMBoost::Graph [private]

typedef GraphWrapper<VertexProp,EdgeProp>::Vertex TMBoost::Vertex [private]

---

Constructor & Destructor Documentation

TMBoost::TMBoost

(

)

Boost Topology Manager Interface class constructor.

{

}

TMBoost::~TMBoost

(

)

[virtual]

Boost Topology Manager Interface class destructor.

{

}

---

Member Function Documentation

void TMBoost::calcFIDsFromTM_2_Nodes

(

)

[virtual]

Calculates the FID from the Topology Manager to every node of the network according to the shortest path.

                                    {
  // predecessor_map
  std::vector<Vertex> p(g.getVertexCount());
  // distance_map
  std::vector<double> d(g.getVertexCount());

  Vertex src = getVertex(myNodeId);

  //XXX::The source is not the Topology manager in the simulation! Be carefull!!!
  dijkstra_shortest_paths(g.getGraph(), src, predecessor_map(&p[0]).distance_map(&d[0]));
  // For all nodes - update!
  for (TMtoNodes::iterator it = tm2nodes.begin(); it!=tm2nodes.end(); ++it){
    
    Vertex dst = getVertex(it->first);
    it->second = lidOR(getFIDFromBoostResult_rec(src, dst, p), getNodeInternalLID(it->first));
  }
  // WoW Easier than it sounds!
}

void TMBoost::finish

(

)

[protected, virtual]

The finish function of the Boost Topology Manager.

Reimplemented from TMInterface.

{
        TMInterface::finish();

        //Clear Graph
        g.clear();
}

TMBoost::Edge TMBoost::getEdge	(	string	lid,
		bool &	found
	)			[protected, virtual]

Get an edge based on the LID...

                                                    {
        GraphWrapper<VertexProp,EdgeProp>::edge_iterator ei, eend;
        for (tie(ei, eend) = g.getEdges(); ei != eend; ++ei) {
                if (g.properties(*ei).lid.compare(lid)==0) {
                        found=true;
                        return *ei;
                }
        }
        found=false;
        // ?
        return Edge();
}

string TMBoost::getFIDFromBoostResult_rec	(	Vertex	src,
		Vertex	dst,
		vector< Vertex >	pre
	)			[protected, virtual]

Visit the predecessor map and calculate FID for a single destination/sub. RECURSIVE

                                                                                   {
 
        Vertex pre_v = pre[dst];

        // Terminal Condition! Add node it
        if (dst == src) return "";

        // Get the edge for pre_v - dst. NOT THE OPPOSITE!
        std::pair<Edge, bool> edge_res= g.getEdge(pre_v,dst);
        if (edge_res.second == false){
                opp_error("*** NO EDGE FOR pre_v - dst: Check topology initializer, THIS SHOULD NEVER HAPPEN");
        return "";
        }

        Edge e = edge_res.first;

        // Get all the previous recursively
        string newfid=getFIDFromBoostResult_rec(src,pre_v,pre);

        newfid=lidOR(newfid,g.properties(e).lid);

        return newfid;
}

TMBoost::Vertex TMBoost::getVertex

(

string

nodeid

)

[protected, virtual]

Get a vertex by nodeid, it returns UINT_MAX in case that the vertex is not found!

                                             {

        GraphWrapper<VertexProp,EdgeProp>::vertex_iterator vi, vend;
        for (tie(vi, vend) = g.getVertices(); vi != vend; ++vi) {
          if (g.properties(*vi).nodeid.compare(nodeid)==0) return *vi;
        }

        return UINT_MAX;

}

void TMBoost::handleLinkStateUpdate

(

LSMPacket *

pkt

)

[virtual]

Handles the packets carrying link state status information. -- DUMMY

Implements TMInterface.

                                                 {
  ev << " - TMBoost::handleLinkStateUpdate" << endl;
  
  int replen = pkt->getRepLen();
  bool found=false;
  for (int i=0; i<replen; i++){
    Edge e = getEdge(pkt->getLid(i),found);
    if (!found){
      cerr<<"TMBoost: LID NOT FOUND!: "<<pkt->getLid(i)<<endl;
      continue;
    }
    g.properties(e).status = pkt->getLinkStatus(i);
  }
  
  //write2gml("/tmp/top.graphml");
}

void TMBoost::handleMessage

(

cMessage *

msg

)

[protected, virtual]

Handles the messages sent by the Information Item Table module, as well as self messages.

Reimplemented from TMInterface.

                                         {
        ev << "Message received!!!" << endl;

        //If this message is a Topology manager message
        if(TMPacket *tmmsg=dynamic_cast<TMPacket *>(msg)) {
                ev << "It's a link status update from " << tmmsg->getSenderModule()->getName() << endl;
                handleUpdate(tmmsg);
        }
        else if(LSMPacket *lsmmsg=dynamic_cast<LSMPacket *>(msg)) {
                ev << "It's a link status update from " << lsmmsg->getSenderModule()->getName() << endl;
                handleLinkStateUpdate(lsmmsg);
        }

        delete msg;
}

virtual void TMBoost::handleMetaDataUpdate

(

MetaDataPacket *

pkt

)

[inline, virtual]

DUMMY.

Implements TMInterface.

{};

void TMBoost::handleUpdate

(

TMPacket *

pkt

)

[virtual]

Handle packet function for Click Modular Router. Called by the handleMessage() function of the Omnet++ module.

Implements TMInterface.

                                       {
  
  ev << " - TMBoost::handleUpdate" << endl;
  
  //Update the Information Items in the Topology Manager
  updateInformationItems(pkt);

  // Search all the IIems and run alg. for the changed
  for (InfoItems::iterator it = ii.begin(); it!=ii.end(); ++it){
    
    ev << "   - Checking: " << it->first << " status: " << it->second.ii_updated << endl;
    // Not changed... continue
    if (!it->second.ii_updated) continue;

    IIDetails  *itd = &it->second;
    // Check that we have publishers
    if (itd->pubs.size() == 0){
      ev << "   - SHIT: No Publishers for item " << it->first << "???" << endl;
      ev << "    - What should i do??? " << endl;
      itd->ii_updated = false;
      //itd->fid_updated = false;
      continue;
    }
    
    // Check that we have subscribers
    if (itd->subs.size() == 0){
      ev << "   - No Subscribers for item " << it->first << endl;
      // Cancel the transmission
      itd->ii_updated = false;
      //itd->fid_updated = true;
      // Clear fids for all publishers of the Information Item
          for(uint i=0;i<itd->pubs.size();i++) {
                  itd->pubs[i].fid = "";
                  itd->pubs[i].fid_updated = true;
          }
      continue;
    }
    
    // Here we take the 1st publisher! Optimazation could be done!
    Vertex src = getVertex(itd->pubs[0].pub);
    
    // Sanity Check
    if (src == UINT_MAX){
      opp_error("*** What THE HELL: Check your topology parser, NO VERTEX FOR PUBLISHER ??? ");
      continue;
    }
    
    // Yay... Do the job...
    // predecessor_map
    std::vector<Vertex> p(g.getVertexCount());
    // distance_map
    std::vector<double> d(g.getVertexCount());

    // THE JOB
    ev << "   - Going for item " << it->first << " published from vertex " << src << endl;
    dijkstra_shortest_paths(g.getGraph(), src, predecessor_map(&p[0]).distance_map(&d[0]));
    
    // Clear fids for all publishers of the Information Item
        for(uint i=0;i<itd->pubs.size();i++)
          itd->pubs[i].fid = "";
    
    // Make the fid for ALL subscribers
    for (uint i=0; i<itd->subs.size(); ++i){
      Vertex dst = getVertex(itd->subs[i]);
      // Get FID src to dst
      itd->pubs[0].fid = lidOR(itd->pubs[0].fid, getFIDFromBoostResult_rec(src, dst, p));
      // Add the dst node internal LID! is needed
      itd->pubs[0].fid = lidOR(itd->pubs[0].fid, getNodeInternalLID(itd->subs[i]));

      //Update the fid_update flag for the selected publisher
      itd->pubs[0].fid_updated = true;
    }
    
    // Update Flags
    //itd->fid_updated = true; // NEWFID
    itd->ii_updated = false; // UNMODIFIED SINCE LAST RUN
    
    ev << "   - FID Found " << src << ": " << it->second.pubs[0].fid << endl;
    
  }
  
  // Here we should be done! Update all the publishers with new FIDs
  updateAllThePublishers();
  
}

void TMBoost::initialize

(

int

stage

)

[protected, virtual]

Initialization function

Reimplemented from TMInterface.

                                  {

        TMInterface::initialize(stage);

        //The TMInterace Initialized at stage 2. To be safe
        //let's initialize on stage later.
        if(stage==3) {
                // At this stage the Topology Manager configuration is fed to Boost++
                initializeGraph();
                //write2gml("InitialGraph.gml");
        }
}

void TMBoost::initializeGraph

(

)

[protected, virtual]

Initialize BGraph from topology

                             {
  
        for (uint i=0; i<topology.size(); ++i){
                // Check n Add source
                Vertex src = getVertex(topology[i].src);
                if (src == UINT_MAX){
                        VertexProp vp;
                        vp.nodeid=topology[i].src;
                        src=g.addVertex(vp);
                }

                // Check n Add destination
                Vertex dst = getVertex(topology[i].dst);
                if (dst == UINT_MAX){
                        VertexProp vp;
                        vp.nodeid=topology[i].dst;
                        dst=g.addVertex(vp);
                }

                // NOTE: Avoid LOOPs !!
                if (dst==src) continue;

                // Add edge
                EdgeProp ep;
                ep.weight = 1; // FIXME:TODO Initial weight!
                ep.lid = topology[i].lid;
                g.addEdge(src,dst,ep);
        }
}

virtual int TMBoost::numInitStages

(

)

const [inline, protected, virtual]

Returns the number of initialization stages.

Reimplemented from TMInterface.

{return 5;};

bool TMBoost::vertexExists

(

string

nodeid

)

[protected, virtual]

Check that a vertex exists by nodeid

                                       {
        return (!getVertex(nodeid) == UINT_MAX);
}

void TMBoost::write2gml

(

string

fname

)

[virtual]

Extracts the network graph in a xml format, proving the ability of monitoring the network on runtime.

                                   {
        // Chinese Language with mixed Greek follows!
        std::ofstream fout(fname.c_str());
        if (!fout) return;

        string top="<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?> \n\
        <graphml xmlns=\"http://graphml.graphdrawing.org/xmlns\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xmlns:y=\"http://www.yworks.com/xml/graphml\" xmlns:yed=\"http://www.yworks.com/xml/yed/3\" xsi:schemaLocation=\"http://graphml.graphdrawing.org/xmlns http://www.yworks.com/xml/schema/graphml/1.1/ygraphml.xsd\"> \n\
        <key id=\"key0\" for=\"node\" attr.name=\"id\" attr.type=\"string\" />\n\
        <key id=\"key1\" for=\"edge\" attr.name=\"weight\" attr.type=\"int\" /> \n\
        <key id=\"key2\" for=\"edge\" attr.name=\"lid\" attr.type=\"string\" />\n\
        <key for=\"edge\" id=\"d12\" yfiles.type=\"edgegraphics\"/> \n\
        <key for=\"node\" id=\"d7\" yfiles.type=\"nodegraphics\"/>\n\
        <graph id=\"G\" edgedefault=\"directed\" parse.nodeids=\"canonical\" parse.edgeids=\"canonical\" parse.order=\"nodesfirst\">\n";

        fout.write(top.c_str(), top.length());

        GraphWrapper<VertexProp,EdgeProp>::vertex_iterator vi, vend;
        for (tie(vi, vend) = g.getVertices(); vi != vend; ++vi) {
                VertexProp p = g.properties(*vi);
                string nodestr="<node id=\""+p.nodeid+"\">\n";
                nodestr+=" <data key=\"key0\">"+p.nodeid+"</data>\n";
                nodestr+=" <data key=\"d7\">\n\
                  <y:GenericNode configuration=\"ShinyPlateNode\">\n\
                   <y:NodeLabel alignment=\"center\" autoSizePolicy=\"content\" fontFamily=\"Dialog\" fontSize=\"12\" fontStyle=\"plain\" hasBackgroundColor=\"false\" hasLineColor=\"false\" height=\"4.0\" modelName=\"internal\" modelPosition=\"s\" textColor=\"#000000\" visible=\"true\" width=\"4.0\" >"+p.nodeid+"</y:NodeLabel>\n\
                  </y:GenericNode>\n\
                 </data>\n";
                nodestr+="</node>\n";

                fout.write(nodestr.c_str(), nodestr.length());
        }

        int count=0;
        GraphWrapper<VertexProp,EdgeProp>::edge_iterator ei, eend;
        for (tie(ei, eend) = g.getEdges(); ei != eend; ++ei) {
                EdgeProp p = g.properties(*ei);
                stringstream ss;
                ss<<"e"<<count;
                count++;
                string lid=chararray_to_bin(p.lid);

                string edgestr = "<edge id=\""+ss.str()+"\" source=\""+g.getSourceProp(*ei).nodeid+
                                  "\" target=\""+g.getTargetProp(*ei).nodeid+"\">\n";
                ss.clear();
                ss.str(std::string());
                ss<<p.weight;
                edgestr += " <data key=\"key1\">"+ss.str()+"</data>\n";
                edgestr += " <data key=\"key2\">"+lid+"</data>\n";
                edgestr+=" <data key=\"d12\">\n\
                  <y:PolyLineEdge>\n\
                        <y:Arrows source=\"none\" target=\"delta\"/>\n\
                  </y:PolyLineEdge>\n\
                 </data>\n";
                edgestr += "</edge>\n";
                fout.write(edgestr.c_str(), edgestr.length());
        }

        string bottom=" </graph>\n</graphml>";
        fout.write(bottom.c_str(), bottom.length());
        fout.close();
}

---

Member Data Documentation

GraphWrapper<VertexProp, EdgeProp> TMBoost::g [protected]

---

The documentation for this class was generated from the following files:

• TMBoost.h
• TMBoost.cc