使用队列的过去信息进行负载平衡

D. Guha, S. Pathak
{"title":"使用队列的过去信息进行负载平衡","authors":"D. Guha, S. Pathak","doi":"10.1109/RAICS.2011.6069412","DOIUrl":null,"url":null,"abstract":"We provide an approach to balancing the load and splitting the traffic during the overload condition based on queue occupation using old information of the output interface queue. A common storage space known as bulletin board is used to store the queue length of the output interface buffer. Bulletin board is updated on a regular interval basis and new arrival verifies the queue length of the bulletin board instead of the output interface buffer. The assumption of our model are: packets arrive as a Poisson stream of rate λ1 for data and λ2 for voice. Packets are served according to FIFO and the service time for a packet is exponentially distributed with mean 1. The Partial Buffer Sharing scheme is applied to partition the output buffer between voice and data packets. The growth of voice buffer is bounded so that queueing delay is restricted for voice packets. Data packet can take their space if the allocated voice packet buffer is unused on an arrival of data packet. But voice packets are prohibited to take the space of unused allocated data packets. The bulletin board fetches the output queue length evolution on a regular interval basis. The model provides an abstraction of simple load balancing scheme in setting when to split the traffic and send it over another path. This model estimates the bandwidth usage on a local granularity basis instead of running periodic probe messages to estimate the bandwidth between two nodes.","PeriodicalId":394515,"journal":{"name":"2011 IEEE Recent Advances in Intelligent Computational Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Load balancing using past information of queue\",\"authors\":\"D. Guha, S. Pathak\",\"doi\":\"10.1109/RAICS.2011.6069412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide an approach to balancing the load and splitting the traffic during the overload condition based on queue occupation using old information of the output interface queue. A common storage space known as bulletin board is used to store the queue length of the output interface buffer. Bulletin board is updated on a regular interval basis and new arrival verifies the queue length of the bulletin board instead of the output interface buffer. The assumption of our model are: packets arrive as a Poisson stream of rate λ1 for data and λ2 for voice. Packets are served according to FIFO and the service time for a packet is exponentially distributed with mean 1. The Partial Buffer Sharing scheme is applied to partition the output buffer between voice and data packets. The growth of voice buffer is bounded so that queueing delay is restricted for voice packets. Data packet can take their space if the allocated voice packet buffer is unused on an arrival of data packet. But voice packets are prohibited to take the space of unused allocated data packets. The bulletin board fetches the output queue length evolution on a regular interval basis. The model provides an abstraction of simple load balancing scheme in setting when to split the traffic and send it over another path. This model estimates the bandwidth usage on a local granularity basis instead of running periodic probe messages to estimate the bandwidth between two nodes.\",\"PeriodicalId\":394515,\"journal\":{\"name\":\"2011 IEEE Recent Advances in Intelligent Computational Systems\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Recent Advances in Intelligent Computational Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAICS.2011.6069412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Recent Advances in Intelligent Computational Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAICS.2011.6069412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

利用输出接口队列的旧信息,提出了一种在过载条件下基于队列占用情况进行负载均衡和流量分流的方法。一个称为公告板的公共存储空间用于存储输出接口缓冲区的队列长度。公告板定期更新,新到达验证公告板的队列长度,而不是输出接口缓冲区。我们模型的假设是:数据包以速率为λ1的泊松流到达,数据速率为λ1,语音速率为λ2。数据包按照先进先出的方式服务,每个数据包的服务时间以平均1为指数分布。部分缓冲区共享方案用于对语音和数据包之间的输出缓冲区进行分区。语音缓冲区的增长是有界的,从而限制了语音分组的排队延迟。如果分配的语音分组缓冲区在数据包到达时未使用,则数据包可以占用其空间。但是禁止语音包占用未分配数据包的空间。公告板定期获取输出队列长度演变。该模型提供了一个简单的负载均衡方案的抽象,用于设置何时将流量拆分并通过另一条路径发送。该模型以本地粒度为基础估计带宽使用情况,而不是定期运行探测消息来估计两个节点之间的带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Load balancing using past information of queue
We provide an approach to balancing the load and splitting the traffic during the overload condition based on queue occupation using old information of the output interface queue. A common storage space known as bulletin board is used to store the queue length of the output interface buffer. Bulletin board is updated on a regular interval basis and new arrival verifies the queue length of the bulletin board instead of the output interface buffer. The assumption of our model are: packets arrive as a Poisson stream of rate λ1 for data and λ2 for voice. Packets are served according to FIFO and the service time for a packet is exponentially distributed with mean 1. The Partial Buffer Sharing scheme is applied to partition the output buffer between voice and data packets. The growth of voice buffer is bounded so that queueing delay is restricted for voice packets. Data packet can take their space if the allocated voice packet buffer is unused on an arrival of data packet. But voice packets are prohibited to take the space of unused allocated data packets. The bulletin board fetches the output queue length evolution on a regular interval basis. The model provides an abstraction of simple load balancing scheme in setting when to split the traffic and send it over another path. This model estimates the bandwidth usage on a local granularity basis instead of running periodic probe messages to estimate the bandwidth between two nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信