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...

A flow control mechanism, express virtual channels (EVCs), was recently presented to close the gap between packetswitched networks and the ideal interconnection through virtually bypass intermediate routers. Currently, EVCs paths are inserted regularly. This paper proposes a novel methodology to insert EVCs in an application-specific way (AS-EVC) by exploiting communication characteristics of a...

Static nodes, e.g. houses, educational institutions etc, can comprise ad-hoc networks using off-the-self wireless technologies with a view to bypass expensive telecommunication solutions. A suburban adhoc network (SAHN) aims to provide such an inexpensive broadband networking alternative for communities of cooperating users using wireless medium. There exists a plethora of efficient routing sol...

In this paper we present imss: IP Multicast Shortcut Service for ATM networks. imss pursues the \short-cut" routing paradigm in order to exploit the underlying ATM QoS and native routing mechanisms in the optimal way. imss is built on top of congress (CONnection oriented Group-address RESolution Service). Congress is an eecient native ATM protocol for resolution and management of multicast grou...

NetTap is a new platform for prototyping, fieldtesting, and deploying network services. NetTap is based on a PC running FreeBSD. NetTap can be configured as a bridge, router, or host. NetTap’s API allows user-level network applications to send or receive packets, on standard network adapters, without copying or system call overheads. NetTap’s watchdog timer and simple bypass switch can be confi...

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...