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

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Mengjing Song Hui Li Hao Wu Shenzhen Eng. Lab. of Converged Networks Technology Peking University Shenzhen Graduate School Guangdong China

ISBN: (纸本)9781467392013

Cache technology has emerged as a promising approach for distributed web systems to mitigate the web server's data access performance bottleneck. In this paper, we propose a decentralized load balancing architecture. The cache system takes advantage of the decentralized architecture for providing scalab.lity and high availab.lity. It can provide content requested by a user if it is cached in any of the cache servers in the system. Moreover, it can reduce the network traffic for web servers if the requested contents are cached in the system. We also propose a dynamic load balancing algorithm called Adaptive Dynamic Algorithm to dispatch requested contents that are not cached in the cache system to different cache servers. In Adaptive Dynamic Algorithm, we combine load metrics (CPU, memory) and number of alive requests to predict the real load of cache server. The balance strategy prevents the cache servers to be skew, improves cache hit rate, and reduces response time effectively. Experimental results support that our proposed load balancing algorithm is faster than Round Robin and Least Connection, and the content hit rate is higher than Round Robin and Least Connection too.

关键词： Heuristic algorithms Load management Computer architecture Measurement Web servers Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On low repair complexity storage codes via group divisible designs 19

On low repair complexity storage codes via group divisible d...

引用

19th IEEE Symposium on Computers and Communications, ISCC 2014

作者： Zhu, Bing Shum, Kenneth W. Li, Hui Li, Shuo-Yen Robert Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Graduate School Peking University China Institute of Network Coding Chinese University of Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong

ISBN: (纸本)9781479942787

Fractional repetition (FR) codes are a family of storage codes that provide efficient node repair at the minimum bandwidth regenerating point. Specifically, the repair process is exact and uncoded, but table-based. Existing constructions of FR codes are primarily based on combinatorial designs such as Steiner systems, resolvable designs, etc. In this paper, we present a new explicit construction of FR codes, which adopts the theory of uniform group divisible designs, termed GDDFR codes. Our codes achieve the storage capacity of random access and are availab.e for a wide range of parameters. In addition, our techniques allow for constructing FR codes with parameters that are not covered by Steiner systems, which answers an open question put forward in prior work. © 2014 IEEE.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

A Practical Approach for Automatically Constructing Concept Map in E-learning Environments

A Practical Approach for Automatically Constructing Concept ...

引用

2014 IEEE International Conference on Progress in Informatics and Computing

作者： Na Yi Hui Li Shenzhen Eng. Lab. of Converged Networks Technology Shenzhen Key Lab. of Cloud Computing Tech. and App Peking University Shenzhen Graduate School

With the prevalence of web-based learning, the application of concept mapping, as a powerful diagnostic and instructional tool, has been widely exploited in both education and computer science. In recent years, several methods have been presented toautomatically construct concept map that achieved encouraging results, while ignoring some critical issues when applied in actual E-learning system. In this paper,we propose a practical approach for constructing concept map,which is adapted tothe dynamic character of a real ***, we apply fuzzy set theory and fuzzy reasoning basis on fuzzy rules for similarity degree between twoconcepts, tofind direct prerequisite relationship among concepts. It provides a useful way toimprove accuracy and reduce complexity of the concept map.

关键词： concept map E-learning fuzzy set education

来源：评论

学校读者我要写书评

暂无评论

Fast Repair for Single Failure in Erasure Coding-Based Distributed Storage Systems

Fast Repair for Single Failure in Erasure Coding-Based Distr...

引用

Reliable Distributed Systems

作者： Huayu Zhang Hui Li Bing Zhu Jun Chen Shenzhen Engineering Lab of Converged Networks Technology Peking University China Peking University Beijing Beijing CN

In order to guarantee data reliability in distributed storage systems, erasure codes are widely used for the desirable storage properties. Nevertheless, the codes have one drawback that overmuch data are needed to repair a failure, resulting in both large bandwidth consuming in the network and high calculation pressure on the replacement node. For repair bandwidth problem, researchers derive the tradeoffs between storage and repair traffic from network coding and propose regenerating codes. However, the constructions of regenerating codes complicate the systems as well as recovery calculation. Hence, this paper proposes a distributed repair method based on general erasure codes to mitigate the burden of both recovery computation and network traffic. We observe that distributing recovery computation among helpers can distract the whole calculation procedure and accelerate repair speed in practical systems. Furthermore, by combining this technique with network topology, we introduce a novel repair tree to minimize repair traffic. Repair tree is also derived from network coding. The performance of the repair tree is preliminarily analyzed and evaluated, which infers that the storage-bandwidth bound of regenerating codes can be broken under this model.

关键词： Maintenance engineering Bandwidth Strips Vectors Silicon Computational modeling Servers

来源：评论

学校读者我要写书评

暂无评论

A multi-path forwarding strategy for content-centric networking

A multi-path forwarding strategy for content-centric network...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Guanghui Zhang Hui Li Tingting Zhang Dagang Li Li Xu School of Electronic & Computer Engineering Peking University Shenzhen China Engineering Lab of Converged Networks Technology Shenzhen China Communication Engineering Research Center Harbin Institute of Technology Shenzhen China

