Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849256
Hyunseok Chang, A. Hari, S. Mukherjee, T. Lakshman
Edge services become increasingly important as the Internet transforms into an Internet of Things (IoT). Edge services require bounded latency, bandwidth reduction between the edge and the core, service resiliency with graceful degradation, and access to resources visible only inside the NATed and secured edge networks. While the data center based cloud excels at providing general purpose computation/storage at scale, it is not suitable for edge services. We present a new model for cloud computing, which we call the Edge Cloud, that addresses edge computing specific issues by augmenting the traditional data center cloud model with service nodes placed at the network edges. We describe the architecture of the Edge Cloud and its implementation as an overlay hybrid cloud using the industry standard OpenStack cloud management framework. We demonstrate the advantages garnered by two new classes of applications enabled by the Edge Cloud - a highly accurate indoor localization that saves on latency, and a scalable and resilient video monitoring that saves on bandwidth.
{"title":"Bringing the cloud to the edge","authors":"Hyunseok Chang, A. Hari, S. Mukherjee, T. Lakshman","doi":"10.1109/INFCOMW.2014.6849256","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849256","url":null,"abstract":"Edge services become increasingly important as the Internet transforms into an Internet of Things (IoT). Edge services require bounded latency, bandwidth reduction between the edge and the core, service resiliency with graceful degradation, and access to resources visible only inside the NATed and secured edge networks. While the data center based cloud excels at providing general purpose computation/storage at scale, it is not suitable for edge services. We present a new model for cloud computing, which we call the Edge Cloud, that addresses edge computing specific issues by augmenting the traditional data center cloud model with service nodes placed at the network edges. We describe the architecture of the Edge Cloud and its implementation as an overlay hybrid cloud using the industry standard OpenStack cloud management framework. We demonstrate the advantages garnered by two new classes of applications enabled by the Edge Cloud - a highly accurate indoor localization that saves on latency, and a scalable and resilient video monitoring that saves on bandwidth.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"255 1","pages":"346-351"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75762377","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.6849225
H. S. Ghadikolaei, C. Fischione
Developing an efficient spectrum access policy enables cognitive radios to dramatically increase spectrum utilization while assuring predetermined quality of service levels for the primary users. In this abstract, modeling, performance evaluation, and optimization of a distributed secondary network with random sensing order policy are studied. Specifically, the secondary users create a random order of the available channels upon primary users return, and then find an optimal transmission opportunity in a distributed manner. After modeling the behavior of the SUs by a Markov chain, the average throughputs of the secondary users and interference level among the secondary and primary users are evaluated. Then, a maximization of the secondary network performance in terms of throughput while keeping under control the average interference is proposed. A simple and practical adaptive algorithm is developed to optimize the network. Interestingly, the proposed algorithm follows the variations of the wireless channels in non-stationary conditions and outperforms even static brute force optimization, while demanding few computations. Finally, numerical results are provided to demonstrate the efficiencies of the proposed schemes. It is shown that fully distributed algorithms can achieve substantial performance improvements in cognitive radio networks without the need of centralized management or message passing among the users.
{"title":"Random sensing order in cognitive radio systems: Performance evaluation and optimization","authors":"H. S. Ghadikolaei, C. Fischione","doi":"10.1109/INFCOMW.2014.6849225","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849225","url":null,"abstract":"Developing an efficient spectrum access policy enables cognitive radios to dramatically increase spectrum utilization while assuring predetermined quality of service levels for the primary users. In this abstract, modeling, performance evaluation, and optimization of a distributed secondary network with random sensing order policy are studied. Specifically, the secondary users create a random order of the available channels upon primary users return, and then find an optimal transmission opportunity in a distributed manner. After modeling the behavior of the SUs by a Markov chain, the average throughputs of the secondary users and interference level among the secondary and primary users are evaluated. Then, a maximization of the secondary network performance in terms of throughput while keeping under control the average interference is proposed. A simple and practical adaptive algorithm is developed to optimize the network. Interestingly, the proposed algorithm follows the variations of the wireless channels in non-stationary conditions and outperforms even static brute force optimization, while demanding few computations. Finally, numerical results are provided to demonstrate the efficiencies of the proposed schemes. It is shown that fully distributed algorithms can achieve substantial performance improvements in cognitive radio networks without the need of centralized management or message passing among the users.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"42 1","pages":"201-202"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74207483","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.6849175
Bin Nie, Honggang Zhang, Yong Liu
Online videos, e.g., YouTube videos, are important topics for social interactions among users of online social networking sites (OSN), e.g., Facebook. This opens up the possibility of exploiting video-related user social interaction information for better video recommendation. Towards this goal, we conduct a case study of recommending YouTube videos to Facebook users based on their social interactions. We first measure social interactions related to YouTube videos among Facebook users. We observe that the attention a video attracts on Facebook is not always well-aligned with its popularity on YouTube. Unpopular videos on YouTube can become popular on Facebook, while popular videos on YouTube often do not attract proportionally high attentions on Facebook. This finding motivates us to develop a simple top-k video recommendation algorithm that exploits user social interaction information to improve the recommendation accuracy for niche videos, that are globally unpopular, but highly relevant to a specific user or user group. Through experiments on the collected Facebook traces, we demonstrate that our recommendation algorithm significantly outperforms the YouTube-popularity based video recommendation algorithm as well as a collaborative filtering algorithm based on user similarities.
{"title":"Social interaction based video recommendation: Recommending YouTube videos to facebook users","authors":"Bin Nie, Honggang Zhang, Yong Liu","doi":"10.1109/INFCOMW.2014.6849175","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849175","url":null,"abstract":"Online videos, e.g., YouTube videos, are important topics for social interactions among users of online social networking sites (OSN), e.g., Facebook. This opens up the possibility of exploiting video-related user social interaction information for better video recommendation. Towards this goal, we conduct a case study of recommending YouTube videos to Facebook users based on their social interactions. We first measure social interactions related to YouTube videos among Facebook users. We observe that the attention a video attracts on Facebook is not always well-aligned with its popularity on YouTube. Unpopular videos on YouTube can become popular on Facebook, while popular videos on YouTube often do not attract proportionally high attentions on Facebook. This finding motivates us to develop a simple top-k video recommendation algorithm that exploits user social interaction information to improve the recommendation accuracy for niche videos, that are globally unpopular, but highly relevant to a specific user or user group. Through experiments on the collected Facebook traces, we demonstrate that our recommendation algorithm significantly outperforms the YouTube-popularity based video recommendation algorithm as well as a collaborative filtering algorithm based on user similarities.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 1","pages":"97-102"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84192571","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.6849326
Amna Jamal, C. Tham, L. Wong
Dynamic spectrum access in the form of cognitive radio (CR) has gained traction in wireless sensor networks (WSN) because of scarcity caused by the proliferation of wireless devices and service and it provides spectrum efficient communication for the resource constrained WSNs. However, proper means have to be devised to satisfy the requirements of both WSNs and CRs and to enjoy the benefits of cognition in sensor networks. In this paper, we propose a novel energy-efficient and spectrum aware multi-channel medium access control (MAC) protocol for the underlying cognitive radio enabled sensor network. We designed a spectrum aware multichannel asynchronous duty cycle approach which caters to the requirements of both the domains. The performance of the proposed MAC is evaluated via simulations. The simulation results are also compared with MCMAC, a multi-channel MAC for WSNs. The comparative results show that the proposed approach outperforms the multi-channel scheme for WSN.
{"title":"Spectrum aware and energy efficient MAC protocol for cognitive radio sensor network","authors":"Amna Jamal, C. Tham, L. Wong","doi":"10.1109/INFCOMW.2014.6849326","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849326","url":null,"abstract":"Dynamic spectrum access in the form of cognitive radio (CR) has gained traction in wireless sensor networks (WSN) because of scarcity caused by the proliferation of wireless devices and service and it provides spectrum efficient communication for the resource constrained WSNs. However, proper means have to be devised to satisfy the requirements of both WSNs and CRs and to enjoy the benefits of cognition in sensor networks. In this paper, we propose a novel energy-efficient and spectrum aware multi-channel medium access control (MAC) protocol for the underlying cognitive radio enabled sensor network. We designed a spectrum aware multichannel asynchronous duty cycle approach which caters to the requirements of both the domains. The performance of the proposed MAC is evaluated via simulations. The simulation results are also compared with MCMAC, a multi-channel MAC for WSNs. The comparative results show that the proposed approach outperforms the multi-channel scheme for WSN.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"86 1","pages":"759-764"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84356490","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.6849267
Giulio Grassi, Davide Pesavento, G. Pau, Rama Vuyyuru, R. Wakikawa, Lixia Zhang
In this paper we apply the Named Data Networking [1], a newly proposed Internet architecture, to networking vehicles on the run. Our initial design, dubbed V-NDN, illustrates NDN's promising potential in providing a unifying architecture that enables networking among all computing devices independent from whether they are connected through wired infrastructure, ad hoc, or intermittent DTN. This paper describes a prototype implementation of V-NDN and its preliminary performance assessment, and identifies remaining challenges.
{"title":"VANET via Named Data Networking","authors":"Giulio Grassi, Davide Pesavento, G. Pau, Rama Vuyyuru, R. Wakikawa, Lixia Zhang","doi":"10.1109/INFCOMW.2014.6849267","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849267","url":null,"abstract":"In this paper we apply the Named Data Networking [1], a newly proposed Internet architecture, to networking vehicles on the run. Our initial design, dubbed V-NDN, illustrates NDN's promising potential in providing a unifying architecture that enables networking among all computing devices independent from whether they are connected through wired infrastructure, ad hoc, or intermittent DTN. This paper describes a prototype implementation of V-NDN and its preliminary performance assessment, and identifies remaining challenges.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"72 1","pages":"410-415"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80429729","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.6849271
I. Psaras, Lorenzo Saino, M. Arumaithurai, K. Ramakrishnan, G. Pavlou
In the immediate aftermath of a natural disaster, network infrastructure is likely to have suffered severe damages that challenge normal communications. In addition to that, traffic substantially increases as a result of people attempting to get in touch with friends, relatives or the rescue teams. To address such requirements of a challenged network, we propose a communication framework based on messages that exploits name-based replication of content and enables ad-hoc communications with spatial and temporal scoping and prioritisation of named messages. We evaluate our design against less sophisticated replication strategies and show that important messages (e.g., from first responders) get disseminated to more nodes than less important messages.
{"title":"Name-based replication priorities in disaster cases","authors":"I. Psaras, Lorenzo Saino, M. Arumaithurai, K. Ramakrishnan, G. Pavlou","doi":"10.1109/INFCOMW.2014.6849271","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849271","url":null,"abstract":"In the immediate aftermath of a natural disaster, network infrastructure is likely to have suffered severe damages that challenge normal communications. In addition to that, traffic substantially increases as a result of people attempting to get in touch with friends, relatives or the rescue teams. To address such requirements of a challenged network, we propose a communication framework based on messages that exploits name-based replication of content and enables ad-hoc communications with spatial and temporal scoping and prioritisation of named messages. We evaluate our design against less sophisticated replication strategies and show that important messages (e.g., from first responders) get disseminated to more nodes than less important messages.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"434-439"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90861766","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.6849166
Adrian Juan Verdejo, Bholanathsingh Surajbali, H. Baars, H.-G. Kemper
Business Intelligence systems use information technology to supply integrated management support with data coming from several sources of structured and unstructured data. The integrated infrastructures of Business Intelligence (BI) are often too complex and hence costly and inflexible. A solution for these issues is to leverage cloud computing services to enhance legacy BI systems and applications with cost-efficient increased scalability and flexibility. However, the migration of BI systems to cloud environments is usually hindered by strict requirements regarding privacy, security, or availability and a multitude of interdependences with other systems. In this paper, we describe the challenges in the adoption of BI within cloud environments and propose a cloud migration framework to assist decision makers in taking into account the consequences of the migration of BI systems to cloud environments as well as the impact of privacy, security, cost, and performance in so doing.
{"title":"Moving Business Intelligence to cloud environments","authors":"Adrian Juan Verdejo, Bholanathsingh Surajbali, H. Baars, H.-G. Kemper","doi":"10.1109/INFCOMW.2014.6849166","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849166","url":null,"abstract":"Business Intelligence systems use information technology to supply integrated management support with data coming from several sources of structured and unstructured data. The integrated infrastructures of Business Intelligence (BI) are often too complex and hence costly and inflexible. A solution for these issues is to leverage cloud computing services to enhance legacy BI systems and applications with cost-efficient increased scalability and flexibility. However, the migration of BI systems to cloud environments is usually hindered by strict requirements regarding privacy, security, or availability and a multitude of interdependences with other systems. In this paper, we describe the challenges in the adoption of BI within cloud environments and propose a cloud migration framework to assist decision makers in taking into account the consequences of the migration of BI systems to cloud environments as well as the impact of privacy, security, cost, and performance in so doing.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"43-48"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89207267","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.6849188
L. A. Lopes, Rute C. Sofia, H. Osman, Huseyin Haci
The last hop of the Internet towards the end-user is mostly supported by wireless technologies and thus interconnects multiple users, that should, ideally, be served simultaneously. The shared media capability of such last hop is, however, underused, asthe principle behind wireless technologies implies that only one user can be served at an instant in time. Aiming at allowing multiuser transmission within a specific time-frame, this technological demonstration goes over a novel wireless extension mechanism explaining how it can be applied to current wireless networks while keeping backward compatibility.
{"title":"A proposal for elastic spectrum management in wireless local area networks","authors":"L. A. Lopes, Rute C. Sofia, H. Osman, Huseyin Haci","doi":"10.1109/INFCOMW.2014.6849188","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849188","url":null,"abstract":"The last hop of the Internet towards the end-user is mostly supported by wireless technologies and thus interconnects multiple users, that should, ideally, be served simultaneously. The shared media capability of such last hop is, however, underused, asthe principle behind wireless technologies implies that only one user can be served at an instant in time. Aiming at allowing multiuser transmission within a specific time-frame, this technological demonstration goes over a novel wireless extension mechanism explaining how it can be applied to current wireless networks while keeping backward compatibility.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"38 1","pages":"127-128"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88300902","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.6849221
Boyang Zhou, Haifeng Zhou, W. Gao, X. Hong, Bin Wang, Chunming Wu
Software-Defined Networking (SDN) opens the configuring interfaces for the data plane to improve its flexibility[1]. In the data plane, the switches are partitioned into multiple domains. Each domain is dynamically configured by its controller. The domains are physically connected via the border switches. In the control plane, each controller supports multiple services. Each service runs the same control program at multiple controllers in a distributed manner.
SDN (Software-Defined Networking)开放了数据平面的配置接口，提高了数据平面的灵活性。在数据平面，交换机被划分为多个域。每个域由其控制器动态配置。这些域通过边界开关进行物理连接。在控制平面，每个控制器支持多个业务。每个服务以分布式的方式在多个控制器上运行相同的控制程序。
{"title":"Lossless reconfiguration protocol for multi-domain data plane in software-defined networks","authors":"Boyang Zhou, Haifeng Zhou, W. Gao, X. Hong, Bin Wang, Chunming Wu","doi":"10.1109/INFCOMW.2014.6849221","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849221","url":null,"abstract":"Software-Defined Networking (SDN) opens the configuring interfaces for the data plane to improve its flexibility[1]. In the data plane, the switches are partitioned into multiple domains. Each domain is dynamically configured by its controller. The domains are physically connected via the border switches. In the control plane, each controller supports multiple services. Each service runs the same control program at multiple controllers in a distributed manner.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"61 1","pages":"193-194"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76021235","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.6849196
Xianjin Xia, Shining Li, Yu Zhang, Zhe Yang
Mixed data transmission strategies have been proposed to address the energy imbalance problem in wireless sensor networks. However, whether the energy of all nodes can be balanced by this approach, especially under the communication range constraints of sensor nodes, is lack of study. In this paper, we present a novel analytical model for the two-hop based mixed data transmission and derive its energy balance bounds. It is found that the limits of the mixed data transmission scheme on energy balance are only determined by the power profiles of the communication system. This power profile is indicated by a newly discovered parameter which is defined as the premium power ratio of the system.
{"title":"Poster: Energy balance bounds of mixed data transmission in wireless sensor networks","authors":"Xianjin Xia, Shining Li, Yu Zhang, Zhe Yang","doi":"10.1109/INFCOMW.2014.6849196","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849196","url":null,"abstract":"Mixed data transmission strategies have been proposed to address the energy imbalance problem in wireless sensor networks. However, whether the energy of all nodes can be balanced by this approach, especially under the communication range constraints of sensor nodes, is lack of study. In this paper, we present a novel analytical model for the two-hop based mixed data transmission and derive its energy balance bounds. It is found that the limits of the mixed data transmission scheme on energy balance are only determined by the power profiles of the communication system. This power profile is indicated by a newly discovered parameter which is defined as the premium power ratio of the system.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"7 1","pages":"143-144"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80091415","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
扫码关注我们
求助内容：
应助结果提醒方式：