2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第6页

Managing your trees: Insights from a metropolitan-scale low-power wireless network 管理您的树木:来自大都市规模的低功耗无线网络的见解

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849310

Zhang Fu, O. Landsiedel, M. Almgren, M. Papatriantafilou

{"title":"Managing your trees: Insights from a metropolitan-scale low-power wireless network","authors":"Zhang Fu, O. Landsiedel, M. Almgren, M. Papatriantafilou","doi":"10.1109/INFCOMW.2014.6849310","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849310","url":null,"abstract":"Low-power wireless, such as IEEE 802.15.4, is envisioned as one key technology for wireless control and communication. In the context of the Advanced Metering Infrastructure (AMI), it serves as an energy-efficient communication technology for both communications at building-scale networks and city-scale networks. Understanding real-world challenges and key properties of 802.15.4 based networks is an essential requirement for both the research community and practitioners: When deploying and operating low-power wireless networks at metropolitan-scale, a deep knowledge is essential to ensure network availability and performance at production-level quality. Similarly, researchers require realistic network models when developing new algorithms and protocols. In this paper, we present new and real-world insights from a deployed metropolitan-scale low-power wireless network: It includes 300,000 individual wireless connected meters and covers a city with roughly 600,000 inhabitants. Our findings, for example, help to estimate real-world parameters such as the typical size of routing trees, their balance, and their dynamics over time. Moreover, these insights facilitate the understanding and the realistic calibration of simulation models in key properties such as reliability and throughput.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"73 1","pages":"664-669"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72967066","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}

引用次数: 4

Energy-efficient cloud resource management 节能的云资源管理

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849263

M. Dabbagh, B. Hamdaoui, M. Guizani, A. Rayes

引用次数: 34

Analyzing the impact of proximity, location, and personality on smartphone usage 分析距离、位置和个性对智能手机使用的影响

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849247

L. Meng, Shu Liu, A. Striegel

引用次数: 9

Leveraging advanced metering infrastructure for distribution grid asset management 利用先进的计量基础设施进行配电网资产管理

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849311

G. Atkinson, M. Thottan

引用次数: 8

A game theory framework for a distributed and energy efficient bandwidth expansion process 分布式和节能带宽扩展过程的博弈论框架

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849318

R. A. V. Ramírez, J. Thompson, E. Altman, V. Ramos

{"title":"A game theory framework for a distributed and energy efficient bandwidth expansion process","authors":"R. A. V. Ramírez, J. Thompson, E. Altman, V. Ramos","doi":"10.1109/INFCOMW.2014.6849318","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849318","url":null,"abstract":"In this paper, we aim to reduce the power expenditure in the reverse link during low network load periods, by allocating extra resource blocks (RBs) to the mobile users. Thereby, the user's rate demands are split among its allocated RBs in order to transmit in each of them by using a low level modulation order. We model the bandwidth expansion (BE) process by a game theory framework derived from the concept of stable marriage with incomplete lists (SMI). We focus on the optimization of the circuit consumed power rather than on the transmitted power. Thus, the power consumption of the radio frequency (RF) circuits and the baseband (BB) system module is taken into account. Our proposed framework works in a distributed way, hence each RB and mobile user in the system are considered as an independent entity which takes an active role in the decision making process. Additionally, we show that when circuit power consumption is used as an optimization metric, transmitting in more than one RB may not become an energy efficient solution for users experiencing favorable propagation conditions in the reverse link.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"46 1","pages":"712-717"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76857402","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}

引用次数: 2

The stability of best effort and Managed Services in the Internet, and the role of application creation Internet中尽力而为和托管服务的稳定性，以及应用程序创建的角色

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849297

D. Mitra, Qiong Wang

{"title":"The stability of best effort and Managed Services in the Internet, and the role of application creation","authors":"D. Mitra, Qiong Wang","doi":"10.1109/INFCOMW.2014.6849297","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849297","url":null,"abstract":"Best Effort service has been the bedrock of the Internet. The simultaneous offering of Managed Service has been proposed as an efficient way to support quality of service, to make some applications feasible and many others more attractive, and give consumers greater choice. However, there is widespread concern that if a network provider is allowed to offer Managed Service and charge a per-use fee, then the network provider will find it in its short-term profit-maximizing interest to degrade the Best Effort service. Not only will consumers then face higher costs, but also fewer innovations and new applications will be created. To investigate these issues, we formulate a model in which the provider myopically maximizes its profit by setting the per-use fee and deciding on the bandwidth to provision for the Best Effort and Managed Services. We show that in the optimal solution the service offering is binary, i.e., either the Best Service or the Managed Service is offered, but not both simultaneously. Moreover, a necessary and sufficient condition gives the optimal service offering. Combining this condition with a birth-and-death model of applications, we identify a natural attractor around which the application creation process makes the service offering stable. Our finding alleviates the concern about the Managed Service. Still, the provider needs tow have foresight and the regulator needs to be vigilant, since we also show that there is a threshold number of applications belo which the stabilizing mechanism loses its effectiveness and myopic profit-maximization results in a shrinking network and application pool, which hurts both the provider and consumers.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"589-594"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76424059","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}

引用次数: 1

On the experimentation of the novel GCMR multicast routing in a large-scale testbed 新型GCMR组播路由在大型试验台的实验研究

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849177

D. Careglio, D. Papadimitriou, F. Agraz, Sahel Sahhaf, J. Perelló, W. Tavernier

{"title":"On the experimentation of the novel GCMR multicast routing in a large-scale testbed","authors":"D. Careglio, D. Papadimitriou, F. Agraz, Sahel Sahhaf, J. Perelló, W. Tavernier","doi":"10.1109/INFCOMW.2014.6849177","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849177","url":null,"abstract":"Originally defined in the 90s, multicast is nowadays (re)gaining interest given the increasing popularity of multimedia streaming/content traffic and the explosion of cloud services. In fact, multicast yields bandwidth savings complementing cached content distribution techniques and its potential benefits have been verified by studies several times since then (see e.g. [1]). By multicast routing, we refer to a distributed algorithm that, given a group identifier, allows any node to route multicast traffic to a group of destination nodes, usually called multicast group. To enable one-to-many traffic distribution, the multicast routing protocol configures the involved routers to build a (logical) delivery tree between the source and the multicast group, commonly referred to as the Multicast Distribution Tree (MDT). Nevertheless, the scaling problems faced in the 90s still remain mostly unaddressed and worst-case projections predict indeed that routing engines could have to process and maintain in the order of 1 million active routes within the next 5 years [2].","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"91 1","pages":"105-106"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82588720","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}

引用次数: 1

AcousAuth: An acoustic-based mobile application for user authentication acoustic auth:一个基于声学的移动应用程序，用于用户认证

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849232

Si Chen, M. Li, Zhan Qin, Bingsheng Zhang, K. Ren

{"title":"AcousAuth: An acoustic-based mobile application for user authentication","authors":"Si Chen, M. Li, Zhan Qin, Bingsheng Zhang, K. Ren","doi":"10.1109/INFCOMW.2014.6849232","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849232","url":null,"abstract":"Short-range wireless communication technologies have been used in many security-sensitive smartphone applications and services such as contactless micro payment and device pairing. Typically, the data confidentiality of existing short-range communication systems relies on key-exchange then encryption mechanism, which is inefficient, especially for short communication sessions. In this work, we present AcousAuth, a smartphone empowered system designed for personal authentication. AcousAuth adopts the emerging friendly jamming technique from radio communication for data confidentiality and it features a seamless, faster, easier and safer user authentication process without the need for special infrastructure. Our system is intended to provide security assurances comparable to or greater than that of conventional authentication systems while offering the same user experience as inputing a password alone. AcousAuth provides a purely software-based solution to secure smartphone short-range communication without key agreement phase and it is potentially well suited for legacy mobile devices. Despite the computational restrictions and bandwidth of mobile device, our mobile application is able to maintain real-time performance.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 1","pages":"215-216"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82937086","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}

引用次数: 6

Optimal risk-aware power procurement for data centers in day-ahead and real-time electricity markets 数据中心在日前和实时电力市场中的最佳风险意识电力采购

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849301

Mahdi Ghamkhari, Hamed Mohsenian Rad, A. Wierman

引用次数: 26

A game theoretical study of peering vs transit in the internet 互联网中对等与传输的博弈理论研究

2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2014-07-08 DOI: 10.1109/INFCOMW.2014.6849330

Giovanni Accongiagioco, E. Altman, E. Gregori, L. Lenzini

{"title":"A game theoretical study of peering vs transit in the internet","authors":"Giovanni Accongiagioco, E. Altman, E. Gregori, L. Lenzini","doi":"10.1109/INFCOMW.2014.6849330","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849330","url":null,"abstract":"We propose a model for network optimization in a non-cooperative game setting with specific reference to the Internet connectivity. We refer to the general model shown in internal report [1], where Autonomous Systems (AS) decisions on link creation and traffic routing are strategically based on realistic interconnection costs, keeping into account the peering/transit dichotomy. Equilibria existence and convergence results were obtained in [1] only for a specific toy problem, while here we study larger scale scenarios which better fit the complex nature of the Internet. We are able to show that equilibria existence and convergence properties still hold for many possible generalizations, yet not all of them, and provide a specific example for which the system enters in a never-ending oscillation. Thanks to the use of simulations we covered those scenarios for which analytic results could not be obtained, thus analyzing a broad variety of general cases which were not studied in [1]. Simulation shows that the system, in the vast majority of cases, converges to an equilibrium. Very interestingly, even in asymmetric scenarios the equilibrium reached suggests that players tend to be symmetric with respect to the peering exchange points and send their asymmetric traffic quota via the transit service providers.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"12 1","pages":"783-788"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90282756","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}

引用次数: 0