{"title":"一种最小化光突发交换WDM网络中到达突发所产生空隙的调度算法","authors":"M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase","doi":"10.1109/GLOCOM.2002.1189127","DOIUrl":null,"url":null,"abstract":"We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network\",\"authors\":\"M. Iizuka, M. Sakuta, Y. Nishino, I. Sasase\",\"doi\":\"10.1109/GLOCOM.2002.1189127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.\",\"PeriodicalId\":415837,\"journal\":{\"name\":\"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2002.1189127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2002.1189127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network
We propose a scheduling algorithm minimizing voids generated by arriving bursts in an optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at an optical core router at a certain time can be transmitted in some data channels by using unused data channel capacity (called a void), our proposed scheduling algorithm selects the data channel in which a void newly generated after the burst transmission becomes minimum. We compare, by computer simulations, the performance of our proposed scheduling algorithm with that of the conventional one with respect to burst loss ratio. It is shown that our proposed algorithm can improve burst loss ratio.