Investigation of packet loss reduction methods and decentralization for dynamic routing in packet-switching networks.

Abstract

In this thesis, we slightly modify a known routing model in packet-switching networks. Those modifications give priority to messages transiting in the network (internal) over external arrivals (users) incoming to each node while reducing the number of lost packets. Mathematical programs are developed for the multiple and single buffer node models. Those take into account line capacities, finite buffers and channel errors during transmission. We investigate a simple decentralized routing policy, based on the proposed centralized model with multiple buffers, where partial information is available from neighboring nodes only. Integer linear programming is used to optimally solve the routing problem for each of the models studied. Simulation, conducted on a 5-node network, illustrates the impact of these modifications.