The Performance of Simple Routing Algorithms That Drop Packets

Abstract

Several modern high-speed networks implement routing algorithms that resolve contention for resources such as buffer space by dropping (i.e., deleting) packets. In this paper, we analyze the performance of such routing algorithms for the commonly-used butterfly network. We assume that each switch of the butterfly has a buffer that can hold a bounded number of packets, and any packet attempting to enter a switch with a full buffer is simply dropped from the network. We study three significant metrics that characterize routing performance: expected throughput of the network, packet loss rate, and expected delay of a packet. Our main results are analytic expressions for these three performance metrics in terms of the network-size, size of the buffer at each switch, and the packet arrival rate. Our analyses for the throughput and packet loss rate hold for any non-predictive queuing protocol, including simple, often-implemented protocols such as i%st-in fist-out (FIFO) and fixed-priority scheduling. Our delay expressions hold for the FIFO protocol. Several facts of interest to a network designer fall out of our analysis. Further, our results provide quantitative insights into how the three performance metrics tradeoff against each other. Also, we present simulation results to bolster the results of our analysis. Finally, we outline preliminary results for routing on other networks such aa the crossbar.

DOI: 10.1145/258492.258508

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Datta1997ThePO, title={The Performance of Simple Routing Algorithms That Drop Packets}, author={Suprakash Datta and Ramesh K. Sitaraman}, booktitle={SPAA}, year={1997} }