{"title":"A new voice scheduling scheme for broadcast bus local area networks","authors":"Wai Chen, San-qi Li, M. Schwartz","doi":"10.1109/INFCOM.1989.101486","DOIUrl":null,"url":null,"abstract":"Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<>