Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849301
Mahdi Ghamkhari, Hamed Mohsenian Rad, A. Wierman
With the growing trend in the amount of power consumed by data centers, finding ways to cut their electricity bills has become an important and challenging problem. In this paper, our focus is on the cost reduction that data centers may achieve by exploiting the diversity in the price of electricity in day-ahead and real-time electricity markets. Based on a stochastic optimization framework, we propose to jointly select a data center's service rate and its power demand bids to the day-ahead and real-time electricity markets. In our analysis, we take into account service-level-agreements, risk management constraints, and statistical characteristics of workload and electricity prices. Using empirical electricity price and Internet workload data and through computer simulations, we show that by directly participating in the day-ahead and real-time electricity markets, data centers can significantly reduce their energy expenditure.
{"title":"Optimal risk-aware power procurement for data centers in day-ahead and real-time electricity markets","authors":"Mahdi Ghamkhari, Hamed Mohsenian Rad, A. Wierman","doi":"10.1109/INFCOMW.2014.6849301","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849301","url":null,"abstract":"With the growing trend in the amount of power consumed by data centers, finding ways to cut their electricity bills has become an important and challenging problem. In this paper, our focus is on the cost reduction that data centers may achieve by exploiting the diversity in the price of electricity in day-ahead and real-time electricity markets. Based on a stochastic optimization framework, we propose to jointly select a data center's service rate and its power demand bids to the day-ahead and real-time electricity markets. In our analysis, we take into account service-level-agreements, risk management constraints, and statistical characteristics of workload and electricity prices. Using empirical electricity price and Internet workload data and through computer simulations, we show that by directly participating in the day-ahead and real-time electricity markets, data centers can significantly reduce their energy expenditure.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"24 1","pages":"610-615"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87455568","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.6849177
D. Careglio, D. Papadimitriou, F. Agraz, Sahel Sahhaf, J. Perelló, W. Tavernier
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].
最初定义于上世纪90年代，随着多媒体流/内容流量的日益普及和云服务的爆炸式增长，多播现在(重新)引起了人们的兴趣。事实上，多播可以节省带宽，补充缓存内容分发技术，并且从那时起，它的潜在好处已经被多次研究证实(参见示例[1])。通过组播路由，我们指的是一种分布式算法，给定组标识符，允许任何节点将组播流量路由到一组目标节点，通常称为组播组。为了实现一对多的流量分配，组播路由协议配置相关路由器在源和组播组之间构建一个(逻辑)传递树，通常称为组播分发树(multicast distribution tree, MDT)。尽管如此，90年代面临的扩展问题仍然没有得到解决，最坏情况的预测确实预测路由引擎可能不得不在未来5年内处理和维护大约100万条活动路由[2]。
{"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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849232
Si Chen, M. Li, Zhan Qin, Bingsheng Zhang, K. Ren
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.
{"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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849210
Dimitris Milioris, P. Jacquet
In this paper we present an efficient encryption system based on Compressive Sensing, without the additional computational cost of a separate encryption protocol, when applied to indoor location estimation problems. The breakthrough of the method is the use of the weakly encrypted measurement matrices which are generated when solving the optimization problem to localize the source. It must be noted that in this method an alternative key is required to secure the system.
{"title":"SecLoc: Encryption system based on compressive sensing measurements for location estimation","authors":"Dimitris Milioris, P. Jacquet","doi":"10.1109/INFCOMW.2014.6849210","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849210","url":null,"abstract":"In this paper we present an efficient encryption system based on Compressive Sensing, without the additional computational cost of a separate encryption protocol, when applied to indoor location estimation problems. The breakthrough of the method is the use of the weakly encrypted measurement matrices which are generated when solving the optimization problem to localize the source. It must be noted that in this method an alternative key is required to secure the system.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"78 1","pages":"171-172"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83606068","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.6849330
Giovanni Accongiagioco, E. Altman, E. Gregori, L. Lenzini
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.
{"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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849249
Bidi Ying, D. Makrakis
Location privacy is an important issue in location-based services. A large number of location cloaking algorithms have been proposed for protecting location privacy of users. However, these algorithms cannot be used in vehicular networks due to constrained vehicular mobility. In this paper, we propose a new method named Protecting Location Privacy with Clustering Anonymization (PLPCA) for location-based services in vehicular networks. This PLPCA algorithm starts with a road network transforming to an edge-cluster graph in order to conceal road information and traffic information, and then provides a cloaking algorithm based on A-anonymity and l-diversity as privacy metrics to further enclose a target vehicle's location. Simulation analysis shows our PLPCA has good performances like the strength of hiding of road information & traffic information.
{"title":"Protecting Location Privacy with Clustering Anonymization in vehicular networks","authors":"Bidi Ying, D. Makrakis","doi":"10.1109/INFCOMW.2014.6849249","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849249","url":null,"abstract":"Location privacy is an important issue in location-based services. A large number of location cloaking algorithms have been proposed for protecting location privacy of users. However, these algorithms cannot be used in vehicular networks due to constrained vehicular mobility. In this paper, we propose a new method named Protecting Location Privacy with Clustering Anonymization (PLPCA) for location-based services in vehicular networks. This PLPCA algorithm starts with a road network transforming to an edge-cluster graph in order to conceal road information and traffic information, and then provides a cloaking algorithm based on A-anonymity and l-diversity as privacy metrics to further enclose a target vehicle's location. Simulation analysis shows our PLPCA has good performances like the strength of hiding of road information & traffic information.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"305-310"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84806267","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.6849220
M. Li, Si Chen, K. Ren
The typical usage for phones is making calls. However, under certain scenarios, phone calls are inappropriate or intrusive when people are having a meeting, impractical when background noise level is too high or insecure under monitoring of other personals/parties. Typical solution to these problems is to send text-based messages. Yet, we argue that the most natural, efficient way for human-beings to communicate is via speech. In this work, we provide envision for our project, a non-intrusive, convenient and secure communication system. We utilize the front camera of smart phones, efficiency of cloud computing environment and state-of-the-art text-to-speech methods to create a robust visual speech recognition system to enable people to chat with lip movements. We present the current challenges, system architecture, initial findings and planned approaches to our problem.
{"title":"Enabling private and non-intrusive smartphone calls with LipTalk","authors":"M. Li, Si Chen, K. Ren","doi":"10.1109/INFCOMW.2014.6849220","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849220","url":null,"abstract":"The typical usage for phones is making calls. However, under certain scenarios, phone calls are inappropriate or intrusive when people are having a meeting, impractical when background noise level is too high or insecure under monitoring of other personals/parties. Typical solution to these problems is to send text-based messages. Yet, we argue that the most natural, efficient way for human-beings to communicate is via speech. In this work, we provide envision for our project, a non-intrusive, convenient and secure communication system. We utilize the front camera of smart phones, efficiency of cloud computing environment and state-of-the-art text-to-speech methods to create a robust visual speech recognition system to enable people to chat with lip movements. We present the current challenges, system architecture, initial findings and planned approaches to our problem.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"28 1","pages":"191-192"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80643695","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.6849310
Zhang Fu, O. Landsiedel, M. Almgren, M. Papatriantafilou
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.
{"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}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849261
MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.
{"title":"Online multi-resource scheduling for minimum task completion time in cloud servers","authors":"MohammadJavad NoroozOliaee, B. Hamdaoui, M. Guizani, Mahdi Ben Ghorbel","doi":"10.1109/INFCOMW.2014.6849261","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849261","url":null,"abstract":"We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes by relying on real Google data traces. Using this data, we show that our scheme outperforms the other schemes in terms of resource utilizations as well as average task queuing delays.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"375-379"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78326746","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.6849297
D. Mitra, Qiong Wang
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：