Sensible decisions in very large networks

Speaker: Erol Gelenbe

15th March 2006 , 2pm , 1.18 Claremont Tower

Abstract

The network -- wired, wireless, sensor -- that we use is for all practical purposes becoming infinite. In such an environment, it may not possible to count on the accuracy of routing tables. The presentation will first discuss whether finite search times are possible in a large network with imperfect information. We will then suggest sensible local rules that can be used to do better than a random search. Finally we will discuss our Cognitive Packet Routing Protocol which has been implemented to experiment with some of these questions and ideas.