We prove a shape theorem for rotor-router aggregation on the comb, for a specific initial rotor configuration and clockwise rotor sequence for all vertices. Furthermore, as an application of rotor-router walks, we describe the harmonic measure of the rotor-router aggregate and related shapes, which is useful in the study of other growth models on the comb. We also identify the shape for which t...

We recognize two trends in router design: increasing pressure to extend the set of services provided by the router and increasing diversity in the hardware components used to construct the router. The consequence of these two trends is that it is becoming increasingly difficult to map the services onto the underlying hardware. Our response to this situation is to define a virtual router archite...

This paper compares the implementation results of two architectures for virtual channel router. Since the router is used for building an on-chip network, its small size is critical. Together with the total design area we provide information about the distribution of this area between the main router blocks and thus give insight about the cost of each block. The comparison shows that one of the ...

The main interconnecting device of today’s Internet the router, forwards IP packets without any true Quality of Service (QoS) considerations. This paper discusses a new approach for routing IP packets, which provides a basic QoS characteristic. It is shown that, by fine-tuning the parameters of a multi-port router, service discrimination can be achieved, according to the priority value set for ...

It is proposed that a new role: Router Node is introduced to the Bluetooth Personal Area Network profile to enable multiple hops between piconets. A proposed structure that allows transparent piconet connection is illustrated. The resulting increase in data throughput is particularly important for scalable PAN communications where multiple hops between piconets are needed. A software system has...

We present the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router n...

As interest in IPv6 deployment in cellular networks increases, several migration issues have been being raised; IPv6 prefix management is the issue addressed in this document. Based on the idea that DHCPv6 servers can manage prefixes, we use DHCPv6 Prefix Delegation to address such prefix management issues as an access router offloading delegation of prefixes and release tasks to a DHCPv6 serve...

Programmable networks offer the ability to customize router behaviour at run time, thus increasing flexibility of network administration. Programmable network routers are configured using domain-specific languages. The ability to evolve router programs dynamically creates potential for misconfigurations. By exploiting domain-specific abstractions, we are able to translate router configurations ...

The model is a service system, consisting of several large server pools. A server processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the customer total arrival rate and poo...