{"title":"A new mechanism to reduce congestion on TDM networks-on-chips","authors":"Daniel Vergeylen, A. K. Lusala, J. Legat","doi":"10.1109/ReCoSoC.2011.5981515","DOIUrl":null,"url":null,"abstract":"This paper presents a mechanism to decrease the congestion on TDM networks handling both Best Effort and Guaranteed Throughput traffic. The mechanism consists of an algorithm which gives an optimal Time Slot to begin transactions between source and destination, thus maximising the probability of successfully reserving a path through the network, to guarantee Quality of Service for the streaming traffic. In order to evaluate the improvements given by the algorithm, a 4×4 2D mesh was simulated in the Soclib environment under random traffic and compared to a same mesh not using the algorithm. Simulation results show that the rate of acceptance of connections from a source to a destination through the network is significantly higher when using the algorithm illustrating a decrease in the global congestion.","PeriodicalId":103130,"journal":{"name":"6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReCoSoC.2011.5981515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a mechanism to decrease the congestion on TDM networks handling both Best Effort and Guaranteed Throughput traffic. The mechanism consists of an algorithm which gives an optimal Time Slot to begin transactions between source and destination, thus maximising the probability of successfully reserving a path through the network, to guarantee Quality of Service for the streaming traffic. In order to evaluate the improvements given by the algorithm, a 4×4 2D mesh was simulated in the Soclib environment under random traffic and compared to a same mesh not using the algorithm. Simulation results show that the rate of acceptance of connections from a source to a destination through the network is significantly higher when using the algorithm illustrating a decrease in the global congestion.