{"title":"增量流量下弹性单链路频谱空闲最小化","authors":"H. Waldman, R. C. Almeida, R. C. Bortoletto","doi":"10.1109/LATINCOM48065.2019.8937937","DOIUrl":null,"url":null,"abstract":"The paper addresses the problem of minimizing total slot idle time in assigning spectrum to an incremental 2-class traffic. Deadlock avoidance is first shown to be possible in many instances from knowledge of the connection sizes, thus keeping total idleness finite. Then, minimization of the finite residual idleness is shown to be possible with appropriate traffic-aware assignment policies.","PeriodicalId":120312,"journal":{"name":"2019 IEEE Latin-American Conference on Communications (LATINCOM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Spectral Idleness Minimization in the Elastic Single Link under Incremental Traffic\",\"authors\":\"H. Waldman, R. C. Almeida, R. C. Bortoletto\",\"doi\":\"10.1109/LATINCOM48065.2019.8937937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper addresses the problem of minimizing total slot idle time in assigning spectrum to an incremental 2-class traffic. Deadlock avoidance is first shown to be possible in many instances from knowledge of the connection sizes, thus keeping total idleness finite. Then, minimization of the finite residual idleness is shown to be possible with appropriate traffic-aware assignment policies.\",\"PeriodicalId\":120312,\"journal\":{\"name\":\"2019 IEEE Latin-American Conference on Communications (LATINCOM)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Latin-American Conference on Communications (LATINCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LATINCOM48065.2019.8937937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Latin-American Conference on Communications (LATINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM48065.2019.8937937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spectral Idleness Minimization in the Elastic Single Link under Incremental Traffic
The paper addresses the problem of minimizing total slot idle time in assigning spectrum to an incremental 2-class traffic. Deadlock avoidance is first shown to be possible in many instances from knowledge of the connection sizes, thus keeping total idleness finite. Then, minimization of the finite residual idleness is shown to be possible with appropriate traffic-aware assignment policies.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
