Bivariate gamma distribution: A plausible solution for joint distribution of packet arrival and their sizes

A. Bhattacharjee, Sukumar Nandi
{"title":"Bivariate gamma distribution: A plausible solution for joint distribution of packet arrival and their sizes","authors":"A. Bhattacharjee, Sukumar Nandi","doi":"10.1109/ICCITECHN.2010.5723841","DOIUrl":null,"url":null,"abstract":"Network traffic has been studied extensively since new findings by Taqqu et. al. (1994), which has shown that network traffic is not memoryless. Such traffic has been called self similar with Long Range Dependence (LRD) and their distribution is commonly known as heavy-tailed. It is very hard to estimate buffer size to protect against overflow in presence of such traffic as packet sizes and their arrival count is positively correlated. Queuing analysis of network devices consider only arriving packets irrespective of their sizes, but existing network protocols allow for variable packet sizes. This can lead to higher overflow probability. This paper examines network traffic heavy-tailedness assumption via number of experimentation on connectionless service traffic. Number of arrival per second and number of bytes transferred per second are found to be highly correlated across lags. Based on these findings, this work proposes bivariate gamma distribution for joint probability distribution of these parameters.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2010.5723841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Network traffic has been studied extensively since new findings by Taqqu et. al. (1994), which has shown that network traffic is not memoryless. Such traffic has been called self similar with Long Range Dependence (LRD) and their distribution is commonly known as heavy-tailed. It is very hard to estimate buffer size to protect against overflow in presence of such traffic as packet sizes and their arrival count is positively correlated. Queuing analysis of network devices consider only arriving packets irrespective of their sizes, but existing network protocols allow for variable packet sizes. This can lead to higher overflow probability. This paper examines network traffic heavy-tailedness assumption via number of experimentation on connectionless service traffic. Number of arrival per second and number of bytes transferred per second are found to be highly correlated across lags. Based on these findings, this work proposes bivariate gamma distribution for joint probability distribution of these parameters.
二元伽玛分布:一个似是而非的解决方案的联合分布的数据包到达和他们的大小
自从Taqqu等人(1994)的新发现表明网络流量不是无记忆的以来,人们对网络流量进行了广泛的研究。这种流量被称为具有长距离依赖的自相似流量,其分布通常被称为重尾流量。由于数据包大小和它们的到达数呈正相关,因此很难估计缓冲区大小以防止存在这种流量的溢出。网络设备的排队分析只考虑到达的数据包,而不考虑其大小,但现有的网络协议允许可变数据包大小。这可能导致更高的溢出概率。通过对无连接业务流量的大量实验,验证了网络流量重尾假设。发现每秒到达的数量和每秒传输的字节数在延迟之间高度相关。基于这些发现,本工作提出了这些参数的联合概率分布的二元伽马分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信