2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)最新文献_第5页

A combinatorial double auction mechanism for cloud resource group-buying 云资源团购的组合双拍卖机制

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017104

Zehao Sun, Zhenyu Zhu, Long Chen, Hongli Xu, Liusheng Huang

{"title":"A combinatorial double auction mechanism for cloud resource group-buying","authors":"Zehao Sun, Zhenyu Zhu, Long Chen, Hongli Xu, Liusheng Huang","doi":"10.1109/PCCC.2014.7017104","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017104","url":null,"abstract":"With the development of cloud computing, there is an increasing number of market-based mechanisms for cloud resource allocation. Inspired by the emerging group-buying Web sites, we advocate that group-buying can be applied to cloud resource allocation, and thus cloud providers can benefit from demand aggregation due to the advantage of group-buying in attracting customers, while cloud users can enjoy lower price. However, none of the existing allocation mechanisms is specifically designed for the scenario with group-buying, and it is a challenge for mechanism design to take full advantage of group-buying to maximize the total utility. In this paper, we fill this gap by proposing an innovative auction mechanism. The mechanism is designed based on a combinatorial double auction, in which the allocation algorithm and payment scheme are specifically designed to efficiently generate allocation and compute prices considering group-buying. We theoretically prove that the necessary economic properties in auction design, such as individual rationality, budget balance and truthfulness, are satisfied in our work. The experiments show that the proposed mechanism yields higher total utility, and has good scalability.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"95 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134196690","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}

引用次数: 24

A new multi-objective microgrid restoration via semidefinite programming 一种基于半定规划的多目标微电网恢复方法

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017078

Liang Zhao, Wenzhan Song

引用次数: 7

WCET analysis of static NUCA caches 静态NUCA缓存的WCET分析

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017093

Yiqiang Ding, Wei Zhang

引用次数: 3

Joint power optimization through VM placement and flow scheduling in data centers 通过数据中心中的虚拟机放置和流调度进行联合功率优化

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017088

Dawei Li, Jie Wu, Zhiyong Liu, Fa Zhang

{"title":"Joint power optimization through VM placement and flow scheduling in data centers","authors":"Dawei Li, Jie Wu, Zhiyong Liu, Fa Zhang","doi":"10.1109/PCCC.2014.7017088","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017088","url":null,"abstract":"Two important components that consume the majority of IT power in data centers are the servers and the Data Center Network (DCN). Existing works fail to fully utilize power management techniques on the servers and in the DCN at the same time. In this paper, we jointly consider VM placement on servers with scalable frequencies and flow scheduling in the DCN, to minimize the overall system's power consumption. Due to the convex relation between a server's power consumption and its operating frequency, we prove that, given the number of servers to be used, computation workloads should be allocated to severs in a balanced way, to minimize the power consumption on servers. To reduce the power consumption of the DCN, we further consider the flow requirements among the VMs during VM allocation and assignment. Also, after VM placement, flow consolidation is conducted to reduce the number of active switches and ports. We notice that, choosing the minimum number of servers to accommodate the VMs may result in high power consumption on servers, due to servers' increased operating frequencies. Choosing the optimal number of servers purely based on servers' power consumption leads to reduced power consumption on servers, but may increase power consumption of the DCN. We propose to choose the optimal number of servers to be used, based on the overall system's power consumption. Simulations show that, our joint power optimization method helps to reduce the overall power consumption significantly, and outperforms various existing state-of-the-art methods in terms of reducing the overall system's power consumption.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121711171","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

The automatic configuration of transmit power in LTE networks based on throughput estimation 基于吞吐量估计的LTE网络发射功率自动配置

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017020

Mariusz Słabicki, K. Grochla

引用次数: 3

Achieving transparent coexistence in a multi-hop secondary network through distributed computation 通过分布式计算实现多跳辅助网络的透明共存

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017055

Xu Yuan, Yi Shi, Yiwei Thomas Hou, W. Lou, S. Midkiff, S. Kompella

引用次数: 2

Low-latency last-level cache structure based on grouped cores in Chip Multi-Processor 芯片多处理器中基于分组核的低延迟末级缓存结构

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017021

Jinbo Xu, Weixia Xu, Kefei Wang, Zhengbin Pang

引用次数: 0

Randomized routing in multi-party internet video conferencing 多方网络视频会议中的随机路由

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017110

Yousuk Seung, Quan Leng, Wei Dong, L. Qiu, Yin Zhang

{"title":"Randomized routing in multi-party internet video conferencing","authors":"Yousuk Seung, Quan Leng, Wei Dong, L. Qiu, Yin Zhang","doi":"10.1109/PCCC.2014.7017110","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017110","url":null,"abstract":"Despite significant advances, supporting high-quality large video conferences at a low cost remains a significant challenge due to stringent performance requirements, limited and heterogeneous client resources, and dynamic traffic demands. In this paper, we develop a simple yet effective valiant multicast routing to select application-layer routes and adapt streaming rates according to the current network condition. It consists of four novel components: (i) a valiant multicast routing using two random choices to effectively balance the load in the presence of uncertainty about the clients' load, (ii) a scheme to cluster clients based on their delay and adapt valiant multicast routing based on both upload capacity and locality, (iii) an approach to further leverage resources from other peers or nodes in content distribution network (CDN) to enhance performance, and (iv) a simple distributed scheme to adapt streaming rates according to the current network resources. Our real implementation and experiments show that our approach significantly out-performs existing multicast routing schemes and quickly adapts to changing traffic demands and network conditions.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115927938","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

Shaping HTTP adaptive streams using receive window tuning method in home gateway 在家庭网关中使用接收窗口调优方法对HTTP自适应流进行整形

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017042

C. Ameur, Emmanuel Mory, Bernard A. Cousin

引用次数: 7

An encryption and probability based access control model for named data networking 一种基于加密和概率的命名数据网络访问控制模型

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017100

Tao Chen, Kai Lei, Kuai Xu

{"title":"An encryption and probability based access control model for named data networking","authors":"Tao Chen, Kai Lei, Kuai Xu","doi":"10.1109/PCCC.2014.7017100","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017100","url":null,"abstract":"The new named data networking (NDN) has shifted the Internet from today's IP-based packet-delivery model to the name-based data retrieval model. The architecture shift from IP addresses to named data results in effective content delivery via in-networking cache and direct object retrieval. However, this shift has also created challenges and obstacles for securing data objects and providing appropriate access control on named data due to broad data replications and the loss of network perimeters. This paper designs, implements, and evaluates an encryption and probability based access control model for NDN with video streaming service as a case study. In particularly, we explore a combination of public-key cryptography and symmetric ciphers to encrypt video data for preventing unauthorized access. In addition, we build a bloom-filter probabilistic data structure for pre-filtering Interests from consumers without desired credentials. Our experimental results have demonstrated the capabilities of the proposed model for providing access control while incurring low system and performance overhead on producers and consumers.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123518763","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}

引用次数: 31