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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

46 篇 会议
30 篇 期刊文献

馆藏范围

76 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

50 篇 工学
- 31 篇 计算机科学与技术...
- 21 篇 软件工程
- 20 篇 信息与通信工程
- 11 篇 电子科学与技术（可...
- 6 篇 生物工程
- 5 篇 电气工程
- 4 篇 机械工程
- 3 篇 光学工程
- 3 篇 仪器科学与技术
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 测绘科学与技术
- 1 篇 交通运输工程
20 篇 理学
- 16 篇 数学
- 9 篇 统计学（可授理学、...
- 6 篇 物理学
- 6 篇 生物学
- 1 篇 化学
- 1 篇 大气科学
- 1 篇 系统科学
11 篇 管理学
- 7 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
- 2 篇 工商管理
3 篇 法学
- 2 篇 社会学
- 1 篇 法学
2 篇 文学
- 2 篇 新闻传播学
1 篇 军事学

主题

10 篇 bandwidth
9 篇 encoding
8 篇 maintenance engi...
7 篇 routing
6 篇 network coding
5 篇 computer archite...
5 篇 educational inst...
5 篇 vectors
5 篇 internet
5 篇 decoding
4 篇 computational co...
4 篇 topology
4 篇 complexity theor...
3 篇 network topology
3 篇 markov processes
3 篇 computational mo...
3 篇 protocols
3 篇 polynomials
3 篇 ip networks
2 篇 strips

机构

4 篇 department of in...
4 篇 institute of net...
4 篇 pcl research cen...
4 篇 peng cheng labor...
4 篇 shenzhen enginee...
3 篇 shenzhen enginee...
3 篇 research center ...
3 篇 department of el...
3 篇 national enginee...
3 篇 shenzhen enginee...
2 篇 department of in...
2 篇 henan joint inte...
2 篇 peking universit...
2 篇 shenzhen eng. la...
2 篇 faculty of mathe...
2 篇 school of materi...
2 篇 peking universit...
2 篇 shenzhen eng. la...
2 篇 college of infor...
2 篇 shenzhen eng. la...

作者

22 篇 hui li
17 篇 li hui
7 篇 hanxu hou
7 篇 bing zhu
6 篇 chen fuxing
6 篇 kenneth w. shum
6 篇 liu weiyang
5 篇 kai pan
5 篇 pan kai
4 篇 chaoqi yu
4 篇 meng deyu
3 篇 minghua chen
3 篇 wang yunmin
3 篇 hongbin song
3 篇 jun chen
3 篇 wensheng chen
3 篇 fuxing chen
3 篇 ai zhou
3 篇 kai lei
3 篇 wang hui-ming

语言

72 篇 英文
2 篇 其他
2 篇 中文

检索条件"机构=Shenzhen Engineering Lab of Converged Networks Technology"

共 76 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

On the optimal routing for Reconfigurable Network Architecture

On the optimal routing for Reconfigurable Network Architectu...

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Kai Pan Hui Li Weiyang Liu Zhipu Zhu Bing Zhu Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479959716

The over 40-year old Internet, which was designed and proposed with the intention to interconnect several computing resources across a geographically distributed user group, is now facing many unprecedented challenges especially from the increasingly abundant demands in future networks. Traditional IP protocol can hardly deal with the challenges due to the single function and low QoS. In this paper, we proposed a unified polymorphic routing method towards the Reconfigurable Network Architecture (RNA) to achieve diverse demands according to different business types. Then, a rough description of specific based routing method is given in conjunction with the stipulated packet header that is compatible with current IP. Moreover, the network business match rate of polymorphic routing for RNA is simulated to validate the effectiveness and feasibility.

关键词： Routing Internet RNA Business IP networks Protocols Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Work in progress: On the knapsack-based resource allocation for reconfigurable network architecture

Work in progress: On the knapsack-based resource allocation ...

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Kai Pan Weiyang Liu Hui Li Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479959716

