Pub Date : 2016-06-27DOI: 10.1109/ISCC.2016.7543817
Raisa O. C. Hirafuji, A. R. Dhaini, Denis A. Khotimsky, Divanilson R. Campelo
Energy efficiency has become a salient element in the design and operation of modern telecommunications networks. To support energy efficiency in passive optical network (PON) systems, the ITU-T has recently standardized a new power management technique, namely the Watchful Sleep mode, which unifies the two previously standardized techniques (i.e., Doze and Cyclic Sleep modes). The new mode can emulate each of the Doze and Cyclic modes, and it outperforms them in terms of energy efficiency and reduced network signaling. In this paper, we present the first analytical model for numerically measure the performance of the Watchful Sleep mode. Specifically, the new model estimates the ONU's energy efficiency under different network scenarios given a set of quality-of-service constraints. To validate our model, we perform comparisons with simulation results. These comparisons demonstrate that the proposed model can accurately capture the energy efficiency of PON systems.
{"title":"Energy efficiency analysis of the Watchful Sleep mode in next-generation passive optical networks","authors":"Raisa O. C. Hirafuji, A. R. Dhaini, Denis A. Khotimsky, Divanilson R. Campelo","doi":"10.1109/ISCC.2016.7543817","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543817","url":null,"abstract":"Energy efficiency has become a salient element in the design and operation of modern telecommunications networks. To support energy efficiency in passive optical network (PON) systems, the ITU-T has recently standardized a new power management technique, namely the Watchful Sleep mode, which unifies the two previously standardized techniques (i.e., Doze and Cyclic Sleep modes). The new mode can emulate each of the Doze and Cyclic modes, and it outperforms them in terms of energy efficiency and reduced network signaling. In this paper, we present the first analytical model for numerically measure the performance of the Watchful Sleep mode. Specifically, the new model estimates the ONU's energy efficiency under different network scenarios given a set of quality-of-service constraints. To validate our model, we perform comparisons with simulation results. These comparisons demonstrate that the proposed model can accurately capture the energy efficiency of PON systems.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126838626","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-06-27DOI: 10.1109/ISCC.2016.7543707
M. Mandava, C. Lubamba, Adiel Ismail, A. Bagula, H. Bagula
The recent advances in sensor/actuator and RFID technologies have spun out a new healthcare model enabling capture and dissemination of patient vital signs over the Internet for ubiquitous monitoring of these patients anytime and from anywhere. This provides new opportunities for enhancing healthcare through participatory consultation, medical diagnosis and many other novel healthcare services. Some of the advantages of this emerging technology referred to in this paper as “Cyber-healthcare” includes low acquisition cost, flexible deployment and improved accuracy resulting from replacing manual operations by fully digitized processes. It is expected that the emerging healthcare technology will change the way healthcare is delivered in both rural and urban settings of the developing world by building upon this technology to leapfrog from poorly prepared to medically equipped environments capable of tackling some of the most challenging medical issues of the developing world such as patients' vital signs capture, patient prioritization and preparedness to virus outbreaks such as Ebola. This paper proposes a Cyber-healthcare system as a first step towards the implementation of least cost digital health systems in the developing countries. We assess the field readiness of the off-the-shelf sensor technology used by the system and evaluate the performance of its underlying patient prioritization module using two machine learning algorithms: 1) multivariate linear regression and 2) support vector machine.
{"title":"Cyber-healthcare for public healthcare in the developing world","authors":"M. Mandava, C. Lubamba, Adiel Ismail, A. Bagula, H. Bagula","doi":"10.1109/ISCC.2016.7543707","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543707","url":null,"abstract":"The recent advances in sensor/actuator and RFID technologies have spun out a new healthcare model enabling capture and dissemination of patient vital signs over the Internet for ubiquitous monitoring of these patients anytime and from anywhere. This provides new opportunities for enhancing healthcare through participatory consultation, medical diagnosis and many other novel healthcare services. Some of the advantages of this emerging technology referred to in this paper as “Cyber-healthcare” includes low acquisition cost, flexible deployment and improved accuracy resulting from replacing manual operations by fully digitized processes. It is expected that the emerging healthcare technology will change the way healthcare is delivered in both rural and urban settings of the developing world by building upon this technology to leapfrog from poorly prepared to medically equipped environments capable of tackling some of the most challenging medical issues of the developing world such as patients' vital signs capture, patient prioritization and preparedness to virus outbreaks such as Ebola. This paper proposes a Cyber-healthcare system as a first step towards the implementation of least cost digital health systems in the developing countries. We assess the field readiness of the off-the-shelf sensor technology used by the system and evaluate the performance of its underlying patient prioritization module using two machine learning algorithms: 1) multivariate linear regression and 2) support vector machine.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121350867","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-06-27DOI: 10.1109/ISCC.2016.7543778
M. Tortonesi, James R. Michaelis, A. Morelli, Niranjan Suri, Michael A. Baker
Managing the extremely large volume of information generated by Internet-of-Things (IoT) devices, estimated to be in excess of 400 ZB per year by 2018, is going to be an increasingly relevant issue. Most of the approaches to IoT information management proposed so far, based on the collection of IoT-generated raw data for storage and processing in the Cloud, place a significant burden on both communications and computational resources, and introduce significant latency. IoT applications would instead benefit from new paradigms to enable definition and deployment of dynamic IoT services and facilitate their use of computational resources at the edge of the network for data analysis purposes, and from smart dissemination solutions to deliver the processed information to consumers. This paper presents SPF (as in “Sieve, Process, and Forward”), an SDN solution which extends the reference ONF architecture replacing the Data Plane with an Information Processing and Dissemination Plane. By leveraging programmable information processors deployed at the Internet/IoT edge and disruption tolerant information dissemination solutions, SPF allows to define and manage IoT applications and services and represents a promising architecture for future urban computing applications.
{"title":"SPF: An SDN-based middleware solution to mitigate the IoT information explosion","authors":"M. Tortonesi, James R. Michaelis, A. Morelli, Niranjan Suri, Michael A. Baker","doi":"10.1109/ISCC.2016.7543778","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543778","url":null,"abstract":"Managing the extremely large volume of information generated by Internet-of-Things (IoT) devices, estimated to be in excess of 400 ZB per year by 2018, is going to be an increasingly relevant issue. Most of the approaches to IoT information management proposed so far, based on the collection of IoT-generated raw data for storage and processing in the Cloud, place a significant burden on both communications and computational resources, and introduce significant latency. IoT applications would instead benefit from new paradigms to enable definition and deployment of dynamic IoT services and facilitate their use of computational resources at the edge of the network for data analysis purposes, and from smart dissemination solutions to deliver the processed information to consumers. This paper presents SPF (as in “Sieve, Process, and Forward”), an SDN solution which extends the reference ONF architecture replacing the Data Plane with an Information Processing and Dissemination Plane. By leveraging programmable information processors deployed at the Internet/IoT edge and disruption tolerant information dissemination solutions, SPF allows to define and manage IoT applications and services and represents a promising architecture for future urban computing applications.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394474","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-06-27DOI: 10.1109/ISCC.2016.7543782
Jorge Werner, C. Westphall
Cloud computing has been a great ally in the development of products and services with highly scalable, flexible, on-demand, providing big data to users in different administrative domains services. In this context, federated identity management assist in the administration of access to services and privacy of Personally Identifiable Information (PII). The cloud may impose some security issues, especially some threats to sensitive data such as PII. Therefore, we present a model that addresses privacy issues of PII, considering aspects of dynamic federations, different policies, data manipulation rules and encryption. A prototype of the federation agreement, dynamic scopes and security policies was developed using OpenID Connect (OIDC).
{"title":"A model for identity management with privacy in the cloud","authors":"Jorge Werner, C. Westphall","doi":"10.1109/ISCC.2016.7543782","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543782","url":null,"abstract":"Cloud computing has been a great ally in the development of products and services with highly scalable, flexible, on-demand, providing big data to users in different administrative domains services. In this context, federated identity management assist in the administration of access to services and privacy of Personally Identifiable Information (PII). The cloud may impose some security issues, especially some threats to sensitive data such as PII. Therefore, we present a model that addresses privacy issues of PII, considering aspects of dynamic federations, different policies, data manipulation rules and encryption. A prototype of the federation agreement, dynamic scopes and security policies was developed using OpenID Connect (OIDC).","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123035958","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-06-27DOI: 10.1109/ISCC.2016.7543747
Bahadir K. Polat, Müjdat Soytürk
Understanding vehicle mobility is essential for devising successful protocols for vehicular communications. Vehicles move at varying speeds on roads whose complexities range from plain highway lanes to urban boulevards with intersections/circles, traffic lights and various points of interest on them. This mobility pattern combined with vehicle density fluctuations depending on location and time makes understanding the vehicular mobility a challenging task and leads to vehicular communication solutions which are incomplete or low-performance. In this paper, we propose an alternative method for vehicular mobility analysis. We attempt to extract the spatio-temporal vehicular mobility characteristics of large, complex geographical areas by dividing them into cells and analyzing on these cells certain metrics that are of interest for vehicular communication. We first discuss the logic behind our approach. We then present definitions of the metrics used by the proposed analysis method. We conclude with a demonstration of the results achieved when the proposed method is applied in the analysis of a large scale mobility trace.
{"title":"An alternative approach to mobility analysis in vehicular ad hoc networks","authors":"Bahadir K. Polat, Müjdat Soytürk","doi":"10.1109/ISCC.2016.7543747","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543747","url":null,"abstract":"Understanding vehicle mobility is essential for devising successful protocols for vehicular communications. Vehicles move at varying speeds on roads whose complexities range from plain highway lanes to urban boulevards with intersections/circles, traffic lights and various points of interest on them. This mobility pattern combined with vehicle density fluctuations depending on location and time makes understanding the vehicular mobility a challenging task and leads to vehicular communication solutions which are incomplete or low-performance. In this paper, we propose an alternative method for vehicular mobility analysis. We attempt to extract the spatio-temporal vehicular mobility characteristics of large, complex geographical areas by dividing them into cells and analyzing on these cells certain metrics that are of interest for vehicular communication. We first discuss the logic behind our approach. We then present definitions of the metrics used by the proposed analysis method. We conclude with a demonstration of the results achieved when the proposed method is applied in the analysis of a large scale mobility trace.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408242","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-06-27DOI: 10.1109/ISCC.2016.7543838
Yinlong Liu, Dali Zhu, Wei Ma
Content Centric Mobile Ad-hoc NETwork (CCMANET) applies the advantages of Content Centric networking (CCN) into Mobile Ad Hoc Network(MANET) to overcome the drawbacks of low efficiency and unstable in transmission. Caching scheme is one of the key components of CCMANET. However, the caching scheme in CCMANET has not been well explored. In this paper, a novel cooperative caching scheme based on generalized dominating set and local content popularity for CCMANET is proposed. First, a virtual backbone in CCMANET is constructed by generalized dominating set to make the arbitrary topology become two-level hierarchy and a collaborative cache placement scheme between the two hierarchies is designed. Second, we propose a method of computing the local content popularity and a cache replacement scheme based on the local content popularity. Simulation results show that the proposed caching scheme can effectively reduces both path stretch value and server load, and improves the hit ratio compared with the existing caching schemes.
CCMANET (Content Centric Mobile Ad- Hoc NETwork)是将内容中心网络(Content Centric networking, CCN)的优点应用到移动自组网(Mobile Ad- Hoc NETwork, MANET)中，以克服其传输效率低、传输不稳定等缺点。缓存方案是CCMANET的关键组成部分之一。然而，CCMANET中的缓存方案还没有得到很好的研究。提出了一种基于广义支配集和局部内容流行度的CCMANET协同缓存方案。首先，利用广义支配集构造CCMANET中的虚拟主干网，使任意拓扑变为两层结构，并设计了两层结构之间的协同缓存放置方案;其次，我们提出了一种计算本地内容流行度的方法和基于本地内容流行度的缓存替换方案。仿真结果表明，与现有的缓存方案相比，所提出的缓存方案能够有效地降低路径拉伸值和服务器负载，提高命中率。
{"title":"A novel cooperative caching scheme for Content Centric Mobile Ad Hoc Networks","authors":"Yinlong Liu, Dali Zhu, Wei Ma","doi":"10.1109/ISCC.2016.7543838","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543838","url":null,"abstract":"Content Centric Mobile Ad-hoc NETwork (CCMANET) applies the advantages of Content Centric networking (CCN) into Mobile Ad Hoc Network(MANET) to overcome the drawbacks of low efficiency and unstable in transmission. Caching scheme is one of the key components of CCMANET. However, the caching scheme in CCMANET has not been well explored. In this paper, a novel cooperative caching scheme based on generalized dominating set and local content popularity for CCMANET is proposed. First, a virtual backbone in CCMANET is constructed by generalized dominating set to make the arbitrary topology become two-level hierarchy and a collaborative cache placement scheme between the two hierarchies is designed. Second, we propose a method of computing the local content popularity and a cache replacement scheme based on the local content popularity. Simulation results show that the proposed caching scheme can effectively reduces both path stretch value and server load, and improves the hit ratio compared with the existing caching schemes.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133583427","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-06-27DOI: 10.1109/ISCC.2016.7543849
Genya Ishigaki, N. Shinomiya
This paper discusses a composition problem of a resilient tree on a graph modeling a communication network whose links are intermittent. The resiliency of a tree is defined exploiting the binary relation on two kinds of edge weights: availability and commonality. Availability represents a probabilistic stability of a communication link corresponding to an edge, and commonality indicates the influence of an edge based on relative locations of edges on a tree. Our simulation analyzes that the trees satisfying the proposed ordering property on the binary relation provide more stable connections among communication nodes.
{"title":"On composing a resilient tree in a network with intermittent links based on stress centrality","authors":"Genya Ishigaki, N. Shinomiya","doi":"10.1109/ISCC.2016.7543849","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543849","url":null,"abstract":"This paper discusses a composition problem of a resilient tree on a graph modeling a communication network whose links are intermittent. The resiliency of a tree is defined exploiting the binary relation on two kinds of edge weights: availability and commonality. Availability represents a probabilistic stability of a communication link corresponding to an edge, and commonality indicates the influence of an edge based on relative locations of edges on a tree. Our simulation analyzes that the trees satisfying the proposed ordering property on the binary relation provide more stable connections among communication nodes.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132764118","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-06-27DOI: 10.1109/ISCC.2016.7543742
Davide Mulfari, A. Celesti, M. Fazio, M. Villari, A. Puliafito
Google Cloud Vision is an image recognition technology that allows us to remotely process the content of an image and to retrieve its main features. By using specialized REST API, called Google Cloud Vision API, developers exploit such a technology within their own applications. Currently, this tool is in limited preview and its services are accessible for trusted tester users only. From a developer's perspective, in this paper, we intend to use such software resources in order to achieve assistive technology solutions for people with disabilities. Specifically, we investigate some potential benefits of Cloud Vision tool towards the development of applications for users who are blind.
{"title":"Using Google Cloud Vision in assistive technology scenarios","authors":"Davide Mulfari, A. Celesti, M. Fazio, M. Villari, A. Puliafito","doi":"10.1109/ISCC.2016.7543742","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543742","url":null,"abstract":"Google Cloud Vision is an image recognition technology that allows us to remotely process the content of an image and to retrieve its main features. By using specialized REST API, called Google Cloud Vision API, developers exploit such a technology within their own applications. Currently, this tool is in limited preview and its services are accessible for trusted tester users only. From a developer's perspective, in this paper, we intend to use such software resources in order to achieve assistive technology solutions for people with disabilities. Specifically, we investigate some potential benefits of Cloud Vision tool towards the development of applications for users who are blind.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"57 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132837068","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-06-27DOI: 10.1109/ISCC.2016.7543758
Jagruti Sahoo, R. Glitho
Recently, Cloud based Content Delivery Network (CCDN) has emerged as efficient content delivery architecture to provide content delivery services with improved Quality of Service (QoS), scalability and resource efficiency. Replica server placement is a key design issue in CCDNs and involves deciding the placement of replica servers on geographically dispersed cloud sites that minimizes the operational cost and satisfies QoS of the end-users. Since replica server placement problem is NP-hard, it is necessary to design an efficient heuristic for CCDNs. In this paper, we propose an efficient greedy heuristic for the replica server placement problem. The heuristic consists of two main procedures: placement and refinement. The placement procedure obtains an initial placement of replica servers on cloud sites with low operational cost. The refinement procedure removes the redundant cloud sites to reduce the operational cost further. The simulation results demonstrate that the proposed greedy heuristic outperforms the existing greedy heuristics in terms of computation time and the operational cost.
{"title":"Greedy heuristic for replica server placement in Cloud based Content Delivery Networks","authors":"Jagruti Sahoo, R. Glitho","doi":"10.1109/ISCC.2016.7543758","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543758","url":null,"abstract":"Recently, Cloud based Content Delivery Network (CCDN) has emerged as efficient content delivery architecture to provide content delivery services with improved Quality of Service (QoS), scalability and resource efficiency. Replica server placement is a key design issue in CCDNs and involves deciding the placement of replica servers on geographically dispersed cloud sites that minimizes the operational cost and satisfies QoS of the end-users. Since replica server placement problem is NP-hard, it is necessary to design an efficient heuristic for CCDNs. In this paper, we propose an efficient greedy heuristic for the replica server placement problem. The heuristic consists of two main procedures: placement and refinement. The placement procedure obtains an initial placement of replica servers on cloud sites with low operational cost. The refinement procedure removes the redundant cloud sites to reduce the operational cost further. The simulation results demonstrate that the proposed greedy heuristic outperforms the existing greedy heuristics in terms of computation time and the operational cost.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133704444","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-06-27DOI: 10.1109/ISCC.2016.7543836
Muhui Shen, Bing Chen, Xiaojun Zhu, Yanchao Zhao
A traditional approach to solving the large delay problem of campus networks is to upgrade the link connecting the gateway to the Internet. Inspired by the emerging content-centric network (CCN) and software defined network (SDN) architecture, we propose an alternative solution where the campus network uses a few CCN routers with caching ability, so that duplicate requests for the same content can be satisfied locally without traffic from the Internet. In our solution, we formulate the problem of deciding the cached content at each router to minimize the total delay of all requests. We prove that the problem is NP-hard, and no polynomial time algorithm can provide a constant approximation ratio, unless P=NP. We then propose an exponential-time exact algorithm and three polynomial-time heuristic algorithms. Numerical results show that our solution can reduce network delay significantly, compared to existing cache decision algorithms.
{"title":"Towards optimal cache decision for campus networks with content-centric network routers","authors":"Muhui Shen, Bing Chen, Xiaojun Zhu, Yanchao Zhao","doi":"10.1109/ISCC.2016.7543836","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543836","url":null,"abstract":"A traditional approach to solving the large delay problem of campus networks is to upgrade the link connecting the gateway to the Internet. Inspired by the emerging content-centric network (CCN) and software defined network (SDN) architecture, we propose an alternative solution where the campus network uses a few CCN routers with caching ability, so that duplicate requests for the same content can be satisfied locally without traffic from the Internet. In our solution, we formulate the problem of deciding the cached content at each router to minimize the total delay of all requests. We prove that the problem is NP-hard, and no polynomial time algorithm can provide a constant approximation ratio, unless P=NP. We then propose an exponential-time exact algorithm and three polynomial-time heuristic algorithms. Numerical results show that our solution can reduce network delay significantly, compared to existing cache decision algorithms.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133744753","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
扫码关注我们
求助内容：
应助结果提醒方式：