Loading...

A Distance Vector Based Routing Protocol for Named Data Networking

Aghajani, Mahsa | 2018

481 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 51759 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Movaghar, Ali
  7. Abstract:
  8. Named Data Networking is the most promisicing content centric Architecture for the future of Internet. In this architecture, content can be accessed regardless of where it is.Routing is one of the most important and challenging issues in these networks. An efficient router improves the efficiency of network by reducing routers convergence time, stored data related to routing and exchanged routing data traffic. It also reduces the state each router keeps due to routing information. In Named Data Networking routers are smart and some of routing protocol responsibilities can be done by forwarding plane. Therefor netwok churns can be handeled by forwarding plane. Considering this responsibility reduction, it is possoble that routing protocols which were not so efficient in IP networks, turn to appropriate options in NDN. Current NDN testbed protocol is NLSR. In thie thesis, a named routing protocol based on distance vector Or NDVR is proposed. NDVR tries to improve networks efficiency by reducing the state kept by each router and the traffic sent to the netwok due to routing information. In NDVR each router send routing messages only to its direct neighbors. In this Distance Vector based routing protocol, routing tables are calculated by Bellman-Ford algorithm. Simulation results, Confirm NDVR advanteges in routing information state at each router over NLSR
  9. Keywords:
  10. Named Data Network (NDN) ; Routing Protocol ; Distance Vector ; Belman-Ford Algorithm

 Digital Object List

 Bookmark

...see more