{"title":"Coordinated Sampling in SDNs with Dynamic Flow Rates","authors":"Soroosh Esmaeilian, Mahdi Dolati, Sogand Sadrhaghighi, Majid Ghaderi","doi":"arxiv-2409.05966","DOIUrl":null,"url":null,"abstract":"Traffic sampling has become an indispensable tool in network management.\nWhile there exists a plethora of sampling systems, they generally assume flow\nrates are stable and predictable over a sampling period. Consequently, when\ndeployed in networks with dynamic flow rates, some flows may be missed or\nunder-sampled, while others are over-sampled. This paper presents the design\nand evaluation of dSamp, a network-wide sampling system capable of handling\ndynamic flow rates in Software-Defined Networks (SDNs). The key idea in dSamp\nis to consider flow rate fluctuations when deciding on which network switches\nand at what rate to sample each flow. To this end, we develop a general model\nfor sampling allocation with dynamic flow rates, and then design an efficient\napproximate integer linear program called APX that can be used to compute\nsampling allocations even in large-scale networks. To show the efficacy of\ndSamp for network monitoring, we have implemented APX and several existing\nsolutions in ns-3 and conducted extensive experiments using model-driven as\nwell as trace-driven simulations. Our results indicate that, by considering\ndynamic flow rates, APX outperforms the existing solutions by up to 10% in\nsampling more flows at a given sampling rate.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05966","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Traffic sampling has become an indispensable tool in network management.
While there exists a plethora of sampling systems, they generally assume flow
rates are stable and predictable over a sampling period. Consequently, when
deployed in networks with dynamic flow rates, some flows may be missed or
under-sampled, while others are over-sampled. This paper presents the design
and evaluation of dSamp, a network-wide sampling system capable of handling
dynamic flow rates in Software-Defined Networks (SDNs). The key idea in dSamp
is to consider flow rate fluctuations when deciding on which network switches
and at what rate to sample each flow. To this end, we develop a general model
for sampling allocation with dynamic flow rates, and then design an efficient
approximate integer linear program called APX that can be used to compute
sampling allocations even in large-scale networks. To show the efficacy of
dSamp for network monitoring, we have implemented APX and several existing
solutions in ns-3 and conducted extensive experiments using model-driven as
well as trace-driven simulations. Our results indicate that, by considering
dynamic flow rates, APX outperforms the existing solutions by up to 10% in
sampling more flows at a given sampling rate.