Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945405
N. A. Aadhithan, Prashant K. Wali, D. Das
The exponentially increasing demand for higher data rates has pushed the mobile network operators and researchers to scout for ways to improve the system bandwidth, most notably by using the unlicensed band which already hosts long-standing technologies like Wi-Fi. Of late, some effort has gone into exploring the performance of Licensed-Assisted Access (LAA) which can boost the bandwidth of LTE by opportunistically anchoring a secondary carrier in the unlicensed band in addition to the primary licensed carrier. Duty-cycle based schemes are being looked at to fasttrack the commercial deployment of LAA, and falling along this line of thought, the current state of the art scheme in the literature proposes a proportionally fair duty-cycle based LAA scheme. In this work, we investigate the interesting question of whether a proportionally fair duty-cycle based LAA scheme affects the performance of Wi-Fi more than it should.
{"title":"Duty-cycle based licensed-assisted access: Does proportional fairness affect Wi-Fi more than it should?","authors":"N. A. Aadhithan, Prashant K. Wali, D. Das","doi":"10.1109/COMSNETS.2017.7945405","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945405","url":null,"abstract":"The exponentially increasing demand for higher data rates has pushed the mobile network operators and researchers to scout for ways to improve the system bandwidth, most notably by using the unlicensed band which already hosts long-standing technologies like Wi-Fi. Of late, some effort has gone into exploring the performance of Licensed-Assisted Access (LAA) which can boost the bandwidth of LTE by opportunistically anchoring a secondary carrier in the unlicensed band in addition to the primary licensed carrier. Duty-cycle based schemes are being looked at to fasttrack the commercial deployment of LAA, and falling along this line of thought, the current state of the art scheme in the literature proposes a proportionally fair duty-cycle based LAA scheme. In this work, we investigate the interesting question of whether a proportionally fair duty-cycle based LAA scheme affects the performance of Wi-Fi more than it should.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134429270","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945410
Amitrajit Sarkar, Srijan Chattopadhyay, Paramita Dey, Sarbani Roy
In today's world, social media is a powerful tool: spreading information, and changing the way we receive news. It often reaches faster and farther than any any other channel. The availability of large scale data on online social media motivates our questions on social behavior in spreading information on the network. We conduct extensive experiments on Twitter data, to determine how important some people are in spreading information to the world. The Twitter data used in this study is stored on an HDFS and manipulated using algorithms framed in the MapReduce paradigm of Hadoop. An information flow network is generated from the Twitter data (81540798 tweets) based on the hashtags #Brexit, #Euro and #Rio. We study the effectiveness of K-core and PageRank algorithms in identifying important seeds in social networks, by comparing their outputs against the true seeds obtained from the two-phase algorithm. K-core performs better by most similarity indices, when compared to PageRank.
{"title":"The importance of seed nodes in spreading information in social networks: A case study","authors":"Amitrajit Sarkar, Srijan Chattopadhyay, Paramita Dey, Sarbani Roy","doi":"10.1109/COMSNETS.2017.7945410","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945410","url":null,"abstract":"In today's world, social media is a powerful tool: spreading information, and changing the way we receive news. It often reaches faster and farther than any any other channel. The availability of large scale data on online social media motivates our questions on social behavior in spreading information on the network. We conduct extensive experiments on Twitter data, to determine how important some people are in spreading information to the world. The Twitter data used in this study is stored on an HDFS and manipulated using algorithms framed in the MapReduce paradigm of Hadoop. An information flow network is generated from the Twitter data (81540798 tweets) based on the hashtags #Brexit, #Euro and #Rio. We study the effectiveness of K-core and PageRank algorithms in identifying important seeds in social networks, by comparing their outputs against the true seeds obtained from the two-phase algorithm. K-core performs better by most similarity indices, when compared to PageRank.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"719 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132709843","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945443
Mithileysh Sathiyanarayanan, S. Rajan
Since early 2000 there is a constant need to build a strong healthcare innovation engine to allow researchers from multi-disciplinary field to develop innovative products in the healthcare sector. Many western countries have adopted the use of innovative products in the form of mobile/web technologies and wearable devices to improve their healthcare system. Interestingly, a wearable device called MYO Armband is being adopted in the physiotherapy treatment and few studies show doctors and patients are interested in using the device but due to MYO's cumbersome nature, we decided to consider non-wearable device(s) for the treatment. Recently, we identified a touchless device (non-wearable) called “Leap Motion”, which is used for gaming systems and controlling applications in mobiles and computers. A sudden spark made us think the Leap Motion could be used in the physiotherapy treatment and we also, spotted interesting web applications which could potentially be used along with the device. We conducted workshops with the UK and Indian doctors and common people to understand the Leap Motion's use in physiotherapy and set some guidelines in using the device. Though the methodology of using workshops and survey responses collected to analyze is not the strongest of research methodologies, we tried to generalize the outcomes and recommendations, and the stimulating discussions with the doctors and practitioners helped us address ten-points to improve the healthcare system in India.
{"title":"Understanding the use of leap motion touchless device in physiotherapy and improving the healthcare system in India","authors":"Mithileysh Sathiyanarayanan, S. Rajan","doi":"10.1109/COMSNETS.2017.7945443","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945443","url":null,"abstract":"Since early 2000 there is a constant need to build a strong healthcare innovation engine to allow researchers from multi-disciplinary field to develop innovative products in the healthcare sector. Many western countries have adopted the use of innovative products in the form of mobile/web technologies and wearable devices to improve their healthcare system. Interestingly, a wearable device called MYO Armband is being adopted in the physiotherapy treatment and few studies show doctors and patients are interested in using the device but due to MYO's cumbersome nature, we decided to consider non-wearable device(s) for the treatment. Recently, we identified a touchless device (non-wearable) called “Leap Motion”, which is used for gaming systems and controlling applications in mobiles and computers. A sudden spark made us think the Leap Motion could be used in the physiotherapy treatment and we also, spotted interesting web applications which could potentially be used along with the device. We conducted workshops with the UK and Indian doctors and common people to understand the Leap Motion's use in physiotherapy and set some guidelines in using the device. Though the methodology of using workshops and survey responses collected to analyze is not the strongest of research methodologies, we tried to generalize the outcomes and recommendations, and the stimulating discussions with the doctors and practitioners helped us address ten-points to improve the healthcare system in India.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960632","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945389
Akanksha Patel, S. Vishwanathan, B. Raman
The use of unused TV white space spectrum has been a topic of research in the recent past. In this paper, we focus on the situation in parts of the world such as India, where this spectrum is largely unused. We explore a framework where the spectrum can be efficiently used to provide broadband access in a multi-operator scenario. Specifically, we formulate and address limited colors weighted graph multi-coloring (LCWGMC) problem, to model the dynamic channel allocation requirement in such settings. Subsequent to showing that the LCWGMC problem is NP-hard, we formulate an ILP to solve it optimally. We then propose algorithms to solve LCWGMC optimally in two restricted scenarios. These then guide us to propose heuristics to solve LCWGMC. We show through evaluation that one of our heuristics (termed minIE) performs near-optimal in a variety of scenarios.
{"title":"Multi-channel allocation to coexisting networks in TV white spaces","authors":"Akanksha Patel, S. Vishwanathan, B. Raman","doi":"10.1109/COMSNETS.2017.7945389","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945389","url":null,"abstract":"The use of unused TV white space spectrum has been a topic of research in the recent past. In this paper, we focus on the situation in parts of the world such as India, where this spectrum is largely unused. We explore a framework where the spectrum can be efficiently used to provide broadband access in a multi-operator scenario. Specifically, we formulate and address limited colors weighted graph multi-coloring (LCWGMC) problem, to model the dynamic channel allocation requirement in such settings. Subsequent to showing that the LCWGMC problem is NP-hard, we formulate an ILP to solve it optimally. We then propose algorithms to solve LCWGMC optimally in two restricted scenarios. These then guide us to propose heuristics to solve LCWGMC. We show through evaluation that one of our heuristics (termed minIE) performs near-optimal in a variety of scenarios.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130764636","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}
Swearing is a prevalent phenomenon, in regular conversations as well as on social media. Whether multilinguals have a preference for a language while swearing and if so, what factors influence it, is an interesting question that has intrigued linguists, but large scale studies of multilingual swearing behavior has been impossible due to unavailability of data. In this study with English and Romanized Hindi tweets from multilingual Indian users, for the first time, we show that indeed when people code-switch, there is a strong preference for swearing in the dominant language, i.e. Hindi in this case. We also study the correlations between topic, gender and language preferences while swearing.
{"title":"I may talk in English but gaali toh Hindi mein hi denge : A study of English-Hindi code-switching and swearing pattern on social networks","authors":"Prabhat Agarwal, Ashish Sharma, Jeenu Grover, Mayank Sikka, Koustav Rudra, M. Choudhury","doi":"10.1109/COMSNETS.2017.7945452","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945452","url":null,"abstract":"Swearing is a prevalent phenomenon, in regular conversations as well as on social media. Whether multilinguals have a preference for a language while swearing and if so, what factors influence it, is an interesting question that has intrigued linguists, but large scale studies of multilingual swearing behavior has been impossible due to unavailability of data. In this study with English and Romanized Hindi tweets from multilingual Indian users, for the first time, we show that indeed when people code-switch, there is a strong preference for swearing in the dominant language, i.e. Hindi in this case. We also study the correlations between topic, gender and language preferences while swearing.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132009236","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945362
Eeva Terkki, Ashwin Rao, S. Tarkoma
Targeted ads are a vital source of revenue for ad networks, and ad networks compile detailed profiles of users for targeting purposes. This wealth of private information can motivate an attacker to spy on a victim by sampling the victim's information available at the ad networks. In this paper, we explore the possibility to spy on an Android user by requesting ads targeted at that user. During our controlled experiments, an attacker was able to remotely request and receive mobile ads using a leaked identifier belonging to their victim. The lack of targeted ads from some of the studied ad networks, which we believe to be partly caused by our geographical location, restricts us from drawing strong conclusions on the success of such an attack. However, we believe that our methodology can be used to perform similar experiments to explore the success in spying on Android users through targeted ads.
{"title":"Spying on Android users through targeted ads","authors":"Eeva Terkki, Ashwin Rao, S. Tarkoma","doi":"10.1109/COMSNETS.2017.7945362","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945362","url":null,"abstract":"Targeted ads are a vital source of revenue for ad networks, and ad networks compile detailed profiles of users for targeting purposes. This wealth of private information can motivate an attacker to spy on a victim by sampling the victim's information available at the ad networks. In this paper, we explore the possibility to spy on an Android user by requesting ads targeted at that user. During our controlled experiments, an attacker was able to remotely request and receive mobile ads using a leaked identifier belonging to their victim. The lack of targeted ads from some of the studied ad networks, which we believe to be partly caused by our geographical location, restricts us from drawing strong conclusions on the success of such an attack. However, we believe that our methodology can be used to perform similar experiments to explore the success in spying on Android users through targeted ads.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133582363","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945463
Abhijit Mondal, S. Bhattacharjee
Internet of Things (IoT) connects a large volume of devices together, via different modes of wired and wireless communication interfaces. The existing transport layer protocols, like TCP and UDP as well as their variants, lack functionality to handle the diverge and heterogeneous communication standards while ensuring the IoT transport requirements like short-lived packet or message transfer, short duration real-time flow transfer with guaranteed delay, ensuring message reliability etc. In this work, we develop a reliable, connection-oriented, multi-path, IP-independent transport layer protocol to handle IoT requirements. This protocol is able to use all the available network interfaces in a multi-homed mobile IoT device. It can also provide seamless connection between server-client even if devices change its underlying IP network.
{"title":"A reliable, multi-path, connection oriented and independent transport protocol for IoT networks","authors":"Abhijit Mondal, S. Bhattacharjee","doi":"10.1109/COMSNETS.2017.7945463","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945463","url":null,"abstract":"Internet of Things (IoT) connects a large volume of devices together, via different modes of wired and wireless communication interfaces. The existing transport layer protocols, like TCP and UDP as well as their variants, lack functionality to handle the diverge and heterogeneous communication standards while ensuring the IoT transport requirements like short-lived packet or message transfer, short duration real-time flow transfer with guaranteed delay, ensuring message reliability etc. In this work, we develop a reliable, connection-oriented, multi-path, IP-independent transport layer protocol to handle IoT requirements. This protocol is able to use all the available network interfaces in a multi-homed mobile IoT device. It can also provide seamless connection between server-client even if devices change its underlying IP network.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130262342","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945423
S. Kumar, R. Knopp, N. Nikaein, Debashisha Mishra, T. B. Reddy, A. Franklin, K. Kuchi, Rohit Gupta
In this demo, we describe the realization of cloud radio access network (C-RAN) prototype using OpenAirInterface (OAI) software and commodity hardware. The deployment of the centralized baseband processing on the remote cloud center (RCC), and the remote radio units (RRU), connected over Ethernet fronthaul is demonstrated. Further, the demo illustrates the flexibility in deploying several cellular radio access network protocol split architectures using OAI.
{"title":"FLEXCRAN: Cloud radio access network prototype using OpenAirInterface","authors":"S. Kumar, R. Knopp, N. Nikaein, Debashisha Mishra, T. B. Reddy, A. Franklin, K. Kuchi, Rohit Gupta","doi":"10.1109/COMSNETS.2017.7945423","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945423","url":null,"abstract":"In this demo, we describe the realization of cloud radio access network (C-RAN) prototype using OpenAirInterface (OAI) software and commodity hardware. The deployment of the centralized baseband processing on the remote cloud center (RCC), and the remote radio units (RRU), connected over Ethernet fronthaul is demonstrated. Further, the demo illustrates the flexibility in deploying several cellular radio access network protocol split architectures using OAI.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"45 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113989386","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945401
Moumita Samanta, P. Pal, A. Mukherjee
Leakage of personal information is a problem with free usage of social networks. In the face of enhanced connectivity reaching out to friends of friends, it is becoming increasingly difficult to prevent unwanted users from seeing personal posts. Various automated means of abatement measures are being taken in this regard and the present work is an attempt in that direction. Conventionally, the trust value between two mutual friends is computed based on attribute matching among them. In this work, the trust is computed by blending with the degree of the target nodes to arrive at a modified trust metric based on the viewer-ship decision which is taken by user. It is explored that as the emphasis of the blending factor shifts from the conventional trust towards the degree factor, the uncertainty in trust values increases while the viewer count of a post keeps reducing simultaneously. It is proposed that the blending factor may be tuned at the crossover point in order to suit the needs of the user in these two respects. Detailed testing and statistical analysis of proposed scheme has been conducted on representative data of Facebook available in public domain.
{"title":"Prevention of information leakage by modulating the trust uncertainty in Ego-Network","authors":"Moumita Samanta, P. Pal, A. Mukherjee","doi":"10.1109/COMSNETS.2017.7945401","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945401","url":null,"abstract":"Leakage of personal information is a problem with free usage of social networks. In the face of enhanced connectivity reaching out to friends of friends, it is becoming increasingly difficult to prevent unwanted users from seeing personal posts. Various automated means of abatement measures are being taken in this regard and the present work is an attempt in that direction. Conventionally, the trust value between two mutual friends is computed based on attribute matching among them. In this work, the trust is computed by blending with the degree of the target nodes to arrive at a modified trust metric based on the viewer-ship decision which is taken by user. It is explored that as the emphasis of the blending factor shifts from the conventional trust towards the degree factor, the uncertainty in trust values increases while the viewer count of a post keeps reducing simultaneously. It is proposed that the blending factor may be tuned at the crossover point in order to suit the needs of the user in these two respects. Detailed testing and statistical analysis of proposed scheme has been conducted on representative data of Facebook available in public domain.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116451750","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945407
Rui Wang, Faezeh Hajiaghajani, S. Biswas
This work develops a cooperative content caching framework for Social Wireless Networks (SWNETs) in which content demands are hierarchically heterogeneous. The heterogeneous request model incorporates user preference for different categories/genres, and contents under each category, both following power law distributions at local as well as global levels. Based upon such request generation model, an optimal Heterogeneous Split Caching (HSC) algorithm is proposed which can minimize electronic content provisioning cost using cooperative caching policies. Detailed simulation experiments for functional validation and performance evaluation with respect to traditional caching strategies are then performed under various protocol and network parameters. The baseline HSC mechanism is also tested against a special benchmark situation that provides a steady state performance bound, which can occur after an infinite request horizon.
{"title":"Heterogeneous content caching in wireless networks","authors":"Rui Wang, Faezeh Hajiaghajani, S. Biswas","doi":"10.1109/COMSNETS.2017.7945407","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945407","url":null,"abstract":"This work develops a cooperative content caching framework for Social Wireless Networks (SWNETs) in which content demands are hierarchically heterogeneous. The heterogeneous request model incorporates user preference for different categories/genres, and contents under each category, both following power law distributions at local as well as global levels. Based upon such request generation model, an optimal Heterogeneous Split Caching (HSC) algorithm is proposed which can minimize electronic content provisioning cost using cooperative caching policies. Detailed simulation experiments for functional validation and performance evaluation with respect to traditional caching strategies are then performed under various protocol and network parameters. The baseline HSC mechanism is also tested against a special benchmark situation that provides a steady state performance bound, which can occur after an infinite request horizon.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128283456","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
扫码关注我们
求助内容：
应助结果提醒方式：