缓冲Crossbar交换机的最佳努力和优先排队策略

{"title":"缓冲Crossbar交换机的最佳努力和优先排队策略","authors":"A. Kesselman, Kirill Kogan, M. Segal","doi":"10.1007/978-3-540-69355-0_15","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":203487,"journal":{"name":"Chicago Journal of Theoretical Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Best Effort and Priority Queuing Policies for Buffered Crossbar Switches\",\"authors\":\"A. Kesselman, Kirill Kogan, M. Segal\",\"doi\":\"10.1007/978-3-540-69355-0_15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":203487,\"journal\":{\"name\":\"Chicago Journal of Theoretical Computer Science\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chicago Journal of Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-69355-0_15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chicago Journal of Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-69355-0_15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}