Show simple item record

Analytic evaluation of contention protocols used in distributed real-time systems

dc.contributor.authorShin, Kang G.en_US
dc.contributor.authorHou, Chao-Juen_US
dc.date.accessioned2006-09-11T19:45:27Z
dc.date.available2006-09-11T19:45:27Z
dc.date.issued1995-07en_US
dc.identifier.citationShin, Kang; Hou, Chao-Ju; (1995). "Analytic evaluation of contention protocols used in distributed real-time systems." Real-Time Systems 9(1): 69-107. <http://hdl.handle.net/2027.42/48090>en_US
dc.identifier.issn0922-6443en_US
dc.identifier.issn1573-1383en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/48090
dc.description.abstractThe probability of a station failing to deliver packets before their deadlines, called the probability of dynamic failure, P dyn , is an important measure for the communication subsystem of a distributed real-time system. Another closely-related performance measure is the ε- bounded delivery time , T ε , which is defined as the least time needed to deliver a packet with probability greater than 1−ε. Using P dyn and T ε , we comparatively evaluate four contention protocols often used in distributed real-time systems: (i) the token passing protocol and its priority-based variation (called the token scheduling protocol ), and (ii) the P i -persistent protocol and a priority-based variation thereof. The communication subsystem equipped with different contention protocols is modeled first as embedded Markov chains. Then, we derive the probability distributions of access delay, from which P dyn and T ε can be calculated. The blocking probability, Q i , can also be derived from the access delay distribution. These measures are derived first under the assumption of a single buffer at each station. The single-buffer model is then extended to the multiple-buffer case. The effects of buffer size on P dyn , T ε , and Q i , and the performance improvement with multiple buffers are analyzed over a wide range of network traffic.en_US
dc.format.extent2469158 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherComputer Scienceen_US
dc.subject.otherPerformance and Reliabilityen_US
dc.subject.otherProcessor Architecturesen_US
dc.subject.otherSpecial Purpose and Application-Based Systemsen_US
dc.subject.otherSystem Performance and Evaluationen_US
dc.subject.otherCommunications Engineering, Networksen_US
dc.subject.otherControl Engineeringen_US
dc.subject.otherDeadlinesen_US
dc.subject.otherReal-time Systemsen_US
dc.subject.otherContention Protocolsen_US
dc.subject.otherAccess Delayen_US
dc.subject.otherEmbedded Markov Chainsen_US
dc.subject.otherQueueing Theoryen_US
dc.subject.otherPerformance Metricsen_US
dc.subject.otherPerformance Evaluationen_US
dc.titleAnalytic evaluation of contention protocols used in distributed real-time systemsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelBusiness (General)en_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumReal-Time Computing Laboratory Department of Electrical Engineering and Computer Science, The University of Michigan, 48105-2122, Ann Arbor, MIen_US
dc.contributor.affiliationotherDepartment of Electrical and Computer Engineering, The University of Wisconsin — Madison, 53706-1691, Madison, WIen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/48090/1/11241_2005_Article_BF01094173.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01094173en_US
dc.identifier.sourceReal-Time Systemsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Accessibility: If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.