Time constrained performance of a two channel reservation protocol for local networks

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200520

H. Barghi, W. Cronenwett, J. Bredeson

{"title":"Time constrained performance of a two channel reservation protocol for local networks","authors":"H. Barghi, W. Cronenwett, J. Bredeson","doi":"10.1109/PCCC.1992.200520","DOIUrl":null,"url":null,"abstract":"An efficient reservation-based carrier sense multiple access with collision-detection (CSMA/CD) protocol for two types of priority packets is presented. Type 1 packets are of relatively short duration, need a very quick response time, and have a high arrival rate. Type 2 packets are of longer duration, do not require as fast a response time, and have a low arrival rate. Expressions are developed for both the throughput and delay performance of two channel reservation network (TCRN), two channel reservation network with a preemptive priority, (TCRN/PP), and two channel reservation network with a nonpreemptive priority (TCRN/NPP) protocols. To examine the behavior of the protocols under time-constrained conditions, the authors check the percentage of voice packets which are transmitted within a given amount of time after their generation at a transmitting station and the voice capacity, both under different operating conditions. The results show that the channel is efficiently used to minimize the average delay for the data portion and to maintain as many voice stations as possible.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"7 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

An efficient reservation-based carrier sense multiple access with collision-detection (CSMA/CD) protocol for two types of priority packets is presented. Type 1 packets are of relatively short duration, need a very quick response time, and have a high arrival rate. Type 2 packets are of longer duration, do not require as fast a response time, and have a low arrival rate. Expressions are developed for both the throughput and delay performance of two channel reservation network (TCRN), two channel reservation network with a preemptive priority, (TCRN/PP), and two channel reservation network with a nonpreemptive priority (TCRN/NPP) protocols. To examine the behavior of the protocols under time-constrained conditions, the authors check the percentage of voice packets which are transmitted within a given amount of time after their generation at a transmitting station and the voice capacity, both under different operating conditions. The results show that the channel is efficiently used to minimize the average delay for the data portion and to maintain as many voice stations as possible.<>

查看原文本刊更多论文

局域网络双通道预约协议的时间约束性能

针对两种优先级报文，提出了一种基于预约的载波感知多址冲突检测(CSMA/CD)协议。类型1的数据包持续时间相对较短，需要非常快的响应时间，并且到达率很高。类型2数据包的持续时间较长，不需要快速的响应时间，并且到达率较低。给出了两通道预留网络(TCRN)、两通道优先抢占预留网络(TCRN/PP)和两通道非优先抢占预留网络(TCRN/NPP)协议的吞吐量和延迟性能表达式。为了检查协议在时间约束条件下的行为，作者检查了在不同的操作条件下，在发射站生成语音包后的给定时间内传输的语音包的百分比和语音容量。结果表明，该信道被有效地用于最小化数据部分的平均延迟，并保持尽可能多的语音站。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量