Добірка наукової літератури з теми "FIB Forwarding Information Bases"

One of the main advantages of information-centric networking (ICN) is that a requested piece of content can be retrieved from a content store (CS) at any intermediate node, instead of its original content producer. In existing ICN designs, nodes forward Interest packets mainly based on forwarding information base (FIB). FIB is constructed from name prefixes registered by content producers with a list of next hops to the name prefixes. The ICN forwarding engine uses those information to forward Interest packets towards corresponding content producers. CS information of a node is currently used only for checking the availability of cached content objects at the node and is not considered in the data plane of existing ICN forwarding mechanisms. This paper highlights the importance of CS information in an ICN forwarding mechanism and enables neighbor CS information in the data plane to improve the cache hit ratio and forwarding efficiency, especially for resource-constraint Internet of Things (IoT). We propose an efficient CS-based forwarding scheme for IoT. The proposed forwarding scheme exploits CS information of neighbors to find efficient routes to forward Interest packets toward nearby nodes with corresponding cached content. For that, we carefully design an efficient way for CS information sharing using counting bloom filter. We implement the proposed scheme and compare with state-of-the-art ICN forwarding schemes in IoT. Experimental results indicate that the proposed forwarding scheme achieves a significant improvement in terms of cache hit ratio, energy efficiency, content retrieval latency, and response rate.

Content store (CS) is one of the main components of information-centric networking (ICN), which enables content objects to be cached and retrieved from any intermediate node in the network. However, in existing ICN designs, CS information is not exploited to coordinate content caching and content retrieval. CS of nodes in the network operates independently while Interest packets forwarding mainly uses forwarding information base (FIB). This paper highlights the importance of CS information for efficient content caching and content retrieval to improve the performance of information-centric networking, especially in resource-constrained environments like the Internet of Things. We propose an efficient caching policy to coordinate the CS of a node with its neighbor nodes in a distributed manner so that more and more popular content objects are cached in the neighborhood of the node. To exploit and coordinate CS information among nodes, we urge to enable CS information in the data plane of the network and design an efficient way for CS information transmission. Each node contributes to the objective of its neighborhood by maximizing its number of unique popular content objects being cached in its CS and not cached in the CS of its neighbors. We implement the proposed policy on top of state-of-the-art popularity-based caching schemes. Through analysis and experiments, we show that the proposed caching policy achieves a significant improvement in terms of cache hit ratio, stretch ratio, content retrieval latency, and energy efficiency significantly compared to state-of-the-art schemes.

With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.

Internet has become as a social infrastructure. The current Internet architecture based on TCP/IP is faced with many challenges. This fact makes the clean slate design of future Internet architecture represented by ICN (Information-Centric Networking) be a hot research topic. In this paper, a novel routing scheme for ICN (Information-Centric Networking) is proposed. On the basis of name-based routing, a process was designed to look for other available interface through which the backtracking-condition-met interest packet will be forwarded, which can reduce the network blocking rate. Moreover, FIB (Forwarding Information Base) of neighbor nodes will be modified when data packets go through a router, which can realize the efficient use of cache. Also, a concept of "popularity" is introduced to improve CS (Content Store) hit rate. The proposed routing scheme is implemented on NSFNET by simulation, and the experimental results have shown that it is feasible and effective.

The transition of current Internet from host-centric communication to content-centric communication has been realized due to rapid growth in the number of users and their demands. Named Data Network (NDN) has emerged as Future Internet Architecture to meet the demands related to content oriented communication. Among other data structures such as Forwarding Information Base (FIB) and Content Store (CS), Pending Interest Table (PIT) holds record of the pending interests for which response has not yet received. Despite the benefits of PIT for fast packet forwarding (such as address less communication, loop detection, multi-path routing, packet aggregation, efficient bandwidth utilization), there are challenges faced by PIT. These challenges include name lookup speed, PIT memory consumption and PIT Entry Lifetime (PEL) that may render PIT as a bottleneck and hence will affect the system performance. In this paper, we thoroughly and systematically study the PIT management schemes. Our study covers the solutions for PIT management spanning over the last 7 years. As far as considering our learning, we are the first to study PIT based on both PIT memory size reduction to achieve fast look-up speed and different PEL calculation schemes. The study will help the research community in modeling better and optimized PIT management solutions. The paper also presents the research trends on the basis of different regions, publishing outlets, contributing patterns etc. in the field of PIT management in NDN.

