| #include <iostream> |
| #include <string> |
| #include <list> |
| |
| #include "routing-table.hpp" |
| #include "nlsr.hpp" |
| #include "map.hpp" |
| #include "conf-parameter.hpp" |
| #include "routing-table-calculator.hpp" |
| #include "routing-table-entry.hpp" |
| #include "name-prefix-table.hpp" |
| #include "logger.hpp" |
| |
| namespace nlsr { |
| |
| INIT_LOGGER("RoutingTable"); |
| |
| using namespace std; |
| |
| void |
| RoutingTable::calculate(Nlsr& pnlsr) |
| { |
| //debugging purpose |
| pnlsr.getNamePrefixTable().print(); |
| pnlsr.getLsdb().printAdjLsdb(); |
| pnlsr.getLsdb().printCorLsdb(); |
| pnlsr.getLsdb().printNameLsdb(); |
| pnlsr.getNamePrefixTable().writeLog(); |
| if (pnlsr.getIsRoutingTableCalculating() == false) { |
| //setting routing table calculation |
| pnlsr.setIsRoutingTableCalculating(true); |
| if (pnlsr.getLsdb().doesLsaExist( |
| pnlsr.getConfParameter().getRouterPrefix().toUri() + "/" + "adjacency", |
| std::string("adjacency"))) { |
| if (pnlsr.getIsBuildAdjLsaSheduled() != 1) { |
| std::cout << "CLearing old routing table ....." << std::endl; |
| _LOG_DEBUG("CLearing old routing table ....."); |
| clearRoutingTable(); |
| // for dry run options |
| clearDryRoutingTable(); |
| // calculate Link State routing |
| if ((pnlsr.getConfParameter().getHyperbolicState() == HYPERBOLIC_STATE_OFF) |
| || (pnlsr.getConfParameter().getHyperbolicState() == HYPERBOLIC_STATE_DRY_RUN)) { |
| calculateLsRoutingTable(pnlsr); |
| } |
| //calculate hyperbolic routing |
| if (pnlsr.getConfParameter().getHyperbolicState() == HYPERBOLIC_STATE_ON) { |
| calculateHypRoutingTable(pnlsr); |
| } |
| //calculate dry hyperbolic routing |
| if (pnlsr.getConfParameter().getHyperbolicState() == HYPERBOLIC_STATE_DRY_RUN) { |
| calculateHypDryRoutingTable(pnlsr); |
| } |
| //need to update NPT here |
| pnlsr.getNamePrefixTable().updateWithNewRoute(); |
| //debugging purpose |
| printRoutingTable(); |
| pnlsr.getNamePrefixTable().print(); |
| pnlsr.getFib().print(); |
| writeLog(); |
| pnlsr.getNamePrefixTable().writeLog(); |
| pnlsr.getFib().writeLog(); |
| //debugging purpose end |
| } |
| else { |
| std::cout << "Adjacency building is scheduled, so "; |
| std::cout << "routing table can not be calculated :(" << std::endl; |
| _LOG_DEBUG("Adjacency building is scheduled, so" |
| " routing table can not be calculated :("); |
| } |
| } |
| else { |
| std::cout << "No Adj LSA of router itself,"; |
| std::cout << " so Routing table can not be calculated :(" << std::endl; |
| _LOG_DEBUG("No Adj LSA of router itself," |
| " so Routing table can not be calculated :("); |
| clearRoutingTable(); |
| clearDryRoutingTable(); // for dry run options |
| // need to update NPT here |
| std::cout << "Calling Update NPT With new Route" << std::endl; |
| pnlsr.getNamePrefixTable().updateWithNewRoute(); |
| //debugging purpose |
| printRoutingTable(); |
| pnlsr.getNamePrefixTable().print(); |
| pnlsr.getFib().print(); |
| writeLog(); |
| pnlsr.getNamePrefixTable().writeLog(); |
| pnlsr.getFib().writeLog(); |
| //debugging purpose end |
| } |
| pnlsr.setIsRouteCalculationScheduled(false); //clear scheduled flag |
| pnlsr.setIsRoutingTableCalculating(false); //unsetting routing table calculation |
| } |
| else { |
| scheduleRoutingTableCalculation(pnlsr); |
| } |
| } |
| |
| |
| void |
| RoutingTable::calculateLsRoutingTable(Nlsr& pnlsr) |
| { |
| std::cout << "RoutingTable::calculateLsRoutingTable Called" << std::endl; |
| Map vMap; |
| vMap.createFromAdjLsdb(pnlsr); |
| int numOfRouter = vMap.getMapSize(); |
| LinkStateRoutingTableCalculator lsrtc(numOfRouter); |
| lsrtc.calculatePath(vMap, ndn::ref(*this), pnlsr); |
| } |
| |
| void |
| RoutingTable::calculateHypRoutingTable(Nlsr& pnlsr) |
| { |
| Map vMap; |
| vMap.createFromAdjLsdb(pnlsr); |
| int numOfRouter = vMap.getMapSize(); |
| HypRoutingTableCalculator hrtc(numOfRouter, 0); |
| hrtc.calculatePath(vMap, ndn::ref(*this), pnlsr); |
| } |
| |
| void |
| RoutingTable::calculateHypDryRoutingTable(Nlsr& pnlsr) |
| { |
| Map vMap; |
| vMap.createFromAdjLsdb(pnlsr); |
| int numOfRouter = vMap.getMapSize(); |
| HypRoutingTableCalculator hrtc(numOfRouter, 1); |
| hrtc.calculatePath(vMap, ndn::ref(*this), pnlsr); |
| } |
| |
| void |
| RoutingTable::scheduleRoutingTableCalculation(Nlsr& pnlsr) |
| { |
| if (pnlsr.getIsRouteCalculationScheduled() != true) { |
| pnlsr.getScheduler().scheduleEvent(ndn::time::seconds(15), |
| ndn::bind(&RoutingTable::calculate, this, |
| ndn::ref(pnlsr))); |
| pnlsr.setIsRouteCalculationScheduled(true); |
| } |
| } |
| |
| static bool |
| routingTableEntryCompare(RoutingTableEntry& rte, ndn::Name& destRouter) |
| { |
| return rte.getDestination() == destRouter; |
| } |
| |
| // function related to manipulation of routing table |
| void |
| RoutingTable::addNextHop(const ndn::Name& destRouter, NextHop& nh) |
| { |
| RoutingTableEntry* rteChk = findRoutingTableEntry(destRouter); |
| if (rteChk == 0) { |
| RoutingTableEntry rte(destRouter); |
| rte.getNexthopList().addNextHop(nh); |
| m_rTable.push_back(rte); |
| } |
| else { |
| rteChk->getNexthopList().addNextHop(nh); |
| } |
| } |
| |
| RoutingTableEntry* |
| RoutingTable::findRoutingTableEntry(const ndn::Name& destRouter) |
| { |
| std::list<RoutingTableEntry>::iterator it = std::find_if(m_rTable.begin(), |
| m_rTable.end(), |
| ndn::bind(&routingTableEntryCompare, |
| _1, destRouter)); |
| if (it != m_rTable.end()) { |
| return &(*it); |
| } |
| return 0; |
| } |
| |
| void |
| RoutingTable::writeLog() |
| { |
| _LOG_DEBUG("---------------Routing Table------------------"); |
| for (std::list<RoutingTableEntry>::iterator it = m_rTable.begin() ; |
| it != m_rTable.end(); ++it) { |
| _LOG_DEBUG("Destination: " << (*it).getDestination()); |
| _LOG_DEBUG("Nexthops: "); |
| (*it).getNexthopList().writeLog(); |
| } |
| } |
| |
| void |
| RoutingTable::printRoutingTable() |
| { |
| std::cout << "---------------Routing Table------------------" << std::endl; |
| for (std::list<RoutingTableEntry>::iterator it = m_rTable.begin() ; |
| it != m_rTable.end(); ++it) { |
| std::cout << (*it) << std::endl; |
| } |
| } |
| |
| |
| //function related to manipulation of dry routing table |
| void |
| RoutingTable::addNextHopToDryTable(const ndn::Name& destRouter, NextHop& nh) |
| { |
| std::list<RoutingTableEntry>::iterator it = std::find_if(m_dryTable.begin(), |
| m_dryTable.end(), |
| ndn::bind(&routingTableEntryCompare, |
| _1, destRouter)); |
| if (it == m_dryTable.end()) { |
| RoutingTableEntry rte(destRouter); |
| rte.getNexthopList().addNextHop(nh); |
| m_dryTable.push_back(rte); |
| } |
| else { |
| (*it).getNexthopList().addNextHop(nh); |
| } |
| } |
| |
| void |
| RoutingTable::printDryRoutingTable() |
| { |
| std::cout << "--------Dry Run's Routing Table--------------" << std::endl; |
| for (std::list<RoutingTableEntry>::iterator it = m_dryTable.begin() ; |
| it != m_dryTable.end(); ++it) { |
| cout << (*it) << endl; |
| } |
| } |
| |
| |
| void |
| RoutingTable::clearRoutingTable() |
| { |
| if (m_rTable.size() > 0) { |
| m_rTable.clear(); |
| } |
| } |
| |
| void |
| RoutingTable::clearDryRoutingTable() |
| { |
| if (m_dryTable.size() > 0) { |
| m_dryTable.clear(); |
| } |
| } |
| |
| }//namespace nlsr |
| |