Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

The 31st Annual Simulation Symposium   p. 50
Fair Arbitration in Point-to-Point Networks

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIMSYM.1998.668433
Send link to a friend

Abstract
In this paper we introduce and evaluate a method for optimizing the router arbitration policy in point- to-point networks. These networks use multiple high- speed, low-cost routers to rapidly switch data directly between data sources and destinations. We assume that routers use an arbitration algorithm that has the ability to assign different priorities to different links thus controlling the distribution of available bandwidth among channels. We propose an analytical method that allows us to determine the correct priorities for channels so as to achieve fair arbitration thus mini- mizing latency, increasing throughput and eliminating tree saturation.In our study we used data generated by a simulation tool to validate the proposed analytical model for determining the weights (priorities) of router ports and to evaluate the resulting performance improvements. Link usage statistics were recorded by the simulator for the purpose of performing a detailed investigation of congestion effects and especially tree saturation. The method was applied to the ServerNet TM System Area Network (SAN), developed by Tandem Computers Inc.
Additional Information

Citation:  D.R. Avresky, V. Shurbanov, R. Horst, "Fair Arbitration in Point-to-Point Networks," ss, p. 50,  The 31st Annual Simulation Symposium,  1998

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback