{"title":"最小复用信道突发调度原则","authors":"G. Figueiredo, N. Fonseca","doi":"10.1109/GLOCOM.2008.ECP.268","DOIUrl":null,"url":null,"abstract":"This paper presents a novel channel scheduling discipline for optical burst switching networks called Least Reusable Channel (LRC). LRC decides on which void to allocate an incoming burst based on the potentiality of reusing the voids created. These decisions consider the routes as well as the network load. It is shown via numerical examples that the LRC produces lower blocking probability and distributes more uniformly the losses among routes than existing scheduling disciplines.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Least Reusable Channel Burst Scheduling Discipline\",\"authors\":\"G. Figueiredo, N. Fonseca\",\"doi\":\"10.1109/GLOCOM.2008.ECP.268\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel channel scheduling discipline for optical burst switching networks called Least Reusable Channel (LRC). LRC decides on which void to allocate an incoming burst based on the potentiality of reusing the voids created. These decisions consider the routes as well as the network load. It is shown via numerical examples that the LRC produces lower blocking probability and distributes more uniformly the losses among routes than existing scheduling disciplines.\",\"PeriodicalId\":297815,\"journal\":{\"name\":\"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2008.ECP.268\",\"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 GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2008.ECP.268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Least Reusable Channel Burst Scheduling Discipline
This paper presents a novel channel scheduling discipline for optical burst switching networks called Least Reusable Channel (LRC). LRC decides on which void to allocate an incoming burst based on the potentiality of reusing the voids created. These decisions consider the routes as well as the network load. It is shown via numerical examples that the LRC produces lower blocking probability and distributes more uniformly the losses among routes than existing scheduling disciplines.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
