2010 Ninth IEEE International Symposium on Network Computing and Applications最新文献_第2页

Improving Conjunctive Query Routing in Unstructured P2P Networks 非结构化P2P网络中联合查询路由的改进

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.26

Wai Gen Yee, L. Nguyen, O. Frieder

引用次数: 0

A Network Based Approach to Malware Detection in Large IT Infrastructures 大型IT基础设施中基于网络的恶意软件检测方法

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.33

B. Kumar, C. Katsinis

{"title":"A Network Based Approach to Malware Detection in Large IT Infrastructures","authors":"B. Kumar, C. Katsinis","doi":"10.1109/NCA.2010.33","DOIUrl":"https://doi.org/10.1109/NCA.2010.33","url":null,"abstract":"Malware is code that has malicious intent and is designed for malicious purpose such as stealing confidential data, or obtaining root privileges on a system. The current approach to deal with malware threats such as virus and spyware is to use host based anti-malware software. However, this approach leads to many vulnerable machines since many users don't update their software, their virus signatures, and some even disable their software to avoid the system performance degradation caused by these software. Host based security software require a good deal of administration, with consistent needs for reconfiguration, management, and report analysis. With security administrators supporting an ever growing number of users, such an approach has become impractical. In this paper, we present a novel network based malware detection architecture that uses host security vectors to protect host machines without any intervention from hosts. This architecture provides another layer of security and can complement existing host based solutions. Only central detection server needs to be actively managed instead of individual hosts - hence providing more manageable solution for large IT infrastructures.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284632","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

Under the Cloud: A Novel Content Addressable Data Framework for Cloud Parallelization to Create and Virtualize New Breeds of Cloud Applications 云下:一种新颖的内容可寻址数据框架，用于云并行化，以创建和虚拟化新型云应用程序

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.29

Amir H. Basirat, A. Amin, Asad I. Khan

引用次数: 6

Partition Participant Detector with Dynamic Paths in Mobile Networks 移动网络中具有动态路径的分区参与者检测器

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.40

L. Arantes, Pierre Sens, Gaël Thomas, D. Conan, Léon Lim

引用次数: 7

GROK: A Practical System for Securing Group Communications GROK:一个实用的系统，以确保集团通信

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.20

Joseph A. Cooley, R. Khazan, Benjamin Fuller, G. Pickard

引用次数: 8

Detection of Performance Anomalies in Web-Based Applications web应用程序中性能异常的检测

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.15

J. Magalhães, L. Silva

引用次数: 26

Location Awareness Rescue System: Support for Mountain Rescue Teams 位置感知救援系统:支持山地救援队

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.44

Panagiotis Georgopoulos, B. McCarthy, C. Edwards

{"title":"Location Awareness Rescue System: Support for Mountain Rescue Teams","authors":"Panagiotis Georgopoulos, B. McCarthy, C. Edwards","doi":"10.1109/NCA.2010.44","DOIUrl":"https://doi.org/10.1109/NCA.2010.44","url":null,"abstract":"Aiding the efficient collaboration and coordination of rescue teams is a difficult task especially in a mountainous region. Challenges emerge from quickly alerting and debriefing rescuers, to deploying them effectively, and also coordinating and monitoring them in the rural search domain. Knowing the exact location of the rescuers and vehicles involved in a mountain search and rescue mission is a key element for the successful progress of the mission and aids the mission coordinator, who usually stays at the headquarters, to take fast and informed decisions. In this paper we present the devised Location Awareness Rescue System that targets the aforementioned challenges, and provides location information and updates of the rescuers in a real time manner as they are deployed in the rescue domain overlaid onto interactive maps. The results from our tests show that our system is a proficient presence management solution that can provide precise location information by recovering from any periodic or total connectivity loss, and also improve and support mountain rescue teams leading to more effective and successful missions.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123705150","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}

引用次数: 9

Prediction of Job Resource Requirements for Deadline Schedulers to Manage High-Level SLAs on the Cloud 预测用于管理云上的高级sla的截止日期调度器的作业资源需求

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.28

Gemma Reig, Javier Alonso, Jordi Guitart

{"title":"Prediction of Job Resource Requirements for Deadline Schedulers to Manage High-Level SLAs on the Cloud","authors":"Gemma Reig, Javier Alonso, Jordi Guitart","doi":"10.1109/NCA.2010.28","DOIUrl":"https://doi.org/10.1109/NCA.2010.28","url":null,"abstract":"For a non IT expert to use services in the Cloud is more natural to negotiate the QoS with the provider in terms of service-level metrics --e.g. job deadlines-- instead of resource-level metrics --e.g. CPU MHz. However, current infrastructures only support resource-level metrics --e.g. CPU share and memory allocation-- and there is not a well-known mechanism to translate from service-level metrics to resource-level metrics. Moreover, the lack of precise information regarding the requirements of the services leads to an inefficient resource allocation --usually, providers allocate whole resources to prevent SLA violations. According to this, we propose a novel mechanism to overcome this translation problem using an online prediction system which includes a fast analytical predictor and an adaptive machine learning based predictor. We also show how a deadline scheduler could use these predictions to help providers to make the most of their resources. Our evaluation shows: i) that fast algorithms are able to make predictions with an 11% and 17% of relative error for the CPU and memory respectively; ii) the potential of using accurate predictions in the scheduling compared to simple yet well-known schedulers.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039933","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}

引用次数: 58

Dynamic Web Service Composition Middleware: A New Approach for QoS Guarantees 动态Web服务组合中间件:一种新的QoS保证方法

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.30

B. Kuehne, J. C. Estrella, M. Peixoto, T. C. Tavares, R. Santana, M. J. Santana

引用次数: 2

Fault-Tolerant Deadlock-Free Adaptive Routing for Any Set of Link and Node Failures in Multi-cores Systems 多核系统中任意链路和节点故障的容错无死锁自适应路由

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.14

Fabien Chaix, D. Avresky, N. Zergainoh, M. Nicolaidis

{"title":"Fault-Tolerant Deadlock-Free Adaptive Routing for Any Set of Link and Node Failures in Multi-cores Systems","authors":"Fabien Chaix, D. Avresky, N. Zergainoh, M. Nicolaidis","doi":"10.1109/NCA.2010.14","DOIUrl":"https://doi.org/10.1109/NCA.2010.14","url":null,"abstract":"Future applications will require processors with many cores communicating through a regular interconnection network. Meanwhile, as the Deep submicron technology fore- shadows highly defective chips era, fault-tolerant designs become compulsory. In particular, the fault tolerance of a core interconnect is critical, and inevitably increases its complexity. In this paper, we present a novel adaptive routing algorithm that is able to route messages in the presence of any set of multiple nodes and links failures, as long as a path exists. Compared to the existing solutions, the proposed algorithm provides fault tolerance without using any routing table. It is scalable and can be applied to multicore chips with a 2D mesh core interconnect of any size. The algorithm is deadlock-free and avoids infinite looping in fault-free and faulty 2D meshes, based on Virtual Networks and Virtual Channels. We simulated the proposed algorithm using the worst case scenario, regarding the traffic patterns and the failure rate up to 40%. Experimentation results confirmed that the algorithm tolerates multiple failures even in the most extreme failure patterns. Additionally, we monitored the trade off between the fault tolerance and the average latency for faulty cases, as measurement of the performance degradation. The algorithm detects the interconnects partitioning and enables \"preferred paths\" for streaming applications.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129572076","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}

引用次数: 39