{"title":"ATM网络中TCP over GFR服务的缓冲区管理","authors":"P. Krachodnok, W. Benjapolakul","doi":"10.1109/ICON.2001.962358","DOIUrl":null,"url":null,"abstract":"Buffer management plays an important role in guaranteed frame rate (GFR) service in an asynchronous transfer mode (ATM) network. Buffer management algorithms are used to allocate appropriate space in a switch buffer for untagged GFR cells to fulfill the guaranteed minimum cell rate (MCR). Two main goals of buffer management algorithms are high throughput and high fairness index. However, these goals are compromised, that is the higher throughput gives the lower fairness index. This paper proposes a new buffer management algorithm called BADT (buffer allocation with dynamic threshold) algorithm, which uses dynamic threshold techniques for the fairness index improvement. The performance comparison of the previously proposed algorithms is shown. The simulation results show that the BADT algorithm gives the highest fairness index and still gives acceptably high throughput compared to the previously proposed algorithms.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Buffer management for TCP over GFR service in an ATM network\",\"authors\":\"P. Krachodnok, W. Benjapolakul\",\"doi\":\"10.1109/ICON.2001.962358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Buffer management plays an important role in guaranteed frame rate (GFR) service in an asynchronous transfer mode (ATM) network. Buffer management algorithms are used to allocate appropriate space in a switch buffer for untagged GFR cells to fulfill the guaranteed minimum cell rate (MCR). Two main goals of buffer management algorithms are high throughput and high fairness index. However, these goals are compromised, that is the higher throughput gives the lower fairness index. This paper proposes a new buffer management algorithm called BADT (buffer allocation with dynamic threshold) algorithm, which uses dynamic threshold techniques for the fairness index improvement. The performance comparison of the previously proposed algorithms is shown. The simulation results show that the BADT algorithm gives the highest fairness index and still gives acceptably high throughput compared to the previously proposed algorithms.\",\"PeriodicalId\":178842,\"journal\":{\"name\":\"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2001.962358\",\"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. Ninth IEEE International Conference on Networks, ICON 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2001.962358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
在异步传输模式(ATM)网络中,缓冲管理在保证帧率(GFR)业务中起着重要的作用。缓冲区管理算法用于在切换缓冲区中为未标记的GFR细胞分配适当的空间,以实现保证的最小细胞速率(MCR)。缓冲区管理算法的两个主要目标是高吞吐量和高公平指数。然而,这些目标是妥协的,即更高的吞吐量会带来更低的公平性指数。本文提出了一种新的缓冲区管理算法BADT (buffer allocation with dynamic threshold)算法,该算法利用动态阈值技术来提高公平性指标。给出了上述算法的性能比较。仿真结果表明,与现有算法相比,BADT算法具有最高的公平性指数,并且仍然具有可接受的高吞吐量。
Buffer management for TCP over GFR service in an ATM network
Buffer management plays an important role in guaranteed frame rate (GFR) service in an asynchronous transfer mode (ATM) network. Buffer management algorithms are used to allocate appropriate space in a switch buffer for untagged GFR cells to fulfill the guaranteed minimum cell rate (MCR). Two main goals of buffer management algorithms are high throughput and high fairness index. However, these goals are compromised, that is the higher throughput gives the lower fairness index. This paper proposes a new buffer management algorithm called BADT (buffer allocation with dynamic threshold) algorithm, which uses dynamic threshold techniques for the fairness index improvement. The performance comparison of the previously proposed algorithms is shown. The simulation results show that the BADT algorithm gives the highest fairness index and still gives acceptably high throughput compared to the previously proposed algorithms.