Content-Centric Networking (CCN) is a new networking paradigm to resolve the data traffic explosive problem of the Internet caused by a rapid increase in file sharing and video streaming traffic. Instead of seeking a single best path in the IP network, CCN is able to employ multipath to deliver packets. The conventionally adopted CCN forwarding strategies, such as taking advantage of replication of Interests or the shortest path do not offer satisfying performance under high-bandwidth requirements. In this paper, we present a Luby Transform (LT) code aided multipath forwarding strategy (LTCA-MF), which aims at reducing data downloading time and improving load balance in forwarding by transmitting LT coded contents on multiple disjoint paths. Tested by a large-scale network simulation scenario, our LTCA-MF strategy achieves excellent performance with desirable reliability and feasibility in comparison to others.

关键词： Servers Routing Greedy algorithms IP networks Complexity theory Decoding Encoding

来源：评论

学校读者我要写书评

暂无评论

New MDS array code correcting multiple disk failures

New MDS array code correcting multiple disk failures

引用

2014 IEEE Global Communications Conference

作者： Hanxu Hou Kenneth W. Shum Minghua Chen Hui Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen Graduate School Department of Information Engineering The Chinese University of Hong Kong Institute of Network Coding Shenzhen Key Lab. of Network Coding Key Tech. and Application China

ISBN: (纸本)9781479935130

We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to practical implementation. Efficient repair method for correcting up to two disk failures is also given. The proposed coding scheme provides a larger spectrum of parameters, with comparable encoding and repairing complexities in compare with existing MDS array codes, such as the row-diagonal parity (RDP) code and the EVENODD code.

关键词： Arrays Polynomials Encoding Complexity theory Maintenance engineering Memory Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Construction of exact-BASIC codes for distributed storage systems at the MSR point

Construction of exact-BASIC codes for distributed storage sy...

引用

IEEE International Conference on Big Data

作者： Hanxu Hou Kenneth W. Shum Hui Li Department of Information Engineering Chinese University of Hong Kong Institute of Network Coding Chinese University of Hong Kong Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen Graduate School

Regenerating codes (RGC) are a class of distributed storage codes that can provide efficient repair of failure nodes in distributed storage systems. In general, the reduction of repair bandwidth of RGC is at the expense of a small increase in storage cost and computational cost. The high computational complexity of data coding over a finite field of large size makes it unsuitable for practical distributed storage systems. BASIC codes, which stands for Binary Addition and Shift Implementable Convolutional codes, is introduced in [1] with the aim of reducing computational complexity, while retaining the benefits of RGC. In this paper, we present a construction of exact-repair BASIC codes at the minimum-storage point (MSR). A helper node needs no coding to repair a failure node for the minimum-storage BASIC codes. The results of simulation show minimum-storage BASIC codes outperform Cauchy Reed-Solomon codes in both repairing cost and coding cost.

关键词： Encoding Maintenance engineering Bandwidth Decoding Educational institutions Computational complexity

来源：评论

学校读者我要写书评

暂无评论

On low repair complexity storage codes via group divisible designs

On low repair complexity storage codes via group divisible d...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Bing Zhu Kenneth W. Shum Hui Li Shuo-Yen Robert Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Institute of Network Coding Chinese University of Hong Kong Department of Information Engineering Chinese University of Hong Kong

关键词： Maintenance engineering Decision support systems Educational institutions Bandwidth Complexity theory Equations Network coding

来源：评论

学校读者我要写书评

暂无评论

A novel framework of online network coding for multicast switches with constrained buffers

引用

Journal of Electronics 2011年第4期28卷 460-467页

作者： Wang, Wei Yu, Li Zhu, Guangxi Li, Hui Wuhan National Lab. for Optoelectronics Division of Communiction and Intelligent Networks Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching. Hence, it successfully achieves a larger rate region than non-coding approaches in crossbar switches. However, network coding requires large coding buffers and a high computational cost on encoding and decoding. In this paper, we propose a novel Online Network Coding framework called Online NC for multicast switches, which is adaptive to constrained buffers. Moreover, it enjoys a much lower decoding complexity O(n ²) by a Vandermonde matrix based approach, as compared to conventional randomized network coding O(n ³). Our approach realizes online coding with one coding algorithm that synchronizes buffering and coding. Therefore, we significantly reduce requirements on buffer space, while also sustaining high throughputs. We confirm the superior advantages of our contributions using empirical studies. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Multicast Network coding Packet switching Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Structure of campus network based on reconfigurable architecture

引用

Tongxin Xuebao/Journal on Communications 2013年第SUPPL.2期34卷 107-110页

作者： Yuan, Hu-Sheng Feng, Hua Li, Hui Zhong, Zhi-Bin Pan, Kai Network and Information Center of Shenzhen University Town Shenzhen 518055 China Peking University Shenzhen Graduate School Shenzhen 518055 China Shenzhen Key Lab. of Cloud Computing Technology and Application Shenzhen 518055 China Shenzhen Engineering Lab. of Converged Network Technology Shenzhen 518055 China Huaqiang Vocational Technical School Shenzhen 518000 China

Because of the petrifaction of the existing network, it is difficult to achieve the controllab.lity, adaptability and expansibility in current structure. Simultaneously, in order to have better campus network services in teaching, researching and studying, a new structure based on reconfigurable architecture for campus network was designed based on service set handling capacity of various kinds of business in reconfigurable network as the central idea. After the evolution from tradition to flat structure, a more condensed structure was proposed by adopting virtualization technology on switches and routers. It has the advantages of high performance, high reliability, manageability and augmentability.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：