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
Patent
Noboru Endo1, Masataka Takano1
28 Feb 1996
TL;DR: In this article, a line interface tests whether or not a failure has occurred in an output line involved in the normal route, by referring to a bitmap 264 storing failure lines and a VP failures.
Abstract: An ATM switching system at each node of a network performs route changing or rerouting promptly when a failure occurs. In each of ATM switching systems at nodes N1 to N6: a route table 21 of a line interface 102 is set with conversion header information of a normal route, and an alternate routing table 25 is set with header information of one or more alternate routes. Subsequently, each line interface tests, when a packet arrives, whether or not a failure has occurred in an output line involved in the normal route, by referring to a bitmap 264 storing failure lines and a VP failures. The line interface executes header conversion by applying the normal header information stored in the routing table 21 in the case of no failure set for the normal route and by applying the header information stored in the alternate routing table 25 in case a failure has occurred on the normal route, and then outputs the packet to an ATM switch 101. Since the alternate route is promptly selected at the time of a failure of a net line and not in response to decoding a header of a received packet, the number of packets discarded due to the failure is reduced, and the rerouting operation is promptly executed even in the case of multiple failures.

71 citations

Journal ArticleDOI
TL;DR: This article presents a new network architecture that eliminates the need of multi-hop flooding for route discovery, thereby enabling WDNs to scale and substantially improve scalability and reliability of Wdns, especially in mobile environments.
Abstract: Scalability is a key issue in large scale WDNs, such as vehicular networks and device-to-device networks. To address the issue, this article extends the SDN concept, and presents a new network architecture that eliminates the need of multi-hop flooding for route discovery, thereby enabling WDNs to scale. The key idea of the new architecture is to split network control and data forwarding by using two separate frequency bands. Another important aspect of the architecture is that computational complexity of routing is split between the SDN controller and the forwarding nodes, thereby allowing nodes to make distributed routing decisions. As a result, network control of the new architecture has a hybrid structure, which improves the operability and scalability of large scale WDNs. Our case study shows that the new architecture is able to substantially improve scalability and reliability of WDNs, especially in mobile environments.

71 citations

Journal ArticleDOI
TL;DR: Simulation results show that SGF achieves significant energy savings and outperforms several existing data forwarding protocols in terms of packet delivery ratio and end-to-end delay.
Abstract: Limitation on available resources is a major challenge in wireless sensor networks. Due to high rates of unexpected node/link failures, robust data delivery through multiple hops also becomes a critical issue. In this article we present a state-free gradient-based forwarding (SGF) protocol to address these challenges. Nodes running SGF do not maintain states of neighbors or network topology and thus can scale to very large networks. Without using routing tables, SGF builds a cost field called gradient that provides each node the direction to forward data. The maintenance of gradient is purely driven by data transmissions and hence incurs little overhead. To adapt to transient channel variations and topology changes, the forwarder of a routing node is selected opportunistically among multiple candidate nodes through a distributed contention process. Simulation results show that SGF achieves significant energy savings and outperforms several existing data forwarding protocols in terms of packet delivery ratio and end-to-end delay.

71 citations

Journal ArticleDOI
TL;DR: The aim of this survey is to examine how opportunistic forwarding and network coding can achieve performance gains by performing hop-by-hop route construction and by encoding data packets at intermediate nodes.

70 citations

Patent
24 Aug 1987
TL;DR: In this paper, the window manager may modify the routing table and all keycodes remaining in the buffer are routed to their associated processes as determined by the modified routing table, unless otherwise indicated, a keycode is routed to the active process.
Abstract: A computer system in which multiple processes may run concurrently includes a window manager for displaying windows associated with different processes. One of the processes represented by a window may be designated as active. Keystrokes are translated by a keyboard driver to events represented by keycodes. The keycodes are routed to processes with which they are associated by reference to a routing table. Unless otherwise indicated, a keycode is routed to the active process. Where a keycode is associated with and transferred to the window manager, subsequent keycodes are stored in a typeahead buffer. The window manager may modify the routing table. After completion of the window manager operation, all keycodes remaining in the buffer are routed to their associated processes as determined by the modified routing table.

70 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