2012 IEEE 11th International Symposium on Network Computing and Applications最新文献

Two-Dimensional Dynamic Loop Scheduling Schemes for Computer Clusters 计算机集群的二维动态循环调度方案

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.36

Anthony T. Chronopoulos, Satish Penmatsa, Naveen Jayakumar, Eric Ogharandukun

引用次数: 2

A Density-Based Anomaly Detection Method for MapReduce 基于密度的MapReduce异常检测方法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.15

Kai Wang, Y. Wang, Bo Yin

引用次数: 6

The Impact of User's Dynamic Behavior on Web Performance 用户动态行为对Web性能的影响

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.9

R. Peña-Ortiz, J. A. Gil, J. Sahuquillo, A. Pont

{"title":"The Impact of User's Dynamic Behavior on Web Performance","authors":"R. Peña-Ortiz, J. A. Gil, J. Sahuquillo, A. Pont","doi":"10.1109/NCA.2012.9","DOIUrl":"https://doi.org/10.1109/NCA.2012.9","url":null,"abstract":"The increasing popularity of web applications has introduced a new paradigm where users are no longer passive web consumers but they become active contributors to the Web, specially in the contexts of social networking, blogs, wikis or e-commerce. In this new paradigm, contents and services are even more dynamic, which consequently increases the level of dynamism in user's behavior. Moreover, this trend is expected to rise in the incoming Web. This dynamism is a major adversity to define and model representative web workload, in fact, this characteristic is not fully represented in the most of the current web workload generators. This work proves that the web user's dynamic behavior is a crucial point that must be addressed in web performance studies in order to accurately estimate system performance indexes. In this paper, we analyze the effect of using a more realistic dynamic workload on the web performance metrics. To this end, we evaluate a typical e-commerce scenario and compare the results obtained using dynamic workload instead of traditional workloads. Experimental results show that, when a more dynamic and interactive workload is taken into account, performance indexes can widely differ and noticeably affect the stress borderline on the server. For instance, the processor usage can increase 20% due to dynamism, affecting negatively average response time perceived by users, which can also turn in unwanted effects in marketing and fidelity policies.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897379","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

A New Family of Hybrid Topologies for Large-Scale Interconnection Networks 一种新的用于大规模互连网络的混合拓扑

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.22

Roberto Peñaranda, Crispín Gómez Requena, M. E. Gómez, P. López, J. Duato

{"title":"A New Family of Hybrid Topologies for Large-Scale Interconnection Networks","authors":"Roberto Peñaranda, Crispín Gómez Requena, M. E. Gómez, P. López, J. Duato","doi":"10.1109/NCA.2012.22","DOIUrl":"https://doi.org/10.1109/NCA.2012.22","url":null,"abstract":"In large supercomputers the topology of the interconnection network is a key design issue that impacts the performance and cost of the whole system. Direct topologies provide a reduced hardware cost, but as the number of dimensions is conditioned by 3D wiring restrictions, a high number of nodes per dimension is used, which increases communication latency and reduces network throughput. On the other hand, indirect topologies can provide better performance for large network sizes, but at the cost of a high amount of switches and links. In this paper we propose a new family of topologies that combines the best features of both direct and indirect topologies to efficiently connect an extremely high number of nodes. In particular, we propose an n-dimensional topology where the nodes of each dimension are connected through a small indirect topology. This combination results in a family of topologies that provides high performance, with latency and throughput figures of merit close to indirect topologies, but with a lower hardware cost. In particular, it is able to double the throughput obtained per switching element of indirect topologies. Moreover, the layout of the topology is much simpler than in indirect topologies. Indeed, its fault-tolerance degree is equal or higher than the one for direct and indirect topologies.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"12 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564738","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}

引用次数: 14

LooCI: The Loosely-coupled Component Infrastructure 松散耦合的组件基础设施

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.30

D. Hughes, K. Thoelen, Jef Maerien, Nelson Matthys, Wouter Horré, P. Cid, Christophe Huygens, Sam Michiels, W. Joosen

引用次数: 41

A Performance Evaluation of HRAN: A Hybrid Routing Protocol Using Bloom Filters for Wireless Mobile Ad Hoc Networks 基于布隆滤波器的无线移动自组网混合路由协议HRAN的性能评估

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.17

J. Trindade, T. Vazão

引用次数: 2

A Localized Algorithm for the Maximum Lifetime Broadcast Problem with Asymmetric Edge Costs 边缘代价不对称的最大生存期广播问题的局部算法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.43

Bruno Nunes, Frederico J. R. Barboza, F. M. A. Silva

引用次数: 1

A Novel Associative Model of Data: Toward a Distributed Large-Scale Data Processing Scheme for Future Computer Clouds 一种新的数据关联模型:面向未来计算机云的分布式大规模数据处理方案

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.50

Amir H. Basirat, Asad I. Khan

{"title":"A Novel Associative Model of Data: Toward a Distributed Large-Scale Data Processing Scheme for Future Computer Clouds","authors":"Amir H. Basirat, Asad I. Khan","doi":"10.1109/NCA.2012.50","DOIUrl":"https://doi.org/10.1109/NCA.2012.50","url":null,"abstract":"Existing cloud frameworks involve isolating low-level operations within an application for data distribution and partitioning. This limits their applicability for many applications with complex data dependency considerations. This paper aims to explore new methods of partitioning and distributing data in the cloud by fundamentally re-thinking the way in which future data management models will need to be developed on the Internet. Loosely-coupled associative computing techniques, which have so far not been considered, can provide the break-through needed for a distributed data management scheme. Using a novel lightweight associative memory algorithm known as Edge Detecting Hierarchical Graph Neuron (Edge HGN), data retrieval/processing can be modeled as a pattern recognition problem, conducted across multiple records within a single-cycle, utilizing a parallel approach. The proposed model envisions a distributed data management scheme for large-scale data processing and database updating that is capable of providing scalable real-time recognition and processing with high accuracy while being able to maintain low computational cost in its function.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"393 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128934723","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

Anomaly Detection Techniques for Web-Based Applications: An Experimental Study 基于web应用的异常检测技术:实验研究

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.27

J. Magalhães, L. Silva

{"title":"Anomaly Detection Techniques for Web-Based Applications: An Experimental Study","authors":"J. Magalhães, L. Silva","doi":"10.1109/NCA.2012.27","DOIUrl":"https://doi.org/10.1109/NCA.2012.27","url":null,"abstract":"The web-based applications are exposed to a large spectrum of factors that may affect their availability and performability. The mean-time-to-detect (MTTD) and the mean-time-to-repair (MTTR) are considered of utmost importance to reduce the failure impacts. In this context, the combination of multiple monitoring techniques is commonly adopted to provide IT staff with information useful for timely detection and recovery from the failures. In this paper we provide an experimental study about the detection abilities provided by the monitoring tools that are being used nowadays in web-based applications. Besides the system-level, end-to-end and container-level monitoring techniques we incorporate an application-level monitoring technique. This technique provides the detection of performance anomalies by performing a correlation analysis among application parameters collected by an aspect-oriented program. The detection latency, the number of end-users affected, the coverage analysis and the overhead achieved by each monitoring technique, was evaluated considering different anomaly scenarios. Despite the importance of the monitoring techniques complementarity, the results achieved by the application-level monitoring are very interesting: it has detected 100% of the anomaly scenarios tested, for 73% of the anomalies it was the fastest detection technique, and due to the low detection latency it contributes to reduce the number of end-users experiencing the anomalies.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127721990","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

Local Algorithms for Robust Mission Realization in Large-Scale Disconnected Networks 大规模非连通网络中鲁棒任务实现的局部算法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.48

Michel Charpentier, R. Bartos, Ying Li

引用次数: 1