// // Copyright (C) 2003 CTIE, Monash University // // 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. // // // Prototype for modules providing Ethernet switch functionality. // These modules handle the mapping between ports and MAC addresses, // and forward frames to appropriate ports. // // Functions: // - relays frames based on their dest MAC addresses (dest-->port mapping) // - models finite buffer size (drops) and finite processing power (latency, queueing) // // Address caching is modeled by a fixed-size lookup table. // When the table is full, the oldest address is kicked out of the cache. // // Entries are also deleted if their age exceeds a certain limit. // // If needed, address tables can be pre-loaded from text files at the beginning // of the simulation; this controlled by the addressTableFile module parameter. // // This module is not a concrete implementation, it just defines gates and // parameters a MACRelayUnit should have. Concrete inplementations add // capacity and performance aspects to the model (number of frames processed // per second, amount of memory available in the switch, etc.) // C++ implementations can subclass from the class <tt>MACRelayUnitBase</tt>. // // Known implementations are MACRelayUnitNP and MACRelayUnitPP. // simple MACRelayUnit parameters: addressTableFile : string, // set to empty string if not used addressTableSize : numeric, // max size of address table agingTime : numeric; // max idle time for address table entries // (if expires, entry is removed from the table) gates: in: lowerLayerIn[]; out: lowerLayerOut[]; endsimple