{"title":"一种有效的WDm光网络实时流量调度算法","authors":"Xiaohong Huang, M. Ma","doi":"10.1109/ICCS.2004.1359400","DOIUrl":null,"url":null,"abstract":"One of the major challenges in the design of future generation high-speed networks is the provision of quality-of-service (QoS) to real-time traffic. In this paper, we propose a novel scheduling scheme, namely differentiated dropping scheduling (DDS), which is designed to handle real-time traffic in passive star-coupled WDM optical networks. By taking channel availability and destination availability into account, DDS can dramatically improve the network performance in terms of message loss rate. In order to evaluate the proposed algorithm DDS, extensive discrete-event simulations are conducted by comparing its performance with Moore and Hodgson's algorithm and earliest due date (EDD) algorithm. The results show that DDS can achieve best performance among the three algorithms","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"238 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An efficient scheduling algorithm for real-time traffic on WDm optical networks\",\"authors\":\"Xiaohong Huang, M. Ma\",\"doi\":\"10.1109/ICCS.2004.1359400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the major challenges in the design of future generation high-speed networks is the provision of quality-of-service (QoS) to real-time traffic. In this paper, we propose a novel scheduling scheme, namely differentiated dropping scheduling (DDS), which is designed to handle real-time traffic in passive star-coupled WDM optical networks. By taking channel availability and destination availability into account, DDS can dramatically improve the network performance in terms of message loss rate. In order to evaluate the proposed algorithm DDS, extensive discrete-event simulations are conducted by comparing its performance with Moore and Hodgson's algorithm and earliest due date (EDD) algorithm. The results show that DDS can achieve best performance among the three algorithms\",\"PeriodicalId\":333629,\"journal\":{\"name\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"volume\":\"238 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2004.1359400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2004.1359400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient scheduling algorithm for real-time traffic on WDm optical networks
One of the major challenges in the design of future generation high-speed networks is the provision of quality-of-service (QoS) to real-time traffic. In this paper, we propose a novel scheduling scheme, namely differentiated dropping scheduling (DDS), which is designed to handle real-time traffic in passive star-coupled WDM optical networks. By taking channel availability and destination availability into account, DDS can dramatically improve the network performance in terms of message loss rate. In order to evaluate the proposed algorithm DDS, extensive discrete-event simulations are conducted by comparing its performance with Moore and Hodgson's algorithm and earliest due date (EDD) algorithm. The results show that DDS can achieve best performance among the three algorithms