2011 IEEE 10th International Symposium on Network Computing and Applications最新文献_第5页

Predicting Software Anomalies Using Machine Learning Techniques 使用机器学习技术预测软件异常

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.29

Javier Alonso, L. B. Muñoz, D. Avresky

引用次数: 64

Beyond Power Proportionality: Designing Power-Lean Cloud Storage 超越功率比例:设计低功耗云存储

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.27

L. Ganesh, Hakim Weatherspoon, K. Birman

引用次数: 6

From a Database Management System to a Policy-Based Network Management System 从数据库管理系统到基于策略的网络管理系统

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.59

T. Su, Chen-Feng Chiu

引用次数: 0

End-to-End Data Deduplication for the Mobile Web 端到端移动Web重复数据删除

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.60

Ricardo Filipe, J. Barreto

引用次数: 7

Two-Party Mobile Authentication Protocols for Wireless Roaming Networks 无线漫游网络的两方移动认证协议

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.48

A. Almuhaideb, P. D. Le, B. Srinivasan

引用次数: 5

Thread-Based Live Checkpointing of Virtual Machines 基于线程的虚拟机实时检查点

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.28

Vasinee Siripoonya, K. Chanchio

{"title":"Thread-Based Live Checkpointing of Virtual Machines","authors":"Vasinee Siripoonya, K. Chanchio","doi":"10.1109/NCA.2011.28","DOIUrl":"https://doi.org/10.1109/NCA.2011.28","url":null,"abstract":"Virtual machine check pointing is the mechanism to save virtual machine state to a file for later recovery. Traditional check pointing mechanisms can suffer a long delay and cause a long disruption of services since they have to stop virtual machines to save state, which could be large. In this study, a novel Thread-based Live Check pointing (TLC) mechanism is proposed. This mechanism leverages the pre-copy live migration mechanism introducing a checkpoint thread, which is responsible for the majority of the check pointing activities. While the checkpoint thread is saving the virtual machine state to persistent storage, the virtual machine thread is allowed to progress with normal execution. However, the virtual machine thread will be periodically interrupted to incrementally copy dirty memory pages to a hash table. The interruptions will occur until the final stage of check pointing is reached. This approach is implemented in KVM and its performance evaluations are conducted using NAS parallel benchmarks. Experiments show that this approach can provide high levels of virtual machine responsiveness during check pointing. It can also reduce the check pointing overheads to as low as 0.53 times of that of the traditional approach, when operating on a virtual machine running memory intensive workloads.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"53 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":"132832896","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}

引用次数: 16

An Enhanced-MDP Based Vertical Handoff Algorithm for QoS Support over Heterogeneous Wireless Networks 基于增强mdp的异构无线网络QoS支持垂直切换算法

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.49

Shusmita Anwar Sharna, M. R. Amin, M. M. Murshed

{"title":"An Enhanced-MDP Based Vertical Handoff Algorithm for QoS Support over Heterogeneous Wireless Networks","authors":"Shusmita Anwar Sharna, M. R. Amin, M. M. Murshed","doi":"10.1109/NCA.2011.49","DOIUrl":"https://doi.org/10.1109/NCA.2011.49","url":null,"abstract":"Vertical handoff plays an important role in guaranteeing users to be always connected in an overlapped multi-network environment. During the vertical handoff procedure, handoff decision is the most important step that affects the normal working of communication. An incorrect handoff decision or selection of a non-optimal network may result in undesirable effects such as higher costs, poor quality of service (QoS) experience, and even dropped communication. Among the existing vertical handoff decision algorithms, the Markov Decision Process (MDP) based algorithm by Stevens-Navarro et al. is promising due to its ability to achieve the optimal expected reward. However, the reward function used by this algorithm is flawed as it favors reducing expected number of vertical handoffs at the expense of diminished expected values of other QoS parameters. This paper presents an extended MDP based algorithm (EMDP) with novel reward function formulation. Analysis shows that EMDP outperforms the MDP based algorithm in terms of improved expected values of all QoS parameters considered while keeping the vertical handoff number reasonably low.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"2 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":"134072279","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}

引用次数: 17

SYNI - TCP Hole Punching Based on SYN Injection 基于SYN注入的SYN - TCP打孔

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.66

Sebastian Holzapfel, Matthäus Wander, Arno Wacker, Torben Weis

引用次数: 6

Clustering SOAP Web Services on Internet Computing Using Fast Fractals 基于快速分形的互联网计算上的SOAP Web服务聚类

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.65

Dhiah Al-Shammary, I. Khalil, L. George

{"title":"Clustering SOAP Web Services on Internet Computing Using Fast Fractals","authors":"Dhiah Al-Shammary, I. Khalil, L. George","doi":"10.1109/NCA.2011.65","DOIUrl":"https://doi.org/10.1109/NCA.2011.65","url":null,"abstract":"The interoperability of Web services has resulted in its adoption for recently-emerging cloud platforms. SOAP (Simple Object Access Protocol) is considered as the main platform independent communication tool for the Cloud Web service. Generally, Cloud Web services suffer performance bottlenecks and congestions that are mainly caused by the encoding of XML messages as they are bigger than the real payloads. In this paper, Fractal clustering model is proposed to compute the Fractal clustering similarity of SOAP messages in order to cluster them and enable the aggregation of SOAP messages to significantly reduce the size of the aggregated SOAP messages. Furthermore, as Fractal is a well-known as a time-consuming technique especially for large dataset, two fast Fractal clustering models have been proposed that are aiming to reduce the required clustering time. The proposed fast Fractal models have tremendously outperformed the classical Fractal model in terms of the processing time and have outperformed both K-means and PCA combined with K-means models in terms of both the processing time and SOAP messages size reduction.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"79 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":"114848379","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

SCAN: An Efficient Decoding Algorithm for RAID-6 Codes SCAN:一种高效的RAID-6码解码算法

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.20

Jianqiang Luo, Lihao Xu

{"title":"SCAN: An Efficient Decoding Algorithm for RAID-6 Codes","authors":"Jianqiang Luo, Lihao Xu","doi":"10.1109/NCA.2011.20","DOIUrl":"https://doi.org/10.1109/NCA.2011.20","url":null,"abstract":"Recent studies show hard disk drives fail much more often in real systems than specified in their data-sheets, and RAID-5 may not be able to provide necessary reliability for practical systems. It is desirable to have disk arrays and clustered storage systems with higher data redundancy, such as RAID-6. Meanwhile, latest research also indicates that sector failures become a threat to data reliability in storage systems. As a result, disk failures in RAID-6 systems become complex, and call for efficient decoding approaches to recover data when disk failures take place. This paper proposes a simple and efficient decoding algorithm to reconstruct data from disk failures for RAID-6 systems. First, for many well known RAID-6 codes, we provide the conditions to determine the recoverability of disk failures by using Tanner graph. The covered RAID-6 codes include X-code, EVENODD, and RDP. Then, a generic failure decoding algorithm called SCAN algorithm is derived. The SCAN algorithm is able to efficiently reconstruct data for any recoverable disk failures. Extensive performance evaluation shows the SCAN algorithm achieves higher performance than Matrix Method, another general decoding algorithm. Hence, the SCAN algorithm is an attractive decoding algorithm to be integrated into RAID-6 systems.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"40 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":"115786273","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