preview

Java Essay

Decent Essays
Open Document

import java.io.*; import java.util.Arrays; import java.util.ArrayList; /** * Authors: Andrew Barrasso (abarrass@bu.edu), Michael Rojas * * * * This is the class that students need to implement. The code skeleton is provided. * Students need to implement rtinit(), rtupdate() and linkhandler(). * printdt() is provided to pretty print a table of the newc costs for reaching * other nodes in the network. */ public class NodeDVR { public final int INFINITY = 9999; int[] lkcost; /*The link cost between node 0 and other nodes*/ int[][] costs; /*Define distance table*/ int nodename; /*Name of this node*/ int[] paths; /*Define all paths*/ int size = 4; // size of …show more content…

if(initial_lkcost[j] != 9999){ paths[j] = j; } } //send costs of shortest paths to other neighboring nodes: int [] mincost = new int[lkcost.length]; for (int h = 0; h < mincost.length; ++h) { mincost[h] = costs[h][h]; } for (int g = 0; g < lkcost.length; ++g) { if (lkcost[g] != 9999 && g != this.nodename) { PacketDVR sendPacket = new PacketDVR(this.nodename, g, mincost); NetworkSimulatorDVR.tolayer2(sendPacket); } } } //Helper Methods for rtupdate: // Check if the costs array has been updated boolean updated(int[][] old, int[][] newc) { for (int j = 0; j < old.length; j++) { for (int k = 0; k < old[0].length; k++) { if (old[j][k] != newc[j][k]) { return true; } } } return false; } void poison(int[] xi) { for (int s = 0; s < lkcost.length; ++s) { if (lkcost[s] != 9999 && s != this.nodename) { int[] mini = new int[xi.length]; for (int t = 0; t < mini.length; ++t) { mini[t] = xi[t]; } //update mincost according to split horizon with poison reverse for (int u = 0; u < mini.length; ++u) { if

Get Access
Related
Get Access