A routing algorithm for distributed communication networks

As the speed and number of LANs continue to increase higher and higher demand is placed on wide area networks. To support the tremendous traffic and to avoid link congestion, such networks should utilize a robust routing strategy. This paper proposes a routing algorithm called MINDEL for assigning flows to distributed network links. With polynomial complexity this algorithm tends to minimize each packet delay by avoiding as much as possible the congested routes. Numerical results confirm the efficiency of such an algorithm, particularly for large networks, which convinces us that it could be efficiently used in high-speed networks