ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 31, Issues 1-2, 14 January 1999, Pages 59-78
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (519 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0169-7552(98)00230-X    How to Cite or Link Using DOI (Opens New Window)

Analyzing and measuring the latency of the Totem multicast protocols

E. Thomopoulos*, L. E. Moser1 and P. M. Melliar-Smith2

Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106, USA

Available online 24 March 1999.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This article presents, by analysis and measurement, the probability density functions (pdfs) for the latency from origination to message delivery for the Totem multicast protocols, in the presence of message loss and token loss. The Totem protocols provide reliable totally ordered delivery of messages across single and multiple local-area networks (LANs), using a logical token-passing ring on each LAN with gateways that forward messages selectively between LANs. The analysis of the pdfs for the latency involves decomposing the latency into independent components and convolving the pdfs of those components. A comparison of the performance of single-ring, two-ring and four-ring networks shows that, with message filtering in the gateways, multiple-ring networks achieve lower mean latency, less variability, and shorter tails of the latency distribution than an equivalent single ring. The experimental measurements of the pdfs for the latency are similar to those obtained from the analytical formulas, particularly for values of the latency with high probabilities. Limitations of the analytical model, and insight into communication and scheduling of the operating system, are discussed.

Author Keywords: Multicast protocols; Performance modeling and analysis; Message delivery latency; Probability density functions; Latency measurements; Clock skew elimination; Density estimation

*Corresponding author. E-mail: thomo@alpha.ece.ucsb.edu.

1E-mail: moser@ece.ucsb.edu.

2E-mail: pmms@ece.ucsb.edu.


Computer Networks
Volume 31, Issues 1-2, 14 January 1999, Pages 59-78
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.