检索结果-内蒙古大学图书馆

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ali A. Yassin Hai Jin Ayad Ibrahim Weizhong Qiang Deqing Zou Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781467309745

An era of cloud computing allows users to profit from many privileges. However, there are several new security challenges. In fact, anonymous password authentication in the traditional setting has been suffered from many inherent drawbacks such as ease of exposure to malicious attacks and users registered their passwords in the server. Our scheme proposes the phenomenal context according to three main components: data owner, users, and service provider in cloud where users do not need to register their passwords in the service provider. Moreover, the data owner is contributed to make secure decisions, so that he manages the significant keys to other components distributedly. The proposal enjoys several advantages such as preserving privacy of password, unlink ability, and secrecy of session key. We have given a mechanism to prove the identity of the users authenticated without a need to reveal their passwords. Our approach has been achieved good results of reliability, and validity for cloud password authentication. The experimental results show an effective level of performance.

关键词： Authentication Servers Encryption Privacy Dictionaries Zinc

来源：评论

学校读者我要写书评

暂无评论

Assessing MapReduce for Internet computing: A Comparison of Hadoop and BitDew-MapReduce

Assessing MapReduce for Internet Computing: A Comparison of ...

引用

International Workshop on grid computing

作者： Lu Lu Hai Jin Xuanhua Shi Gilles Fedak Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China INRIA Universitý of Lyon Lyon France

MapReduce is emerging as an important programming model for data-intensive application. Adapting this model to desktop grid would allow taking advantage of the vast amount of computing power and distributed storage to execute new range of application able to process enormous amount of data. In 2010, we have presented the first implementation of MapReduce dedicated to Internet Desktop grid based on the BitDew middleware. In this paper, we present new optimizations to BitDew-MapReduce (BitDew-MR): aggressive task backup, intermediate result backup, task re-execution mitigation and network failure hiding. We propose a new experimental framework which emulates key fundamental aspects of Internet Desktop grid. Using the framework, we compare BitDew-MR and the open-source Hadoop middleware on grid5000. Our experimental results show that 1) BitDew-MR successfully passes all the stress-tests of the framework while Hadoop is unable to work in typical wide-area network topology which includes PC hidden behind firewall and NAT; 2) BitDew-MR outperforms Hadoop performances on several aspects: scalability, fairness, resilience to node failures, and network disconnections.

关键词： Peer to peer computing Runtime Internet Dynamic scheduling Distributed databases Heart beat Data processing

来源：评论

学校读者我要写书评

暂无评论

Probabilistic critical path identification for cost-effective monitoring of service-based systems

Probabilistic critical path identification for cost-effectiv...

引用

2012 IEEE 9th International Conference on services computing, SCC 2012

作者： He, Qiang Han, Jun Yang, Yun Schneider, Jean-Guy Jin, Hai Versteeg, Steve Faculty of Information and Communication Technologies Swinburne University of Technology Melbourne VIC 3122 Australia Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China CA Labs. Melbourne VIC Australia

ISBN: (纸本)9780769547534

When operating in volatile environments, service-based systems (SBSs) that are built through dynamic composition of component services must be monitored in order to guarantee the response times of the SBSs. In particular, the critical path of a composite SBS, i.e., the execution path in the service composition with the maximum execution time, should be prioritised in cost-effective monitoring as it determines the response time of the SBS. In volatile operating environments, the critical path of a SBS is probabilistic. As such, it is important to estimate the criticalities of the execution paths and the component services, i.e., the probabilities that they are critical, to decide which parts of the system to monitor. In this paper, we propose a novel approach to the identification of Probabilistic Critical Path for Service-based Systems (PCP-SBS). PCP-SBS takes into account the probabilistic nature of the critical path and calculates path criticalities in the context of service composition. We evaluate PCP-SBS experimentally using SBSs that are synthetically composed based on a real-world Web service dataset. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Maestro: Replica-aware map scheduling for MapReduce 12

Maestro: Replica-aware map scheduling for MapReduce

引用

12th IEEE/ACM International Symposium on cluster, Cloud and grid computing, CCgrid 2012

作者： Ibrahim, Shadi Jin, Hai Lu, Lu He, Bingsheng Antoniu, Gabriel Wu, Song Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China INRIA Rennes - Bretagne Atlantique Rennes 35000 France School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769546919

