Hakyong Kim, Kiseon Kim, Yongtak Lee, Hyunho Yoon, C. Oh
{"title":"多输入排队ATM交换机的小区选择算法:棋盘和随机小区选择","authors":"Hakyong Kim, Kiseon Kim, Yongtak Lee, Hyunho Yoon, C. Oh","doi":"10.1109/ATM.1999.786866","DOIUrl":null,"url":null,"abstract":"A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N/sup 2/) in the worst case, where N is the switch size.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Cell selection algorithm for the multiple input-queued ATM switch: chessboard and random cell selections\",\"authors\":\"Hakyong Kim, Kiseon Kim, Yongtak Lee, Hyunho Yoon, C. Oh\",\"doi\":\"10.1109/ATM.1999.786866\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N/sup 2/) in the worst case, where N is the switch size.\",\"PeriodicalId\":266412,\"journal\":{\"name\":\"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATM.1999.786866\",\"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 ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATM.1999.786866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cell selection algorithm for the multiple input-queued ATM switch: chessboard and random cell selections
A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N/sup 2/) in the worst case, where N is the switch size.