UC Santa Cruz
Towards Efficient Routing to Addresses and Names in Computer Communication Networks
- Author(s): Li, Qian
- Advisor(s): Garcia-Luna-Aceves, J.J.
- et al.
Traditional routing protocols in mobile ad hoc networks (MANET) rely on routing tables which suffer from the scale-free and self-organizing nature of wireless networks. Routing protocols adopting destination-based routing tables introduce large overhead to maintain the routing tables in wireless networks. Many routing protocols cause flooding in updating and finding routes when topology changes. In information centric network (ICN), prior content routing approaches assume that the entire ICN use the same naming space for named data objects (NDO) and that routing tables list routes to NDOs or name prefixes, which incurs more overhead than routing to address ranges.
In this thesis we present novel approaches to build a new hierarchy for routing in computer communication networks which collaborates information dissemination in networks with publish-subscribe mechanisms, network storage, scalable routing and social networks. We propose a few hierarchical, scale-free routing schemes which scale well with network size. In contrast to prior approaches to disseminate information through wireless networks over routing tables, our approaches exploit the social plane exiting in the wireless network to improve the efficiency to deliver information and eliminates the use of destination-based routing tables. In addition, different from prior works in adopting social networks into wireless networks that focus on physical aspects of connectivity over time, our approaches emphasize on the underlying social information among the wireless networks to analyze nodes potential delivery capability and efficiently utilize network storage resources. We also design novel use of Dominating Sets for improving the problems of broadcasting, information query and storage, topology management, and routing in MANETs and ICNs. Our new approaches allow distance-vector routing to scale by integrating it with adaptive publish-subscribe mechanisms. We propose to apply our approaches to address the existing issues of flooding, scale-free, routing efficiency, and routing table maintenance overhead that are faced by computer communication networks that use traditional routing tables for information dissemination.