As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6–8% of the traffic for distributing the connectivity information and 5–9% of the memory consumption.

Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively handling this ever-increasing network traffic. In order to realize the NDN, high-speed lookup algorithms for a forwarding information base (FIB) are crucial. This paper proposes a level-priority trie (LPT) and a 2-phase Bloom filter architecture implementing the LPT. The proposed Bloom filters are sufficiently small to be implemented with on-chip memories (less than 3 MB) for FIB tables with up to 100,000 name prefixes. Hence, the proposed structure enables high-speed FIB lookup. The performance evaluation result shows that FIB lookups for more than 99.99% of inputs are achieved without needing to access the database stored in an off-chip memory.

Topicality. The current stage of economic development of the country is characterized by increased globalization, transport, especially in the context of mixed freight transportation, and is an important factor in ensuring integration processes. Identifying the relationship between the development of mixed transportation systems and their management at different levels of the hierarchy requires a number of complex scientific problems. It is necessary to create conditions for the interconnection of different modes of transport on the principles of logistics, competition and at the same time the formation of a single integrated transport space, including the processes of information and telecommunication development. The fall in the volume of interstate freight flows, as well as changes in the routes of freight forwarding, lead to increased interbranch and interstate competition for transit freight flows. This makes the development of mixed freight transportation one of the determining factors for ensuring the country's competitiveness in the international transport market. Aim and tasks. The purpose of the work is to substantiate and develop the methodological bases of mixed cargo transportation, organizational and economic approaches and practical recommendations for the development and management of different levels of the hierarchy. Achieving the goal of the study necessitated the formulation and solution of the following tasks: to summarize the components of the logistics center of management and information support of mixed cargo transportation; substantiate the use of innovative technologies for the management of mixed freight transportation. Research results. The organizational and economic bases of creation of logistic center of management and information support of mixed transportations in the form of DFD-diagram are provided in the work. It is established that the use of cloud technologies in the activities of the logistics center, which will accelerate the information exchange between stakeholders of mixed transport, which will help to solve management problems, reduce subjectivity in decision-making, minimize the time of decision-making and provide high efficiency of transportation and logistics services. Conclusion. The results of the research allow to improve the management of mixed cargo transportation, to identify the necessary tools, to improve the scientific basis of the state policy for the creation and further development of mixed transportation systems, as well as to optimize the parameters of its individual units for both domestic transportation and for further integration into the system.

Abstract The huge amount of content names available in Named-Data Networking (NDN) challenges both the required routing table size and the techniques for locating and forwarding information. Content copies and content mobility exacerbate the scalability challenge to reach content in the new locations. We present and analyze the performance of a proposed Controller-based Routing Scheme, named CRoS-NDN, which preserves NDN features using the same interest and data packets. CRoS-NDN supports content mobility and provides fast content recovery from copies that do not belong to the consumer-producer path because it splits identity from location without incurring FIB size explosion or supposing prefix aggregation. It provides features similar to Content Distribution Networks (CDN) in NDN, and improves the routing efficiency. We compare our proposal with similar routing protocols and derive analytical expressions for lower-bound efficiency and upper-bound latency. We also conduct extensive simulations to evaluate results in data delivery efficiency and delay. The results show the robust behavior of the proposed scheme achieving the best efficiency and delay performance for a wide range of scenarios. Furthermore, CRoS-NDN results in low use of processing time and memory for a growing number of prefixes.

