{"title":"FDDI网络中同步业务传输的最坏情况","authors":"Sijing Zhang, E. S. Lee","doi":"10.1109/LCN.1999.802016","DOIUrl":null,"url":null,"abstract":"We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline, a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI network, in which the time elapsed between arrival of the message and completion of its transmission will reach its maximum (i.e., the longest possible interval). A few conditions under which the worst-case situation can happen are formally derived.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"The worst-case scenario for transmission of synchronous traffic in an FDDI network\",\"authors\":\"Sijing Zhang, E. S. Lee\",\"doi\":\"10.1109/LCN.1999.802016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline, a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI network, in which the time elapsed between arrival of the message and completion of its transmission will reach its maximum (i.e., the longest possible interval). A few conditions under which the worst-case situation can happen are formally derived.\",\"PeriodicalId\":265611,\"journal\":{\"name\":\"Proceedings 24th Conference on Local Computer Networks. LCN'99\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 24th Conference on Local Computer Networks. LCN'99\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1999.802016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 24th Conference on Local Computer Networks. LCN'99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1999.802016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The worst-case scenario for transmission of synchronous traffic in an FDDI network
We study the problem of guaranteeing deadlines of synchronous messages with their deadlines no more than periods in an FDDI network. In order to guarantee the transmission of a synchronous message before its deadline, a precise knowledge of the worst-case situation for such transmission is required. This paper studies the worst-case scenario for transmission of a synchronous message in an FDDI network, in which the time elapsed between arrival of the message and completion of its transmission will reach its maximum (i.e., the longest possible interval). A few conditions under which the worst-case situation can happen are formally derived.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
