2011 IEEE 10th International Symposium on Network Computing and Applications最新文献

筛选
英文 中文
Constrained Pricing for Cloud Resource Allocation 云资源分配的约束定价
Makhlouf Hadji, Wajdi Louati, D. Zeghlache
{"title":"Constrained Pricing for Cloud Resource Allocation","authors":"Makhlouf Hadji, Wajdi Louati, D. Zeghlache","doi":"10.1109/NCA.2011.64","DOIUrl":"https://doi.org/10.1109/NCA.2011.64","url":null,"abstract":"Constrained pricing in a cloud computing environment is addressed using game theory. The objective of the model and the game is to enable cloud providers to maximize their revenue while satisfying users by maximizing their utilities. The users net utility is modeled as a function of resource demand with a corresponding price. The game consists in the cloud provider suggesting differentiated prices according to demand and users updating their requests in view of the proposed price. The objective is to determine the optimal suggested prices by the cloud-provider and the optimal user demands. A theoretical model based on Stackelberg game is proposed and a Stackelberg/Nash equilibrium solution is found. Performance results show that rejecting a certain number of users is not the best decision to select. Cloud provider should deploy the right amount of resources to maintain good reputation while satisfying users' requirements.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126335404","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}
引用次数: 29
Quality Adjustable Query Processing Framework for Wireless Sensor Networks 无线传感器网络质量可调查询处理框架
Shaila Pervin, J. Kamruzzaman, G. Karmakar
{"title":"Quality Adjustable Query Processing Framework for Wireless Sensor Networks","authors":"Shaila Pervin, J. Kamruzzaman, G. Karmakar","doi":"10.1109/NCA.2011.63","DOIUrl":"https://doi.org/10.1109/NCA.2011.63","url":null,"abstract":"Existing in-network query processing techniques are categorized as approximation and aggregation based approaches. The former achieves lower query response delay at the expense of accuracy, while the latter reduces query response inaccuracy by executing queries at the actual sensor nodes resulting in longer delay. In this paper, we propose a query processing framework which is delay as well as accuracy aware and capable of dynamic adjustment to meet user/application requirements. When query response is required within specific delay, it provides approximated sensor data meeting the delay requirement. On the other hand, when query response accuracy is vital, it tolerates longer delay in acquiring response with the desired accuracy. To achieve this, we propose a novel method of constructing a delay aware spanning tree (DAST) based on query load and organizing sensor data with varied accuracy. Experimental results illustrate superiority of the proposed framework against competing approaches.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125869233","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
Detecting User-Visible Failures in Web-Sites by Using End-to-End Fine-Grained Monitoring: An Experimental Study 使用端到端细粒度监控检测网站中用户可见的故障:一项实验研究
C. Vaz, L. Silva, A. Dourado
{"title":"Detecting User-Visible Failures in Web-Sites by Using End-to-End Fine-Grained Monitoring: An Experimental Study","authors":"C. Vaz, L. Silva, A. Dourado","doi":"10.1109/NCA.2011.57","DOIUrl":"https://doi.org/10.1109/NCA.2011.57","url":null,"abstract":"Failure detection in Web Applications is a topic of paramount importance. There are several papers in the literature about end-to-end monitoring of web-sites. Most of those systems use a distributed set of probes, located in different places in the Internet, and conduct some remote checking of the main HTML pages of the web-sites. This approach seems viable and many web-sites are already using some commercial services that provide this type of monitoring. In this paper we present new insights about the nature of user-visible failures in web-sites. We conducted an experimental study in the Internet by monitoring a set of 20 well-known web-sites during a one-month period. The results achieved are interesting for the whole community that is studying the reliability of the Internet and Internet Sites.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130170095","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}
引用次数: 3
Performance Trade-Offs of a IEEE 802.21-Based Vertical Handover Decision Algorithm under Different Network Conditions 基于IEEE 802.21的垂直切换决策算法在不同网络条件下的性能权衡
J. Márquez-Barja, C. Calafate, Juan-Carlos Cano, P. Manzoni
{"title":"Performance Trade-Offs of a IEEE 802.21-Based Vertical Handover Decision Algorithm under Different Network Conditions","authors":"J. Márquez-Barja, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/NCA.2011.50","DOIUrl":"https://doi.org/10.1109/NCA.2011.50","url":null,"abstract":"Wireless technologies have been widely deployed in the last decade making users demand for continuous connectivity. Users not only demand being attached to a network, but possibly to the one with the highest performance, or at least to a network able to fulfill their requirements. To choose the best network among different candidates, the IEEE 802.21 standard has been developed. In this paper we aim at demonstrating the viability of performing Vertical Handover (VHO) processes based on the IEEE 802.21 protocol. To do so, we have evaluated a VHO strategy which considers network availability and maximum data rate in order to choose the best network candidate among the Wi-Fi, the WiMAX, and the UMTS. Moreover, throughout a set of experiments, we have also evaluated the maximum performance of the available networks.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133927295","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}
引用次数: 15
Treewidth and Hyperbolicity of the Internet 互联网的树宽和双曲性
F. D. Montgolfier, Mauricio Soto, L. Viennot
{"title":"Treewidth and Hyperbolicity of the Internet","authors":"F. D. Montgolfier, Mauricio Soto, L. Viennot","doi":"10.1109/NCA.2011.11","DOIUrl":"https://doi.org/10.1109/NCA.2011.11","url":null,"abstract":"We study the measurement of the Internet according to two graph parameters: tree width and hyper bolicity. Both tell how far from a tree a graph is. They are computed from snapshots of the Internet released by CAIDA, DIMES, AQUALAB, UCLA, Rocket fuel and Strasbourg University, at the AS or at the router level. On the one hand, the tree width of the Internet appears to be quite large and being far from a tree with that respect, reflecting some high degree of connectivity. This proves the existence of a well linked core in the Internet. On the other hand, the hyper bolicity (as a graph parameter) appears to be very low, reflecting a tree-like structure with respect to distances. Additionally, we compute the tree width and hyper bolicity obtained for classical Internet models and compare with the snapshots.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114156239","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}
引用次数: 66
Adaptive Profiling for Root-Cause Analysis of Performance Anomalies in Web-Based Applications 基于web的应用程序中性能异常的根本原因分析的自适应分析
J. Magalhães, L. Silva
{"title":"Adaptive Profiling for Root-Cause Analysis of Performance Anomalies in Web-Based Applications","authors":"J. Magalhães, L. Silva","doi":"10.1109/NCA.2011.30","DOIUrl":"https://doi.org/10.1109/NCA.2011.30","url":null,"abstract":"The most important factor in the assessment of the availability of a system is the mean-time to repair (MTTR). The lower the MTTR the higher the availability. A significant portion of the MTTR is spent in the detection and localization of the cause of the failure. One possible method that may provide good results in the root-cause analysis of application failures is run-time profiling. The major drawback of run-time profiling is the performance impact. In this paper we describe two algorithms for selective and adaptive profiling of web-based applications. The algorithms make use of a dynamic profiling interval and are mainly triggered when some of the transactions start presenting some symptoms of performance anomaly. The algorithms were tested under different types of degradation scenarios and compared to static sampling strategies. We observed through experimentation that the pinpoint of performance anomalies, supported by the data collected using the adaptive profiling algorithms, stills timely as with full-profiling while the response time overhead is reduced in almost 60%. When compared to a non-profiled version the response time overhead is less than 1.5%. These results show the viability of using run-time profiling to support quickly detection and pinpointing of performance anomalies and enable timely recovery.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116166158","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}
引用次数: 10
Tracking Coverage throughout Epochs with Bounded Uncertainty 具有有限不确定性的跟踪覆盖
Fan Zhou, Goce Trajcevski, Besim Avci
{"title":"Tracking Coverage throughout Epochs with Bounded Uncertainty","authors":"Fan Zhou, Goce Trajcevski, Besim Avci","doi":"10.1109/NCA.2011.17","DOIUrl":"https://doi.org/10.1109/NCA.2011.17","url":null,"abstract":"This work addresses the problem of managing the sensor-coverage and organizing the epochs in a manner that balances the trades-offs between the accuracy and energy consumptions during target tracking in Wireless Sensor Networks (WSN). While the typical target tracking approaches are based on movement prediction, we only assume a knowledge of some maximal speed of the target during certain time-intervals. This, in turn, restricts its whereabouts to a disk-bound area throughout such intervals. In such settings, we seek to determine a sensor cover, a subset of all the nodes that need to be awake, which ensures that the target can be detected during the given epoch. Towards this, we propose sensor-cover selection methodologies, Greedy Uncertain Moving Object coverage sensor set selection (GUMO) and PAttern Based coverage sensor set selection (PAB). GUMO is a heuristic maximizing the coverage gain at each step, while PAB is an approach based on optimal deployment pattern of sensor nodes achieving coverage of the disk area bounding the target's whereabouts. We conduct extensive simulations to evaluate the performance of the algorithms, and the results reveal that GUMO and PAB not only provide substantial energy saving due to reduction in the communications involved in selecting tracking participant-nodes and principal(s), while assuring a bounded error on the target's location.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543763","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
Optimum Clusters for Reliable and Energy Efficient Wireless Sensor Networks 可靠和节能无线传感器网络的最佳集群
A. Sadat, G. Karmakar
{"title":"Optimum Clusters for Reliable and Energy Efficient Wireless Sensor Networks","authors":"A. Sadat, G. Karmakar","doi":"10.1109/NCA.2011.61","DOIUrl":"https://doi.org/10.1109/NCA.2011.61","url":null,"abstract":"One of the challenging aspects for wireless sensor network (WSN) clustering is to estimate the optimal cluster number. Most WSN clustering techniques have used an a priori value to determine the cluster number. A few techniques, available at the literature, attempted to find the optimal cluster number by energy minimization. However, due to the assumption of lossless communication, these initiatives do not always converge to the minimum energy as wireless channels are error-prone. As wireless communication is always vulnerable to the signal interference, environmental noise, and so on, it suffers from data loss. To capture the characteristics of the communication phenomenon in a real context and have better reliability, we need to embed the link quality into the cluster number determination process. To address this issue, in this paper together with the energy, we incorporate link quality metric into the theoretical underpinning to achieve an optimal cluster number analytically and finally justified the result by simulation.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"72 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130328889","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}
引用次数: 5
Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication 不可靠通信下的互联网超级计算算法机制
Evgenia Christoforou, Antonio Fernández, Chryssis Georgiou, Miguel A. Mosteiro
{"title":"Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication","authors":"Evgenia Christoforou, Antonio Fernández, Chryssis Georgiou, Miguel A. Mosteiro","doi":"10.1109/NCA.2011.46","DOIUrl":"https://doi.org/10.1109/NCA.2011.46","url":null,"abstract":"This work, using a game-theoretic approach, considers Internet-based computations, where a master processor assigns, over the Internet, a computational task to a set of untrusted worker processors, and collects their responses. The master must obtain the correct task result, while maximizing its benefit. Building on prior work, we consider a framework where altruistic, malicious, and rational workers co-exist. In addition, we consider the possibility that the communication between the master and the workers is not reliable, and that workers could be unavailable assumptions that are very realistic for Internet-based master-worker computations. Within this framework, we design and analyze two algorithmic mechanisms that provide, when necessary, appropriate incentives to rational workers to act correctly, despite the malicious' workers actions and the unreliability of the network. These mechanisms are then applied to two realistic Internet-based master-worker settings, a SETI-like one and a contractor-based one, such as Amazon's mechanical turk.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124612564","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
Building Autonomically Scalable Services on Wide-Area Shared Computing Platforms 在广域共享计算平台上构建自主可扩展服务
Vinit Padhye, A. Tripathi
{"title":"Building Autonomically Scalable Services on Wide-Area Shared Computing Platforms","authors":"Vinit Padhye, A. Tripathi","doi":"10.1109/NCA.2011.54","DOIUrl":"https://doi.org/10.1109/NCA.2011.54","url":null,"abstract":"We present here mechanisms and models for building autonomically scalable and resilient services on wide‐area shared computing platforms in which resources at a node are allocated to competing users on fair‐share basis. There is no platform‐wide resource manager for the placement of users on different nodes. Building scalable services in such environments poses unique challenges due to fluctuations in the available resource capacities and node crashes. The service load may surge in a short time due to flash crowds. We present here models for estimating the service capacity under varying operating conditions. Autonomic scaling of service capacity is performed by dynamic control of the degree of service replication based on the estimated service capacity and the observed load. Furthermore adaptive load distribution mechanisms are needed because of the varying service capacities of the individual replicas. We present the results of our evaluations of these mechanisms on Planet Lab.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591849","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信