routingdb.h

来自「use swarm intelligence to simulate netwo」· C头文件 代码 · 共 65 行

// -*- C++ -*-
// Copyright (C) 2003 Leherstuh f黵 Betrieb System/ Verteilte System, 
// Universitaet Dortmund 
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

// Author: Muddassar Farooq
// Informatik III, Universitaet Dortmund
// Germany

//-------------------------------------------------------------
// file: routingDB.h
// This class calculates the shortest distance 
// in terms of number of hops from a node to all
// destinations
//-------------------------------------------------------------

#ifndef __ROUTING_DB_H
#define __ROUTING_DB_CPP

#include "protocolParameters.h"

class routingDB : public cSimpleModule
{
	struct RTEntry
	{
		int sourceAddress;
		int destAddress;

        bool operator<(const RTEntry& b) const 
		{
           return sourceAddress<b.sourceAddress || (sourceAddress==b.sourceAddress && destAddress<b.destAddress);
		}
	};

    typedef map<RTEntry,int> hopsTable; // (sourceAddress+DestAddress) -> hops

	protected:
		hopsTable *hTable;

  public:
	routingDB(const char *name, cModule *parentmodule,	unsigned stacksize = 0);
	virtual ~routingDB();
    virtual void initialize();

    /**
     * Returns the number of hops from a source to a destination connected along the
	 * shortest path
     */
    virtual int getNumberOfIdealHops(int sourceAddress, int destAddress);
};

#endif