{"title":"支持太比特交换机的服务质量","authors":"K. W. James, K. Yun","doi":"10.1109/PCCC.2000.830302","DOIUrl":null,"url":null,"abstract":"We discuss a novel architecture for performing very high speed cell switching with earliest-deadline-first scheduling. An input queued switch with central EDF contention resolution is presented. Static RAM buffers are used in conjunction with fast hardware queues that sort ensembles of equivalent cells. Simulation results show that this approach yields low latency in the presence of bursty traffic, without requiring large queues to prevent cell loss. The results compare favorably to those of an ideal output buffered switch that could not be implemented at a similar link rate and cost.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Supporting quality of service in a terabit switch\",\"authors\":\"K. W. James, K. Yun\",\"doi\":\"10.1109/PCCC.2000.830302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss a novel architecture for performing very high speed cell switching with earliest-deadline-first scheduling. An input queued switch with central EDF contention resolution is presented. Static RAM buffers are used in conjunction with fast hardware queues that sort ensembles of equivalent cells. Simulation results show that this approach yields low latency in the presence of bursty traffic, without requiring large queues to prevent cell loss. The results compare favorably to those of an ideal output buffered switch that could not be implemented at a similar link rate and cost.\",\"PeriodicalId\":387201,\"journal\":{\"name\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2000.830302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2000.830302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We discuss a novel architecture for performing very high speed cell switching with earliest-deadline-first scheduling. An input queued switch with central EDF contention resolution is presented. Static RAM buffers are used in conjunction with fast hardware queues that sort ensembles of equivalent cells. Simulation results show that this approach yields low latency in the presence of bursty traffic, without requiring large queues to prevent cell loss. The results compare favorably to those of an ideal output buffered switch that could not be implemented at a similar link rate and cost.