Network processors offer a new flexibility for network applications and reduce the time to market for data processing systems. In this paper, we describe the changed development process of the data plane using the Motorola C-5 network processor. We implemented a resilient packet ring line card for a SDH cross connect. We show a solution for the support of different quality of service classes with a network processor and to achieve the necessary system stability. Additionally we carried out some simulations to verify the performance of a fairness algorithm over the ring and the system behavior.

The utilization of geometric characteristics of configuration-space obstacle to do path planning is considered. Specifically, for a two-link arm it is shown how and when to select intermediate goals for path planning. An implementation of a path planner based on these ideas is sketched. However, many path planners, especially ones designed for parallel machines, can make use of computed intermediate goals.>

This paper presents an efficient algorithm for determining the minimum distance and the minimum separating segment between two boxes situated arbitrarily in 3-space. This generalizes the intersection detection problem for boxes. A brief survey is given of other methods which have been used or could be used, including intersection detection methods. This algorithm may be useful in speeding up collision detection and clipping in some cases.