In this paper we propose a delay-constrained distributed multicast routing algorithm based on token passing. This algorithm is fully distributed and generates a multicast routing tree, which not only meets the realtime requirement, but also has a sub-optimal network cost. Simulations have been done and the results have shown that the multicast routing tree generated by our algorithm has better ...

We propose an integrated QoS routing framework based on selective probing for high-speed packet-switching networks. The framework is fully distributed and depends only on the local state maintained at every individual node. By using controlled di usion computations, the framework captures the common messaging and computational structure of distributed QoS routing, and allows an e cient implemen...

The importance of energy preservation in wireless sensor networks is long established, and a number of maximum lifetime routing schemes exist in the literature. Many of the existing online routing schemes are based on the use of some edge-weight functions, but those schemes exhibit diverse performances in terms of the obtained lifetime results. The major contribution of the present work is to c...

This paper presents the rst dynamic routing scheme for high-speed networks. The scheme is based on a hierarchical bubbles partition of the underlying communication graph. Dynamic routing schemes are ranked by their adaptability, i.e., the maximum number of sites to be updated upon a topology change. An advantage of our scheme is that it implies small number of updates upon a topology change. In...

Workloads in distributed database applications consist of queries and transactions. In order to address performance requirements, distributed transaction processing systems have to deal with two related issues: transaction routing and scheduling. Due to the distribution of data objects among nodes and the access cost incurred by remote accesses, efficient transaction routing is an important con...

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...