{"title":"分组交换体系结构中部分共享缓冲中最优输出缓冲区大小和共享缓冲区大小的评估","authors":"N. Kitsuwan, C. Srikoon, S. Noppanakeepong","doi":"10.1109/SCORED.2003.1459678","DOIUrl":null,"url":null,"abstract":"This paper concerns finding optimal buffer size in shared buffering using raising rate of packet loss probability and mean delay called percentage of packet loss probability and approximate percentage relative delay respectively. This can reduce the cost and complexity of the system and can reach to the appropriate waiting time while packet loss still good.","PeriodicalId":239300,"journal":{"name":"Proceedings. Student Conference on Research and Development, 2003. SCORED 2003.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The evaluation of optimal output buffer size and shared buffer size in partially shared buffering for packet switching architecture\",\"authors\":\"N. Kitsuwan, C. Srikoon, S. Noppanakeepong\",\"doi\":\"10.1109/SCORED.2003.1459678\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns finding optimal buffer size in shared buffering using raising rate of packet loss probability and mean delay called percentage of packet loss probability and approximate percentage relative delay respectively. This can reduce the cost and complexity of the system and can reach to the appropriate waiting time while packet loss still good.\",\"PeriodicalId\":239300,\"journal\":{\"name\":\"Proceedings. Student Conference on Research and Development, 2003. SCORED 2003.\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Student Conference on Research and Development, 2003. SCORED 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCORED.2003.1459678\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Student Conference on Research and Development, 2003. SCORED 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCORED.2003.1459678","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The evaluation of optimal output buffer size and shared buffer size in partially shared buffering for packet switching architecture
This paper concerns finding optimal buffer size in shared buffering using raising rate of packet loss probability and mean delay called percentage of packet loss probability and approximate percentage relative delay respectively. This can reduce the cost and complexity of the system and can reach to the appropriate waiting time while packet loss still good.