{"title":"片上网络中的公平速率分组仲裁","authors":"F. Guderian, E. Fischer, M. Winter, G. Fettweis","doi":"10.1109/SOCC.2011.6085085","DOIUrl":null,"url":null,"abstract":"This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.","PeriodicalId":365422,"journal":{"name":"2011 IEEE International SOC Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Fair rate packet arbitration in Network-on-Chip\",\"authors\":\"F. Guderian, E. Fischer, M. Winter, G. Fettweis\",\"doi\":\"10.1109/SOCC.2011.6085085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.\",\"PeriodicalId\":365422,\"journal\":{\"name\":\"2011 IEEE International SOC Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International SOC Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCC.2011.6085085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International SOC Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCC.2011.6085085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes two new arbitration techniques to enable fair link bandwidth allocation. One technique is a weighted round-robin scheme with weights based on the number of contending flows at the input port. The second technique is an age-based scheme with probabilistic arbitration where the traversed packet distance approximates age. Opposed to existing work, both schemes reach almost absolute fairness of link bandwidth allocation and simplify calculation of arbitration metrics.