ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

A model of the contention resolution time for binary tree protocols

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Jagan P. Agrawal Computer Science Telecommunications Program, University of Missouri-Kansas City, Kansas City, MO
Mary L. Gerken Environment Protection Agency, 726 Minnesota Ave., Kansas City, KS
Published in:
· Proceeding
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
ACM New York, NY, USA ©1992
table of contents ISBN:0-89791-472-4 doi>10.1145/131214.131279
A model of the contention resolution time for binary tree protocols Published by ACM 1992 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 6
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder