Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502795
Nessrine Trabelsi, Chung Shue Chen, L. Roullet, E. Altman, R. E. Azouzi
Due to Orthogonal Frequency Division Multiple Access (OFDMA) mechanism adopted in LTE cellular networks, intra-cell interference is nearly absent. Yet, as these networks are designed for a frequency reuse factor of 1 to maximize the utilization of the licensed bandwidth, inter-cell interference coordination remains an important challenge. In both homogeneous and heterogeneous cellular networks, there is a need for scheduling coordination techniques to efficiently distribute the resources and mitigate inter-cell interference. In this paper, we propose a dynamic solution of inter-cell interference coordination performing an optimization of frequency sub-band reuse and transmission power in order to maximize the overall network utility. The proposed framework, based on game theory, permits to dynamically define frequency and transmission power patterns for each cell in the coordinated cluster. Simulation results show significant benefits in average throughput and also cell edge user throughput of 40% and 55% gains when performing the frequency sub-band muting and power control. Furthermore, we also obtain a meaningful improvement in energy efficiency.
{"title":"Coordinated scheduling via frequency and power allocation optimization in LTE cellular networks","authors":"Nessrine Trabelsi, Chung Shue Chen, L. Roullet, E. Altman, R. E. Azouzi","doi":"10.1109/NOMS.2016.7502795","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502795","url":null,"abstract":"Due to Orthogonal Frequency Division Multiple Access (OFDMA) mechanism adopted in LTE cellular networks, intra-cell interference is nearly absent. Yet, as these networks are designed for a frequency reuse factor of 1 to maximize the utilization of the licensed bandwidth, inter-cell interference coordination remains an important challenge. In both homogeneous and heterogeneous cellular networks, there is a need for scheduling coordination techniques to efficiently distribute the resources and mitigate inter-cell interference. In this paper, we propose a dynamic solution of inter-cell interference coordination performing an optimization of frequency sub-band reuse and transmission power in order to maximize the overall network utility. The proposed framework, based on game theory, permits to dynamically define frequency and transmission power patterns for each cell in the coordinated cluster. Simulation results show significant benefits in average throughput and also cell edge user throughput of 40% and 55% gains when performing the frequency sub-band muting and power control. Furthermore, we also obtain a meaningful improvement in energy efficiency.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125607498","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502893
Roberto di Lallo, Gabriele Lospoto, M. Rimondini, G. Battista
Federated networking is a promising approach to resource sharing that supports cost-effective services involving multiple parties. Research in this field largely focused on architectures and cost models, making limited progress on the technological side. On the other hand, the widely adopted Software-Defined Networking (SDN) model found its most successful application in data centers, exhibiting very little penetration in other scenarios. We leverage the unexplored potential of SDN on the edge of a network to introduce an approach that supports end-to-end connectivity among different federated partners. Our approach is based on simple Network Address and Port Translation (NAPT), making it applicable in standard IP networks. It is also very flexible, because it exploits SDN, and scalable, because address translations are performed on Customer Premises Equipment, where SDN is being progressively supported by device vendors. We define various alternative NAPT strategies and evaluate their effectiveness with simulations as well as emulated scenarios.
{"title":"Supporting end-to-end connectivity in federated networks using SDN","authors":"Roberto di Lallo, Gabriele Lospoto, M. Rimondini, G. Battista","doi":"10.1109/NOMS.2016.7502893","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502893","url":null,"abstract":"Federated networking is a promising approach to resource sharing that supports cost-effective services involving multiple parties. Research in this field largely focused on architectures and cost models, making limited progress on the technological side. On the other hand, the widely adopted Software-Defined Networking (SDN) model found its most successful application in data centers, exhibiting very little penetration in other scenarios. We leverage the unexplored potential of SDN on the edge of a network to introduce an approach that supports end-to-end connectivity among different federated partners. Our approach is based on simple Network Address and Port Translation (NAPT), making it applicable in standard IP networks. It is also very flexible, because it exploits SDN, and scalable, because address translations are performed on Customer Premises Equipment, where SDN is being progressively supported by device vendors. We define various alternative NAPT strategies and evaluate their effectiveness with simulations as well as emulated scenarios.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126747188","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502865
H. Matsuura
Sensor data aggregation trees in a wireless sensor network (WSN) are used to gather data from an area that the WSN covers. In this paper, a hierarchical sensor network routing is proposed in which a base station (BS) cooperates with its underlying multiple cluster heads (CHs) to determine the best routes in each tree-cluster. A routing metric proposed in this paper represents the rate of energy increase on a tree when a new sensor is connected to the tree, and the BS can always select the smallest metric route among all the trees; thus, the architecture can reduce the energy consumption of the trees and extend their lifetime significantly. In addition, the proposed routing sets a backup route for each primary route on a tree by choosing the second smallest metric route after the primary route. Therefore, the lifetime of aggregation trees even after some percentage of sensors die is longer compared with other routings.
{"title":"Maximizing lifetime of multiple data aggregation trees in wireless sensor networks","authors":"H. Matsuura","doi":"10.1109/NOMS.2016.7502865","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502865","url":null,"abstract":"Sensor data aggregation trees in a wireless sensor network (WSN) are used to gather data from an area that the WSN covers. In this paper, a hierarchical sensor network routing is proposed in which a base station (BS) cooperates with its underlying multiple cluster heads (CHs) to determine the best routes in each tree-cluster. A routing metric proposed in this paper represents the rate of energy increase on a tree when a new sensor is connected to the tree, and the BS can always select the smallest metric route among all the trees; thus, the architecture can reduce the energy consumption of the trees and extend their lifetime significantly. In addition, the proposed routing sets a backup route for each primary route on a tree by choosing the second smallest metric route after the primary route. Therefore, the lifetime of aggregation trees even after some percentage of sensors die is longer compared with other routings.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126316510","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502914
Ahmad AlEroud, I. Alsmadi
The recent emerge of Software Defined Networking (SDN) promotes both supporters and opponents to further explore this network architecture. One of the main attributes that characterize SDN is the significant role of software to manage and control the architecture. There are four major concerns for such software dominant role, security, performance, reliability, and fault tolerance. Among them security is considered a major concern. SDNs security concerns include attacks on the control plane layer such as DoS attacks. This paper presents an inference-relation context based technique for the detection of DoS attacks on SDNs. The proposed technique utilizes contextual similarity with existing attack patterns to identify DoS in an OpenFlow infrastructure. A validation of the proposed technique has been performed using a several benchmark datasets yielding promising results.
{"title":"Identifying DoS attacks on software defined networks: A relation context approach","authors":"Ahmad AlEroud, I. Alsmadi","doi":"10.1109/NOMS.2016.7502914","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502914","url":null,"abstract":"The recent emerge of Software Defined Networking (SDN) promotes both supporters and opponents to further explore this network architecture. One of the main attributes that characterize SDN is the significant role of software to manage and control the architecture. There are four major concerns for such software dominant role, security, performance, reliability, and fault tolerance. Among them security is considered a major concern. SDNs security concerns include attacks on the control plane layer such as DoS attacks. This paper presents an inference-relation context based technique for the detection of DoS attacks on SDNs. The proposed technique utilizes contextual similarity with existing attack patterns to identify DoS in an OpenFlow infrastructure. A validation of the proposed technique has been performed using a several benchmark datasets yielding promising results.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127639221","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502839
M. T. Vega, J. Famaey, A. Koonen, A. Liotta
Optical Wireless (OW) technologies deploying narrow multiwavelength light beams offer a promising alternative to traditional wireless indoor communications as they provide higher bandwidths and overcome the radio spectrum congestion typical of the 2.4 and 5GHz frequency bands. However, unlocking their full potential requires exploring novel control and management techniques. Specifically, there is a need for efficient and intelligent resource management and localization techniques that allot wavelengths and capacity to devices. In this paper we present a resource allocation model for one such indoor optical wireless approach, a Beam-steered Reconfigurable Optical-Wireless System for Energy-efficient communication (BROWSE). BROWSE aims to supply each user within a room with its own downstream infrared light beam with at least 10Gbps throughput, while providing a 60GHz radio channel upstream. Using Integer Linear Programming (ILP) techniques, we have designed and implemented a resource allocation model for the BROWSE OW downstream connection. The designed model optimises the trade-off between energy-consumption and throughput, while providing TDM capabilities to effectively serve densely deployed devices with a limited number of simultaneous available wavelengths. Through several test-scenarios we have assessed the model's performance, as well as its applicability to future ultra-high bandwidth video streaming applications.
{"title":"Resource allocation in optical beam-steered indoor networks","authors":"M. T. Vega, J. Famaey, A. Koonen, A. Liotta","doi":"10.1109/NOMS.2016.7502839","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502839","url":null,"abstract":"Optical Wireless (OW) technologies deploying narrow multiwavelength light beams offer a promising alternative to traditional wireless indoor communications as they provide higher bandwidths and overcome the radio spectrum congestion typical of the 2.4 and 5GHz frequency bands. However, unlocking their full potential requires exploring novel control and management techniques. Specifically, there is a need for efficient and intelligent resource management and localization techniques that allot wavelengths and capacity to devices. In this paper we present a resource allocation model for one such indoor optical wireless approach, a Beam-steered Reconfigurable Optical-Wireless System for Energy-efficient communication (BROWSE). BROWSE aims to supply each user within a room with its own downstream infrared light beam with at least 10Gbps throughput, while providing a 60GHz radio channel upstream. Using Integer Linear Programming (ILP) techniques, we have designed and implemented a resource allocation model for the BROWSE OW downstream connection. The designed model optimises the trade-off between energy-consumption and throughput, while providing TDM capabilities to effectively serve densely deployed devices with a limited number of simultaneous available wavelengths. Through several test-scenarios we have assessed the model's performance, as well as its applicability to future ultra-high bandwidth video streaming applications.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"32 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114002811","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502875
Maria Efthymiopoulou, N. Efthymiopoulos, Athanasios Christakidis
Live video streaming over internet is becoming popular more and more. Current commercial live video streaming systems are based either on a typical client-server (cloud) or on a peer-to-peer (P2P) architecture. The former is preferred for stability and QoS, provided that the system is not stretched beyond the server's bandwidth capacity, while the latter is scalable with small bandwidth and management cost. In this paper, we stabilize live streaming with a cloud assisted P2P live streaming system without sacrificing scalability. In order to achieve this we develop: i) a scalable gossip protocol with low bandwidth overhead for the cloud that monitors dynamically the total available bandwidth resources of the participating peers, ii) a control strategy that dynamically allocates from the cloud the exact amount of required bandwidth in order to guarantee the complete and on time stream distribution, iii) an alternative control strategy that dynamically adapts the playback rate to the available bandwidth resources. All these are achieved by modeling analytically through difference equations the dynamic relationship between the total bandwidth surplus (idle peers' bandwidth) and the playback rate. Finally, we evaluate our proposed architecture in a packet level simulator of a complete P2P live streaming system that designed in OPNET Modeler. Our evaluation testifies the uninterrupted and complete stream delivery even in adverse bandwidth changes.
{"title":"Enabling QoS in peer to peer live streaming through dynamic bandwidth or playback rate control","authors":"Maria Efthymiopoulou, N. Efthymiopoulos, Athanasios Christakidis","doi":"10.1109/NOMS.2016.7502875","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502875","url":null,"abstract":"Live video streaming over internet is becoming popular more and more. Current commercial live video streaming systems are based either on a typical client-server (cloud) or on a peer-to-peer (P2P) architecture. The former is preferred for stability and QoS, provided that the system is not stretched beyond the server's bandwidth capacity, while the latter is scalable with small bandwidth and management cost. In this paper, we stabilize live streaming with a cloud assisted P2P live streaming system without sacrificing scalability. In order to achieve this we develop: i) a scalable gossip protocol with low bandwidth overhead for the cloud that monitors dynamically the total available bandwidth resources of the participating peers, ii) a control strategy that dynamically allocates from the cloud the exact amount of required bandwidth in order to guarantee the complete and on time stream distribution, iii) an alternative control strategy that dynamically adapts the playback rate to the available bandwidth resources. All these are achieved by modeling analytically through difference equations the dynamic relationship between the total bandwidth surplus (idle peers' bandwidth) and the playback rate. Finally, we evaluate our proposed architecture in a packet level simulator of a complete P2P live streaming system that designed in OPNET Modeler. Our evaluation testifies the uninterrupted and complete stream delivery even in adverse bandwidth changes.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114571969","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502961
G. Moura, M. Müller, M. Wullink, Cristian Hesselman
We present nDEWS, a Hadoop-based automatic early warning system of malicious domains for domain name registry operators, such as top-level domain (TLD) registries. By monitoring an entire DNS zone, nDEWS is able to single out newly added suspicious domains by analyzing both domain registration and global DNS lookup patterns of a TLD. nDEWS is capable to detect several types of domain abuse, such as malware, phishing, and allegedly fraudulent web shops. To act on this data, we have established a pilot study with two major .nl registrars, and provide them with daily feeds of their respective suspicious domains. Moreover, nDEWS can also be implemented by other TLD operators/registries.
{"title":"nDEWS: A new domains early warning system for TLDs","authors":"G. Moura, M. Müller, M. Wullink, Cristian Hesselman","doi":"10.1109/NOMS.2016.7502961","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502961","url":null,"abstract":"We present nDEWS, a Hadoop-based automatic early warning system of malicious domains for domain name registry operators, such as top-level domain (TLD) registries. By monitoring an entire DNS zone, nDEWS is able to single out newly added suspicious domains by analyzing both domain registration and global DNS lookup patterns of a TLD. nDEWS is capable to detect several types of domain abuse, such as malware, phishing, and allegedly fraudulent web shops. To act on this data, we have established a pilot study with two major .nl registrars, and provide them with daily feeds of their respective suspicious domains. Moreover, nDEWS can also be implemented by other TLD operators/registries.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121502088","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502994
Bahman Rashidi, Carol J. Fung
RecDroid is a smartphone permission management system which provides users with a fine-grained real-time app permission control and a recommendation system regarding whether to grant the permission or not based on expert users' responses in the network. However, in such a system, malware owners may create multiple bot users to misguide the recommendation system by providing untruthful responses on the malicious app. Threshold-based detection method can detect malicious users which are dishonest on many apps, but it cannot detect malicious users that target on some specific apps. In this work, we present a clustering-based method called BotTracer to finding groups of bot users controlled by the same masters, which can be used to detect bot users with high reputation scores. The key part of the proposed method is to map the users into a graph based on their similarity and apply a clustering algorithm to group users together. We evaluate our method using a set of simulated users' profiles, including malicious users and regular ones. Our experimental results demonstrate high accuracy in terms of detecting malicious users. Finally, we discuss several clustering features and their impact on the clustering results.
{"title":"BotTracer: Bot user detection using clustering method in RecDroid","authors":"Bahman Rashidi, Carol J. Fung","doi":"10.1109/NOMS.2016.7502994","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502994","url":null,"abstract":"RecDroid is a smartphone permission management system which provides users with a fine-grained real-time app permission control and a recommendation system regarding whether to grant the permission or not based on expert users' responses in the network. However, in such a system, malware owners may create multiple bot users to misguide the recommendation system by providing untruthful responses on the malicious app. Threshold-based detection method can detect malicious users which are dishonest on many apps, but it cannot detect malicious users that target on some specific apps. In this work, we present a clustering-based method called BotTracer to finding groups of bot users controlled by the same masters, which can be used to detect bot users with high reputation scores. The key part of the proposed method is to map the users into a graph based on their similarity and apply a clustering algorithm to group users together. We evaluate our method using a set of simulated users' profiles, including malicious users and regular ones. Our experimental results demonstrate high accuracy in terms of detecting malicious users. Finally, we discuss several clustering features and their impact on the clustering results.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126094463","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502996
G. Biczók, Balázs Sonkoly, Nikolett Bereczky, C. Boyd
Flexible service delivery is a key requirement for 5G network architectures. This includes the support for collaborative service delivery by multiple operators, when an individual operator lacks the geographical footprint or the available network, compute or storage resources to provide the requested service to its customer. Network Function Virtualisation is a key enabler of such service delivery, as network functions (VNFs) can be outsourced to other operators. Owing to the (partial lack of) contractual relationships and co-opetition in the ecosystem, the privacy of user data, operator policy and even VNF code could be compromised. In this paper, we present a case for privacy in a VNF-enabled collaborative service delivery architecture. Specifically, we show the promise of homomorphic encryption (HE) in this context and its performance limitations through a proof of concept implementation of an image transcoder network function. Furthermore, inspired by application-specific encryption techniques, we propose a way forward for private, payload-intensive VNFs.
{"title":"Private VNFs for collaborative multi-operator service delivery: An architectural case","authors":"G. Biczók, Balázs Sonkoly, Nikolett Bereczky, C. Boyd","doi":"10.1109/NOMS.2016.7502996","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502996","url":null,"abstract":"Flexible service delivery is a key requirement for 5G network architectures. This includes the support for collaborative service delivery by multiple operators, when an individual operator lacks the geographical footprint or the available network, compute or storage resources to provide the requested service to its customer. Network Function Virtualisation is a key enabler of such service delivery, as network functions (VNFs) can be outsourced to other operators. Owing to the (partial lack of) contractual relationships and co-opetition in the ecosystem, the privacy of user data, operator policy and even VNF code could be compromised. In this paper, we present a case for privacy in a VNF-enabled collaborative service delivery architecture. Specifically, we show the promise of homomorphic encryption (HE) in this context and its performance limitations through a proof of concept implementation of an image transcoder network function. Furthermore, inspired by application-specific encryption techniques, we propose a way forward for private, payload-intensive VNFs.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127723621","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}
Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502940
M. Hoogesteger, R. Schmidt, A. Pras
Motivated by the fact that comprehensive and long term Internet traffic measurements can be hard to obtain, we have proposed and developed the Internet Traffic Statistics Archive (ITSA). Since 2013, ITSA concentrates reports on highlevel statistics of Internet traffic worldwide. Examples of statistics are shares of traffic per port, protocols and distribution of packets and bytes. Such information can be of great help to those that need to support claims and assumptions on what Internet traffic actually looks like. The reports containing traffic statistics are generated on a weekly basis from NetFlow data, and publicly published on the ITSA website. In this demo we will present the ITSA architecture, how it can be used, and how the available data can help to visualize and understand trends in Internet traffic.
{"title":"ITSA: Internet traffic statistics archive","authors":"M. Hoogesteger, R. Schmidt, A. Pras","doi":"10.1109/NOMS.2016.7502940","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502940","url":null,"abstract":"Motivated by the fact that comprehensive and long term Internet traffic measurements can be hard to obtain, we have proposed and developed the Internet Traffic Statistics Archive (ITSA). Since 2013, ITSA concentrates reports on highlevel statistics of Internet traffic worldwide. Examples of statistics are shares of traffic per port, protocols and distribution of packets and bytes. Such information can be of great help to those that need to support claims and assumptions on what Internet traffic actually looks like. The reports containing traffic statistics are generated on a weekly basis from NetFlow data, and publicly published on the ITSA website. In this demo we will present the ITSA architecture, how it can be used, and how the available data can help to visualize and understand trends in Internet traffic.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127877810","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
扫码关注我们
求助内容：
应助结果提醒方式：