On Routing and #x201C;Delta Routing#x201D;: A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks

Abstract

An inherent capability of packet-switched networks is the speed at which they can be reconfigured; various dynamic or adaptive routing techniques have been conceived to exploit this capability. In this study, existing techniques are described and an #x201C;ultra-dynamic#x201D; technique, delta routing, is invented. Several promising techniques are then selected for comparison with one another and with a network#x0027;s ultimate carrying capacity. The goal is to shed light on the questions if and when one should use which kind of adaptive routing. First, a taxonomy of routing strategies is presented. In addition to delta routing, random, proportional, shortest path, and shortest path fixed-for-session duration are selected for comparison and their mechanisms described. The delay and efficiency performance of the five techniques are then compared with one another and with ideal behavior via simulations. These have been carried out concentrating on four very small networks, each with very different characteristics with the intention of gaining insight into the strengths and weaknesses of the various techniques. A ten-node network has also been simulated. The results favor delta routing which is most effective in highly interconnected network enviroments. Copyright #x00A9; 1975 by The Institute of Electrical and Electronics Engineers, Inc.