Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412382
S. Park, J. Kwak, B. Lee
Communication services based on wireless data, such as Social Network Service (SNS) and Mobile Instant Messenger (MIM), developed rapidly with the advent of communication networks and smartphones. As SNS and MIM gradually replace voice and Short Message Service (SMS) communication, the revenue structures of mobile carriers also change into data. Although mobile carriers are still measuring their revenues using voice-based indices such as Average Revenue Per User (ARPU). The use of accurate indices and measurement is important, since revenue measurement determines the future developmental direction of businesses and industries. Therefore, this study analyzes changes in revenue sources in this age of data, the utility of ARPU, and the standards for data-based revenue calculations. The analysis shows that the utility of ARPU is very low, since it cannot reflect the growth of data services and the existence of multiple subscribers. Also, it was identified that services and subscribers should be redefined in consideration of data revenues. The results of the study propose measurement factors considering data-based revenue, which could be referred as standards for measuring diverse revenues.
{"title":"Is ARPU1; the right choice for wireless data-based communication services?","authors":"S. Park, J. Kwak, B. Lee","doi":"10.1109/CASoN.2012.6412382","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412382","url":null,"abstract":"Communication services based on wireless data, such as Social Network Service (SNS) and Mobile Instant Messenger (MIM), developed rapidly with the advent of communication networks and smartphones. As SNS and MIM gradually replace voice and Short Message Service (SMS) communication, the revenue structures of mobile carriers also change into data. Although mobile carriers are still measuring their revenues using voice-based indices such as Average Revenue Per User (ARPU). The use of accurate indices and measurement is important, since revenue measurement determines the future developmental direction of businesses and industries. Therefore, this study analyzes changes in revenue sources in this age of data, the utility of ARPU, and the standards for data-based revenue calculations. The analysis shows that the utility of ARPU is very low, since it cannot reflect the growth of data services and the existence of multiple subscribers. Also, it was identified that services and subscribers should be redefined in consideration of data revenues. The results of the study propose measurement factors considering data-based revenue, which could be referred as standards for measuring diverse revenues.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132766041","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412385
Atta-ur-Rahman
In this paper, performance of Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Multi-level codes. MIDA is a hard decision decoder that was initially proposed for decoding of Product codes, by same authors. In this paper same concept is being extended for Multi-level codes. The basic iterative decoder has a huge complexity which is unaffordable for long constituent codes especially when used in real time systems. In MIDA, the idea of Syndrome Decoding is used for search space reduction. Moreover, it is found that complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of basic algorithm but in average case there is huge reduction in complexity, with negligible performance degradation. Performance of the proposed algorithm is investigated over an OFDM system. Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel are used for simulations.
{"title":"Performance of Modified Iterative Decoding Algorithm for Multilevel codes","authors":"Atta-ur-Rahman","doi":"10.1109/CASoN.2012.6412385","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412385","url":null,"abstract":"In this paper, performance of Modified Iterative Decoding Algorithm (MIDA) is investigated for decoding of Multi-level codes. MIDA is a hard decision decoder that was initially proposed for decoding of Product codes, by same authors. In this paper same concept is being extended for Multi-level codes. The basic iterative decoder has a huge complexity which is unaffordable for long constituent codes especially when used in real time systems. In MIDA, the idea of Syndrome Decoding is used for search space reduction. Moreover, it is found that complexity reduction factor increases with each iteration. The worst case complexity of MIDA is closed to that of basic algorithm but in average case there is huge reduction in complexity, with negligible performance degradation. Performance of the proposed algorithm is investigated over an OFDM system. Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel are used for simulations.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920602","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412396
Lisa Ziemer, Tina Stahlschmidt, Norbert Kuhn
Recently, more and more German universities have decided to pursue an active marketing strategy for student recruitment. Given the fact that the target group of these marketing efforts, i.e. potential students, belong to the generation of so-called "digital natives“, it seems indisputable that the integration of social media channels in academic marketing campaigns is indispensable. German institutions of higher education have increasingly been acknowledging this trend by creating official profiles on Twitter, Facebook, and YouTube or by hosting a blog. Looking at this process from a longterm perspective, this should be considered as a first phase. As online activities are becoming more professional and habitual, a second phase has to be initiated: monitoring and evaluation. In this paper we present the results of the evaluation of a university social media marketing campaign, namely the campaign of our university, which was launched in May 2011. Now, seven months later we carried out a survey among new students to evaluate their acceptance, feedback and interaction. In this paper we discuss how the use and requirements of participants have changed over just a few months, as well as how different platforms serve different needs and target groups. In addition, we will argue that continuous monitoring and analysis of social media activities and usage is essential when carrying out successful academic marketing.
{"title":"Social media in the context of academic marketing: Case study: Evaluation of the Umwelt-Campus campaign","authors":"Lisa Ziemer, Tina Stahlschmidt, Norbert Kuhn","doi":"10.1109/CASoN.2012.6412396","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412396","url":null,"abstract":"Recently, more and more German universities have decided to pursue an active marketing strategy for student recruitment. Given the fact that the target group of these marketing efforts, i.e. potential students, belong to the generation of so-called \"digital natives“, it seems indisputable that the integration of social media channels in academic marketing campaigns is indispensable. German institutions of higher education have increasingly been acknowledging this trend by creating official profiles on Twitter, Facebook, and YouTube or by hosting a blog. Looking at this process from a longterm perspective, this should be considered as a first phase. As online activities are becoming more professional and habitual, a second phase has to be initiated: monitoring and evaluation. In this paper we present the results of the evaluation of a university social media marketing campaign, namely the campaign of our university, which was launched in May 2011. Now, seven months later we carried out a survey among new students to evaluate their acceptance, feedback and interaction. In this paper we discuss how the use and requirements of participants have changed over just a few months, as well as how different platforms serve different needs and target groups. In addition, we will argue that continuous monitoring and analysis of social media activities and usage is essential when carrying out successful academic marketing.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125918479","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412417
E. Sorio, Alberto Bartoli, Eric Medvet
Preventing illegitimate modifications to web sites offering a public service is a fundamental requirement of any e-government initiative. Unfortunately, attacks to web sites resulting in the creation of fraudulent content by hackers are ubiquitous. In this work we attempted to assess the ability of Italian public administrations to be in full control of the respective web sites. We examined several thousands sites, including all local governments and universities, and found that approximately 1.5% of the analyzed sites serves contents that admittedly is not supposed to be there. Although these contents do not constitute an immediate threat to citizens, this result does not seem very encouraging also because our methodology leads to very conservative estimates. We believe that our analysis allows gaining useful insights into this novel and peculiar threat.
{"title":"A look at hidden web pages in Italian public administrations","authors":"E. Sorio, Alberto Bartoli, Eric Medvet","doi":"10.1109/CASoN.2012.6412417","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412417","url":null,"abstract":"Preventing illegitimate modifications to web sites offering a public service is a fundamental requirement of any e-government initiative. Unfortunately, attacks to web sites resulting in the creation of fraudulent content by hackers are ubiquitous. In this work we attempted to assess the ability of Italian public administrations to be in full control of the respective web sites. We examined several thousands sites, including all local governments and universities, and found that approximately 1.5% of the analyzed sites serves contents that admittedly is not supposed to be there. Although these contents do not constitute an immediate threat to citizens, this result does not seem very encouraging also because our methodology leads to very conservative estimates. We believe that our analysis allows gaining useful insights into this novel and peculiar threat.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746368","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412409
R. Lundin, S. Lindskog
Selective encryption is a concept in which the main goal is to reduce computational cost while providing confidentiality by encrypting only chosen parts of the information to be protected. Previous work on selective encryption has mainly been aimed towards multimedia applications in order to reduce the overhead induced by encryption while still making the information perceptually secure to a desired protection level. This was accomplished by utilizing the fact that different parts of the information have different impacts on our perception senses, i.e., eyes and ears. How computationally secure the information is when using selective encryption has however only briefly been mentioned or rudimentarily analyzed. In this paper, we therefore investigate the security implications of selective encryption by generalizing the work on entropy of selectively encrypted strings to several dimensions and applying it to bitmap images. The generalization is done by constructing information neighborhoods that capture and model information dependencies in several dimensions.
{"title":"An investigation of entropy of selectively encrypted bitmap images","authors":"R. Lundin, S. Lindskog","doi":"10.1109/CASoN.2012.6412409","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412409","url":null,"abstract":"Selective encryption is a concept in which the main goal is to reduce computational cost while providing confidentiality by encrypting only chosen parts of the information to be protected. Previous work on selective encryption has mainly been aimed towards multimedia applications in order to reduce the overhead induced by encryption while still making the information perceptually secure to a desired protection level. This was accomplished by utilizing the fact that different parts of the information have different impacts on our perception senses, i.e., eyes and ears. How computationally secure the information is when using selective encryption has however only briefly been mentioned or rudimentarily analyzed. In this paper, we therefore investigate the security implications of selective encryption by generalizing the work on entropy of selectively encrypted strings to several dimensions and applying it to bitmap images. The generalization is done by constructing information neighborhoods that capture and model information dependencies in several dimensions.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123141371","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412420
Sanchika Gupta, Padam Kumar, A. Sardana, A. Abraham
Cloud Computing envisioned as the next generation architecture for IT enterprises, has proliferated itself due to the advantages it provides. Cloud Computing provides solutions for carrying out efficient, scalable and low cost computing. Due to the distributed nature of cloud based system, it is vulnerable to a large category of attacks out of which VM based attacks are most common. To counter these attacks we need Intrusion Detection System (IDS), which is used to monitor network traffic and policy violations from unauthorized users. Anomaly Detection is a technique of Intrusion Detection, which is used to detect intrusions by monitoring system activity and finding out patterns that do not comply with the normal behavior. In this paper an approach for anomaly detection in cloud environment is presented, which is based upon analysis of system call sequences generated by the virtual machines to the hypervisor. Our proposed implementation prevents malicious VM users to modify well known frequently executed programs.
{"title":"A fingerprinting system calls approach for intrusion detection in a cloud environment","authors":"Sanchika Gupta, Padam Kumar, A. Sardana, A. Abraham","doi":"10.1109/CASoN.2012.6412420","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412420","url":null,"abstract":"Cloud Computing envisioned as the next generation architecture for IT enterprises, has proliferated itself due to the advantages it provides. Cloud Computing provides solutions for carrying out efficient, scalable and low cost computing. Due to the distributed nature of cloud based system, it is vulnerable to a large category of attacks out of which VM based attacks are most common. To counter these attacks we need Intrusion Detection System (IDS), which is used to monitor network traffic and policy violations from unauthorized users. Anomaly Detection is a technique of Intrusion Detection, which is used to detect intrusions by monitoring system activity and finding out patterns that do not comply with the normal behavior. In this paper an approach for anomaly detection in cloud environment is presented, which is based upon analysis of system call sequences generated by the virtual machines to the hypervisor. Our proposed implementation prevents malicious VM users to modify well known frequently executed programs.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127737216","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412430
S. K. Malik, S. Rizvi
As we are aware that for fulfilling the dream of an intelligent web, an Ontology may act as a backbone and it's significance may not be denied for realizing the vision of semantic web to add semantics or computer understandable data to the existing human readable web inorder to facilitate a more efficient knowledge use or reuse on a sharable basis on web. It means that Ontology enables to structure and conceptualize the shared knowledge of a particular domain on web but the major challenging problem is the huge decentralized nature of web which does not permit to have a single large ontology but left with the possibility of having several smaller ontologies which are difficult to implement and manage. Now, Ontology has several critical aspects where Ontology design and development is one of the fundamental key issues which may be best realized with the help of a case study. In this paper, a case study of a “Sports Complex Ontology” is presented using ontology editor SWOOP 2.3 Beta 4 presenting Ontology Statistics with some results or observations. What makes it different from others is it's key aspects which include: design criteria pictorial representation along with the key steps and it's relevance with research issues like Semantic Search patterns based on "Structure", the details being out of scope of this paper.
{"title":"Ontology design towards web intelligence: A Sports Complex Ontology case study","authors":"S. K. Malik, S. Rizvi","doi":"10.1109/CASoN.2012.6412430","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412430","url":null,"abstract":"As we are aware that for fulfilling the dream of an intelligent web, an Ontology may act as a backbone and it's significance may not be denied for realizing the vision of semantic web to add semantics or computer understandable data to the existing human readable web inorder to facilitate a more efficient knowledge use or reuse on a sharable basis on web. It means that Ontology enables to structure and conceptualize the shared knowledge of a particular domain on web but the major challenging problem is the huge decentralized nature of web which does not permit to have a single large ontology but left with the possibility of having several smaller ontologies which are difficult to implement and manage. Now, Ontology has several critical aspects where Ontology design and development is one of the fundamental key issues which may be best realized with the help of a case study. In this paper, a case study of a “Sports Complex Ontology” is presented using ontology editor SWOOP 2.3 Beta 4 presenting Ontology Statistics with some results or observations. What makes it different from others is it's key aspects which include: design criteria pictorial representation along with the key steps and it's relevance with research issues like Semantic Search patterns based on \"Structure\", the details being out of scope of this paper.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769229","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412384
M. Radvanský, M. Kudelka, V. Snás̃el
This paper introduces a method for head expert identification in a social network based on local community detection and formal concept analysis. There are several methods for expert identification, but most of these methods try to find an expert for a particular area. In this paper, we propose a novel approach to identify a head expert. This person is in the background and most of the time he is working across different areas of research, and he can establish teams of experts for particular areas.
{"title":"Detection of head experts in social network","authors":"M. Radvanský, M. Kudelka, V. Snás̃el","doi":"10.1109/CASoN.2012.6412384","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412384","url":null,"abstract":"This paper introduces a method for head expert identification in a social network based on local community detection and formal concept analysis. There are several methods for expert identification, but most of these methods try to find an expert for a particular area. In this paper, we propose a novel approach to identify a head expert. This person is in the background and most of the time he is working across different areas of research, and he can establish teams of experts for particular areas.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125512589","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412393
R. Wigand, Nitin Agarwal, O. I. Osesina, W. Hering, M. Korsgaard, A. Picot, Marcus A. Drescher
Measuring an individual's potential to accomplish a goal has key implications in organizational studies, behavioral analysis, business and management among other areas. This relative potential, which is dependent on a myriad of factors, e.g., experience, resource management, cooperation, etc., could shape the individual's performance, motivation, leadership, and likely success. The increasing prevalence of virtual organizations provides unique challenges and opportunities to study complex research questions via convenient data collection. In this NSF-funded research, we introduce a multi-factor dynamic model to estimate the potential of an individual to accomplish a goal in a virtual organization. We analyze data from a Massive Multi-player Online Role-Playing Game (MMORPG), Travian, collected in a controlled environment for over 3.5 months. The data contains activities of 7,406 players, including, players' profiles, daily snapshots of individual and alliance attributes, amount of gold, military strength, trades and cooperation, diplomacy status as well as a 2.3 million-message graph. We model players' potential to survive as a multi-factor function derived from the data attributes, including SNA-based network measures from the message graph. The model predicts a player's potential to win the game or to achieve a specified goal. The target is to identify the influence of network behavior for the player, and how network statistics for each player influence the accuracy of the prediction.
{"title":"Social network indices as performance predictors in a virtual organization","authors":"R. Wigand, Nitin Agarwal, O. I. Osesina, W. Hering, M. Korsgaard, A. Picot, Marcus A. Drescher","doi":"10.1109/CASoN.2012.6412393","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412393","url":null,"abstract":"Measuring an individual's potential to accomplish a goal has key implications in organizational studies, behavioral analysis, business and management among other areas. This relative potential, which is dependent on a myriad of factors, e.g., experience, resource management, cooperation, etc., could shape the individual's performance, motivation, leadership, and likely success. The increasing prevalence of virtual organizations provides unique challenges and opportunities to study complex research questions via convenient data collection. In this NSF-funded research, we introduce a multi-factor dynamic model to estimate the potential of an individual to accomplish a goal in a virtual organization. We analyze data from a Massive Multi-player Online Role-Playing Game (MMORPG), Travian, collected in a controlled environment for over 3.5 months. The data contains activities of 7,406 players, including, players' profiles, daily snapshots of individual and alliance attributes, amount of gold, military strength, trades and cooperation, diplomacy status as well as a 2.3 million-message graph. We model players' potential to survive as a multi-factor function derived from the data attributes, including SNA-based network measures from the message graph. The model predicts a player's potential to win the game or to achieve a specified goal. The target is to identify the influence of network behavior for the player, and how network statistics for each player influence the accuracy of the prediction.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"24 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129260058","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 : 2012-11-01DOI: 10.1109/CASoN.2012.6412398
Dherik Barison, R. Miani, B. Zarpelão, G. D. Breda, L. Mendes
The purpose of this work is to evaluate the quality of encrypted VoIP calls with different encryption algorithms through OpenVPN software, in order to identify differences in results between encryption algorithms and also differences between non-encrypted and encrypted calls. This evaluation will take into account the MOS (Mean Opinion Score), a method to indicate user satisfaction of voice communication quality. The encrypted VoIP calls will occur in different network scenarios that present different network bandwidths and different problems, like packet loss, out-of-order packets, and delay.
{"title":"Evaluation of quality in encrypted VoIP calls","authors":"Dherik Barison, R. Miani, B. Zarpelão, G. D. Breda, L. Mendes","doi":"10.1109/CASoN.2012.6412398","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412398","url":null,"abstract":"The purpose of this work is to evaluate the quality of encrypted VoIP calls with different encryption algorithms through OpenVPN software, in order to identify differences in results between encryption algorithms and also differences between non-encrypted and encrypted calls. This evaluation will take into account the MOS (Mean Opinion Score), a method to indicate user satisfaction of voice communication quality. The encrypted VoIP calls will occur in different network scenarios that present different network bandwidths and different problems, like packet loss, out-of-order packets, and delay.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128615726","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
扫码关注我们
求助内容：
应助结果提醒方式：