A distributed spanning tree algorithm for topology-aware networks

Abstract. A topology-aware network is a dynamic network in which the nodes can detect whether locally topology changes occur. Many modern networks, like IEEE 1394.1, are topology-aware networks. We present a distributed algorithm for computing and maintaining an arbitrary spanning tree in such a topology-aware network. Although usually minimal spanning trees are studied, in practice arbitrary spanning trees are often sufficient. Since our algorithm is not involved in the detection of topology changes, it performs better than the spanning tree algorithms in standards like IEEE 802.1. Because reasoning about distributed algorithms is rather tricky, we use a systematic approach to prove our algorithm

Link layer multi-priority frame forwarding

With increasing demand for multimedia and real-time applications, local area network (LAN) technologies are rapidly being upgraded to support Quality-of-Service (QoS). Many QoS-enabled LANs are making use of resource allocation mechanisms that can discriminate among traffic classes of different priorities. When such LANs are interconnected by bridges to form an extended LAN, it is necessary to upgrade the bridges so that they are QoS-enabled as well. For example, the IEEE 802.1p standard defines a framework for priority queuing in bridges. Alternatively, frame forwarding decisions at the link layer may be modified to recognize frame priorities and alternate paths may be used for differentiating QoS. In this paper, we describe a novel bridge protocol that can forward frames of different priorities using different paths. Our protocol ensures that the forwarding path of a higher priority frame is never longer than the forwarding path of a lower priority frame.published_or_final_versio

Agents in Network Management

The ubiquity and complexity of modern networks require automated management and control. With increases in scale, automated solutions based on simple data access models such as SNMP will give way to more distributed and algorithmic techniques. This article outlines present and near-term solutions based on the ideas of active networks and mobile agents, which permit sophisticated programmable control and management of ultra large scale networks

A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip

The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.Comment: Presented at 11th International Workshop on Network on Chip Architectures (NoCArc 2018

A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip

The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.Comment: Presented at 11th International Workshop on Network on Chip Architectures (NoCArc 2018