There are two major difficulties in real-time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real-time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real-time multicast connection setup mechanism, which ...

This chapter presents first of all a brief historical overview with critical reflections of Community Based Rehabilitation (CBR) in the ‘mainstream disability world’. It also discusses, more specifically, the area of rehabilitation of people (with disabilities) affected by leprosy. Finally, the chapter provides a contemporary critical analysis of CBR and directions for the future. One should ho...

Emerging data-center network designs seek to provide physical topologies with high bandwidth, large bisection capacities, and many alternative data paths. Yet, existing protocols present a one-size-fits-all approach for forwarding packets. Traditionally, the routing process chooses one “best” route for each end-point pair. While some modern protocols support multiple paths through techniques li...

Grid-based methods for finding cost optimal paths are popular because of their flexibility and simple implementation. However, their computational complexity becomes unfeasible for real-time path planning if the resolution of the grid is high. These methods assume complete knowledge about the world, but in dynamic environments where sensing is done on board the robot, less is known about far-aw...

We investigate reliable multi-path provisioning of traffic in high-capacity backbone mesh networks, e.g., nextgeneration SONET/SDH networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversely multiplexed on to multiple paths, a feature that may lead to significantly improved performance over conventional single-path provisioning. Other mesh networks such as those ...

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimum-delay tree, and then iteratively uses a k-shortest-path (KSP) algorithm to search for a ...

We propose query optimization techniques that fully utilize the advantages ojpath indexes in object-oriented database systems. Although path indexes provide an eficient access to complex objects, little research has been done on query optimization that fully utilize path indexes. We first devise a generalized index intersection technique, adapted to the structure of the path index extended from...

We study a path-planning problem amid a set O of obstacles in R, in which we wish to compute a short path between two points while also maintaining a high clearance from O; the clearance of a point is its distance from a nearest obstacle in O. Specifically, the problem asks for a path minimizing the reciprocal of the clearance integrated over the length of the path. We present the first polynom...

Recently, a two-phase handoff protocol has been proposed to support inter-switch handoff in wireless ATM networks. It employs path extension for each inter-switch handoff, followed by path optimization if necessary. In this paper, we propose a number of path optimization initiation schemes to facilitate the two-phase handoff protocol. The design objective is to determine the time to invoke path...