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
03 Apr 1995
TL;DR: In this paper, a routing code table is generated in response to the predicted call traffic matched to shortest path routes in order to assign logical routing IDs to physically distinct, shortest paths in proportion to the expected call traffic allocated to the distinct routes.
Abstract: A communications network (20) includes any number of moving switching nodes (30) and a route-determining node (28). The route-determining node (28) performs an off-line procedure (58) to define a-priori routing for the entire network. This procedure (58) is performed repetitively to track switching node (30) movement and to define routing for numerous epochs included in a planning period. The procedure (58) includes a process (86) for determining all shortest path routes between all possible origination and destination switching nodes (30). Another process (84) matches predicted call traffic for a subject epoch with the shortest path routes. Another process (88) generates routing code tables (54) in response to the predicted call traffic matched to shortest path routes. This process (88) assigns logical routing IDs (52) to physically distinct, shortest path routes in proportion to the predicted call traffic allocated to the distinct routes.

69 citations

Proceedings ArticleDOI
17 Jun 2015
TL;DR: In this article, the authors propose a simple approach to realize the vision of a flexible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice.
Abstract: An emerging architecture for software-defined data centers andWANs is the network fabric, where complex application-sensitive functions are factored out, leaving the network itself to provide a simple, robust high-performance data delivery abstraction. This requires performing route optimization, in real time and across a diverse choice of paths. A large variety of techniques have been proposed to provide path diversity for network fabrics. But, running up against the constraint of forwarding table size, these proposals are topology-dependent, complex, and still only provide limited path choice which (we show) can impact performance.We propose a simple approach to realize the vision of a flexible, high-performance fabric: the network should expose every possible path, allowing a controller or edge device maximum choice. To this end, we observe that source routing can be encoded and processed compactly into a single field, even in large networks, with OpenFlow 1.3. We show that, in addition to the expected decrease in required forwarding table size, source routing supports optimal throughput performance, in some cases significantly higher than some past proposals. We thus believe source routing offers a clean abstraction and efficient implementation for future network fabrics.

69 citations

Patent
10 Dec 2002
TL;DR: In this article, a routing apparatus for routing data in a receiver/decoder is presented, which consists of means for receiving real-time user routing control information and means for routing the data from an input to an output, to storage means, and to both the output and the storage means in accordance with the received realtime user data control information.
Abstract: The present invention discloses a routing apparatus for routing data in a receiver/decoder. The routing apparatus comprises means for receiving realtime user routing control information and means for routing the data from an input to an output, to storage means, and to both the output and the storage means in accordance with the received realtime user routing control information. In other aspects, a command for controlling a data transfer of a bit stream between a source and a destination, where the command is adapted to change at least one of the source and destination of the transfer, and apparatus for receiving and processing data comprising means for receiving the data and means for synchronising the data in two or more different modes, are also disclosed.

69 citations

Proceedings ArticleDOI
01 Apr 1997
TL;DR: Under restricted architectural assumptions, a new lower bound for detailed routing is computed and it is shown that the detailed router typically requires no more than two extra routing tracks above this computed limit.
Abstract: We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, we compute a new lower bound for detailed routing and show that our detailed router typically requires no more than two extra routing tracks above this computed limit. Also, experimental results show that the Mapping Anomaly presented in [20], which suggests that separated routing may yield arbitrarily poor results in certain instances, is a concern only if nets are restricted to a single track domain. Finally, to motivate future work, we show the latest two-step routing results that we have achieved with the VPR global router and SEGA detailed router tools on the largest CBL benchmark circuits.

69 citations

Proceedings ArticleDOI
21 May 2007
TL;DR: The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost and demonstrated that the two- hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius.
Abstract: The hop distance strategy in wireless sensor networks (WSNs) has a major impact on energy consumption of each sensor mote. Long-hop routing minimizes reception cost. However, a substantial power demand is incurred for long distance transmission. Since the transceiver is the major source of power consumption in the node, optimizing the routing for hop length can extend significantly the lifetime of the network. This paper explores when multi-hop routing is more energy efficient than direct transmission to the sink and the conditions for which the two-hop strategy is optimal. Experimental evidence is provided in to support of these conclusions. The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost. They also demonstrated that the two- hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius. Our results may be used in existing routing protocols to select optimal relays or to determine whether it is better to send packets directly to the base station or through intermediate nodes.

69 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