{"title":"具有静态优先级状态通告的服务质量路由","authors":"S. Vieira","doi":"10.1109/EURCON.2001.937764","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the issues related to routing connections that request quality of service (QoS) guarantees in the form of end-to-end delay bounds. We assume that the connection scheduling, connection admissibility and state advertisement at every node is based on the rate-controlled static priority (RCSP) algorithm. We provide conditions that efficiently find a path that satisfies the QoS constraints and that also lead to efficient state updates.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quality of service routing with static priority state advertisement\",\"authors\":\"S. Vieira\",\"doi\":\"10.1109/EURCON.2001.937764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the issues related to routing connections that request quality of service (QoS) guarantees in the form of end-to-end delay bounds. We assume that the connection scheduling, connection admissibility and state advertisement at every node is based on the rate-controlled static priority (RCSP) algorithm. We provide conditions that efficiently find a path that satisfies the QoS constraints and that also lead to efficient state updates.\",\"PeriodicalId\":205662,\"journal\":{\"name\":\"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURCON.2001.937764\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2001.937764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quality of service routing with static priority state advertisement
In this paper, we investigate the issues related to routing connections that request quality of service (QoS) guarantees in the form of end-to-end delay bounds. We assume that the connection scheduling, connection admissibility and state advertisement at every node is based on the rate-controlled static priority (RCSP) algorithm. We provide conditions that efficiently find a path that satisfies the QoS constraints and that also lead to efficient state updates.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
