This paper is devoted to researching the routing reliability and router standby mechanism for smart and cooperation network. The method of updating and initiating the standby router has been also provided. With the aid of virtual interface, both the main router and standby router will be transparent to the network. Through Mini-Net simulated experiment, this paper has verified the mechanism. It...

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This document reflects an existing deployed protocol. The IETF does have a working group which is in the process of producing a standards track protocol to address the same issues. Abstract The memo specifies the Hot Standby...

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...

as technology scales deep into the nanometer regime, on-chip communication becomes more susceptible to transient noise sources, such as crosstalk, external radiation, and spurious voltage spikes. the network on chip s modularity and reusability has brought about the use of error control methods to address transient errors in network on chip links.in this work, we design a fault tolerance router...

OSPF (Open Shortest Path First), which is used widely on networks, has a Router Dead Interval problem. If a (backup) designated router has stopped operation due to failure, the OSPF routers await a hello packet acknowledgment for the router dead interval to recognize that the designated router has ceased the operation. The Router Dead Interval is 40 sec This interval time is not only long for m...

The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph [1]. Instead of distributing tokens to randomly chosen neighbors, the rotor-router model deterministically serves the neighbors in a fixed order by associating to each vertex a “rotor-router” pointing to one of its neighbors. The rotor-router model sometimes appears under th...

An asynchronous router for quality-of-service Networks on Chip (QNoC) is presented. It combines multiple service levels (SL) with multiple equal-priority virtual channels (VC) within each SL. VCs are assigned dynamically per packet in each router. The router employs fast arbitration schemes to minimize latency. Analytical expressions for a generic NoC router performance, area and power are deri...

This paper introduces a router delay model that accurately models key aspects of modern routers. The model accounts for the pipelined nature of contemporary routers, the specific flow control method employed, the delay of the flowcontrol credit path, and the sharing of crossbar ports across virtual channels. Motivated by this model, we introduce a microarchitecture for a speculative virtual-cha...