{"title":"基于窗口的OBS TCP流量突发组合方案","authors":"K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli","doi":"10.1364/JON.7.000487","DOIUrl":null,"url":null,"abstract":"The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.","PeriodicalId":49154,"journal":{"name":"Journal of Optical Networking","volume":"7 1","pages":"487-495"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1364/JON.7.000487","citationCount":"8","resultStr":"{\"title\":\"Window-based burst assembly scheme for TCP traffic over OBS\",\"authors\":\"K. Ramantas, K. Vlachos, Ó. D. Dios, C. Raffaelli\",\"doi\":\"10.1364/JON.7.000487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.\",\"PeriodicalId\":49154,\"journal\":{\"name\":\"Journal of Optical Networking\",\"volume\":\"7 1\",\"pages\":\"487-495\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1364/JON.7.000487\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optical Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1364/JON.7.000487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optical Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/JON.7.000487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Window-based burst assembly scheme for TCP traffic over OBS
The impact of burstification delay on the transmission control protocol traffic statistics is presented as well as a new assembly scheme that uses flow window size as the threshold criterion. It is shown that short assembly times are ideally suitable for sources with small congestion windows, allowing for a speedup in their transmission. In addition, large assembly times do not yield any throughput gain, despite the large number of segments per burst transmitted, but result in a low throughput variation, and thus a higher notion of fairness among the individual flows. To this end we propose a new burst assembly scheme that dynamically assigns flows to different assembly queues with different assembly timers, based on their instant window size. Results show that the proposed scheme with different timers provides a higher average throughput together with a smaller variance, which is a good compromise for bandwidth dimensioning.