David C. Blight

Annotated reference list agents

The agents described in the article were used to create a system which does most of the creation, addition, and maintenance of an annotated reference list page. This system has been used to maintain a telecommunications Web page for the last two years. The strength of this system is that it automatically locates a large number of potential links which may be included in the Web page, and uses a fairly fast method of interfacing with the list maintainer to verify links before their inclusion. The paper discusses the implementation of agents to automate the task of maintaining an annotated reference list.

Modeling and simulation of ATM networks

B-ISDN can support various communication services because it uses ATM as the basis and ATM is a high-bandwidth, low-delay, cell switching and multiplexing technology. OPNET (OPtimized Network Engineering Tools) is a CAD tool which is specialized in communication protocols and networks. This paper presents our work in developing ATM network models with OPNET.

Neural network-based ATM QoS estimation

A key technology for the B-ISDN is asynchronous transfer mode (ATM). ATM traffic management or congestion control is needed to guarantee the quality of service (QoS) parameters. A neural network-based QoS estimation is presented to enhance the performance in ATM management so that the service-providers can offer better services to their users. Several methods such as learning vector quantization (LVQ) and self-organizing map (SM) are used to estimate the QoS levels.

An adaptive message passing environment for water scale systems

An overview of wafer scale systems, including a discussion of yield requirements that could make them viable alternatives for the next generation of computers, is presented. Following this, an architecture necessary in order to fully exploit concurrent processing in an inherently faulty environments such as that envisioned by wafer scale systems is presented. This includes a discussion of exploiting nondeterministic message passing and adaptation for fault and congestion avoidance. The long-term goal of this work is to present a concurrent computer system with emphasis on improving general processing efficiency as opposed to achieving optimal processing upper bounds for specific algorithms. >

Self-Organizing Kohonen Maps for FPL Placement

In this paper we present a novel placement algorithm for FPGAs. This algorithm is based upon the self-organizing map used in unsupervised learning algorithms for artificial neural networks performing pattern classification. The self-organizing map is used to map the connectivity of the design to a two dimensional regular mesh topology. This is followed by simple compaction to minimize wire costs.

Adaptive nondeterministic routing in mesh connected networks

Abstract A new nondeterministic adaptive routing algorithm for routing messages in faulty processor arrays is presented. This algorithm adjusts bias values concurrently with network operation, and allows the network to adjust routing parameters to compensate for communication congestion and faulty processors. Application to WSI processor arrays is discussed.

A review of proposed MAC protocols for high-speed wireless networks

Following an introduction and brief overview of media access control protocols, this paper presents a review of the current literature on MAC protocols and bandwidth allocation strategies for high speed wireless systems. The four protocols reviewed in this paper range from simple Aloha-type algorithms to relatively complex polling schemes. An attempt is also made to compare the protocols based on their technical merits.

Generating traffic distributions for ATM networks: a cellular automaton implementation

ATM networks are designed for the transmission of a wide variety of applications, each having different traffic characteristics. A cellular automaton (CA) can effectively generate random patterns which have good randomness characteristics. This paper makes the first step to use 1-D LHCA (one-dimensional linear hybrid CA) to generate random traffic distributions for ATM networks.

Heterogeneous wormhole routing algorithms

This paper discusses fault tolerant wormhole routing in mesh connected networks containing a single faulty processor. The goal is to examine the characteristics of wormhole routing algorithms in a faulty environment. We will introduce the concept of heterogeneous routing algorithms and show the fault tolerant aspects of these algorithms.