Maintaining Internet network resources available and se-cured is an unmet challenge. Hence, trac classi cationand anomaly detection received much attention in the lastfew years, and several algorithms have been proposed forbackbone trac. However, the evaluation of these methodsusually lacks rigor, leading to hasty conclusions. Since syn-thetic data is rather criticized and common labeled database(like the data sets from the DARPA Intrusion DetectionEvaluation Program [6]) is not available for backbone traf- c; researchers analyze real data and validate their methodsby manually inspecting their results, or by comparing theirresults with other methods. Our nal goal is to label theMAWI database [2] which is an archive of real backbonetrac traces publicly available. Since manual labeling ofbackbone trac is unpractical, we build this database bycross-validating results from several methods with di erenttheoretical backgrounds. This systematic approach permitsto maintain updated database in which recent trac tracesare regularly added, and labels are improved with upcomingalgorithms. In this paper we discuss the diculties facedin comparing events provided by distinct algorithms, andpropose a methodology to achieve it.This work will also help researchers in understanding re-sults from their algorithms. For instance, while developinganomaly detector, researchers commonly face a problem intuning their parameter set. The correlation between ana-lyzed trac and parameter set is complicated. Therefore,researchers usually run their application with numerous pa-rameter settings, and the best parameter set is selected bylooking at the highest detection rate. Although this processis commonly accepted by the community a crucial issue stillremains. Let say a parameter set A gives a similar detec-tion rate than a parameter set B , but a deeper analysis ofreported events shows that B is more e ective for a certainkind of anomalies not detectable with the parameter set A(and vice versa). This case is important and should notbe ignored, however, it cannot be observed with a simplecomparison of detection rate.
{"title":"Towards systematic traffic annotation","authors":"Romain Fontugne, P. Borgnat, P. Abry, K. Fukuda","doi":"10.1145/1658997.1659006","DOIUrl":"https://doi.org/10.1145/1658997.1659006","url":null,"abstract":"Maintaining Internet network resources available and se-cured is an unmet challenge. Hence, tra\u000ec classi cationand anomaly detection received much attention in the lastfew years, and several algorithms have been proposed forbackbone tra\u000ec. However, the evaluation of these methodsusually lacks rigor, leading to hasty conclusions. Since syn-thetic data is rather criticized and common labeled database(like the data sets from the DARPA Intrusion DetectionEvaluation Program [6]) is not available for backbone traf- c; researchers analyze real data and validate their methodsby manually inspecting their results, or by comparing theirresults with other methods. Our nal goal is to label theMAWI database [2] which is an archive of real backbonetra\u000ec traces publicly available. Since manual labeling ofbackbone tra\u000ec is unpractical, we build this database bycross-validating results from several methods with di erenttheoretical backgrounds. This systematic approach permitsto maintain updated database in which recent tra\u000ec tracesare regularly added, and labels are improved with upcomingalgorithms. In this paper we discuss the di\u000eculties facedin comparing events provided by distinct algorithms, andpropose a methodology to achieve it.This work will also help researchers in understanding re-sults from their algorithms. For instance, while developinganomaly detector, researchers commonly face a problem intuning their parameter set. The correlation between ana-lyzed tra\u000ec and parameter set is complicated. Therefore,researchers usually run their application with numerous pa-rameter settings, and the best parameter set is selected bylooking at the highest detection rate. Although this processis commonly accepted by the community a crucial issue stillremains. Let say a parameter set A gives a similar detec-tion rate than a parameter set B , but a deeper analysis ofreported events shows that B is more e ective for a certainkind of anomalies not detectable with the parameter set A(and vice versa). This case is important and should notbe ignored, however, it cannot be observed with a simplecomparison of detection rate.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lin Cong, Guohan Lu, Yang Chen, Beixing Deng, Xing Li
Accurate and effective estimation of TCP operating point impacts directly on TCP performance, especially in modern high-speed networks. In this paper, we focus on two crucial questions: 1) In order to guarantee the performance and stability of TCP, how accurately does the TCP operating point need to be estimated? 2) Ahead of the occurrence of network congestion, how accurately can TCP estimate its operating points at the end host? We declare that the estimator which is based on TCP packet series can satisfy the accuracy TCP required.
{"title":"What level of estimating accuracy does TCP need and can TCP achieve","authors":"Lin Cong, Guohan Lu, Yang Chen, Beixing Deng, Xing Li","doi":"10.1145/1658997.1659009","DOIUrl":"https://doi.org/10.1145/1658997.1659009","url":null,"abstract":"Accurate and effective estimation of TCP operating point impacts directly on TCP performance, especially in modern high-speed networks. In this paper, we focus on two crucial questions: 1) In order to guarantee the performance and stability of TCP, how accurately does the TCP operating point need to be estimated? 2) Ahead of the occurrence of network congestion, how accurately can TCP estimate its operating points at the end host? We declare that the estimator which is based on TCP packet series can satisfy the accuracy TCP required.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125385648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hybrid multicast is regarded a promising technology to overcome the inter-domain deployment problem for group communication. Realistic performance estimators are difficult to obtain due to the diversity of overlay concepts and their complex dependence on the global Internet topology that withstands straightforward simulations or measurements. We contribute a simple analytic model for the expected delay distribution. Parametrized by realistic measurement values, this should serve as a first order estimator for quantifying the delay penalties in a global-scale hybrid multicast packet distribution. We diagnose a strong dependence on hop counts and proximity awareness for the overlay multicast approach in use with promising results for most efficient schemes.
{"title":"An a priori estimator for the delay distribution in global hybrid multicast","authors":"Matthias Wählisch, T. Schmidt","doi":"10.1145/1658997.1659008","DOIUrl":"https://doi.org/10.1145/1658997.1659008","url":null,"abstract":"Hybrid multicast is regarded a promising technology to overcome the inter-domain deployment problem for group communication. Realistic performance estimators are difficult to obtain due to the diversity of overlay concepts and their complex dependence on the global Internet topology that withstands straightforward simulations or measurements. We contribute a simple analytic model for the expected delay distribution. Parametrized by realistic measurement values, this should serve as a first order estimator for quantifying the delay penalties in a global-scale hybrid multicast packet distribution. We diagnose a strong dependence on hop counts and proximity awareness for the overlay multicast approach in use with promising results for most efficient schemes.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Innovative software and system development requires a multi-disciplinary approach where technical, objectively quantifiable Quality of Service aspects are integrated with and correlated to subjective Quality of Experience measures such as usability, user expectations and experiences. To date, QoS and QoE research has however mainly been carried out in an isolated manner. Their exact correlation consequently remains unclear. Using a collaborative multi-platform game as case study, we intend to investigate this relationship and hope to bridge the divide that currently exists between social, user-oriented research and technically-oriented application development by formulating recommendations and guidelines. To implement the QoS and QoE optimizations, we will rely on the NIProxy, a network proxy equipped with network traffic shaping and service provision functionality.
{"title":"Investigating the relationship between QoS and QoE in a mixed desktop/handheld gaming setting","authors":"Maarten Wijnants, S. Agten, P. Quax, W. Lamotte","doi":"10.1145/1658997.1659013","DOIUrl":"https://doi.org/10.1145/1658997.1659013","url":null,"abstract":"Innovative software and system development requires a multi-disciplinary approach where technical, objectively quantifiable Quality of Service aspects are integrated with and correlated to subjective Quality of Experience measures such as usability, user expectations and experiences. To date, QoS and QoE research has however mainly been carried out in an isolated manner. Their exact correlation consequently remains unclear. Using a collaborative multi-platform game as case study, we intend to investigate this relationship and hope to bridge the divide that currently exists between social, user-oriented research and technically-oriented application development by formulating recommendations and guidelines. To implement the QoS and QoE optimizations, we will rely on the NIProxy, a network proxy equipped with network traffic shaping and service provision functionality.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, the lack of spectrum resources becomes an important problem for advanced wireless networks. To overcome this problem, dynamic spectrum access receives much attention. In this paper, we propose a spectrum assignment method based on a genetic algorithm in which a WiFi system temporarily uses a spectrum band of WiMAX system in WiMAX/WiFi integrated networks.
{"title":"A spectrum assignment method based on genetic algorithm in WiMAX/WiFi integrated network","authors":"M. Nakagawa, K. Kinoshita, K. Murakami, K. Kawano","doi":"10.1145/1658997.1659004","DOIUrl":"https://doi.org/10.1145/1658997.1659004","url":null,"abstract":"Recently, the lack of spectrum resources becomes an important problem for advanced wireless networks. To overcome this problem, dynamic spectrum access receives much attention. In this paper, we propose a spectrum assignment method based on a genetic algorithm in which a WiFi system temporarily uses a spectrum band of WiMAX system in WiMAX/WiFi integrated networks.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The upload contribution of peers in a peer-to-peer streaming system depends on their willingness to contribute as well as their physical limitation. Several incentive schemes have been proposed to enforce non-willing peers to cooperate. But we find it of great interest to see how physically constrained, with respect to resources, peers can be supported by a streaming application. In this paper we investigate how free-riders, namely non-contributing peers, can be served in a peer-to-peer streaming system. We examine different prioritization schemes that are used by high contributing peers to prioritize other contributing peers over free-riders and show that as the level of prioritization increases, contributing peers receive higher quality but the average quality drops. To avoid this, we propose an incentive mechanism that encourages contributing peers to upload to free-riders so that the average quality experienced by the peers in the overlay is maximized.
{"title":"Maximizing streaming quality in heterogeneous overlays through incentives","authors":"I. Chatzidrossos","doi":"10.1145/1658997.1659017","DOIUrl":"https://doi.org/10.1145/1658997.1659017","url":null,"abstract":"The upload contribution of peers in a peer-to-peer streaming system depends on their willingness to contribute as well as their physical limitation. Several incentive schemes have been proposed to enforce non-willing peers to cooperate. But we find it of great interest to see how physically constrained, with respect to resources, peers can be supported by a streaming application. In this paper we investigate how free-riders, namely non-contributing peers, can be served in a peer-to-peer streaming system. We examine different prioritization schemes that are used by high contributing peers to prioritize other contributing peers over free-riders and show that as the level of prioritization increases, contributing peers receive higher quality but the average quality drops. To avoid this, we propose an incentive mechanism that encourages contributing peers to upload to free-riders so that the average quality experienced by the peers in the overlay is maximized.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134275102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The delay-sensitive applications has been rapidly growing in recent years, while the current Internet is not well equipped to support such delay-sensitive traffic. The proposed SRD (Stochastic Rate-Delay) services enable a user to choose between a higher transmission rate or low queuing delay at a congested network link. Delay could be allowed to spike occasionally as long as average low delay remains guaranteed. We build a model using stochastic network calculus to analyze the proposal and shed insight on its fundamental characteristics quantitatively.
{"title":"When stochastic rate-delay services meet stochastic network calculus","authors":"Kai Wang, Chuang Lin","doi":"10.1145/1658997.1659025","DOIUrl":"https://doi.org/10.1145/1658997.1659025","url":null,"abstract":"The delay-sensitive applications has been rapidly growing in recent years, while the current Internet is not well equipped to support such delay-sensitive traffic. The proposed SRD (Stochastic Rate-Delay) services enable a user to choose between a higher transmission rate or low queuing delay at a congested network link. Delay could be allowed to spike occasionally as long as average low delay remains guaranteed. We build a model using stochastic network calculus to analyze the proposal and shed insight on its fundamental characteristics quantitatively.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120908819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inter-domain forwarding state is growing at a super-linear rate, rendering older routers obsolete and increasing the cost of replacement. A reduction of state will alleviate this problem. In this paper, we outline a new reduced-state inter-domain forwarding mechanism. We carefully drop portions of the advertised forwarding state using a utility measure for prefixes based on the length of the prefix and the path length to its origin. A deterministic forwarding algorithm uses the resulting partial view. The graph of connections between autonomous systems is shallow, offering many viable paths for data flows, a property we aim to use to achieve minimal detrimental effect on delay and AS path stretch.
{"title":"Deterministic, reduced-visibility inter-domain forwarding","authors":"Stephen D. Strowes, C. Perkins","doi":"10.1145/1658997.1659003","DOIUrl":"https://doi.org/10.1145/1658997.1659003","url":null,"abstract":"Inter-domain forwarding state is growing at a super-linear rate, rendering older routers obsolete and increasing the cost of replacement. A reduction of state will alleviate this problem. In this paper, we outline a new reduced-state inter-domain forwarding mechanism. We carefully drop portions of the advertised forwarding state using a utility measure for prefixes based on the length of the prefix and the path length to its origin. A deterministic forwarding algorithm uses the resulting partial view. The graph of connections between autonomous systems is shallow, offering many viable paths for data flows, a property we aim to use to achieve minimal detrimental effect on delay and AS path stretch.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129225827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless sensor networks (WSNs) are about to become a popular and inexpensive tool for all kinds of applications. More advanced applications also need end-to-end routing, which goes beyond the simple data dissemination and collection mechanisms of early WSNs. The special properties of WSNs -- scarce memory, CPU, and energy resources -- make this a challenge. The Dynamic Address Routing protocol (DART) could be a good candidate for WSN routing, if it were not so prone to link outages. In this paper, we propose Scalable Landmark Flooding (SLF), a new routing protocol for large WSNs. It combines ideas from landmark routing, flooding, and dynamic address routing. SLF is robust against link and node outages, requires only little routing state, and generates low maintenance traffic overhead.
{"title":"Scalable landmark flooding: a scalable routing protocol for WSNs","authors":"Pengfei Di, T. Fuhrmann","doi":"10.1145/1658997.1658999","DOIUrl":"https://doi.org/10.1145/1658997.1658999","url":null,"abstract":"Wireless sensor networks (WSNs) are about to become a popular and inexpensive tool for all kinds of applications. More advanced applications also need end-to-end routing, which goes beyond the simple data dissemination and collection mechanisms of early WSNs. The special properties of WSNs -- scarce memory, CPU, and energy resources -- make this a challenge. The Dynamic Address Routing protocol (DART) could be a good candidate for WSN routing, if it were not so prone to link outages.\u0000 In this paper, we propose Scalable Landmark Flooding (SLF), a new routing protocol for large WSNs. It combines ideas from landmark routing, flooding, and dynamic address routing. SLF is robust against link and node outages, requires only little routing state, and generates low maintenance traffic overhead.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121652529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：