7508 posts
Location
Australia
Posted 20 December 2012 - 04:26 PM
Crafted in a similar fashion to the advanced computers and such with the gold, but it adds the functionality of use OSPF to send to a computer that is out of range of its modem.
OSPF - Open Shortest Path First is where the computer would ping the computers around it for their ARP table (which is only in the advanced modems) and find the shortest path to the target computer that is out of range, but in range of another one, obviously via modems that are on (thats where open comes in). Then the message gets sent from the source to the target via all the ones in the middle :)/>
1054 posts
Posted 20 December 2012 - 05:06 PM
OSPF doesn't use ARP. :mellow:/> It's quite feasible to do this in Lua and I don't think that peripherals should have functionality that's already possible in CC. I would love to see OSPF in CC though. :)/> Might work on it after the exams, if no one else has by then.
7508 posts
Location
Australia
Posted 20 December 2012 - 05:14 PM
OSPF doesn't use ARP. :mellow:/> It's quite feasible to do this in Lua and I don't think that peripherals should have functionality that's already possible in CC. I would love to see OSPF in CC though. :)/> Might work on it after the exams, if no one else has by then.
Sorry I didn't mean ARP table, I meant the network topology table thing that they have, damn i should know its name, only learnt it last semester…..
Back to topic (kinda): Even RIP would be fine if OSPF ends up being too difficult. Just some kind of packet routing would be handy :)/>
EDIT: Or BGP, cant forget BGP. :P/>
EDIT #2: I have a feeling that implementing a correct and working Dijkstra's algorithm for OSPF might be the most difficult part of the lot.
1054 posts
Posted 20 December 2012 - 05:24 PM
Well, dijkstra would be quite easy in this case I think. You'd only benefit from keeping the amount of hops low. So you either map the number of hops for a route, or: the lower the distance the higher the edge cost, that makes using the minimum number of hops likely.
Edit: Do you mean the 'adjacency database' that keeps track of neighbour relationships? Everyone makes a mistake now and then. :)/>
7508 posts
Location
Australia
Posted 20 December 2012 - 05:27 PM
very true… very true… still have fun :P/>
8543 posts
Posted 20 December 2012 - 07:06 PM
Gonna go out on a limb and lock this as won't-implement. The general trend is to not implement anything that can be done with the existing tools in Lua, which this can.