All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.coos.messaging.routing.DirectAlgorithm Maven / Gradle / Ivy

There is a newer version: 1.3.1
Show newest version
/**
 * COOS - Connected Objects Operating System (www.connectedobjects.org).
 *
 * Copyright (C) 2009 Telenor ASA and Tellu AS. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This library 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 .
 *
 * You may also contact one of the following for additional information:
 * Telenor ASA, Snaroyveien 30, N-1331 Fornebu, Norway (www.telenor.no)
 * Tellu AS, Hagalokkveien 13, N-1383 Asker, Norway (www.tellu.no)
 */
package org.coos.messaging.routing;

import java.util.Iterator;
import java.util.Map;

import org.coos.messaging.Link;
import org.coos.messaging.Message;


/**
 * @author Knut Eilif Husa, Tellu AS This routing algorithm is only applicable
 *         for a segment consisting of one node. It does not exchange
 *         routinginfo with other router nodes.
 */
public class DirectAlgorithm extends DefaultRoutingAlgorithm {

    public static String ALG_NAME = "direct";

    public DirectAlgorithm() {
    }

    public void init(String routerUuid, Router router) {
        super.init(routerUuid, router);
    }

    public void processRoutingInfo(Message routingInfo) {
        // No routing info processed
    }

    public void publishLink(Link link) {
        Iterator iter = routingTables.keySet().iterator();

        while (iter.hasNext()) {
            String qos = iter.next();
            Map routingTable = routingTables.get(qos);

            if (link.getCost() < LinkCost.MAX_VALUE) {
                routingTable.put(link.getDestinationUuid(), link);
            } else {
                routingTable.remove(link.getDestinationUuid());
            }

            if (loggingEnabled) {
                printRoutingTable(routerUuid, qos, routingTables.get(qos), logger);
                printAliasTable(routerUuid, aliasTable, logger);
            }
        }

    }

    public void start() throws Exception {
        // No service
    }

    public void stop() throws Exception {
        // No service
    }

    @Override public String getAlgorithmName() {
        return ALG_NAME;
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy