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
21 Mar 1999
TL;DR: The Optimal Routing Table Constructor (ORTC) algorithm that is presented produces routing tables with roughly 60% of the original number of prefixes for large backbone routers.
Abstract: The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present produces routing tables with roughly 60% of the original number of prefixes. The publicly available MaeEast database with 41315 prefixes reduces to 23007 prefixes when ORTC is applied. We present performance measurements on four publicly available databases and a formal proof that ORTC does produce the optimal set of routes.

209 citations

Proceedings Article
02 Apr 2013
TL;DR: This work creates an engineered network and routing protocol that can almost instantaneously reestablish connectivity and load balance, even in the presence of multiple failures, and shows that following network link and switch failures, F10 has less than 1/7th the packet loss of current schemes.
Abstract: The data center network is increasingly a cost, reliability and performance bottleneck for cloud computing. Although multi-tree topologies can provide scalable bandwidth and traditional routing algorithms can provide eventual fault tolerance, we argue that recovery speed can be dramatically improved through the co-design of the network topology, routing algorithm and failure detector. We create an engineered network and routing protocol that directly address the failure characteristics observed in data centers. At the core of our proposal is a novel network topology that has many of the same desirable properties as FatTrees, but with much better fault recovery properties. We then create a series of failover protocols that benefit from this topology and are designed to cascade and complement each other. The resulting system, F10, can almost instantaneously reestablish connectivity and load balance, even in the presence of multiple failures. Our results show that following network link and switch failures, F10 has less than 1/7th the packet loss of current schemes. A trace-driven evaluation of MapReduce performance shows that F10's lower packet loss yields a median application-level 30% speedup.

208 citations

Proceedings ArticleDOI
26 Mar 2000
TL;DR: REUNITE supports load balancing and graceful degradation such that when a router does not have resources to support additional multicast groups, the branching can be automatically migrated to other less-loaded routers.
Abstract: We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP addresses. Instead, both group identification and data forwarding are based on unicast IP addresses. Compared with existing IP multicast protocols, REUNITE has several unique properties. First, only routers that are acting as multicast tree branching points for a group need to keep the multicast forwarding state of the group. All other non-branching-point routers simply forward data packets by unicast routing. In addition, REUNITE can be incrementally deployed in the sense that it works even if only a subset of the routers implement the protocol. Furthermore, REUNITE supports load balancing and graceful degradation such that when a router does not have resources (forwarding table entry, buffer space, processing power) to support additional multicast groups, the branching can be automatically migrated to other less-loaded routers. Finally, sender access control can be easily supported in REUNITE.

208 citations

Proceedings ArticleDOI
21 Mar 1999
TL;DR: The network routing messages exchanged between core Internet backbone routers are examined to show that as a result of specific router vendor software changes suggested by earlier analysis, the volume of Internet routing updates has decreased by an order of magnitude.
Abstract: This paper examines the network routing messages exchanged between core Internet backbone routers. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. In an earlier study of inter-domain routing, we described widespread, significant pathological behaviour in the routing information exchanged between backbone service providers at the major US public Internet exchange points. These pathologies included several orders of magnitude more routing updates in the Internet core than anticipated, large numbers of duplicate routing messages, and unexpected frequency components between routing instability events. The work described in this paper extends our earlier analysis by identifying the origins of several of these observed pathological Internet routing behaviour. We show that as a result of specific router vendor software changes suggested by our earlier analysis, the volume of Internet routing updates has decreased by an order of magnitude. We also describe additional router software changes that can decrease the volume of routing updates exchanged in the Internet core by an additional 30 percent or more. We conclude with a discussion of trends in the evolution of Internet architecture and policy that may lead to a rise in Internet routing instability.

207 citations

Patent
Kazuya Suzuki1, Masahiro Jibiki1
10 Jun 2004
TL;DR: In this paper, the route information used for dynamic route control can be shared by an active router and a standby router even in normal operation, and the route calculation is performed according to a routing protocol, enabling efficient operation.
Abstract: Route information used for dynamic route control can be shared by an active router and a standby router even in normal operation. After route calculation is performed according to a routing protocol, the calculated route information can be shared, enabling efficient operation. Protocol engine sections (31a to 31d) communicate with routers (41, 42), calculate a route to be selected for the routing according to the corresponding protocol. When the route information is altered, a route sharing information transmitting section (33) transmits the route information to the standby router. The protocol engine section in each router acting as an active router communicates with the router (41, 42), calculates a route to be selected for the routing according to the corresponding protocol, and transmits the route information, if it is altered. A route sharing information receiving section (34) receives the route information.

207 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