MapReduce has emerged as a leading programming model for data-intensive computing. Many recent research efforts have focused on improving the performance of the distributed frameworks supporting this model. Many optimizations are network-oriented and most of them mainly address the data shuffling stage of MapReduce. Our studies with Hadoop demonstrate that, apart from the shuffling phase, another source of excessive network traffic is the high number of map task executions which process remote data. That leads to an excessive number of useless speculative executions of map tasks and to an unbalanced execution of map tasks across different machines. All these factors produce a noticeable performance degradation. We propose a novel scheduling algorithm for map tasks, named Maestro, to improve the overall performance of the MapReduce computation. Maestro schedules the map tasks in two waves: first, it fills the empty slots of each data node based on the number of hosted map tasks and on the replication scheme for their input data, second, runtime scheduling takes into account the probability of scheduling a map task on a given machine depending on the replicas of the task's input data. These two waves lead to a higher locality in the execution of map tasks and to a more balanced intermediate data distribution for the shuffling phase. In our experiments on a 100-node cluster, Maestro achieves around 95% local map executions, reduces speculative map tasks by 80% and results in an improvement of up to 34% in the execution time. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

QoS-Driven Service Selection for Multi-tenant SaaS

QoS-Driven Service Selection for Multi-tenant SaaS

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Qiang He Jun Han Yun Yang John Grundy Hai Jin Faulty of Information and Communication Technologies Swinburne University of Technology Melbourne Australia Services Computing Technology and Systems Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781467328920

Cloud-based software applications (Software as a Service - SaaS) for multi-tenant provisioning have become a major development paradigm in Web engineering. Instead of serving a single end-user, a multi-tenant SaaS provides multiple end-users with the same functionality but with potentially different quality-of-service (QoS) values. The service selection for such a SaaS is a complex decision-making process which involves a number of stakeholders with different QoS requirements. SaaS developers need to compose services with different QoS values to meet end-users' different multidimensional QoS constraints for the SaaS. Furthermore, they also need to satisfy SaaS providers' optimisation goals for the SaaS, such as least resource cost and best system performance. Existing QoS-aware service selection approaches are oriented at a single tenant. They do not consider the characteristics of multi-tenant SaaS and hence are ineffective and inefficient when applied to compose multi-tenant SaaS. In this paper, we introduce a novel QoS-driven approach for helping SaaS developers select the services for composing multi-tenant SaaS, which achieves SaaS providers' optimisation goals while fulfilling the end-users' different levels of QoS constraints. The proposed approach is evaluated using an example SaaS synthetically generated based on a dataset of real-world Web services. Experimental results show that our approach significantly outperforms existing approaches in terms of both effectiveness and performance.

关键词： Quality of service Optimization Web services Business Time factors Greedy algorithms Linear programming

来源：评论

学校读者我要写书评

暂无评论

Audio-on-demand over wireless sensor networks 12

Audio-on-demand over wireless sensor networks

引用

International Workshop on Quality of Service

作者： Hanhua Chen Hai Jin Lingchao Guo Shaoliang Wu Tao Gu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Mathematics and Computer Science University of Southern Denmark Odense M Denmark

ISBN: (纸本)9781467312981

Audio represents one of the most appealing yet least exploited modalities in wireless sensor networks, due to the potentially extremely large data volumes and limited wireless capacity. Therefore, how to effectively collect audio sensing information remains a challenging problem. In this paper, we propose a new paradigm of audio information collection based on the concept of audio-on-demand. We consider a sink-free environment targeting for disaster management, where audio chunks are stored inside the network for retrieval. The difficulty is to guarantee a high search success rate without infrastructure support. To solve the problem, we design a novel replication algorithm that deploys an optimal number of O(√n) replicas across the sensor network. We prove the optimality of the energy consumption of the algorithm, and use real testbed experiments and extensive simulations to evaluate the performance and efficiency of our design. The experimental results show that our design can provide satisfactory quality of audio-on-demand service with short startup latency and slight playback jitter. Extensive simulation results show that this design achieves a search success rate of 98% while reducing the search energy consumption by an order of magnitude compared with existing schemes.

关键词： Acoustics Wireless sensor networks Vectors Ash Base stations Distributed databases Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Minimizing inter-server communications by exploiting self-similarity in online social networks

Minimizing inter-server communications by exploiting self-si...

引用

International Conference on Network Protocols

作者： Hanhua Chen Hai Jin Ning Jin Tao Gu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Mathematics and Computer Science University of Southern Denmark Odense M Denmark

