ndn-contrib/test/node/DataStructures/FIB.js

Reusable 'Classes' for Named Data Networking: NameTree, PIT, FIB, ContentStore, Interfaces, and Transports

var FIB = require('../../../src/DataStructures/FIB.js')
, NameTree = require("../../../src/DataStructures/NameTree.js")

var assert = require("assert")
var ndn = require('ndn-lib')


FIB.installNDN(ndn);
NameTree.installNDN(ndn);

var fib = new FIB(new NameTree())

describe('FIB.addEntry()', function(){
  it('should add without error with all polymorphism', function(){
    var param1= {
      prefix : 'a/b/c',
      nextHops:[
        {
          faceID: 1,
          cost: 0
        }
      ]
    }
    var param2 = {
      prefix: new ndn.Name("a/b/c")
      , nextHops: [{
        faceID: 0
      }]
    }

    var entry = new FIB.Entry(param1);

    fib.addEntry(param1.prefix, param1.nextHops)
    fib.addEntry(param2.prefix, param2.nextHops)
    fib.addEntry(param1.prefix, [0,2,3]);
    fib.addEntry(param1.prefix, 7);
    assert(fib.nameTree["/a/b/c"].fibEntry.nextHops.length === 5)
  })
  it("should ignore existing nextHop with identical faceID", function(){
    var param3 = {
      prefix: new ndn.Name("a/b/c")
      , nextHops: [{
        faceID: 0
      }]
    }

    fib.addEntry(param3.prefix, param3.nextHops);

    assert(fib.nameTree["/a/b/c"].fibEntry.nextHops.length === 5)
  })
})
var entry
describe("FIB.Entry.addNextHop()", function(){
  it("should add, but not duplicate, a nextHop", function(){
    entry = new FIB.Entry({prefix: 'a'});
    var hop0 = {faceID: 0}
    var hop1 = {faceID: 1}
    var hop2 = {faceID: 2}
    var hop3 = {faceID: 3}
    entry.addNextHop(hop3).addNextHop(hop1).addNextHop(hop2).addNextHop(hop0).addNextHop(hop1)
    assert(entry.nextHops.length == 4)
  })
  it("should order them by faceID", function(){
    assert(entry.nextHops[0].faceID == 0)
    assert(entry.nextHops[1].faceID == 1)
    assert(entry.nextHops[2].faceID == 2)
    assert(entry.nextHops[3].faceID == 3)
  })
})

describe("FIB.findAllNextHops()", function(){
  it("should return a faceFlag with all next Hops, ignoring exclude ", function(){
    var param = {
      prefix: new ndn.Name("a/b")
      , nextHops: [{
        faceID: 7
      }]
    }
    fib.addEntry(param.prefix, [7,1,2]);

    var faceFlag = fib.findAllNextHops(new ndn.Name("a/b/c/d"), 0);
    assert(faceFlag == 142)
  })
})