Though the decades of great success the Internet has experienced, it still confronts with many challenges to achieve QoS of various business types. A consensus has been reached that resource allocation presents a tremendously status in such a network bandwidth poor settings. In this paper, we bring the knapsack problem idea into reconfigurable network architecture (RNA), which is proposed with the intention of achieving QoS of various business types, to study the resource allocation problem. By defining the volume of flows, we argue that a flow with smaller volume should be granted higher priority while it is allocated bandwidth. Compared to the conventional approach, the knapsack based approach is good at maximizing network utility and decreasing overall price under certain conditions. Simulation results show that knapsack based approach retains the soundness of the conventional approach in the scenario of increasing flows network, and outperforms it both in the aspect of overall price and load balance under network with variation of flows.

关键词： Resource management RNA Quality of service Bandwidth Routing Topology Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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 available 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

来源：评论

学校读者我要写书评

暂无评论

ICCN: Identity-based centralized control network

ICCN: Identity-based centralized control network

引用

IEEE International Conference on Communications in China (ICCC)

作者： Huiling Liu Hui Li Chaoqi Yu Bing Zhu Kai Pan Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen China

Identity/locator separation and software defined networking (SDN) have emerged in recent years as two promising technologies within the Internet community. Identity/locator separation supports mobility and shows good performance in scaling problems. By separating the control and data plane, SDN achieves the software control of the networks evolving independently of the hardware. Constant attempts are made to integrate identity/locator separation and SDN dedicated to a new network architecture incorporating these two technologies so as to retain the advantages from both of them. In this paper, we propose a novel identity-based centralized control network architecture (ICCN) by mapping identity into locator to route and decoupling control strategy from packet forwarding. ICCN provides efficient communication and host mobility. We implement ICCN and conducts experiments on a SDN-based network with up to 10 nodes, and the results show that ICCN is feasible and scalable.

关键词： Switches Databases Routing Network topology Topology Internet

来源：评论

学校读者我要写书评

暂无评论

STORE: Data recovery with approximate minimum network bandwidth and disk I/O in distributed storage systems

STORE: Data recovery with approximate minimum network bandwi...

引用

IEEE International Conference on Big Data

作者： Tai Zhou Hui Li Bing Zhu Yumeng Zhang Hanxu Hou Jun Chen Shenzhen Eng. Lab. of Converged Networks Technology Peking University Shenzhen China

ISBN: (纸本)9781479956678

Recently, traditional erasure codes such as Reed-Solomon (RS) codes have been increasingly deployed in many distributed storage systems to reduce the large storage overhead incurred by the widely adopted replication scheme. However, these codes require significantly high resources with respect to network bandwidth and disk I/O during recovery of missing or unavailable data. It is referred as the recovery problem. In this paper, we dedicate to integrating exact minimum bandwidth regenerating codes into practical systems to solve the recovery problem. We design an implementation friendly storage code with the recently proposed BASIC framework and ZigZag decodable code for saving recovery bandwidth and disk I/O. We build a system called STORE based on this code and evaluate our prototype atop a HDFS cluster testbed with 21 nodes. As shown in this paper, the recovery bandwidth achieves minimum approximately during recovery of both data block and parity block with STORE. Another attractive result is that the recovery disk I/O also achieves minimum approximately during recovery of data block. Due to the reduction of recovery bandwidth and disk I/O, the degraded read throughput is boosted notably.

关键词： Bandwidth Strips Encoding Vectors Decoding Throughput Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

A new Zigzag MDS code with optimal encoding and efficient decoding

A new Zigzag MDS code with optimal encoding and efficient de...

引用

IEEE International Conference on Big Data

作者： Jun Chen Hui Li Hanxu Hou Bing Zhu Tai Zhou Lijia Lu Yumeng Zhang Shenzhen Eng. Lab. of Converged Networks Technology Peking University Shenzhen China

