发布求助
文献互助 智能选刊 最新文献

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage最新文献

筛选
英文 中文
A Comprehensive Study on RAID-6 Codes: Horizontal vs. Vertical RAID-6代码的综合研究:水平vs垂直
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.31
Chao Jin, D. Feng, Hong Jiang, Lei Tian
{"title":"A Comprehensive Study on RAID-6 Codes: Horizontal vs. Vertical","authors":"Chao Jin, D. Feng, Hong Jiang, Lei Tian","doi":"10.1109/NAS.2011.31","DOIUrl":"https://doi.org/10.1109/NAS.2011.31","url":null,"abstract":"The RAID-6 architecture is playing an increasingly important role in modern storage systems. There are generally two kinds of RAID-6 codes, horizontal codes and vertical codes. Horizontal codes have been extensively studied and widely implemented, while vertical codes have not gained the equal attention. In this paper, we investigate the state-of-the-art horizontal and vertical RAID-6 codes and select two representative ones, RDP for horizontal codes and P-Code for vertical codes, to compare their performance. Since the code lengths of vertical codes are usually restricted, we first provide two efficient code shortening algorithms for vertical codes, by which the length of a vertical code can be extended to an arbitrary given one. In the context of our code shortening algorithms for vertical codes, we compare the theoretical performance of RDP and P-Code at consecutive lengths, and examine their practical behaviors in the real environment. Theoretical analysis and experimental evaluation results have demonstrated that verti-cal codes can provide comparable, and sometimes even better, performance than horizontal codes.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505882","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}
引用次数: 8
Transition from IPv4 to IPv6: A Translation Approach 从IPv4到IPv6的过渡:一种转换方法
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.12
Yudan Zhai, CongXiao Bao, Xing Li
{"title":"Transition from IPv4 to IPv6: A Translation Approach","authors":"Yudan Zhai, CongXiao Bao, Xing Li","doi":"10.1109/NAS.2011.12","DOIUrl":"https://doi.org/10.1109/NAS.2011.12","url":null,"abstract":"IPv4 addresses are already depleted in IANA and will be soon exhausted in RIR while more clients are pouring into the Internet. IPv6, as the only available next generation Internet protocol, is still not commercially successful because a scheme that could solve the migration of IPv4 resources to IPv6 network, as well as mutual communication between the two incompatible protocols, has not been fully developed and deployed. Translation solution provides a proper approach to address this problem. In this article, we propose IVI, an IPv4/IPv6 translation scheme, in order to facilitate resource migration and protocol transition. We explain how it works to translate between IPv4 and IPv6, and how combinations of IVI flavours and various translation scenarios are used in each phase of transition. The evaluation of scalability and robustness, which is important to a widely deployed translation scheme, is also discussed.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133196823","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}
引用次数: 22
Data Allocation in Heterogeneous Disk Arrays 异构磁盘阵列中的数据分配
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.22
Alexander Thomasian, Jun Xu
{"title":"Data Allocation in Heterogeneous Disk Arrays","authors":"Alexander Thomasian, Jun Xu","doi":"10.1109/NAS.2011.22","DOIUrl":"https://doi.org/10.1109/NAS.2011.22","url":null,"abstract":"We consider the allocation of Virtual Arrays (VAs)with different RAID levels in a Heterogeneous Disk Array (HDA). This is expected to provide significant cost savings by consolidating multiple disk arrays into one. Disk load balancing across disk arrays is a by-product of HDA. We provide an example of potential performance benefits expected from HDA. The number of Virtual Disks (VDs) required to materialize a VA is determined by upper bounds on VD bandwidth and space per physical disk drive. Only RAID1 and RAID5 are considered in this paper, but we develop the analysis for other RAID levels. A VA allocation is successful if disks sharing VAs with a failed disk are not overloaded in degraded mode. Single-pass data allocation methods for HDA are evaluated with a synthetic stream of allocation requests. Experimental results show that allocation methods minimizing the maximum disk bandwidth and capacity utilization or their variance across all disks yield the maximum number of allocated VAs. When the disk bandwidth is the bottleneck resource we utilize clustered RAID5 arrays to increase the number of allocated VAs.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121189897","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
A Preventive Traffic Adaptation Model for Wireless Mesh Networks Using Fuzzy Logic 基于模糊逻辑的无线网状网络预防流量自适应模型
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.53
A. Masri, A. Sardouk, L. Khoukhi, D. Gaïti
{"title":"A Preventive Traffic Adaptation Model for Wireless Mesh Networks Using Fuzzy Logic","authors":"A. Masri, A. Sardouk, L. Khoukhi, D. Gaïti","doi":"10.1109/NAS.2011.53","DOIUrl":"https://doi.org/10.1109/NAS.2011.53","url":null,"abstract":"Nowadays, real time traffic over wireless networks is increasing sharply. In addition, network scale is larger due to new facilities as offered by wireless mesh networks. However, the differences between (1) the infrastructure capacities, (2) the end users devices technologies, (3) the number of users, and (4) the number of real time applications are implying the need of more dynamic quality of service (QoS) models. Traditional QoS models are not always suitable to fill out the gap between the four cited points. We are mentioning more QoS degradation due to network congestion. Therefore, in this paper, we propose a novel, dynamic and persistent traffic adaption model, called FTAM. Its main role is to avoid as maximum as possible network congestion. FTAM is based on the fuzzy logic, which is known by its dynamicity and efficiency in uncertain environment. By monitoring the nodes queues evolution, FTAM estimates network congestion and makes the suitable traffic adaptation step. Extensive simulations have proved the efficiency of FTAM in terms of real time traffic QoS guarantee and preventive congestion control.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122353511","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
Understanding Long-Term Evolution and Lifespan in Peer-to-Peer Systems 理解点对点系统的长期进化和寿命
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.24
Yong Zhao, Zhibin Zhang, Li Guo
{"title":"Understanding Long-Term Evolution and Lifespan in Peer-to-Peer Systems","authors":"Yong Zhao, Zhibin Zhang, Li Guo","doi":"10.1109/NAS.2011.24","DOIUrl":"https://doi.org/10.1109/NAS.2011.24","url":null,"abstract":"Although peer-to-peer system is scalable for content distribution, its lifespan is shorter than traditional systems. More and more researchers began to pay close attention to lifespan and proposed specialized methods to extend it. However, what factors influence lifespan and how the effects are? To answer these questions, we analyze the long-term characteristics of swarms by our sampling measurement. The results show that swarms have different behaviors comparing with previous studies that focused on flash-crowd. Based on these new findings, we propose a long term model to depict the swarm evolution in large time scale. According to our model, the attenuation parameter of arrive rate and the average task length influence lifespan linearly while the initial arrival rate and peer availability have logarithmic influence. In order to validate our model, we compare them with real swarm and simulations. Our experiments show that the model captures the evolution closely and our results are valid in different situations.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116997144","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
ThinStore: Out-of-Band Virtualization with Thin Provisioning ThinStore:带外虚拟化和精简配置
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.39
K. Qian, Letian Yi, J. Shu
{"title":"ThinStore: Out-of-Band Virtualization with Thin Provisioning","authors":"K. Qian, Letian Yi, J. Shu","doi":"10.1109/NAS.2011.39","DOIUrl":"https://doi.org/10.1109/NAS.2011.39","url":null,"abstract":"Traditional storage virtualization systems are faced with the problem of poor storage utilizations, leading to expensive capital expenditures and high energy consumptions. To address this issue, we design and implement Thin Store, an out-of-band virtualization system that supports thin provisioning of storage resources. Thin Store automatically allocates storage capacity only when new data is written and employs the probing reclamation policy to reclaim unused storage space. To improve the system performance, we introduce the mapping metadata caching and lazy update mechanisms to reduce the interaction overhead between the metadata server and clients. The experimental results demonstrated that Thin Store significantly improved the storage utilization with acceptable performance overhead. For example, it delivered approximately 88.7% storage space savings when file system utilization was 10%. We also examined the effectiveness of our reclamation policy. It reclaimed 83.6% of unused storage resources for a large file workload. In addition, various file systems showed different friendliness with our system. Compared with ext 3, ext 4 reduced the storage space overhead by 10.6% in a small file workload.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126600048","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
Adaptive Virtual Machine Provisioning in Elastic Multi-tier Cloud Platforms 弹性多层云平台中的自适应虚拟机发放
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.20
Fan Zhang, Junwei Cao, Hong Cai, J. Mulcahy, Cheng Wu
{"title":"Adaptive Virtual Machine Provisioning in Elastic Multi-tier Cloud Platforms","authors":"Fan Zhang, Junwei Cao, Hong Cai, J. Mulcahy, Cheng Wu","doi":"10.1109/NAS.2011.20","DOIUrl":"https://doi.org/10.1109/NAS.2011.20","url":null,"abstract":"Virtual machines are allocated on demand in virtualized cloud platforms to provide flexible and reliable services. The major difficulty lies in satisfying the conflicting objectives of reducing response time while lowering resource costs. In this paper, a mathematical multi-tier framework for virtual machine allocation is proposed, which can be used to capture the performance of the cloud platform. We first use simulations to derive virtual resource allocation policies, and later use real benchmarking applications to verify the effectiveness of this framework. Experimental results show that the model can be simply and effectively used to satisfy the response time requirement as well as lowering the cost of using the virtual machine resources.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124864098","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
A Point-to-Multipoint Distribution Mechanism for IPTV Video Network IPTV视频网络的点对多点分发机制
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.10
Hui Wang, Zhigang Sun, Baosheng Wang, Hua Zhang, Li Liu
{"title":"A Point-to-Multipoint Distribution Mechanism for IPTV Video Network","authors":"Hui Wang, Zhigang Sun, Baosheng Wang, Hua Zhang, Li Liu","doi":"10.1109/NAS.2011.10","DOIUrl":"https://doi.org/10.1109/NAS.2011.10","url":null,"abstract":"IPTV video streams have the characteristics of long-lived connection, high bandwidth consumption and delay sensitive. In this paper, we propose a novel point-to-multipoint distribution mechanism for IPTV video network, and it's especially suitable for the edge network which is between access network and end users. A new transport protocol -- Labelcast, is designed and implemented. Label is used to forward packets and the special video transmission path is built based on label switched. Label cast can provide abundant transmission information, support video quality monitoring, failure detection, flow control, routing optimization and so on. We develop Label cast protocol prototype and implement it. The experimental results demonstrate that, Label cast can choose and adjust to the appropriate path according to the results of video quality monitoring, and it achieves better QoE for users remarkably.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122277284","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
HR-NET: A Highly Reliable Message-Passing Mechanism for Cluster File System HR-NET:集群文件系统的高可靠消息传递机制
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1080/17445760.2012.757316
Jiang Zhou, Can Ma, Jin Xiong, Weiping Wang, Dan Meng
{"title":"HR-NET: A Highly Reliable Message-Passing Mechanism for Cluster File System","authors":"Jiang Zhou, Can Ma, Jin Xiong, Weiping Wang, Dan Meng","doi":"10.1080/17445760.2012.757316","DOIUrl":"https://doi.org/10.1080/17445760.2012.757316","url":null,"abstract":"As PC clusters increase in popularity and quantity, message-passing between nodes has been an important issue for high failure rate in the network. File access in a cluster file system often contains several sub-operations, each includes one or more network transmissions. Any network failures will cause the file system service unavailable. In this paper, we describe a highly reliable message-passing mechanism (HRNET), which tolerates both software and hardware network failures. HR-NET provides fine-grained, connection-level fail over across communication path redundancy. With it the file system can keep passing messages until it either recovers from network failures or it is failed over to a backup. Load balance for messages is also achieved to relieve network traffic. For transmission timeout, HR-NET proposes the message priority scheduling which dynamically manages messages in an appropriate order to tolerate request-response failures between clients and servers. As HR-NET is completely independent, there are neither any changes to standard protocol stacks nor modifications at upper file system. Performance results show that HR-NET takes full advantage of network bandwidth with average 6.17% throughput loss and provides a fast recovery. Experiments with cluster file system dispose that the overall performance degradation is below 8% due to failover of HR-NET while the reliability is highly enhanced.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132724682","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}
引用次数: 5
Classified Power Capping with Distribution Trees in Cloud Computing 云计算中基于分布树的分类功率封顶
2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.52
Zhengkai Wu, Junyao Zhang, C. Giles, Jun Wang
{"title":"Classified Power Capping with Distribution Trees in Cloud Computing","authors":"Zhengkai Wu, Junyao Zhang, C. Giles, Jun Wang","doi":"10.1109/NAS.2011.52","DOIUrl":"https://doi.org/10.1109/NAS.2011.52","url":null,"abstract":"Power management is becoming very important in data centers. Cloud computing is also one of the newest promising data center techniques which is appealing to many big companies. As cloud computing is different from current data centers in terms of power management due to a dynamic structure and property for its online service. Power budgeting, in terms of its important role in power management, provides powerful solutions for cloud computing with dynamic capabilities. To be specific, existing methods for data centers are based on power distribution units (PDU) divided by fixed locations on physical levels. However, it is not suitable for cloud with the dynamic property. We propose a power management design based at the logical level which uses a distribution tree with classified power capping by different service or workload types. By setting multiple trees, we can differentiate and analyze the effect of workload types and Service Level Agreements (SLAs) in terms of power characteristics.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134646647","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书