A partir des limites réelles de l'Internet, dans cette thèse, nous étudions différents aspects de deux directions dont l'Internet évolue. En particulier, nous considérons des moyens plus souples pour joindre les hôtes du réseau, et pour distribuer du contenu. Host Centric Networking (HCN) est le nom que nous donnons à l'ensemble des architectures qui tentent de découpler la position et l'identification d'un hôte. Fondamentalement, ils identifient chaque nœud par des étiquettes plates qui ne localisent pas l'hôte dans le réseau. Les architectures HCN utilisent Distributed Hash Tables ( DHT ) pour récupérer la position de l'hôte de l'étiquette correspondante.Toutefois, l'acheminement et la transmission sous-jacente à la DHT, s'appuient fortement sur des algorithmes traditionnels basés sur des chemins uniques. Ainsi, dans la première partie, nous proposons APLASIA, une architecture de routage alternatif composé principalement par un algorithme de recherche de chemin, à savoir APL, et par un plan de données de autoforwarding. Information Centric Networking (ICN) rend le contenu directement adressable par les hôtes du réseau. L'idée de base consiste à envoyer des paquets portant l'identifiant de contenu, plutôt que l'adresse de l'hôte. Comme le contenu peut être facilement mis en cache dans les périphériques réseau, un réseau ICN peut être modélisée comme un réseau de caches orienté vers le récepteur. Dans la deuxième partie de ce travail, nous considérons la mise en oeuvre des algorithmes déployés sur un réseau de caches
Starting from the evidence of the Internet’s actual limits, in this Thesis we investigate different aspects of two directions the Internet is evolving toward. In particular, we consider more flexible ways to reach hosts, and to distribute content. Host Centric Networking (HCN) is the name we give to the umbrella architectures which try to decouple host location and identifiers. Basically, they identify each device by the means of flat labels which do not locate the host within the network. HCN architectures leverage Distributed Hash Table(DHT) approaches for retrieving the host position from the corresponding label. However, routing and forwarding underlying the DHT, heavily rely on traditional single path algorithms. Thus, in the first part we propose APLASIA, an alternative routing architecture mainly composed by a path-finding algorithm, namely APL, and by an autoforwarding data plane. Information Centric Networking (ICN) makes content directly addressable by network hosts. The basic idea is to send packets carrying the content identifier, rather than the host address. As content can be easily cached within network devices, an ICN network can be modeled as a receiver driven network of caches. Indeed, in the second part of this work, we consider caching algorithms deployed over a network of caches. Each of these algorithms is a triplet composed by forwarding (which path is worth following), meta-caching (what content is worth caching), and replacement (what content is worth replacing) strategies

Internet actors should work on an action plan to mitigate the increase of Routing Information Base (RIB) and Forwarding Information Base (FIB) table sizes and the load induced by routing updates churn (BGP Instability Report, n.d.).

This chapter is designed to relate the rationale used by the Department of Defense (DoD), for the military to adapt the principles of Mobile and Voice Commerce to meet increasing global crises and to find ways to more effectively manage manpower and time. A mobile Telemedicine package has been developed by the Department of Defense to collect and transmit near-real-time, far-forward medical data and to assess how this Web-based capability enhances management of the battlespace. Telemedicine has been successful in resolving uncertain organizational and technological military deficiencies and in improving medical communications and information management. The deployable, mobile teams are the centerpieces of this telemedicine package. These teams have the capability of inserting essential networking and communications capabilities into austere theaters and establishing an immediate means for enhancing health protection, collaborative planning, situational awareness, and strategic decision making through Web-based internet applications. In order to supplement this mobile commerce aspect of telemedicine, U.S. Navy ships have been utilized to integrate voice commerce interactive technologies to improve medical readiness and mobility. An experimental group was tasked to investigate reporting methods in health and environmental surveillance inspections to develop criteria for designing a lightweight, wearable computing device with voice interactive capability. This chapter is also designed to relate the rationale used by the Department of Defense and the Test and Evaluation (T&E) Integrated Product Team, in order to determine the military utility of the Joint Medical Operations—Telemedicine Advanced Concept Technology Demonstration (JMO-T ACTD) and continuous voice activation applications. Voice interactive computing devices are used to enhance problem solving, mobility and effectiveness in the battlespace. It improves efficiency through automated user prompts, enhanced data analysis, presentation, and dissemination tools in support of preventive medicine. The device is capable of storing, processing, and forwarding data to a server. The prototype devices have enabled quick, efficient, and accurate environmental surveillance. In addition to reducing the time needed to complete inspections, the device supported local reporting requirements and enhanced command-level intelligence. This chapter further focuses on developing a holistic model of implementing a strategy for mobile telemedicine. The model synthesizes current thinking on transformation into a holistic model and also explains the integrative influence of vision on the other four model components: environment, people, methodology, and IT perspective. The model was tested by Testing and Evaluating (T&E) the JMO-T ACTD. JMO-T ACTD has developed a very successful training program and is very aware of the importance of planned change. Top military officials, such as the Commander in Chief (CINC), are actively involved in change and are committed to people development through learning. The model served an applied purpose by allowing insights into how well the military organization fit current theory. The model also fit a theoretical purpose by organizing a holistic, comprehensive framework. Accordingly, we have organized and synthesized the literature into five interrelated components that act as a fundamental guide for research. The model also helped to identify a theoretical link and apply it to the internal operations of the military and its adaptation of mobile e-commerce principles to more effectively deliver telemedicine benefits to military personnel.