{"title":"A very high efficient input shared buffered packet switch for broadband wireless communications","authors":"K. L. Baishnab, A. Nag","doi":"10.1109/ELECTRO.2009.5441131","DOIUrl":null,"url":null,"abstract":"The design of a high speed packet switch has been described here. The switch having 4 inputs and 4 outputs (4×4) each of four inputs is further subdivided into additional four input queues. The proposed designed have considered both restricted sharing as well as complete sharing. In restricted sharing a finite threshold is imposed to all queue's length. However on unrestricted sharing one queue can occupy, the free space of others queue under certain conditions and invite starvation for those other queues. Under the restricted sharing we have used different algorithms like fixed threshold, Push-out the delayed packet and dynamic threshold under different loads and buffer's size, delay. The simulation results show that a variety of outcomes based on load, buffer size, and delay","PeriodicalId":149384,"journal":{"name":"2009 International Conference on Emerging Trends in Electronic and Photonic Devices & Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Emerging Trends in Electronic and Photonic Devices & Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ELECTRO.2009.5441131","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The design of a high speed packet switch has been described here. The switch having 4 inputs and 4 outputs (4×4) each of four inputs is further subdivided into additional four input queues. The proposed designed have considered both restricted sharing as well as complete sharing. In restricted sharing a finite threshold is imposed to all queue's length. However on unrestricted sharing one queue can occupy, the free space of others queue under certain conditions and invite starvation for those other queues. Under the restricted sharing we have used different algorithms like fixed threshold, Push-out the delayed packet and dynamic threshold under different loads and buffer's size, delay. The simulation results show that a variety of outcomes based on load, buffer size, and delay