Link-state routing protocols are being increasingly used in modern communications networks. A salient feature of this class of routing protocol is that the network connectivity and the state information of all links are available to the nodes for making routing decisions. Two main components of a link-state routing protocol are an update mechanism and a routing algorithm. These components must be properly designed for efficient routing. Various alternatives are possible for each of these components leading to different scenarios for the routing protocol. In this paper, we quantitatively examine the impact of these alternatives on the performance of a sample network supporting a single service class using call-level simulations.