{"title":"关于为RED丢弃序列","authors":"B. Gaujal, A. Hordijk","doi":"10.1109/NGI.2005.1431674","DOIUrl":null,"url":null,"abstract":"In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On dropping sequences for RED\",\"authors\":\"B. Gaujal, A. Hordijk\",\"doi\":\"10.1109/NGI.2005.1431674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.\",\"PeriodicalId\":435785,\"journal\":{\"name\":\"Next Generation Internet Networks, 2005\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Next Generation Internet Networks, 2005\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2005.1431674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Next Generation Internet Networks, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2005.1431674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
