具有有限缓冲和不可忽略的往返时间的CIOQ开关的稳定性

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI:10.1109/ICCCN.2002.1043104

M. Gusat, F. Abel, F. Gramsamer, R. Luijten, C. Minkenberg, M. Verhappen

{"title":"具有有限缓冲和不可忽略的往返时间的CIOQ开关的稳定性","authors":"M. Gusat, F. Abel, F. Gramsamer, R. Luijten, C. Minkenberg, M. Verhappen","doi":"10.1109/ICCCN.2002.1043104","DOIUrl":null,"url":null,"abstract":"We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ (combined input-output queued) switching systems. We introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the performance achievable with finite buffers.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Stability of CIOQ switches with finite buffers and non-negligible round-trip time\",\"authors\":\"M. Gusat, F. Abel, F. Gramsamer, R. Luijten, C. Minkenberg, M. Verhappen\",\"doi\":\"10.1109/ICCCN.2002.1043104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ (combined input-output queued) switching systems. We introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the performance achievable with finite buffers.\",\"PeriodicalId\":302787,\"journal\":{\"name\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2002.1043104\",\"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. Eleventh International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2002.1043104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们提出了一种确定实际CIOQ(组合输入输出排队)交换系统内部缓冲下界的系统方法。我们引入了一个确定性的流量场景，强调有限输出队列的全局稳定性。我们通过在这种流量模式下对CIOQ的缓冲容量进行量值来证明它的有效性。遵从这个属性可以在有限缓冲区的情况下实现性能最大化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Stability of CIOQ switches with finite buffers and non-negligible round-trip time

We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ (combined input-output queued) switching systems. We introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the performance achievable with finite buffers.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. Eleventh International Conference on Computer Communications and Networks

自引率

0.00%

发文量