ISBN: (纸本)9781467324458

Efficiently operating on relevant data for users in large-scale online social network (OSN) systems is a challenging problem. Storage systems used by popular OSN systems often rely on key-value stores, where randomly partitioning the data of users among servers across the data centers is the defacto standard. Although by using DHTs, the random partition scheme is highly scalable for hosting a large number of users, it leads to costly inter-server communications across data centers due to the complexity of interconnection and interaction between OSN users. In this paper, we explore how to reduce the inter-server communications by retaining the simple and robust nature of OSNs. We propose a data placement solution atop OSN systems to divide users among servers according to the interaction-locality-based structure. Our approach exploits a simple, yet powerful principle of OSN interactions, self-similarity, which reveals that the inter-server communication cost is minimized under such intrinsic structure. Our algorithm avoids a significant amount of inter-server traffic as well as achieves load balance among servers across the data centers. We demonstrate the existence of self-similarity in large-scale Facebook traces including 10 million Facebook users and 24 million interaction events. We conduct comprehensive trace-driven simulations to evaluate this design exploiting the unique feature of self-similarity. Results show that our scheme significantly reduces the traffic and latency of the existing schemes.

关键词： Facebook Communities Servers Merging clustering algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Critical Path Identification for Cost-Effective Monitoring of Service-Based Systems

Probabilistic Critical Path Identification for Cost-Effectiv...

引用

IEEE International Conference on services computing (SCC)

作者： Qiang He Jun Han Yun Yang Jean-Guy Schneider Hai Jin Steve Versteeg Faculty of Information and Communication Technologies Swinburne University of Technology Melbourne Australia Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China CA Laboratories Melbourne Australia

关键词： Monitoring Scattering Time factors Timing Probability Probabilistic logic Runtime

来源：评论

学校读者我要写书评

暂无评论

VMStore: Distributed storage system for multiple virtual machines

引用

Science China(Information Sciences) 2011年第6期54卷 1104-1118页

作者： LIAO XiaoFei, LI He, JIN Hai , HOU HaiXiang, JIANG Yue & LIU HaiKun services computing technology and System lab, cluster and grid computing lab, School of Computer Science and technology, Huazhong University of Science and technology, Wuhan 430074, China 1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Desktop virtualization is a very hot concept in both industry and academic communities. Since virtualized desktop system is based on multiple virtual machines (VM), it is necessary to design a distributed storage system to manage the VM images. In this paper, we design a distributed storage system, VMStore, by taking into account three important characteristics: high performance VM snapshot, booting optimization from multiple images and redundancy removal of images data. We adopt a direct index structure of blocks for VM snapshots to speed up VM booting performance significantly; provide a distribute storage structure with good bandwidth scalability by dynamically changing the number of storage nodes; and propose a data preprocessing strategy with intelligent object partitioning techniques, which would eliminate duplication more effectively. Performance analysis for VMStore focuses on two metrics: the speedup of VM booting and the overhead of de-duplication. Experimental results show the efficiency and effectiveness of VMStore.

关键词： virtualization virtualized desktop distributed storage

来源：评论

学校读者我要写书评

暂无评论

Uniform information service interoperation framework among heterogeneous grids

引用

Journal of Networks 2011年第9期6卷 1359-1366页

作者： Tao, Yongcai Wu, Song School of Information Engineering Zhengzhou University Zhengzhou Henan 450001 China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China China

Currently there is no practical standard for grid middleware, most of the grid platforms are built by their own, and it's not easy to interoperate these grid platforms. Information service is one of the key components of the service oriented grid system, and information service interoperation among heterogeneous grids is the first step towards grid interoperation. Existing grid interoperability projects mainly focus on immediate bridge mechanisms, which is intricate and of poor scalability. To address the issues, a uniform information service interoperation framework (UISIF) is proposed in the paper, which is based on the idea of mediated bridge mechanisms, and adopts virtual layer and plug-in technology. There are two wellestablished grid systems in China, Chinagrid and China National grid, and they are built with two different grid middleware, CGSP and VEGA. With UISIF, these two grid systems make information service interoperation a reality without changing the codes of current grid systems. The experiments also show that the information service interoperation has low information querying latency and high accuracy;Moreover, UISIF has good scalability based on hierarchical architecture, virtual layer and plug-in technology. © 2011 ACADEMY PUBLISHER.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：