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.

Fault tolerant switching architecture

Abstract: A fault tolerant switching architecture is provided with two separate switch fabrics each having a switch cure located in a centralized building and a set of SCAL elements distributed in different physical areas. Each SCAL element has both a SCAL receive element and a SCAL transmit element for access to a corresponding input and output port of the swatch core. A set of port adapters is distributed at different physical areas, with each connected switch fabrics via a particular SCAL element so that each switch core receives the sequence of cells coming from any port adapter and conversely any port adapter may receive cells from either one of the switch cores. Each switch fabric can detect an internal breakdown condition occurring in one of its element and send an error control signal to the peer element located in the other switch fabric. Each switch core extracts the Switch Routing Header (SRH) from the cells entering the switch core, and a routing table for obtaining a bit map value that indicates the output ports to which the cell should be routed. An additional controllable masking mechanism is used for altering the value of the bit map in response to the detection of the error control signal from the peer switch core. The routing process is then performed with the altered value of the bitmap.

Exploit the known or explore the unknown?: hamlet-like doubts in ICN

Abstract: Most Information Centric Networking designs propose the usage of widely distributed in-network storage. However, the huge amount of content exchanged in the Internet, and the volatility of content replicas cached across the network pose significant challenges to the definition of a scalable routing protocol able to address all available copies. In addition, the number of available copies of a given content item and their distribution among caches is clearly impacted by the request forwarding policy.In this paper we gather initial design considerations for an ICN request forwarding strategy by spanning over two extremes: a deterministic exploitation of forwarding information towards a "known" copy and a random network exploration towards an "unknown" copy, via request flooding. By means of packet-level simulations, we investigate the performance trade-offs of exploitation/exploration approaches, and introduce an hybrid solution. Our forwarding scheme shows a good potential, whether carefully tuned, in terms of delivery performance, implicit cache coordination and possible reduction of forwarding table size.

On fast address-lookup algorithms

Abstract: The growth of the Internet and its acceptance has sparkled keen interest in the research community in respect to many apparent scaling problems for a large infrastructure based on IP technology. A self-contained problem of considerable practical and theoretical interest is the longest-prefix lookup operation, perceived as one of the decisive bottlenecks. Several novel approaches have been proposed to speed up this operation that promise to scale forwarding technology into gigabit speeds. This paper surveys these new lookup algorithms and classifies them based on applied techniques, accompanied by a set of practical requirements that are critical to the design of high-speed routing devices. We also propose several new algorithms to provide lookup capability at gigabit speeds. In particular, we show the theoretical limitations of routing table size and show that one of our new algorithms is almost optimal, while requiring only a small number of memory accesses to perform each address lookup.