Home | Trees | Index | Help |
|
---|
Package g4ds :: Module routingtablemanager :: Class RoutingTableManager |
|
Holds the routing table in the memory.
Architecture:Method Summary | |
---|---|
Let's load the routing table here into memory. | |
Some basic information about the object | |
Adds an routing entry to the manager. | |
Updates the local routing table with the information from the remote peer about its routes. | |
Flushes the routing table - the table will be totally empty afterwards. | |
Returns all entries for the pair - source commuity - destination community | |
Returns the member id of the next hop on the route towards the final destination's community. | |
Returns an XML formatted copy of the routing table. | |
Creates routing entries from the scratch by processing gateway information. |
Method Details |
---|
__init__(self,
loadFromDatabase=1)
Let's load the routing table here into memory.
|
__str__(self)
Some basic information about the object
|
addEntry(self, entry, loading=0, skipMoreExpensive=1)Adds an routing entry to the manager. If loading is false, the new value is written through to the database.
|
applyRoutingTableFromNode(self, peerId, tableXml)Updates the local routing table with the information from the remote peer about its routes. |
flushTable(self)Flushes the routing table - the table will be totally empty afterwards. |
getAllEntriesForCommunityPair(self, sourceCommunityId, destinationCommunityId)Returns all entries for the pair - source commuity - destination community |
getNexthopForCommunity(self, destinationcommunityid, sourcecommunityid=None)Returns the member id of the next hop on the route towards the final destination's community. Automatically, the route with the lowest costs for this destination community is chosen. Ifsourcecommunityid is not given, any will
be chosen, in fact the one which causes the lowest costs.
|
getRoutingTableXML(self)Returns an XML formatted copy of the routing table. |
recalculateRoutingTable(self)Creates routing entries from the scratch by processing gateway information. The values for directly reachable communities are applied. Furthermore, communities, which may be reached through one community only (1 hop) are put into as well. The rest should be sorted out be the dynamic routing faciliites. |
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.0 on Sat Oct 22 22:52:47 2005 | http://epydoc.sf.net |