Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849218
Giwon Lee, Haneul Ko, Sangheon Pack
Recently, data sharing applications among mobile users in cloud computing platforms (e.g., Dropbox and Google Drive) are very popular. In such applications, a cloud server is responsible for synchronization among mobile users and thus the synchronization traffic can be significant when the data are frequently updated and shared by many mobile users. To address this problem, we propose a proxy-based aggregated synchronization (PAS) scheme in which the proxy server and the cloud server conduct localized and aggregated synchronizations, respectively. Preliminary simulation results demonstrate that PAS can reduce the synchronization traffic by 83.1%.
{"title":"Proxy-based aggregated synchronization scheme in mobile cloud computing","authors":"Giwon Lee, Haneul Ko, Sangheon Pack","doi":"10.1109/INFCOMW.2014.6849218","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849218","url":null,"abstract":"Recently, data sharing applications among mobile users in cloud computing platforms (e.g., Dropbox and Google Drive) are very popular. In such applications, a cloud server is responsible for synchronization among mobile users and thus the synchronization traffic can be significant when the data are frequently updated and shared by many mobile users. To address this problem, we propose a proxy-based aggregated synchronization (PAS) scheme in which the proxy server and the cloud server conduct localized and aggregated synchronizations, respectively. Preliminary simulation results demonstrate that PAS can reduce the synchronization traffic by 83.1%.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"27 1","pages":"187-188"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85200729","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849182
D. Hock, Matthias Hartmann, Steffen Gebert, T. Zinner, P. Tran-Gia
Recently, Software Defined Networking (SDN) has gained a lot of attention. The paradigm shift towards centralized architectures with a separation of control plane and data plane is expected for several use cases, including amongst others core communication networks, data center networks, or Network Function Virtualization (NFV). An important issue during SDN deployment is the placement of controllers in the network. The first to address this topic were Heller et al. [3] followed by other researchers who added different resilience issues into their observations. An overview on relevant publications can be found in our previous work [1], where we also introduced our POCO toolset. Here, a powerful and user friendly POCO-PLC toolset is provided and presented that facilitates the analysis and optimization of the controller placement in SDN networks under dynamic conditions. A general overview on the functionality and architecture of POCO-PLC is given. Then, possible use cases enabled by POCO-PLC is indicated.
{"title":"POCO-PLC: Enabling dynamic pareto-optimal resilient controller placement in SDN networks","authors":"D. Hock, Matthias Hartmann, Steffen Gebert, T. Zinner, P. Tran-Gia","doi":"10.1109/INFCOMW.2014.6849182","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849182","url":null,"abstract":"Recently, Software Defined Networking (SDN) has gained a lot of attention. The paradigm shift towards centralized architectures with a separation of control plane and data plane is expected for several use cases, including amongst others core communication networks, data center networks, or Network Function Virtualization (NFV). An important issue during SDN deployment is the placement of controllers in the network. The first to address this topic were Heller et al. [3] followed by other researchers who added different resilience issues into their observations. An overview on relevant publications can be found in our previous work [1], where we also introduced our POCO toolset. Here, a powerful and user friendly POCO-PLC toolset is provided and presented that facilitates the analysis and optimization of the controller placement in SDN networks under dynamic conditions. A general overview on the functionality and architecture of POCO-PLC is given. Then, possible use cases enabled by POCO-PLC is indicated.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"36 1","pages":"115-116"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85633012","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849302
John Tadrous, A. Eryilmaz, H. E. Gamal
In this work, we investigate the profit maximization problem of a network service provider through smart pricing and proactive data services. The demand characteristics of each user are dependent on the price and willingness-to-pay values of each service. By learning these characteristics, the service provider can further improve its profit performance through a proactive service of the predictable demand so as to smooth-out its load dynamics over time, and reduce the incurred cost. We formulate the joint price and proactive download allocation problem and study its impact on the expected user payments and the service provider profit. In particular, we show that proactive downloads can only enhance the expected profit of service provider and at the same time reduce the expected payments by the user, when compared with the no-proactive-service regime. The problem is studied from two perspectives: global optimization, and game theory. From the global optimization perspective, the problem is shown to be non-convex, yet an algorithm that yields a local optimal solution with better profit than the no-proactive-download scenario is developed. From the game theoretical perspective, the problem is posed as a coordination game with the user and the service provider are players. Best response dynamics are shown to converge to a Nash Equilibrium (NE) of the game, which is the local optimal solution achieved by the developed non-convex optimization algorithm.
{"title":"Joint pricing and proactive caching for data services: Global and user-centric approaches","authors":"John Tadrous, A. Eryilmaz, H. E. Gamal","doi":"10.1109/INFCOMW.2014.6849302","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849302","url":null,"abstract":"In this work, we investigate the profit maximization problem of a network service provider through smart pricing and proactive data services. The demand characteristics of each user are dependent on the price and willingness-to-pay values of each service. By learning these characteristics, the service provider can further improve its profit performance through a proactive service of the predictable demand so as to smooth-out its load dynamics over time, and reduce the incurred cost. We formulate the joint price and proactive download allocation problem and study its impact on the expected user payments and the service provider profit. In particular, we show that proactive downloads can only enhance the expected profit of service provider and at the same time reduce the expected payments by the user, when compared with the no-proactive-service regime. The problem is studied from two perspectives: global optimization, and game theory. From the global optimization perspective, the problem is shown to be non-convex, yet an algorithm that yields a local optimal solution with better profit than the no-proactive-download scenario is developed. From the game theoretical perspective, the problem is posed as a coordination game with the user and the service provider are players. Best response dynamics are shown to converge to a Nash Equilibrium (NE) of the game, which is the local optimal solution achieved by the developed non-convex optimization algorithm.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"616-621"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77132278","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849230
Sérgio Figueiredo, Seil Jeon, R. Aguiar
This paper proposes a novel multicast mobility solution aimed for mobile video, empowered by a cross-layer approach leveraging on the capabilities of Multicast Context Transfer and IEEE 802.21 Media-Independent Handover. The proposed solution was implemented and deployed in a real testbed, with results showing the significantly reduced latency for vertical handovers.
{"title":"Empowering IP multicast for multimedia delivery over heterogeneous mobile wireless networks","authors":"Sérgio Figueiredo, Seil Jeon, R. Aguiar","doi":"10.1109/INFCOMW.2014.6849230","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849230","url":null,"abstract":"This paper proposes a novel multicast mobility solution aimed for mobile video, empowered by a cross-layer approach leveraging on the capabilities of Multicast Context Transfer and IEEE 802.21 Media-Independent Handover. The proposed solution was implemented and deployed in a real testbed, with results showing the significantly reduced latency for vertical handovers.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"95 1","pages":"211-212"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79822144","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849207
Liu Licai, Guo Yun-chuan, Yin Lihua
With the problem that the non-cooperation of selfish nodes causes by location privacy leakage and resource consumption, some researchers proposed a bargaining-based game for cooperative authentication in MANETs. In this game, a fundamental issue is to study how the asking/bidding price affects the cooperative willingness of nodes. To address the problem that the improvement of cooperative willingness in dynamic decision-making, a bargaining-based dynamic game is proposed to analyze the dynamic behavior of the asking/bidding price of nodes. Further, the Subgame Perfect Nash Equilibriums and Perfect Bayesian Equilibrium are obtained to guide the player chooses its optimal strategy under complete and incomplete information, respectively. Finally, factors affect cooperative willingness have been analyzed and the simulation results indicate all positive factors, which cause a lower asking price and a higher bidding price, imply a higher cooperative willingness and a higher probability of successful cooperative authentication.
{"title":"Analyzing asking/bidding price in dynamic game for cooperative authentication","authors":"Liu Licai, Guo Yun-chuan, Yin Lihua","doi":"10.1109/INFCOMW.2014.6849207","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849207","url":null,"abstract":"With the problem that the non-cooperation of selfish nodes causes by location privacy leakage and resource consumption, some researchers proposed a bargaining-based game for cooperative authentication in MANETs. In this game, a fundamental issue is to study how the asking/bidding price affects the cooperative willingness of nodes. To address the problem that the improvement of cooperative willingness in dynamic decision-making, a bargaining-based dynamic game is proposed to analyze the dynamic behavior of the asking/bidding price of nodes. Further, the Subgame Perfect Nash Equilibriums and Perfect Bayesian Equilibrium are obtained to guide the player chooses its optimal strategy under complete and incomplete information, respectively. Finally, factors affect cooperative willingness have been analyzed and the simulation results indicate all positive factors, which cause a lower asking price and a higher bidding price, imply a higher cooperative willingness and a higher probability of successful cooperative authentication.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"25 1","pages":"165-166"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80308838","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849260
Yegui Cai, Fei Yu, Shengrong Bu
Cloud computing will have profound impacts on wireless networks. On one hand, the integration of cloud computing into the mobile environment enables mobile cloud computing (MCC) systems; on the other hand, the powerful computing platforms in the cloud for radio access networks lead to a novel concept of cloud radio access networks (C-RAN). In this paper, we study the topology configuration and rate allocation problem in C-RAN with the objective of optimizing the end-to-end performance of MCC users in next generation wireless networks. An intrinsic issue related to such system is that only sub-optimal decisions can be made due to the fact that the channel state information is outdated. We employ a decision-theoretic framework to tackle this issue, and maximize the system throughput with constraints on the response latency experienced by each MCC user. Using simulation results, we show that, with the emergence of MCC and C-RAN technologies, the design and operation of future mobile wireless networks can be significantly affected by cloud computing, and the proposed scheme is capable of achieving substantial performance gains over existing schemes.
{"title":"Cloud radio access networks (C-RAN) in mobile cloud computing systems","authors":"Yegui Cai, Fei Yu, Shengrong Bu","doi":"10.1109/INFCOMW.2014.6849260","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849260","url":null,"abstract":"Cloud computing will have profound impacts on wireless networks. On one hand, the integration of cloud computing into the mobile environment enables mobile cloud computing (MCC) systems; on the other hand, the powerful computing platforms in the cloud for radio access networks lead to a novel concept of cloud radio access networks (C-RAN). In this paper, we study the topology configuration and rate allocation problem in C-RAN with the objective of optimizing the end-to-end performance of MCC users in next generation wireless networks. An intrinsic issue related to such system is that only sub-optimal decisions can be made due to the fact that the channel state information is outdated. We employ a decision-theoretic framework to tackle this issue, and maximize the system throughput with constraints on the response latency experienced by each MCC user. Using simulation results, we show that, with the emergence of MCC and C-RAN technologies, the design and operation of future mobile wireless networks can be significantly affected by cloud computing, and the proposed scheme is capable of achieving substantial performance gains over existing schemes.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"17 1","pages":"369-374"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86679864","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849228
Teerawat Kumrai, K. Ota, M. Dong, P. Champrasert
This paper proposes a multi-objective optimization evolutionary algorithm for placement of roadside units (RSUs) in participatory sensing using vehicular networks. The proposed algorithm heuristically optimizes RSUs' communication coverage area in a city with the minimal number of RSUs. The extensive simulation results show the efficacy of the proposed algorithm comparing to a traditional placement algorithm.
{"title":"RSU placement optimization in vehicular participatory sensing networks","authors":"Teerawat Kumrai, K. Ota, M. Dong, P. Champrasert","doi":"10.1109/INFCOMW.2014.6849228","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849228","url":null,"abstract":"This paper proposes a multi-objective optimization evolutionary algorithm for placement of roadside units (RSUs) in participatory sensing using vehicular networks. The proposed algorithm heuristically optimizes RSUs' communication coverage area in a city with the minimal number of RSUs. The extensive simulation results show the efficacy of the proposed algorithm comparing to a traditional placement algorithm.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":" 1","pages":"207-208"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91409709","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849244
Chenglin Li, H. Xiong, Junni Zou, D. Wu
In this paper, we consider the time-varying characteristics of practical wireless networks, and propose a joint dynamic rate allocation and transmission scheduling optimization scheme for scalable video multi-rate multicast based on opportunistic routing (OR) and network coding. With OR, the decision of optimal routes for scalable video coding (SVC) layered streaming is integrated into the joint optimization formulation. The network throughput is also increased by taking advantage of the broadcast nature of the wireless shared medium and by network coding operations in intermediate nodes. To maximize the overall video reception quality among all destinations, the proposed scheme can jointly optimize the video reception rate, the associated routes to different destinations, and the time fraction scheduling of transmitter sets that are concurrently transmitting in the shared wireless medium. By using dual decomposition and primal-dual update approach, we develop a cross-layer algorithm in a fully distributed manner. Simulation results demonstrate significant network multicast throughput improvement and adaptation to dynamic network changes relative to existing optimization schemes.
{"title":"Dynamic rate allocation and opportunistic routing for scalable video multirate multicast over time-varying wireless networks","authors":"Chenglin Li, H. Xiong, Junni Zou, D. Wu","doi":"10.1109/INFCOMW.2014.6849244","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849244","url":null,"abstract":"In this paper, we consider the time-varying characteristics of practical wireless networks, and propose a joint dynamic rate allocation and transmission scheduling optimization scheme for scalable video multi-rate multicast based on opportunistic routing (OR) and network coding. With OR, the decision of optimal routes for scalable video coding (SVC) layered streaming is integrated into the joint optimization formulation. The network throughput is also increased by taking advantage of the broadcast nature of the wireless shared medium and by network coding operations in intermediate nodes. To maximize the overall video reception quality among all destinations, the proposed scheme can jointly optimize the video reception rate, the associated routes to different destinations, and the time fraction scheduling of transmitter sets that are concurrently transmitting in the shared wireless medium. By using dual decomposition and primal-dual update approach, we develop a cross-layer algorithm in a fully distributed manner. Simulation results demonstrate significant network multicast throughput improvement and adaptation to dynamic network changes relative to existing optimization schemes.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 1","pages":"275-280"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90213692","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849164
H. Yabusaki, Hiroshi Nakagoe, Koichi Murayama, Takatoshi Kato
As cloud computing is increasingly adopted by enterprises, a stringent service level agreement such as response time is required by the cloud in order to run business applications. This can be problematic because activity from geographically distributed terminals owing to globalization often increases the average response time. Federating various clouds enables to utilize datacenters in various geographical regions regardless of their servicers. The response time can be reduced by replicating the applications and related data at datacenters near the terminals by considering the factors of delay (e.g., data synchronization, distribution of multi-tier applications, and influence of other applications). However, it is unrealistic to accurately analyze all of the factors without any errors. We propose wide area tentative scaling (WATS) to improve the response time in a phased manner by repetitively replicate a part of the application and related data at other datacenters and selecting a better organization. The WATS approach is to repetitively change the organization to reduce the response time even if the analysis is incorrect, unlike mathematical-formulae-based approaches that require precise analysis. The drawback of this approach is that it consumes more computing resources due to repeating the replication. We therefore, applied Bayesian inference to search for a better organization with fewer trials. Evaluation results showed that WATS successfully reduced the response time in a phased manner.
{"title":"Wide area tentative scaling (WATS) for quick response in distributed cloud computing","authors":"H. Yabusaki, Hiroshi Nakagoe, Koichi Murayama, Takatoshi Kato","doi":"10.1109/INFCOMW.2014.6849164","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849164","url":null,"abstract":"As cloud computing is increasingly adopted by enterprises, a stringent service level agreement such as response time is required by the cloud in order to run business applications. This can be problematic because activity from geographically distributed terminals owing to globalization often increases the average response time. Federating various clouds enables to utilize datacenters in various geographical regions regardless of their servicers. The response time can be reduced by replicating the applications and related data at datacenters near the terminals by considering the factors of delay (e.g., data synchronization, distribution of multi-tier applications, and influence of other applications). However, it is unrealistic to accurately analyze all of the factors without any errors. We propose wide area tentative scaling (WATS) to improve the response time in a phased manner by repetitively replicate a part of the application and related data at other datacenters and selecting a better organization. The WATS approach is to repetitively change the organization to reduce the response time even if the analysis is incorrect, unlike mathematical-formulae-based approaches that require precise analysis. The drawback of this approach is that it consumes more computing resources due to repeating the replication. We therefore, applied Bayesian inference to search for a better organization with fewer trials. Evaluation results showed that WATS successfully reduced the response time in a phased manner.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"31-36"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79491169","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 : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849231
H. Salah, Benjamin Schiller, T. Strufe
Content-Centric Networking (CCN) promises to yield large efficiency gains for Internet content distribution. Its autonomous cache management, however, raises doubts about achieving the intended goals optimally. A coordinated cache management, based on timely usage information, will help to fully leverage the cache efficiency. In this poster we introduce CoMon, a system architecture that implements Coordinated caching based on Monitoring of content usage and its stability. CoMon aims at improving CCN caching with low monitoring and communication overheads.
{"title":"CoMon: A system architecture for improving caching in CCN","authors":"H. Salah, Benjamin Schiller, T. Strufe","doi":"10.1109/INFCOMW.2014.6849231","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849231","url":null,"abstract":"Content-Centric Networking (CCN) promises to yield large efficiency gains for Internet content distribution. Its autonomous cache management, however, raises doubts about achieving the intended goals optimally. A coordinated cache management, based on timely usage information, will help to fully leverage the cache efficiency. In this poster we introduce CoMon, a system architecture that implements Coordinated caching based on Monitoring of content usage and its stability. CoMon aims at improving CCN caching with low monitoring and communication overheads.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"40 1","pages":"213-214"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79552539","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
扫码关注我们
求助内容：
应助结果提醒方式：