PACKET SWITCHING NETWORKS AND ROUTING ALGORITHMS
Abstract
Most existing packet switched Multistage Interconnection Networks (MINs) have unique connection path between any source node and destination node. In this thesis, a few extra stages are added in a MIN to create multiple paths between any source and destination. Such Multipath MINSs are abbreviated as MMINs. Connection principles of MMINs for packet switching are presented. Performance of such network is analyzed for use in multiprocessor systems and dataflow computers. The network delays of MMINs are shown much shorter than that of using unique-path MINs for packet switching. Optimal design criteria are provided for developing MMINs with fixed network size. The FIFO policy has been practiced in packet switching networks, in which packets with higher priority have to experience long delays to reach their destinations. We propose to use priority queueing policies in packet switching networks. Packets with higher priority will be transmitted with significantly reduced delays. Difference priority switches are designed for use in various packet switching networks. Analytical results are presented to show the delay performance of different priority packet classes. A method to distribute priority packets among multiple paths is also presented. A probabilistic scheme is proposed for adaptive packet routing in computer communications networks with a distributed control. The routing table associated with each node consists of path entries, instead of branch entries. Packets are assigned with different paths on a probabilistic basis. The path selection is entirely processed at the source node. The routing table is updated dynamically with the change of packet generating rates at all nodes. The update overhead is a constant, independent of the size of the network. Both analytical and simulation results are presented and compared with the new ARPANET routing method under various traffic conditions. This probabilistic routing algorithm performs significantly better than the ARPANET routing under moderate and heavy traffic conditions.
Degree
Ph.D.
Subject Area
Electrical engineering
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.