{"title":"顽固:分布式控制系统中专家助理的媒介访问协议","authors":"Ruben A. Quiros, Isaac D. Scherson","doi":"10.1109/INFCOM.1988.12968","DOIUrl":null,"url":null,"abstract":"A novel implementation is presented, the Stubborn protocol, which provides the right compromise to obtain a balanced and near-optimal performance under both normal (control) operation and transient (emergency) conditions. It is based on the following simple principle: stations make access attempts as in the usual 1-persistent CSMA/CD (carrier-sense multiple-access with collision detection). In case of collision, a station with priority higher than zero will not interrupt transmission, but will exercise its right to extend the collision for a period proportional to its priority level. The station that persists longer will be able to start 'clean' transmission as soon as all others have desisted. The algorithm is complemented with tie-breaking procedures.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stubborn: a medium access protocol for expert assistants in distributed control systems\",\"authors\":\"Ruben A. Quiros, Isaac D. Scherson\",\"doi\":\"10.1109/INFCOM.1988.12968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel implementation is presented, the Stubborn protocol, which provides the right compromise to obtain a balanced and near-optimal performance under both normal (control) operation and transient (emergency) conditions. It is based on the following simple principle: stations make access attempts as in the usual 1-persistent CSMA/CD (carrier-sense multiple-access with collision detection). In case of collision, a station with priority higher than zero will not interrupt transmission, but will exercise its right to extend the collision for a period proportional to its priority level. The station that persists longer will be able to start 'clean' transmission as soon as all others have desisted. The algorithm is complemented with tie-breaking procedures.<<ETX>>\",\"PeriodicalId\":436217,\"journal\":{\"name\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1988.12968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.12968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Stubborn: a medium access protocol for expert assistants in distributed control systems
A novel implementation is presented, the Stubborn protocol, which provides the right compromise to obtain a balanced and near-optimal performance under both normal (control) operation and transient (emergency) conditions. It is based on the following simple principle: stations make access attempts as in the usual 1-persistent CSMA/CD (carrier-sense multiple-access with collision detection). In case of collision, a station with priority higher than zero will not interrupt transmission, but will exercise its right to extend the collision for a period proportional to its priority level. The station that persists longer will be able to start 'clean' transmission as soon as all others have desisted. The algorithm is complemented with tie-breaking procedures.<>