{"title":"HOL-EDD: ATM网络灵活的业务调度方案","authors":"M. Vishnu, J. Mark","doi":"10.1109/INFCOM.1996.493360","DOIUrl":null,"url":null,"abstract":"The salient properties of a work-conserving, rate-based service scheduling scheme for ATM networks, called the head-of-the-line earliest due date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the HOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"HOL-EDD: a flexible service scheduling scheme for ATM networks\",\"authors\":\"M. Vishnu, J. Mark\",\"doi\":\"10.1109/INFCOM.1996.493360\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The salient properties of a work-conserving, rate-based service scheduling scheme for ATM networks, called the head-of-the-line earliest due date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the HOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.\",\"PeriodicalId\":234566,\"journal\":{\"name\":\"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1996.493360\",\"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 of IEEE INFOCOM '96. Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1996.493360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
HOL-EDD: a flexible service scheduling scheme for ATM networks
The salient properties of a work-conserving, rate-based service scheduling scheme for ATM networks, called the head-of-the-line earliest due date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the HOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
