Shujing Hu, Jinyuan Sehn, Runjie Liu, Wenying Zhang, Weixin Mu
{"title":"基于Hopfield神经网络的ATM小区调度最大尺寸匹配方法","authors":"Shujing Hu, Jinyuan Sehn, Runjie Liu, Wenying Zhang, Weixin Mu","doi":"10.1109/KAMW.2008.4810566","DOIUrl":null,"url":null,"abstract":"Maximum size matching (MSM) cell scheduling in the ATM switching fabrics (ASF) with virtual output queuing (VOQ) is complied by a new Hopfield neural network (HNN). A new energy function of HNN is proposed to correspond to the cell scheduling rules of MSM. The new HNN scheduling algorithm employs all cells updated synchronously and realizes the MSM of the cells with global optimal between input queues and output queues in a single time slot. This difference from the iSLIP and FIRM algorithms makes it have better performances. The simulation results of 8*8 and 16*16' ASF, compared with iSLIP and FIRM methods, demonstrate that the proposed algorithm has faster convergence speed and reduces the mean delay greatly without the throughput degradation.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximum Size Matching Method Realized by Hopfield Neural Network for ATM cell scheduling\",\"authors\":\"Shujing Hu, Jinyuan Sehn, Runjie Liu, Wenying Zhang, Weixin Mu\",\"doi\":\"10.1109/KAMW.2008.4810566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maximum size matching (MSM) cell scheduling in the ATM switching fabrics (ASF) with virtual output queuing (VOQ) is complied by a new Hopfield neural network (HNN). A new energy function of HNN is proposed to correspond to the cell scheduling rules of MSM. The new HNN scheduling algorithm employs all cells updated synchronously and realizes the MSM of the cells with global optimal between input queues and output queues in a single time slot. This difference from the iSLIP and FIRM algorithms makes it have better performances. The simulation results of 8*8 and 16*16' ASF, compared with iSLIP and FIRM methods, demonstrate that the proposed algorithm has faster convergence speed and reduces the mean delay greatly without the throughput degradation.\",\"PeriodicalId\":375613,\"journal\":{\"name\":\"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KAMW.2008.4810566\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KAMW.2008.4810566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Maximum Size Matching Method Realized by Hopfield Neural Network for ATM cell scheduling
Maximum size matching (MSM) cell scheduling in the ATM switching fabrics (ASF) with virtual output queuing (VOQ) is complied by a new Hopfield neural network (HNN). A new energy function of HNN is proposed to correspond to the cell scheduling rules of MSM. The new HNN scheduling algorithm employs all cells updated synchronously and realizes the MSM of the cells with global optimal between input queues and output queues in a single time slot. This difference from the iSLIP and FIRM algorithms makes it have better performances. The simulation results of 8*8 and 16*16' ASF, compared with iSLIP and FIRM methods, demonstrate that the proposed algorithm has faster convergence speed and reduces the mean delay greatly without the throughput degradation.