{"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}
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.