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.

Stochastic routing in ad-hoc networks

Abstract: We investigate a network routing problem where a probabilistic local broadcast transmission model is used to determine routing. We discuss this model's key features, and note that the local broadcast transmission model can be viewed as soft handoff for an ad-hoc network. We present results showing that an index policy is optimal for the routing problem. We extend the network model to allow for control of transmission type, and prove that the index nature of the optimal routing policy remains unchanged. We present three distributed algorithms which compute an optimal routing policy, discuss their convergence properties, and demonstrate their performance through simulation.

Forwarding anomalies in Bloom filter-based multicast

Abstract: Several recently proposed multicast protocols use in-packet Bloom filters to encode multicast trees. These mechanisms are in principle highly scalable because no per-flow state is required in the routers and because routing decisions can be made efficiently by simply checking for the presence of outbound links in the filter. Yet, the viability of previous approaches is limited by the possibility of forwarding anomalies caused by false positives inherent in Bloom filters. This paper explores such anomalies, namely (1) packets storms, (2) forwarding loops and (3) flow duplication. We propose stateless solutions that increase the robustness and the scalability of Bloom filter-based multicast protocols. In particular, we show that the parameters of the filter need to be varied to guarantee the stability of the packet forwarding, and we present a bit permutation technique that effectively prevents both accidental and maliciously created anomalies. We evaluate our solutions in the context of BloomCast, a source-specific inter-domain multicast protocol, using analytical methods and simulations.

Evaluating advanced routing algorithms for content-based publish/subscribe systems

Abstract: We present an evaluation of advanced routing algorithms for content-based publish/subscribe systems that focuses on the inherent characteristics of routing algorithms (routing table sizes and filter forwarding overhead) instead of system-specific parameters (CPU load etc.). The evaluation is based on a working prototype instead of simulations and compares several routing algorithms to each other. Moreover, the effects of locality among the interests of the consumers are investigated. The results offer new insights into the behavior of content-based routing algorithms. Firstly, advanced routing algorithms can be considered mandatory in large-scale publish/subscribe systems. Secondly, the use of advertisements considerably improves scalability. Thirdly, advanced routing algorithms operate efficiently in more dynamic environments than was previously thought. Finally, the good behavior of the algorithms improves even if the interests of the consumers are not evenly distributed, which can be expected in practice.

Avoiding transient loops during IGP convergence in IP networks

Abstract: When the topology of an IP network changes due to a link failure or a link metric modification, the routing tables of all the routers must be updated Each of those updates may cause transient loops In this paper, we prove that by ordering the updates of the routing tables on the routers, it is possible to avoid all transient loops during the convergence of ISIS or OSPF after a planned link failure, an unplanned failure of a protected link and after a link metric modification We then propose a protocol that allows the routers to order the update of their routing tables to avoid transient loops without requiring any complex computation

Method and apparatus for selecting redundant routers using tracking

Abstract: A method for electing a master router in a virtual router network by obtaining a tracking parameter for each of the routers participating in a virtual router network. A priority value is assigned to each of the plurality of routers based on the tracking parameter and reported to each router at periodic intervals. The router with the highest priority value is elected, or re-elected, as the new master. The tracking parameters include a ping tracking parameter obtained by pinging the active routes listed in the routing table for each of the of routers participating in the virtual router network, an environmental tracking parameter obtained by inspecting the operating characteristics outside of the control of the router, including operating temperature and power supply status, and a diagnostic tracking parameter obtained by inspecting the diagnostic data representing operating characteristics within the control of the router, including an operability status of the router's circuitry and channels and a status of the packet-level connectivity to the physical layer backplane network.