2015 IEEE 14th International Symposium on Network Computing and Applications最新文献

筛选
英文 中文
@migo: A Comprehensive Middleware Solution for Participatory Sensing Applications 面向参与式传感应用的综合中间件解决方案
R. Bachiller, Nelson Matthys, P. Cid, W. Joosen, D. Hughes, Kristof Van Laerhoven
{"title":"@migo: A Comprehensive Middleware Solution for Participatory Sensing Applications","authors":"R. Bachiller, Nelson Matthys, P. Cid, W. Joosen, D. Hughes, Kristof Van Laerhoven","doi":"10.1109/NCA.2015.26","DOIUrl":"https://doi.org/10.1109/NCA.2015.26","url":null,"abstract":"In the participatory sensing model, humans may serve as opportunistic sensors and flexible actuators while also consuming sensing services. Integrating humans into sensing systems has the potential to increase scale and reduce costs. However, contemporary participatory sensing software provides poor consideration of user dynamism, which includes: mobility across networks, mobility across devices and context-awareness. To address these limitations we propose the User Component and User Bindings. The former represents the user as a first class reconfigurable element of evolving and shared participatory sensing platforms. The latter allows the middleware to support multiple communications channels including Online Social Networks (OSN) to connect users with sensing applications. Our approach increases user participation, reduces out-of-context interactions and only consumes a limited amount of energy by sharing context information between applications. We support these claims by evaluating our approach on a two weeks experiment in which three participants take part in three concurrent participatory applications.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125856830","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
Efficiently Summarizing Data Streams over Sliding Windows 有效地总结滑动窗口上的数据流
Nicolo Rivetti, Yann Busnel, A. Mostéfaoui
{"title":"Efficiently Summarizing Data Streams over Sliding Windows","authors":"Nicolo Rivetti, Yann Busnel, A. Mostéfaoui","doi":"10.1109/NCA.2015.46","DOIUrl":"https://doi.org/10.1109/NCA.2015.46","url":null,"abstract":"Estimating the frequency of any piece of information in large-scale distributed data streams became of utmost importance in the last decade (e.g., in the context of network monitoring, big data, etc.). If some elegant solutions have been proposed recently, their approximation is computed from the inception of the stream. In a runtime distributed context, one would prefer to gather information only about the recent past. This may be led by the need to save resources or by the fact that recent information is more relevant. In this paper, we consider the sliding window model and propose two different (on-line) algorithms that approximate the items frequency in the active window. More precisely, we determine a (ε, δ)-additive-approximation meaning that the error is greater than ε only with probability δ. These solutions use a very small amount of memory with respect to the size N of the window and the number n of distinct items of the stream, namely, O(1/ε log 1/δ (log N+log n)) and O(1/τε log 1/δ (log N+log n)) bits of space, where τ is a parameter limiting memory usage. We also provide their distributed variant, i.e., considering the sliding window functional monitoring model. We compared the proposed algorithms to each other and also to the state of the art through extensive experiments on synthetic traces and real data sets that validate the robustness and accuracy of our algorithms.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971518","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}
引用次数: 23
Packet Erasure Multi-Channel Model for Video Streaming Applications 视频流应用的包擦除多通道模型
Ronit Nossenson, N. Nossenson
{"title":"Packet Erasure Multi-Channel Model for Video Streaming Applications","authors":"Ronit Nossenson, N. Nossenson","doi":"10.1109/NCA.2015.50","DOIUrl":"https://doi.org/10.1109/NCA.2015.50","url":null,"abstract":"Transmission of a video stream over multiple channels is an emerging technology for improving the streaming quality over wireless and best-effort networks. However, these channels might be statistically dependent and may share resources such as bottleneck links, or may cause mutual interference. As a result, the packet loss rate and packet delay over a specific channel can increase while activating additional channels. Modeling such a system without consideration of the negative impact of the channels statistical dependency can lead to underestimation of service performance problems. We suggest a new simple Markov model for multiple channels with statistical dependency. The suggested model captures the performance degradation over the individual channels, while activating multiple channels. Traces of real data are used to confirm the model validity.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130142801","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
Proactive Scalability and Management of Resources in Hybrid Clouds via Machine Learning 通过机器学习实现混合云中资源的主动可扩展性和管理
D. Avresky, P. D. Sanzo, Alessandro Pellegrini, B. Ciciani, Luca Forte
{"title":"Proactive Scalability and Management of Resources in Hybrid Clouds via Machine Learning","authors":"D. Avresky, P. D. Sanzo, Alessandro Pellegrini, B. Ciciani, Luca Forte","doi":"10.1109/NCA.2015.36","DOIUrl":"https://doi.org/10.1109/NCA.2015.36","url":null,"abstract":"In this paper, we present a novel framework for supporting the management and optimization of application subject to software anomalies and deployed on large scale cloud architectures, composed of different geographically distributed cloud regions. The framework uses machine learning models for predicting failures caused by accumulation of anomalies. It introduces a novel workload balancing approach and a proactive system scale up/scale down technique. We developed a prototype of the framework and present some experiments for validating the applicability of the proposed approaches.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314442","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
A Flexible and Lightweight BGP Route Injector to Multiple Peers 灵活、轻量级的多对等体BGP路由注入器
Jialiang Pan, Yaoqing Liu
{"title":"A Flexible and Lightweight BGP Route Injector to Multiple Peers","authors":"Jialiang Pan, Yaoqing Liu","doi":"10.1109/NCA.2015.28","DOIUrl":"https://doi.org/10.1109/NCA.2015.28","url":null,"abstract":"The paper proposes and implements a flexible and lightweight BGP injector (mBGPInjector) that can announce both offline and real-time BGP routes to multiple peers with various filtering options. mBGP Injector also supports dynamical BGP configuration changes, such as online bringing a peer down or up, applying custom filtering rules and announcing or withdrawing arbitrary BGP routes. The implemented mBGP Injector is a lightweight perl program that consists of a few functions to read, analyze and direct BGP routes to corresponding connected BGP peers in a large size of network (eBGP or iBGP). Experiments with our mBGP Injector tool satisfy the requirements we need for research and education and demonstrate effectiveness under realistic workloads. In addition, we designed and tested the tool in Global Environment for Network Innovations (GENI) environment, where researchers and educators can take advantage of shared resource request files to repeat the same experiments without involvement of ponderous settings and configurations.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132320617","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
A Fuzzy Controller to Optimize a Wireless Network Environment 优化无线网络环境的模糊控制器
G. Mateus, B. Wilges, M. Dantas, S. Nassar
{"title":"A Fuzzy Controller to Optimize a Wireless Network Environment","authors":"G. Mateus, B. Wilges, M. Dantas, S. Nassar","doi":"10.1109/NCA.2015.44","DOIUrl":"https://doi.org/10.1109/NCA.2015.44","url":null,"abstract":"In areas where there are large numbers of devices it's essential to continuously run a process of performance analysis in wireless networks. This is necessary if many devices attempt to transfer large amounts of data, or occupy the channel over long periods as this will probably degrade the capacity and performance of the network. Thus, this research presents a model to manage the parameters that can influence the quality of a wireless network environment, minimizing the loss of performance. The proposed model uses a fuzzy controller to dynamically adjust the maximum frame size that can be transmitted according to the characteristics of the transmission medium. The initial results of this research show that it is possible to enhance the performance of wireless networks by controlling parameters that have influence in the quality of the network.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126406314","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
Analyzing the Effect of Soft Handover on WLAN Usage Efficiency under Load Condition 负载条件下软切换对无线局域网使用效率的影响分析
Nitish K. Panigrahy, Sasthi C. Ghosh
{"title":"Analyzing the Effect of Soft Handover on WLAN Usage Efficiency under Load Condition","authors":"Nitish K. Panigrahy, Sasthi C. Ghosh","doi":"10.1109/NCA.2015.47","DOIUrl":"https://doi.org/10.1109/NCA.2015.47","url":null,"abstract":"With increasing popularity of wireless local area network (WLAN) and emerging real time applications, seamless mobility has become one of the primary concerns. Hence the choice of a proper handoff algorithm is of utmost importance. Previous work suggests that WLAN usage efficiency can act as a good metric to measure the performance of a handoff algorithm. We argue that in a multiple AP scenario, the load on each of the APs, the requested data rate of the mobile terminal (MT) and the soft handover have a significant impact on the usage efficiency. In this paper we present an analytical framework to measure the usage efficiency under both load condition and soft handover for a specific data rate request. Our approach is based on finding the circular region centered around an AP within which the requested data rate can be satisfied. The usage efficiency is then computed based on finding the union of all such circular regions.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"660 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120971821","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
Performance Evaluation of Mixed Traffic Scheduling Algorithm in LTE Network LTE网络混合流量调度算法的性能评价
A. Belghith, Wafa Ben Elmabrouk, Selem Trabelsi
{"title":"Performance Evaluation of Mixed Traffic Scheduling Algorithm in LTE Network","authors":"A. Belghith, Wafa Ben Elmabrouk, Selem Trabelsi","doi":"10.1109/NCA.2015.52","DOIUrl":"https://doi.org/10.1109/NCA.2015.52","url":null,"abstract":"In this paper, we propose a scheduling algorithm called MTSA that considers both real time and non-real time traffic Through extensive simulations, we evaluate the performance of MTSA and compare it with existing scheduling algorithms. We show that MTSA increases the percentage of real time packets served, decreases the percentage of real time packets rejected, and provides high total throughput while offering acceptable delay.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239058","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
Robustness of Multiple High Speed TCP CUBIC Connections under Severe Operating Conditions 苛刻运行条件下多个高速TCP立方连接的鲁棒性
Artur Pilimon, S. Ruepp, M. Berger
{"title":"Robustness of Multiple High Speed TCP CUBIC Connections under Severe Operating Conditions","authors":"Artur Pilimon, S. Ruepp, M. Berger","doi":"10.1109/NCA.2015.43","DOIUrl":"https://doi.org/10.1109/NCA.2015.43","url":null,"abstract":"We study the adaptation capabilities and robustness of the high-speed TCP CUBIC algorithm. For this purpose we consider a network environment with variable and high random packet loss and a large Bandwidth-Delay product, shared by multiple heterogeneous TCP connections. The analysis is based on and supported by packet-level simulations. The results show that the aggressive nature of CUBIC's nonlinear congestion window control principle causes a degradation of the time-average throughput at the moderate level of random packet loss even under increasing Round-Trip-Time of the flow. However, this algorithmic scalability and loss-free-time-dependent window growth allows recovering transmission rate faster in the high packet loss region due to the statistically lower number of dropped packets, compared to the moderate loss level.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126338412","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
A Failure Detector for k-Set Agreement in Dynamic Systems 动态系统中k集一致性的故障检测器
D. Jeanneau, Thibault Rieutord, L. Arantes, Pierre Sens
{"title":"A Failure Detector for k-Set Agreement in Dynamic Systems","authors":"D. Jeanneau, Thibault Rieutord, L. Arantes, Pierre Sens","doi":"10.1109/NCA.2015.45","DOIUrl":"https://doi.org/10.1109/NCA.2015.45","url":null,"abstract":"The k-set agreement problem is a generalization of the consensus problem where processes can decide up to k different values. Very few papers have tackled this problem in dynamic networks, and to the best of our knowledge, every algorithm proposed so far for k-set agreement in dynamic networks assumed synchronous communications or made strong failure pattern assumptions. Exploiting the formalism of the Time-Varying Graph model, this paper proposes a new quorum-based failure detector for solving k-set agreement in dynamic networks with asynchronous communications. We present two algorithms that implement this new failure detector using graph connectivity and message pattern assumptions. We also provide an algorithm for solving k-set agreement using our new failure detector.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126619215","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
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学术文献互助群
群 号:481959085
Book学术官方微信