Pub Date : 2017-12-28DOI: 10.1109/LATINCOM.2017.8240173
Vanessa L. Quintero, C. Estevez
The VST-TDMA access protocol has shown to have many advantages over existing protocols in centralized (star) wireless network architectures. As most data-link layer protocols, it does not have a recovery feature as data integrity is supervised by the connection-oriented transport protocols. Nevertheless, VST-TDMA possesses the flexibility to easily incorporate a retransmission feature that allows the users to experience higher throughput when using applications that use the Transmission Control Protocol, which transports approximately 90% of all Internet traffic. Results show that depending on the wireless link reliability, i.e., the frame loss rate, the throughput can be improved by a factor of ten.
{"title":"Frame retransmission using a modified VST-TDMA access protocol in Picocell/WPAN","authors":"Vanessa L. Quintero, C. Estevez","doi":"10.1109/LATINCOM.2017.8240173","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240173","url":null,"abstract":"The VST-TDMA access protocol has shown to have many advantages over existing protocols in centralized (star) wireless network architectures. As most data-link layer protocols, it does not have a recovery feature as data integrity is supervised by the connection-oriented transport protocols. Nevertheless, VST-TDMA possesses the flexibility to easily incorporate a retransmission feature that allows the users to experience higher throughput when using applications that use the Transmission Control Protocol, which transports approximately 90% of all Internet traffic. Results show that depending on the wireless link reliability, i.e., the frame loss rate, the throughput can be improved by a factor of ten.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"5 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801594","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240146
S. Moteau, F. Guillemin, Thierry Houdoin
We describe a “crowd measurement” project, referred to as PoQeMoN, whose main objective is to identify Quality of Service (QoS) indicators in order to predict the Quality of Experience (QoE) for HTTP YouTube content on mobile networks. Results are based on experiments on an operational network. The second contribution of this paper is to show that the proposed indicator is easy to implement in order to predict the quality that network operators really delivered to customers.
{"title":"Correlation between QoS and QoE for HTTP YouTube content in Orange cellular networks","authors":"S. Moteau, F. Guillemin, Thierry Houdoin","doi":"10.1109/LATINCOM.2017.8240146","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240146","url":null,"abstract":"We describe a “crowd measurement” project, referred to as PoQeMoN, whose main objective is to identify Quality of Service (QoS) indicators in order to predict the Quality of Experience (QoE) for HTTP YouTube content on mobile networks. Results are based on experiments on an operational network. The second contribution of this paper is to show that the proposed indicator is easy to implement in order to predict the quality that network operators really delivered to customers.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126128187","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240149
Bruno Fontana da Silva, César A. Azurdia-Meza, Danilo Silva, B. Filho
In this paper, we consider the deployment of multiple antennas as a way to exploit spatial diversity in the uplink of multiple access systems that adopt low-density spreading (LDS) with orthogonal frequency-division multiplexing (OFDM). An overloaded LDS-OFDM system is assumed, i.e., the number of users served is assumed greater than the number of resources. A basic model is developed and from it we design multiplexing spreading signatures based on space-frequency block codes (SFBC) to enhance the system's error performance. Computer simulations results reveal that the proposed multipleinput multiple-output (MIMO) LDS-OFDM scheme achieves full spatial diversity gain regardless the level of fading correlation between neighboring subcarriers. In contrast, a standard LDS scheme is shown to achieve full spatial diversity gain only under perfectly uncorrelated frequency fading, which favors the proposed scheme. Moreover, the spatial diversity benefits of MIMO LDS-OFDM comes with no additional complexity, as an iterative message-passing algorithm with the same complexity for both the proposed and the standard schemes approaches the respective optimal performances with only 2 iterations. These features make the proposed MIMO LDS-OFDM scheme a strong candidate for future wireless networks.
{"title":"Exploiting spatial diversity in overloaded MIMO LDS-OFDM multiple access systems","authors":"Bruno Fontana da Silva, César A. Azurdia-Meza, Danilo Silva, B. Filho","doi":"10.1109/LATINCOM.2017.8240149","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240149","url":null,"abstract":"In this paper, we consider the deployment of multiple antennas as a way to exploit spatial diversity in the uplink of multiple access systems that adopt low-density spreading (LDS) with orthogonal frequency-division multiplexing (OFDM). An overloaded LDS-OFDM system is assumed, i.e., the number of users served is assumed greater than the number of resources. A basic model is developed and from it we design multiplexing spreading signatures based on space-frequency block codes (SFBC) to enhance the system's error performance. Computer simulations results reveal that the proposed multipleinput multiple-output (MIMO) LDS-OFDM scheme achieves full spatial diversity gain regardless the level of fading correlation between neighboring subcarriers. In contrast, a standard LDS scheme is shown to achieve full spatial diversity gain only under perfectly uncorrelated frequency fading, which favors the proposed scheme. Moreover, the spatial diversity benefits of MIMO LDS-OFDM comes with no additional complexity, as an iterative message-passing algorithm with the same complexity for both the proposed and the standard schemes approaches the respective optimal performances with only 2 iterations. These features make the proposed MIMO LDS-OFDM scheme a strong candidate for future wireless networks.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116131146","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240194
Juliver Gil-Herrera, J. F. Botero
Network Functions Virtualization (NFV) is a new network paradigm that has been strongly promoted from both scientific community and telecom industry, where network functions (NFs) such as firewalls, load balancers, gateways among others, are virtualized, isolated from middleboxes and housed on one or more industry standard computing nodes. One of the main challenges for service providers when they try to deploy the NFV-based networks is to efficiently make use of substrate network resources to facilitate the design, delivery and operation of network services in a dynamic and scalable manner. This challenge is known as NFV Resource Allocation. Service Function Chain (SFC) composition is the first stage of the NFV Resource Allocation problem and we solve it in this paper. We formally define the service requests (VNFRs) in terms of NFs and propose a metaheuristic algorithm for solving the SFC composition stage. Our evaluation focuses primarily on minimizing the total bandwidth demanded by the constructed network service. The results show that our proposed approach is applicable to large and complex VNFRs and finds, in reasonable running times, close-to-optimal solutions with minimal bandwidth requirements.
{"title":"A scalable metaheuristic for service function chain composition","authors":"Juliver Gil-Herrera, J. F. Botero","doi":"10.1109/LATINCOM.2017.8240194","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240194","url":null,"abstract":"Network Functions Virtualization (NFV) is a new network paradigm that has been strongly promoted from both scientific community and telecom industry, where network functions (NFs) such as firewalls, load balancers, gateways among others, are virtualized, isolated from middleboxes and housed on one or more industry standard computing nodes. One of the main challenges for service providers when they try to deploy the NFV-based networks is to efficiently make use of substrate network resources to facilitate the design, delivery and operation of network services in a dynamic and scalable manner. This challenge is known as NFV Resource Allocation. Service Function Chain (SFC) composition is the first stage of the NFV Resource Allocation problem and we solve it in this paper. We formally define the service requests (VNFRs) in terms of NFs and propose a metaheuristic algorithm for solving the SFC composition stage. Our evaluation focuses primarily on minimizing the total bandwidth demanded by the constructed network service. The results show that our proposed approach is applicable to large and complex VNFRs and finds, in reasonable running times, close-to-optimal solutions with minimal bandwidth requirements.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960348","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240150
S. M. Sánchez, César A. Azurdia-Meza, R. Souza, E. Fernández, I. Soto, J. L. Rebelatto
Some of the future wireless networks are related to the provision of higher data rates and lower energy consumption. In contrast to the clear increasing spectrum demand, bandwidth is a limited resource. Cooperative diversity allows to increase the spectral efficiency and the reliability of the communication. However, in scenarios with high node density and high mobile data traffic volume the collaboration between multiple nodes can be a huge challenge. In this paper we focus on cognitive radio scenarios in which the users are only allowed to transmit with a limited power and have few opportunities to access the medium. Then, we propose an alternative non-cooperative transmission scheme based on coded redundant information through which users can automatically revert back, when cooperation is not possible. The results indicate that the proposed method outperforms direct transmission and simple repetition schemes, in terms of reliability, as well as spectral and energy efficiency.
{"title":"An alternative non-cooperative transmission scheme based on coded redundant information","authors":"S. M. Sánchez, César A. Azurdia-Meza, R. Souza, E. Fernández, I. Soto, J. L. Rebelatto","doi":"10.1109/LATINCOM.2017.8240150","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240150","url":null,"abstract":"Some of the future wireless networks are related to the provision of higher data rates and lower energy consumption. In contrast to the clear increasing spectrum demand, bandwidth is a limited resource. Cooperative diversity allows to increase the spectral efficiency and the reliability of the communication. However, in scenarios with high node density and high mobile data traffic volume the collaboration between multiple nodes can be a huge challenge. In this paper we focus on cognitive radio scenarios in which the users are only allowed to transmit with a limited power and have few opportunities to access the medium. Then, we propose an alternative non-cooperative transmission scheme based on coded redundant information through which users can automatically revert back, when cooperation is not possible. The results indicate that the proposed method outperforms direct transmission and simple repetition schemes, in terms of reliability, as well as spectral and energy efficiency.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128788737","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240145
J. M. Ruiz, C. Cárdenas, J. L. Muñoz-Tapia
This paper presents a practical methodology for designing, implementing and deploying IPv6 networks. We use a virtual lab to simulate topologies for different scenarios. These topologies are designed programmatically and then, tested for connectivity and efficiency. In particular, these scenarios include translation mechanisms such as DNS64 and NAT64, tunneling mechanisms such as 6to4 and 6RD and combinations of DHCPv6 and SLAAC for dynamic address assignation. Then, the lessons learned in the virtual scenarios are applied to a production scenario showing that it is possible to migrate to IPv6 without loosing functionality or having a negative performance impact.
{"title":"Implementation and testing of IPv6 transition mechanisms","authors":"J. M. Ruiz, C. Cárdenas, J. L. Muñoz-Tapia","doi":"10.1109/LATINCOM.2017.8240145","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240145","url":null,"abstract":"This paper presents a practical methodology for designing, implementing and deploying IPv6 networks. We use a virtual lab to simulate topologies for different scenarios. These topologies are designed programmatically and then, tested for connectivity and efficiency. In particular, these scenarios include translation mechanisms such as DNS64 and NAT64, tunneling mechanisms such as 6to4 and 6RD and combinations of DHCPv6 and SLAAC for dynamic address assignation. Then, the lessons learned in the virtual scenarios are applied to a production scenario showing that it is possible to migrate to IPv6 without loosing functionality or having a negative performance impact.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130385440","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240191
Vanessa Vasconcellos, Gustavo Cid Ornelas, A. Barreto
Wireless applications require the use of Power Amplifiers for signal transmission. Those are generally nonlinear devices, and there is a trade-off between efficiency and the signal distortion level, which degrades performance. Besides that, transmission waveforms suffer from spectral regrowth when non-linearities are present. Moreover, some power amplifiers also carry memory effects, which further contribute with unrepairable interferences. Here we investigate the performance of different candidate waveforms for 5G, namely, OFDM, FBMC and UFMC, in the presence of nonlinear devices, both with and without memory effects. It is also clear that to reduce the non-linear impairments, correction and compensation schemes are desired. Here, two possibilities are evaluated, the use of a digital predistortion structure, and of an iterative correction algorithm at the receiver.
{"title":"Performance of 5G candidate waveforms with non-linear power amplifiers","authors":"Vanessa Vasconcellos, Gustavo Cid Ornelas, A. Barreto","doi":"10.1109/LATINCOM.2017.8240191","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240191","url":null,"abstract":"Wireless applications require the use of Power Amplifiers for signal transmission. Those are generally nonlinear devices, and there is a trade-off between efficiency and the signal distortion level, which degrades performance. Besides that, transmission waveforms suffer from spectral regrowth when non-linearities are present. Moreover, some power amplifiers also carry memory effects, which further contribute with unrepairable interferences. Here we investigate the performance of different candidate waveforms for 5G, namely, OFDM, FBMC and UFMC, in the presence of nonlinear devices, both with and without memory effects. It is also clear that to reduce the non-linear impairments, correction and compensation schemes are desired. Here, two possibilities are evaluated, the use of a digital predistortion structure, and of an iterative correction algorithm at the receiver.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365493","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240176
L. C. Vieira, Juliana de Santi, Douglas do Amaral, Lucas Darian Schwendler Vieira, K. Fonseca
All-optical (transparent) wavelength-division multiplexing (WDM), a cost-effective and low power consumption solution for core transport networks, suffers from physical-layer impairments that accumulate along optical paths. In this context, it is important to find dynamic routing schemes with good performance that can consider the optical-layer constraints. In this paper, we propose the alternative least loaded under physical impairments (ALLPI) and the ALLPI with threshold (ALLPI-TH) algorithms. These are heuristic routing methods by which the lightpath requests that cannot be provisioned based on the shortest physical distance are established over least-loaded routes, provided that the selected lightpaths satisfy the impairment constraints (OSNR and PMD). Either dispersion-limited or noise-limited network scenarios were studied, for the bit rate of 40 Gbps. The results indicate that the ALLPI-type algorithms produce significantly lower blocking probabilities when compared to the reference algorithms, especially for a highly-connected network and at higher loads.
{"title":"Least-loaded-based routing with physical constraints in transparent optical networks","authors":"L. C. Vieira, Juliana de Santi, Douglas do Amaral, Lucas Darian Schwendler Vieira, K. Fonseca","doi":"10.1109/LATINCOM.2017.8240176","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240176","url":null,"abstract":"All-optical (transparent) wavelength-division multiplexing (WDM), a cost-effective and low power consumption solution for core transport networks, suffers from physical-layer impairments that accumulate along optical paths. In this context, it is important to find dynamic routing schemes with good performance that can consider the optical-layer constraints. In this paper, we propose the alternative least loaded under physical impairments (ALLPI) and the ALLPI with threshold (ALLPI-TH) algorithms. These are heuristic routing methods by which the lightpath requests that cannot be provisioned based on the shortest physical distance are established over least-loaded routes, provided that the selected lightpaths satisfy the impairment constraints (OSNR and PMD). Either dispersion-limited or noise-limited network scenarios were studied, for the bit rate of 40 Gbps. The results indicate that the ALLPI-type algorithms produce significantly lower blocking probabilities when compared to the reference algorithms, especially for a highly-connected network and at higher loads.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130843887","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240166
J. Minango, C. D. Almeida
Minimum mean square error (MMSE) linear detector has been considered as one of the potential detection algorithm for uplink multi-user massive MIMO systems, because it can achieve the near-optimal bit error rate (BER) performance. However, it involves matrix inversion with high complexity. Thus, the conventional Gauss-Seidel (GS) method has been applied for obtain a low-complexity MMSE detector without employing the computationally intensive matrix inversion. In this paper, we propose a refinement for the conventional GS method based on band matrix concept in order to accelerate the convergence rate, that means reduce the number of iterations and consequently the complexity, guaranteeing the near-optimal BER performance. Analytical and numerical results show the efficiency of the proposed method in comparison to the conventional GS method.
{"title":"Low-complexity MMSE detector based on refinement Gauss-Seidel method for massive MIMO systems","authors":"J. Minango, C. D. Almeida","doi":"10.1109/LATINCOM.2017.8240166","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240166","url":null,"abstract":"Minimum mean square error (MMSE) linear detector has been considered as one of the potential detection algorithm for uplink multi-user massive MIMO systems, because it can achieve the near-optimal bit error rate (BER) performance. However, it involves matrix inversion with high complexity. Thus, the conventional Gauss-Seidel (GS) method has been applied for obtain a low-complexity MMSE detector without employing the computationally intensive matrix inversion. In this paper, we propose a refinement for the conventional GS method based on band matrix concept in order to accelerate the convergence rate, that means reduce the number of iterations and consequently the complexity, guaranteeing the near-optimal BER performance. Analytical and numerical results show the efficiency of the proposed method in comparison to the conventional GS method.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043510","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 : 2017-11-01DOI: 10.1109/LATINCOM.2017.8240155
S. Sarmadi, Mingyang Li, S. Chellappan
In this paper, we address the issue of profiling users over the Internet using meta-data logs derived from network flow data (hence preserving a high degree of privacy). In this broader context, we specifically aim to empirically demonstrate that Internet volume and time of usage of humans do exhibit repeatable behavior over time. In our experimental study, Internet usage statistics of octets and duration (collected via privacy-preserving NetFlow records) of 66 student subjects in a college campus was recorded for a month. Subsequently, using state-of-the-art statistical techniques, we demonstrate how the Internet usage of any particular subject is highly-correlated with usage of the same subject over multiple time scales, while simultaneously being distinct from usage of other subjects. We derive interesting and practically useful trends on the relationship between the degree of distinguishability and the window time chosen to do the profiling. We also present discussions on the practical applications of this new study.
{"title":"On the feasibility of profiling internet users based on volume and time of usage","authors":"S. Sarmadi, Mingyang Li, S. Chellappan","doi":"10.1109/LATINCOM.2017.8240155","DOIUrl":"https://doi.org/10.1109/LATINCOM.2017.8240155","url":null,"abstract":"In this paper, we address the issue of profiling users over the Internet using meta-data logs derived from network flow data (hence preserving a high degree of privacy). In this broader context, we specifically aim to empirically demonstrate that Internet volume and time of usage of humans do exhibit repeatable behavior over time. In our experimental study, Internet usage statistics of octets and duration (collected via privacy-preserving NetFlow records) of 66 student subjects in a college campus was recorded for a month. Subsequently, using state-of-the-art statistical techniques, we demonstrate how the Internet usage of any particular subject is highly-correlated with usage of the same subject over multiple time scales, while simultaneously being distinct from usage of other subjects. We derive interesting and practically useful trends on the relationship between the degree of distinguishability and the window time chosen to do the profiling. We also present discussions on the practical applications of this new study.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428117","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
扫码关注我们
求助内容：
应助结果提醒方式：