ISBN: (纸本)9781479956678

Distributed file system has emerged in recent years as an efficient solution to store the large amount of data produced anytime and anywhere. In order to guarantee data reliability, it is necessary to introduce redundancy to the storage systems. Compared to simple replication, practical systems are increasingly adopting erasure codes for better storage efficiency. However, traditional erasure codes such as maximum-distance-separable (MDS) codes, are designed over a large finite field, which inevitably hinders the wide implementation of erasure codes. In this paper, we propose a new family of MDS codes with high computation efficiency. More specifically, only XOR operation is included in the encoding process to generate parity blocks. Upon failure of a storage node, we use the efficient Zigzag decoding method to recover the failed blocks, which achieves the optimal encoding and an efficient decoding. Furthermore, we implement the proposed codes in a distributed file system, and the results show the high performance of the new codes.

关键词： Decoding Encoding Complexity theory Arrays Big data Distributed databases Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Semi-centralized Algorithm to Detect and Resolve Distributed Deadlocks in the Generalized Model

A Semi-centralized Algorithm to Detect and Resolve Distribut...

引用

IEEE International Conference on Computational Science and engineering, CSE

作者： Zhi Tao Hui Li Bing Zhu Yunmin Wang Shenzhen Eng. Lab. of Converged Networks Technology University Shenzhen Graduate School Guangdong China

ISBN: (纸本)9781479979820

To detect and resolve distributed deadlocks in the generalized model, a few algorithms have been proposed. Most of them are distributed algorithms which are based on the diffusing computation technique where propagation of probes and backward propagation of replies are required. On the contrary, centralized algorithms send the dependency information directly to the initiator. However, existing algorithms do not distinguish local deadlocks from global deadlocks. In this paper, we present a semi-centralized algorithm which effectively detects and resolves local deadlocks prior to global deadlocks. To be specific, a consistent snapshot of dependency information of involved nodes is recorded in an information table at each site. Therefore, the detection and resolution of local deadlocks can be performed at each site before the dependency information is sent to the initiator to further detect global deadlocks. The proposed algorithm also handles the problem of phantom edges and concurrent executions. Performance analysis shows that the performance of our algorithm is close to or better than that of the existing algorithms in terms of execution time, message traffic and message size.

关键词： System recovery Probes Algorithm design and analysis Phantoms Registers Image edge detection Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Towards efficient content discovery in NDN with enhanced component-based bloom filters 21

Towards efficient content discovery in NDN with enhanced com...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhang, Cuiping Wang, Yunmin School of Electronic and Computer Engineering Peking University China Shenzhen Key Lab of Information Theory and Future Network Architecture Future Network PKU Lab of National Major Research Infrastructure PKU Institute of Big Data Technology Shenzhen Engineering Lab of Converged Networking Technology Huawei and PKU Jointly Engineering Lab of Future Network Based on SDN Shenzhen Graduate School Peking University China

ISBN: (纸本)9781728120584

Variable-length hierarchical names of Named data networking (NDN) content bring about intuitive issues for both content routing and large-scale forwarding. Bloom filters can accelerate hash-based NDN content discovery with a false positive probability. In this paper, we propose ECBF, a component-based bloom filter scheme to enhance the reliability of bloom filters. We exploit the hierarchical characteristics of NDN content names and store them into different bloom filters in a component-based way, and then we present a correlation validation policy to check whether the names exist. Finally, we introduce an ECBF-based content discovery scheme BCD. ECBF and the correlation validation value are stored in a fast on-chip memory, and cryptographic check values of content names and related information are respectively stored in an off-chip memory of intermediate routers. This design not only improves the effectiveness of content discovery, but also reduces the additional memory throughput. We experimentally demonstrate that BCD can provide a more than twice reduction of false probability compared with the primary bloom filter methods. Besides, BCD can economize about 40% memory consumption. © 2019 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共8页 << < 1 2 3 4 5 6 7 8 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：