With the increasing volume and volatility of Internet traffic, the need for adaptive routing algorithms has become compelling lately. An adaptive routing algorithm controls the rate at which traffic is placed on forwarding paths in concert with the actual user demands, making it possible to avoid congestion even when no information on expected traffic is available. In this paper, we present a n...

This paper introduces AntNet, a new routing algorithm for telecommunication networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet in a datagram network and compare it with both static and adaptive state-ofthe-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial...

An ACO Inspired Strategy to Improve Jobs Scheduling in a Grid Environment p. 30 Architecture Aware Partitioning Algorithms p. 42 A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes p. 54 Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model p. 58 Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph p. 70 Fault Tolerance in the Biswapped Network ...

In this document we carry out a comparative analysis of the application of Fuzzy Logic Controllers (hereinafter FLCs), Fuzzy Temporal Rules-Based Controllers (hereinafter FTRCs), Temporal Fuzzy Logic Controllers (hereinafter TFLCs) and Faded Temporal fuzzy Logic Controllers (hereinafter FTFLCs), to improve the adaptive distributed routing. To obtain a good knowledge base the controllers were ev...

Node Location information may reduce the overall communication overhead for packet forwarding in Mobile Ad-Hoc Networks (MANETs). This paper proposes a novel Geographic Location Aware Adaptive Routing (GLAAR) protocol to reduce the computation and communication requirement for selection of next node (hop) for packet forwarding. Proposed protocol fetches the node location information using GPS a...

This paper introduces AntNet, a new routing algorithm for communications networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet to a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial t...

DHT (Distributed Hash Tables) has been applied to the structured P2P system to achieve information retrieval and positioning efficiently. KAD is a large-scale network protocol based on the XOR metric in practice, which uses DHT technology to improve network salability without central server. However, the increasing malicious pollutes routing tables to reduce seriously the query performance. Thu...

This report explores the impact of di erent message scheduling strategies on the performance of a packet-switched network under bursty tra c conditions and di erent routing strategies. Deterministic routing strategies are attractive because they are cheap and fast to implement. However, possible drawbacks include lower throughput, signi cantly increased message latency under heavy tra c, and hi...

The simultaneous usage of multiple paths in communication networks has the potential to generate important benefits like better utilization of available resources and higher resiliency. Routing solutions with poor adaptive performance can benefit from multi-path techniques, since information about alternative paths is gathered beforehand. In particular, this study explores the embracement of mu...

We explore the design of optimal deadlock recovery-based fully adaptive routers by evaluating promising internal router crossbar designs. Unified and decoupled crossbar designs aimed at exploiting the full capabilities of adaptive routing are evaluated by analyzing their effect on overall network performance. We show that an enhanced hierarchical crossbar design that supports routing locality i...