Randy Buck wrote this article for our discussion of the network layer in CS660. It was a really exciting discussion about how relaxing the requirement for finding the shortest path in a network could result in huge benefits in routing table size and routing efficiency (ironic, isn't it?). The downside, however, is that the benefits only work in theory on a static network, which the Internet very much is not -- nodes come and go all the time. I've been trying to think of some way around that problem, but nothing has panned out so far. Here's what I have thought of and the problems therewith:
1. Central registration server. No. Just no. That just becomes the bottleneck in the network, and everything still has to register or time out with it. Why did I even think of this one?
2. Assign nodes with physical location-based names, and have those locations pre-assigned for an entire namespace. Traffic could then try and hit a certain address, and they'd either get a response from it if something exists at that address, or they wouldn't. The problems here would still lie in trying to get something more human-readable, as well as with mobile devices. Perhaps we should only map routers/access points on the network?
3. Whatever somebody else puts here. It seems like a daunting task, and in an area of networking that I'm just not as up-to-date on.
No comments:
Post a Comment