|We propose and evaluate low-complexity, low-overhead schemes for distributed message scheduling and routing in binary hypercube multicomputers equipped with a hardware communication adapter at each node. The goal is to optimize the network performance not only for steady traac ow, but also for concurrent bursty traac. We comparatively evaluate the performance of diierent scheduling{routing com...

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...

In this paper, we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuit-switching. The conventional approaches to address this issue consider the two aspects of the problem sequentially by rst nding a route from a predetermined set of candidate paths and then searching for an appropriate wavelength assignment. We adopt a more general approach in which...

This paper presents a novel routing protocol for Disruption Tolerant Networks (DTNs) called Efficient DTN Routing Protocol (EDRP). EDRP smartly integrates the forwarding and buffer management policies into an adaptive protocol that includes a local network parameters estimation mechanism. It dynamically adjusts the delivery probability for messages according to a new metric. Meanwhile, EDRP arr...

Internet routing is mostly based on static information— it’s dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not only improve the performance itself of the Internet but also its security and availability. However, previous approaches for making Internet routing adaptive based on optimizing network-wide objectives are not suited for an...

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in 11, 14]. This theory supplies the suu-cient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. Multicast communication refers to the delivery of the same message...

This paper proposes a connectionist mechanism to support adaptive real-time routing in computer networks. In particular, an Adaptive Self-Organizing Concurrent System (ASOCS) model is used as the basic network router. ASOCS are connectionist models which achieve learning and processing in a parallel and self-organizing fashion. By exploiting parallel processing the ASOCS network router addresse...

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algorithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm is proposed in this paper. This routing a...

In this paper we describe a new adaptive routing algorithm for meshed topology de ection networks Our algorithm is based on a local learning method which evolves in order to produce a local spatial representation of the tra c We rst prove that our algorithm is a generalization of the Z routing Secondly we prove that we can set the parameters of the learning algorithm such that our adaptive poli...

QoS provisioning is a complex and challenging issue in mobile ad hoc networks, especially when there are multiple QoS constraints. In this paper, we propose an adaptive QoS routing scheme supported by cross-layer cooperation in ad hoc networks. The cross-layer mechanism provides up-to-date local QoS information for the adaptive routing algorithm, by considering the impacts of node mobility and ...