本文整理汇总了Java中net.floodlightcontroller.routing.BroadcastTree类的典型用法代码示例。如果您正苦于以下问题：Java BroadcastTree类的具体用法？Java BroadcastTree怎么用？Java BroadcastTree使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
BroadcastTree类属于net.floodlightcontroller.routing包，在下文中一共展示了BroadcastTree类的10个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: calculateShortestPathTreeInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateShortestPathTreeInClusters() {
pathcache.invalidateAll();
destinationRootedTrees.clear();
Map<Link, Integer> linkCost = new HashMap<Link, Integer>();
int tunnel_weight = switchPorts.size() + 1;
for (NodePortTuple npt : tunnelPorts) {
if (switchPortLinks.get(npt) == null) continue;
for (Link link : switchPortLinks.get(npt)) {
if (link == null) continue;
linkCost.put(link, tunnel_weight);
}
}
for (Cluster c : clusters) {
for (DatapathId node : c.links.keySet()) {
BroadcastTree tree = clusterDijkstra(c, node, linkCost, true);
destinationRootedTrees.put(node, tree);
}
}
}
开发者ID:xuraylei，项目名称:fresco_floodlight，代码行数:23，代码来源:TopologyInstance.java
示例2: calculateBroadcastNodePortsInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateBroadcastNodePortsInClusters() {
clusterBroadcastTrees.clear();
calculateBroadcastTreeInClusters();
for (Cluster c : clusters) {
// c.id is the smallest node that's in the cluster
BroadcastTree tree = clusterBroadcastTrees.get(c.id);
//log.info("Broadcast Tree {}", tree);
Set<NodePortTuple> nptSet = new HashSet<NodePortTuple>();
Map<DatapathId, Link> links = tree.getLinks();
if (links == null) continue;
for (DatapathId nodeId : links.keySet()) {
Link l = links.get(nodeId);
if (l == null) continue;
NodePortTuple npt1 = new NodePortTuple(l.getSrc(), l.getSrcPort());
NodePortTuple npt2 = new NodePortTuple(l.getDst(), l.getDstPort());
nptSet.add(npt1);
nptSet.add(npt2);
}
clusterBroadcastNodePorts.put(c.id, nptSet);
}
}
开发者ID:xuraylei，项目名称:fresco_floodlight，代码行数:25，代码来源:TopologyInstance.java
示例3: calculateShortestPathTreeInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateShortestPathTreeInClusters() {
pathcache.invalidateAll();
destinationRootedTrees.clear();
Map<Link, Integer> linkCost = new HashMap<Link, Integer>();
int tunnel_weight = switchPorts.size() + 1;
for(NodePortTuple npt: tunnelPorts) {
if (switchPortLinks.get(npt) == null) continue;
for(Link link: switchPortLinks.get(npt)) {
if (link == null) continue;
linkCost.put(link, tunnel_weight);
}
}
for(Cluster c: clusters) {
for (DatapathId node : c.links.keySet()) {
BroadcastTree tree = dijkstra(c, node, linkCost, true);
destinationRootedTrees.put(node, tree);
}
}
}
开发者ID:nsg-ethz，项目名称:iTAP-controller，代码行数:23，代码来源:TopologyInstance.java
示例4: calculateBroadcastNodePortsInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateBroadcastNodePortsInClusters() {
clusterBroadcastTrees.clear();
calculateBroadcastTreeInClusters();
for(Cluster c: clusters) {
// c.id is the smallest node that's in the cluster
BroadcastTree tree = clusterBroadcastTrees.get(c.id);
//log.info("Broadcast Tree {}", tree);
Set<NodePortTuple> nptSet = new HashSet<NodePortTuple>();
Map<DatapathId, Link> links = tree.getLinks();
if (links == null) continue;
for(DatapathId nodeId: links.keySet()) {
Link l = links.get(nodeId);
if (l == null) continue;
NodePortTuple npt1 = new NodePortTuple(l.getSrc(), l.getSrcPort());
NodePortTuple npt2 = new NodePortTuple(l.getDst(), l.getDstPort());
nptSet.add(npt1);
nptSet.add(npt2);
}
clusterBroadcastNodePorts.put(c.id, nptSet);
}
}
开发者ID:nsg-ethz，项目名称:iTAP-controller，代码行数:26，代码来源:TopologyInstance.java
示例5: calculateShortestPathTreeInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateShortestPathTreeInClusters() {
pathcache.invalidateAll();
destinationRootedTrees.clear();
Map<Link, Integer> linkCost = new HashMap<Link, Integer>();
int tunnel_weight = switchPorts.size() + 1;
for(NodePortTuple npt: tunnelPorts) {
if (switchPortLinks.get(npt) == null) continue;
for(Link link: switchPortLinks.get(npt)) {
if (link == null) continue;
linkCost.put(link, tunnel_weight);
}
}
for(Cluster c: clusters) {
for (Long node : c.links.keySet()) {
BroadcastTree tree = dijkstra(c, node, linkCost, true);
destinationRootedTrees.put(node, tree);
}
}
}
开发者ID:JianqingJiang，项目名称:QoS-floodlight，代码行数:23，代码来源:TopologyInstance.java
示例6: calculateBroadcastNodePortsInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateBroadcastNodePortsInClusters() {
clusterBroadcastTrees.clear();
calculateBroadcastTreeInClusters();
for(Cluster c: clusters) {
// c.id is the smallest node that's in the cluster
BroadcastTree tree = clusterBroadcastTrees.get(c.id);
//log.info("Broadcast Tree {}", tree);
Set<NodePortTuple> nptSet = new HashSet<NodePortTuple>();
Map<Long, Link> links = tree.getLinks();
if (links == null) continue;
for(long nodeId: links.keySet()) {
Link l = links.get(nodeId);
if (l == null) continue;
NodePortTuple npt1 = new NodePortTuple(l.getSrc(), l.getSrcPort());
NodePortTuple npt2 = new NodePortTuple(l.getDst(), l.getDstPort());
nptSet.add(npt1);
nptSet.add(npt2);
}
clusterBroadcastNodePorts.put(c.id, nptSet);
}
}
开发者ID:JianqingJiang，项目名称:QoS-floodlight，代码行数:26，代码来源:TopologyInstance.java
示例7: calculateBroadcastNodePortsInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateBroadcastNodePortsInClusters() {
clusterBroadcastTrees.clear();
calculateBroadcastTreeInClusters();
for (Cluster c : clusters) {
// c.id is the smallest node that's in the cluster
BroadcastTree tree = clusterBroadcastTrees.get(c.id);
//log.info("Broadcast Tree {}", tree);
Set<NodePortTuple> nptSet = new HashSet<NodePortTuple>();
Map<DatapathId, Link> links = tree.getLinks();
if (links == null) continue;
for (DatapathId nodeId : links.keySet()) {
Link l = links.get(nodeId);
if (l == null) continue;
NodePortTuple npt1 = new NodePortTuple(l.getSrc(), l.getSrcPort());
NodePortTuple npt2 = new NodePortTuple(l.getDst(), l.getDstPort());
nptSet.add(npt1);
nptSet.add(npt2);
}
clusterBroadcastNodePorts.put(c.id, nptSet);
}
}
开发者ID:zhenshengcai，项目名称:floodlight-hardware，代码行数:25，代码来源:TopologyInstance.java
示例8: calculateShortestPathTreeInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateShortestPathTreeInClusters() {
pathcache.clear();
destinationRootedTrees.clear();
Map<Link, Integer> linkCost = new HashMap<Link, Integer>();
int tunnel_weight = switchPorts.size() + 1;
for(NodePortTuple npt: tunnelPorts) {
if (switchPortLinks.get(npt) == null) continue;
for(Link link: switchPortLinks.get(npt)) {
if (link == null) continue;
linkCost.put(link, tunnel_weight);
}
}
for(Cluster c: clusters) {
for (Long node : c.links.keySet()) {
BroadcastTree tree = dijkstra(c, node, linkCost, true);
destinationRootedTrees.put(node, tree);
}
}
}
开发者ID:vishalshubham，项目名称:Multipath-Hedera-system-in-Floodlight-controller，代码行数:23，代码来源:TopologyInstance.java
示例9: calculateBroadcastNodePortsInClusters
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected void calculateBroadcastNodePortsInClusters() {
clusterBroadcastTrees.clear();
calculateBroadcastTreeInClusters();
log.debug("openflow islands : " + clusters.size());
for(Cluster c: clusters) {
// c.id is the smallest node that's in the cluster
BroadcastTree tree = clusterBroadcastTrees.get(c.id);
log.info("Broadcast Tree {}", tree);
Set<NodePortTuple> nptSet = new HashSet<NodePortTuple>();
Map<Long, Link> links = tree.getLinks();
if (links == null) continue;
for(long nodeId: links.keySet()) {
Link l = links.get(nodeId);
if (l == null) continue;
NodePortTuple npt1 = new NodePortTuple(l.getSrc(), l.getSrcPort());
NodePortTuple npt2 = new NodePortTuple(l.getDst(), l.getDstPort());
nptSet.add(npt1);
nptSet.add(npt2);
}
clusterBroadcastNodePorts.put(c.id, nptSet);
}
}
开发者ID:vishalshubham，项目名称:Multipath-Hedera-system-in-Floodlight-controller，代码行数:26，代码来源:TopologyInstance.java
示例10: getPath
import net.floodlightcontroller.routing.BroadcastTree; //导入依赖的package包/类
protected static MetricEdge getPath(Long src, Long dst){
BroadcastTree tree = destinationRootedTrees.get(dst);
if(src.equals(dst)){
return null;
}
ArrayList<Link> path = new ArrayList<Link>();
int cost = tree.getCost(src);
Long tmpsrc = src;
do{
Link link = tree.getTreeLink(tmpsrc);
if(link == null) break;
// cost += tree.getCost(src);
tmpsrc = link.getDst();
path.add(link);
}while(true);
MetricEdge metricEdge = new MetricEdge(src, dst, path, cost );
return metricEdge;
}
开发者ID:daniel666，项目名称:multicastSDN，代码行数:19，代码来源:TopologyInstanceForST.java
注：本文中的net.floodlightcontroller.routing.BroadcastTree类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论