A Survey of Routing Schemes in Named Data Networks Razia Sultana Patan Department of Computer Science, University of Houston - Clear Lake Houston, USA Abstract— In recent years, due to emergence of content delivery applications (e.g., YouTube, Netflix), the TCP/IP networks are inefficient in transmitting the requested contents, as routers are unaware of the passing contents and might transmit the content through the same path multiple times. Named Data Network (NDN) architecture enables the routers to identify and cache the contents. NDN is a new information-centric networking architecture in which data or content is identified by a unique name and the content pieces are saved in cache of routers. As the source and destination …show more content…
It mainly relies on location-independent naming, in-network caching and named based routing for effective distribution of content over the network. Although NDN has motivated a lot of research community, research in this area is still in its early stages. Many research challenges must be addressed to make NDN a robust architecture. Some of these challenges include secure and persistent naming, name based routing, name resolution, in-network caching, on-demand content replication for optimal performance, security, privacy and content dissemination. Routing lies at the core of any NDN architecture. NDN projects have proposed diverse solutions for routing. In this survey, I present a list of major NDN routing projects and the comparative analysis of four proposed routing models based on performance evaluation factors. My perspective on the requirements of ideal content routing model is introduced based on results of the survey. II. MAJOR RESEARCH PROJECTS In this survey, we analyze and compare the NDN projects in Table 1. The selected research projects provide a diverse research effort toward routing in NDN. Project Name Reference Year Open Shortest Path First for Named-data [1] 2012 Named-data Link State Routing Protocol [2] 2013 Automatic Incremental Routing (AIR) [3] 2017 Content Driven Routing in Datacenter Networking [4] 2014 Table 1. List of surveyed research projects A.
The popularity of Internet has become ubiquitous and pervasive all over the world. The Internet plays a pivotal role in all walks of human life and has improved the quality of people life and has invaded all sectors like Governmental Organizations, Science and Technology, Business World, Industry and Education. In 1969, the Internet was originated by US Department of Defense (DoD) and Advanced Research Project (ARPANET) using Network Control Program (NCP). Research on packet switching communication methodology resulted in inter-networking of networks in 1981, when the researchers in Great Britain and Norway tried to collaborate with the researchers in US using Internet Protocol (IP). Realizing the importance and advantages of IP, the Internet
Upon reviewing Kudler Fine Food network, it has been determined that a major network overhaul will need to be conducted to make sure that Kudler is brought up to speed with the latest technology. This is very important because if Kudler is unable to keep up with the technological advances then the company will fall behind. Making sure that Kudler is not only able to keep up with the advances with network systems it is also important to install the proper systems so that no money is wasted. What is meant by this is that if the improper systems and storage units are installed to only handle data over the next year this is
DSDV is a proactive, hop-by-hop distance vector routing protocol where the routing table is maintained by each and every network node. The routing table consists of all the nodes required to reach destination also including the nodes to which packets are not sent. The routing table is kept updated at every time after each entry. In order to avoid the routing loops, DSDV uses the concept of sequence numbers to maintain the originality of route at all times. For the network in figure. 1 below, the routing table for node A can be seen in table. 1 which contains information about all possible paths reachable by node A, along with the next hop, number of hops and sequence number.
We have simulated another network having 30 numbers of nodes. The simulation is made using the same platform used for network 1. This simulation is done taking node 1 as a source and node 28 as destination. The optimal path obtained in this simulation is 1-23-13-28, in which data rate is 0.47 kbps. The second optimal path is 1-17-28, in which data rate is 0.35 kbps. The simulated results are summarized here in
We have discussed some common features, operations and performances of the applications including CAN, Chord, Pastry, Napster and Gnutella. It can be seen that while some schemes (Napster) are less complex to implement the bottleneck scalability proves a strong drawback. On the other hand, the other P2P networks applications even though being highly scalable may become very complex to implement. With respect to the selection of which network is suitable for a particular implementation of a peer to peer network, a careful consideration of factors such as security, scalability, routing performance would need to be considered to strike a balance between any
routing. In this chapter, we introduce some popular routing protocols in each of the three
contains the case narrative, related figures, and a set of questions and problems. These do not have one unique solution. There are too many alternatives when dealing with LANs, WANs, MANs, BNs, and the Internet, so a reallife network design and development problem can have several workable answers.
Network improvement has become follower in today’s modern life. The more we work the more we are affected to network and thus normally having always new requirements. To implement more efficient methods is needed first to predicate them. This predication needs to be developed before the requirements are very high. Users always expect more from networking while they compare old and current methods they’re working on. If network improvement performs poorly it would damage many businesses, consumer satisfaction etc, thus forthcoming of network should always be improved and not go down. One of the greatest improvements made on network field was
Develop a subnetting plan and implement it in the lab. Configure RIP as a routing protocol.
The proposed network uses UDP protocols, as to allow for constant data streaming between all clients and the server. An external ENet library inside the C++ code to allows for such protocols.
Further, with the evolution of Internet and enterprise data centers, the nature of data circulating on the Internet has also undergone a tremendous change. Data transfer in the form of video and audio is increasing at a tremendous pace[2]. Moreover, different sources of data (e.g.- mobile, tablet PCs) have placed considerable pressure on modern networks. The current capacities of network switches do not support the transfer of these mass amounts of data. Moreover, with advent of social media, amount of data generated on websites such as Facebook and LinkedIn has reached humungous levels.
You are the network manager of a company that has grown from 10 employees to 100 employees in 12 months. Year 2 projected growth is estimated to be 100 additional employees located at a remote location. The aggressive growth has brought about some unique challenges and opportunities. The company has one remote warehouse and no off-site disaster recovery services or servers. The network design remains a non-redundant, flat topology.
Key tools utilized, variable length subnet masking and route summarization are explained as well. Here choosing the appropriate routing protocol is equally critical for a successful design. To implement different masks for the same major network it is necessary to have a routing protocol that supports VLSM. Such routing protocols are called classless routing protocols. They carry the mask information along with the route advertisements therefore allowing for the support of more than one mask.
Structured P2P overlay network have tightly controlled topologies and content is placed at specified locations to efficiently solve queries. Some well-known examples are Content Addressable Network (CAN) [44], Chord [15] and Pastry [45]. Such overlays use a Distributed Hash Table (DHT) as substrate, where data objects (or values) are placed deterministically at the peers whose identifiers correspond to the data object’s unique key. In DHT-based systems, node identifiers are uniform-randomly assigned to the peers
Content delivery networks (CDNs) often suffer from the data overflow to efficiently and securely distribute content to a large number of online users. A Content Delivery Network (CDN) is a distributed network of servers and file storage devices that replicates content or