Decentralized algorithms for search and routing in large-scale networks
Hari Thadakamalla · 2007
∗Signatures are on file in the Graduate School. During the past decade, advances in technology and science have led to many large-scale distributed systems which can be characterized as networks. Some ex-amples include the World Wide Web, the Internet, the power grid, wireless sensor networks, and military (net-centric) logistics. The scale of the size of these net-works is substantially different from the networks considered in traditional graph theory. Further, these networks do not have any pre-specified structure/order or any design principles. Hence, the problems posed in such networks are very novel. Recent years has witnessed an explosion of interest across different disciplines, in understanding and characterizing such large-scale networks, which led to develop-ment of a new field called “Network science”. This activity was mainly triggered by significant findings in real-world networks which led to a revival of network modeling and gave rise to many path breaking results. Until now, a major part of this research was focused on modeling and characterizing the behavior of the