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
Proceedings ArticleDOI
24 Jun 2007
TL;DR: It is shown that a hierarchical routing scheme based on the MAC association procedures offers several benefits with respect to reactive routing in typical sensor network applications.
Abstract: An IEEE 802.15.4-based wireless sensor network is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in the framework of the ZigBee alliance are analyzed. The first is the well-known ad-hoc on demand distance vector (AODV) routing protocol, which was designed for highly dynamic application scenarios in wireless ad-hoc networks. The second is a tree-based routing scheme based on a hierarchical structure established among nodes during the network formation phase. This latter approach, referred to as HERA (hierarchical routing algorithm) in the paper, routes packets from sensors to sink based on the parent-child relationships established by the IEEE 802.15.4 topology formation procedure. An extensive simulation analysis is carried out to compare HERA and AODV. It is shown that a hierarchical routing scheme based on the MAC association procedures offers several benefits with respect to reactive routing in typical sensor network applications. Moreover, it is to be noted that most sensor network scenarios are concerned with delivery of packets from a series of static sensors to a single, static, sink.

117 citations

Proceedings ArticleDOI
07 Mar 2004
TL;DR: This work demonstrates that the use of multipath routing offers significant advantages in bandwidth provisioning for VPNs and presents an optimal polynomial-time algorithm that computes a bandwidth reservation of minimum cost using multi-path routing.
Abstract: A virtual private network (VPN) provides private network connections over a publicly accessible shared network Bandwidth provisioning for VPNs leads to challenging optimization problems In the hose model proposed by Duffield et al, each VPN endpoint specifies bounds on the total amount of traffic that it will send or receive at any time The network provider must provision the VPN so that there is sufficient bandwidth for any traffic matrix that is consistent with these bounds While previous work has considered tree routing and single-path routing between the VPN endpoints, we demonstrate that the use of multipath routing offers significant advantages On the one band, we present an optimal polynomial-time algorithm that computes a bandwidth reservation of minimum cost using multi-path routing This is in contrast to tree routing and single-path routing, where the problem is computationally hard On the other hand, we present experimental results showing that the reservation cost using multi-path routing can indeed be significantly smaller than with tree or single-path routing

117 citations

Journal ArticleDOI
TL;DR: The log-normal shadow fading model is applied to represent a realistic physical layer and use the probability p(x) for receiving a packet successfully as a function of distance x between two nodes to reduce computation time.
Abstract: Existing routing and broadcasting protocols for ad hoc networks assume an ideal physical layer model. We apply the log-normal shadow fading model to represent a realistic physical layer and use the probability p(x) for receiving a packet successfully as a function of distance x between two nodes. We define the transmission radius R as the distance at which p(R)=0.5. We propose a medium access control layer protocol, where receiver node acknowledges packet to sender node u times, where u*p(x)/spl ap/1. We derived an approximation for p(x) to reduce computation time. It can be used as the weight in the optimal shortest hop count routing scheme. We then study the optimal packet forwarding distance to minimize the hop count, and show that it is approximately 0.73R (for power attenuation degree 2). A hop count optimal, greedy, localized routing algorithm [referred as ideal hop count routing (IHCR)] for ad hoc wireless networks is then presented. We present another algorithm called expected progress routing with acknowledgment (referred as aEPR) for ad hoc wireless networks. Two variants of aEPR algorithm, namely, aEPR-1 and aEPR-u are also presented. Next, we propose projection progress scheme, and its two variants, 1-Projection and u-Projection. Iterative versions of aEPR and projection progress attempt to improve their performance. We then propose tR-greedy routing scheme, where packet is forwarded to neighbor closest to destination, among neighbors that are within distance tR. All described schemes are implemented, and their performances are evaluated and compared.

117 citations

Patent
30 Sep 1993
TL;DR: In this paper, a routing table within the NESTP, a plurality of prioritized route lists are provided for at least some destinations, the list that is used to route a particular message to such a destination being a function of the route by which that message arrived at the NestP.
Abstract: Network elements in a telecommunications network, such as toll switches, databases and the like, are provided with redundant SS7 signaling interfaces based on different software designs. At least one of the interfaces, referred to as a network endpoint signaling transfer point, or NESTP, is loosely coupled to its host and has signaling transfer point (STP) capabilities. In a routing table within the NESTP, a plurality of prioritized route lists are provided for at least some destinations, the list that is used to route a particular message to such a destination being a function of the route by which that message arrived at the NESTP.

117 citations

Proceedings ArticleDOI
05 Nov 2000
TL;DR: With comparable routing quality, this work shows that it can predictably route up to 80% of a selected subset of nets and introduces methods for finding a group of nets which can be predictably routed.
Abstract: Predictable routing is the concept of using prespecified patterns to route a net. By doing this, we allow an more accurate prediction mechanism for metrics such as congestion and wirelength earlier in the design flow. Additionally, we can better plan the routes, insert buffers and perform wire sizing earlier. With comparable routing quality, we show that we can predictably route up to 80% of a selected subset of nets. Also, we introduce methods for finding a group of nets which can be predictably routed.

117 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