SimpleLatOrHopMEntries.h

Go to the documentation of this file.

//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Lesser General Public License for more details.
// 
// You should have received a copy of the GNU Lesser General Public License
// along with this program.  If not, see http://www.gnu.org/licenses/.
// 

#pragma once

#include <IntPDUFG.h>
#include <IntIQoSMForwarding.h>
#include <TSimpleRouting/IntTSimpleRouting.h>

#include "IDPerNQoSxPLen.h"

#include <map>
#include <set>


namespace NSPSimpleLatOrHopMEntries {

using namespace std;

typedef unsigned short mType;

class SimpleLatOrHopMEntries: public IntPDUFG {
public:
    // A new flow has been inserted/or removed
    virtual void insertedFlow(const Address &addr, const QoSCube& qos, RMTPort * port);
    virtual void removedFlow(const Address &addr, const QoSCube& qos, RMTPort * port);

    //Routing has processes a routing update
    virtual void routingUpdated();

protected:
    // Called after initialize
    virtual void onPolicyInit();

    DA * difA;
    IntIQoSMForwarding * fwd;
    IntTSimpleRouting<mType> * rt;

    //Next, Ports
    map<string, set<RMTPort*> > neighbours;

    set<string> hopQoS, latQoS;
    map<string, int> dstLat;
    map<string, double> dstDLat;
    bool maUrgent;
    int maxLat;
};

}