2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)最新文献

Staggered flows: An application layer's way to avoid incast problem 交错流:应用层避免连用问题的方法

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486513

Yukai Yang, H. Abe, K. Baba, S. Shimojo

引用次数: 6

Aspect-oriented programming in the development of service-levels controllers of cloud applications 面向方面的编程在云应用程序的服务水平控制器开发中的应用

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486518

T. Dirgahayu

{"title":"Aspect-oriented programming in the development of service-levels controllers of cloud applications","authors":"T. Dirgahayu","doi":"10.1109/APCLOUDCC.2012.6486518","DOIUrl":"https://doi.org/10.1109/APCLOUDCC.2012.6486518","url":null,"abstract":"Service levels of a cloud application are application-specific. Mechanisms for delivering and controlling service levels should hence be defined at the same abstraction level as the application itself. In an implementation, this results in an interweaving combination of application logic and service-levels control mechanisms. The application is thus difficult to understand and maintain, i.e., has a low quality. In this paper, we argue that delivering service levels of a cloud application needs a feedback control system. This control system measures system outputs and adjust the system control inputs accordingly, in order to achieve the agreed service levels. Three models of control systems for service levels are identified, i.e., dedicated controller, shared controller, and shared application and controller. This paper investigates an approach to the use of aspect-oriented programming (AOP) in the development of service-levels controllers of cloud applications. In this approach, service-level mechanisms are considered as an aspect of cloud applications that are implemented separately from the application's functional logic. As a result, the application can be expected to have a higher quality.","PeriodicalId":331441,"journal":{"name":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929456","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

DMooseFS: Design and implementation of distributed files system with distributed metadata server DMooseFS:基于分布式元数据服务器的分布式文件系统的设计与实现

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486509

J. Yu, Weigang Wu, Huaguan Li

{"title":"DMooseFS: Design and implementation of distributed files system with distributed metadata server","authors":"J. Yu, Weigang Wu, Huaguan Li","doi":"10.1109/APCLOUDCC.2012.6486509","DOIUrl":"https://doi.org/10.1109/APCLOUDCC.2012.6486509","url":null,"abstract":"Distributed file system is one of the key blocks of data centers. With the fast increase of user scale, metadata management in distributed file system should also be distributed to multiple nodes so as to achieve high scalability and reliability. However, existing works usually focus on the design of distributed metadata management approach, and very few efforts have been put on real implementation. In this paper, we present the design and implementation of DMooseFS, a system with simple and efficient distributed metadata management. Our work is based on the well-known distributed file system MooseFS. We extend it by introducing multiple metadata servers (MDS). The metadata is divided into non-overlapping parts using static subtree partitioning, and each MDS is assigned with one of the parts according to a hash algorithm. Such a hybrid design is efficient because it can avoid the drawbacks of static subtree partitioning and/or hash-based approaches. We implement DMooseFS by modifying existing implementation of MooseFS and test it in real deployment. Technical issues in implementation are also found and addressed. Experiment results from real world deployment show that our system is effective and efficient, compared with the original version of MooseFS.","PeriodicalId":331441,"journal":{"name":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122320029","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}

引用次数: 11

Development model and environment for dynamic mobile cloud services 动态移动云服务的开发模型和环境

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486507

Kuo-Chu Wu, Wei-y Liu, Shiow-yang Wu

引用次数: 4

A model of Erasure-Coding-Based Distributed File System 基于擦除编码的分布式文件系统模型

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486519

Yu-Feng Han, Hui Li, Hanxu Hou

引用次数: 0

Supporting the personal cloud 支持个人云

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486506

A. Kazi, R. Kazi, R. Deters

引用次数: 9

Evaluation framework of virtualization systems for cloud computing 云计算虚拟化系统评估框架

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486510

Hua Cheng, Zuoning Chen, Ninghui Sun, Fangyuan Chen, Mingyang Wang

引用次数: 5

Fair multi-node multi-resource allocation and task scheduling in datacenter 数据中心中公平的多节点多资源分配和任务调度

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486512

Kaiji Shen, Xiaoying Zheng, Yingwen Song, Yanqin Bai

引用次数: 8

An overlay approach for service discovery in a large-scale decentralized cloud 一种用于大规模分散云中服务发现的覆盖方法

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486514

S. Liew, Ee Na Teoh, P. Lau, P. K. Chong, A. Nazir, E. Karuppiah, Y. M. Yassin

{"title":"An overlay approach for service discovery in a large-scale decentralized cloud","authors":"S. Liew, Ee Na Teoh, P. Lau, P. K. Chong, A. Nazir, E. Karuppiah, Y. M. Yassin","doi":"10.1109/APCLOUDCC.2012.6486514","DOIUrl":"https://doi.org/10.1109/APCLOUDCC.2012.6486514","url":null,"abstract":"Service discovery is a critical feature in cloud computing. It is often centrally controlled within the cloud fabric, which may lead to many risks, such as performance bottleneck and single point of failure. This paper proposes a new service discovery approach based on Pastry, i.e. a structured peer-to-peer network model, to leverage large-scale decentralized cloud computing. In the proposed P2P-Cloud framework, all virtual machines running in a cloud environment on heterogeneous hosts are considered as peer nodes. Each node has its own resources to share and may request resources from other nodes. In addition, each node has a unique NodeID and each service has a unique ServiceID, generated by a hash function. Pastry is used because it maintains locality while performing routing. To reduce complexity, we further propose a fixed-length prefix, say the first m bits, of the ServiceID to be used as the key for service advertisement and discovery. This enables the service capability of a node to be advertised at multiple peer nodes (known as directory nodes of the service) and thus increases the chance that a user can discover within its proximity, a node which can provide the service required. Our proposed prefix routing approach preserves the locality property of Pastry, and the lookup process for service advertisement/discovery has an order of O(logBM), where B is the number base (i.e. radix) used for constructing the Pastry routing table, and M = 2m is the total number of possible keys in the network.","PeriodicalId":331441,"journal":{"name":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126249847","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}

引用次数: 4

LBVP: A load balance algorithm based on Virtual Partition in Hadoop cluster LBVP: Hadoop集群中基于虚拟分区的负载均衡算法

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI: 10.1109/APCLOUDCC.2012.6486508

Yuanquan Fan, Weiguo Wu, Haijun Cao, Huo Zhu, Wei Wei, Pengfei Zheng

引用次数: 12