scispace - formally typeset
Search or ask a question
Topic

Routing table

About: Routing table is a research topic. Over the lifetime, 16589 publications have been published within this topic receiving 336842 citations. The topic is also known as: routing information base & RIB.


Papers
More filters
Journal Article
TL;DR: In this paper, the authors present a family of adaptive routing schemes for general networks, which guarantee a stretch factor of O (k 2 · 3k) and require storing at most O (knk log n) bits of routing information per vertex.
Abstract: In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor - the maximum ratio between the cost of a route computed by the scheme and that of a cheapest path connecting the same pair of vertices.This paper presents a family of adaptive routing schemes for general networks. The hierarchical schemes H Sk (for every fixed k ≥ 1) guarantee a stretch factor of O (k2 · 3k) and require storing at most O (knk log n) bits of routing information per vertex. The new important features, that make the schemes appropriate for adaptive use, are applicability to networks with arbitrary edge costs;name-independence, i.e., usage of original names;a balanced distribution of the memory;an efficient on-line distributed preprocessing.

83 citations

Proceedings ArticleDOI
15 May 2010
TL;DR: By properly selecting weights associated with QoS and social trust metrics for trust evaluation, trust management protocols can approximate the ideal performance obtainable by epidemic routing in delivery ratio and message delay without incurring high message overhead.
Abstract: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only quality-of-service (QoS) trust properties (connectivity) but also social trust properties (honesty and unselfishness) to evaluate other nodes encountered. Two versions of trust management protocols are considered: an equal-weight QoS and social trust management protocol (called trust-based routing) and a QoS only trust management protocol (called connectivity-based routing). By utilizing a stochastic Petri net model describing a DTN behavior, we analyze the performance characteristics of these two routing protocols in terms of message delivery ratio, latency, and message overhead. We also perform a comparative performance analysis with epidemic routing for a DTN consisting of heterogeneous mobile nodes with vastly different social and networking behaviors. The results indicate that trust-based routing approaches the ideal performance of epidemic routing in delivery ratio, while connectivity-based routing approaches the ideal performance in message delay of epidemic routing, especially as the percentage of selfish and malicious nodes present in the DTN system increases. By properly selecting weights associated with QoS and social trust metrics for trust evaluation, our trust management protocols can approximate the ideal performance obtainable by epidemic routing in delivery ratio and message delay without incurring high message overhead.

83 citations

Book ChapterDOI
29 Aug 1995
TL;DR: In this paper, a technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described, which handles solid faults in meshes, including all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T.
Abstract: A technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described. This method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive and nonadaptive fault-tolerant routing algorithms using four virtual channels per physical channel are described.

83 citations

Proceedings ArticleDOI
30 Aug 2010
TL;DR: This paper proposes Resilient Routing Reconfiguration (R3), a novel routing protection scheme that is provably congestion-free under a large number of failure scenarios, efficient by having low router processing overhead and memory requirements, and robust to both topology failures and traffic variations.
Abstract: Network resiliency is crucial to IP network operations. Existing techniques to recover from one or a series of failures do not offer performance predictability and may cause serious congestion. In this paper, we propose Resilient Routing Reconfiguration (R3), a novel routing protection scheme that is (i) provably congestion-free under a large number of failure scenarios; (ii) efficient by having low router processing overhead and memory requirements; (iii) flexible in accommodating different performance requirements (e.g., handling realistic failure scenarios, prioritized traffic, and the trade-off between performance and resilience); and (iv) robust to both topology failures and traffic variations. We implement R3 on Linux using a simple extension of MPLS, called MPLS-ff. We then conduct extensive Emulab experiments and simulations using realistic network topologies and traffic demands. Our results show that R3 achieves near-optimal performance and is at least 50% better than the existing schemes under a wide range of failure scenarios.

83 citations

Proceedings ArticleDOI
22 Apr 2008
TL;DR: This work developed two distributed algorithms for solving large-scale networks with n nodes, out of which k are in possession, based on simple random walks and Fountain codes that do not know n, k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables.
Abstract: We consider large-scale networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet and the original k source packets can be recovered later in a computationally simple way from any (1 + \varepsilon)k nodes for some small \varepsilon > 0. We developed two distributed algorithms for solving this problem based on simple random walks and Fountain codes. Unlike all previously developed schemes, our solution is truly distributed, that is, nodes do not know n, k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables. In the first algorithm, all the sensors have the knowledge of n and k. In the second algorithm, each sensor estimates these parameters through the random walk dissemination. We present analysis of the communication/transmission and encoding/decoding complexity of these two algorithms, and provide extensive simulation results as well.

82 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
92% related
Server
79.5K papers, 1.4M citations
91% related
Wireless ad hoc network
49K papers, 1.1M citations
91% related
Wireless network
122.5K papers, 2.1M citations
90% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202331
202294
2021119
2020293
2019411
2018493