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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

27 篇 会议
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

19 篇 工学
- 14 篇 计算机科学与技术...
- 8 篇 软件工程
- 6 篇 信息与通信工程
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 1 篇 光学工程
- 1 篇 建筑学
- 1 篇 土木工程
6 篇 管理学
- 5 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
2 篇 理学
- 2 篇 数学
- 1 篇 物理学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...

主题

6 篇 routing
6 篇 bandwidth
6 篇 encoding
5 篇 maintenance engi...
5 篇 computer archite...
5 篇 decoding
4 篇 educational inst...
4 篇 network coding
4 篇 complexity theor...
3 篇 internet
3 篇 ip networks
2 篇 strips
2 篇 computational co...
2 篇 arrays
2 篇 vectors
2 篇 servers
2 篇 computational mo...
2 篇 silicon
2 篇 algorithm design...
2 篇 topology

机构

4 篇 shenzhen enginee...
3 篇 shenzhen enginee...
3 篇 department of in...
3 篇 institute of net...
3 篇 shenzhen enginee...
2 篇 peking universit...
2 篇 shenzhen eng. la...
2 篇 shenzhen eng. la...
2 篇 shenzhen eng. la...
1 篇 nanjing universi...
1 篇 department of in...
1 篇 huaqiang vocatio...
1 篇 shenzhen enginee...
1 篇 state key labora...
1 篇 shenzhen enginee...
1 篇 peking universit...
1 篇 shenzhen enginee...
1 篇 shenzhen eng. la...
1 篇 shenzhen eng. la...
1 篇 shenzhen enginee...

作者

17 篇 hui li
13 篇 li hui
6 篇 chen fuxing
6 篇 bing zhu
6 篇 liu weiyang
5 篇 pan kai
4 篇 hanxu hou
4 篇 kai pan
3 篇 chaoqi yu
3 篇 jun chen
3 篇 kenneth w. shum
3 篇 wensheng chen
3 篇 fuxing chen
2 篇 jun lu
2 篇 yumeng zhang
2 篇 tai zhou
2 篇 zhu bing
2 篇 weiyang liu
2 篇 zhu zhipu
2 篇 dagang li

语言

29 篇 英文
2 篇 中文

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

共 31 条记录，以下是11-20 订阅

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

详细简洁

排序：

Centralized Flat Routing

Centralized Flat Routing

引用

International Conference on Computing, Management and Telecommunications (ComManTel)

作者： Zhipu Zhu Hui Li Kai Pan Chaoqi Yu Fuxing Chen Dagang Li Shenzhen Engineering Lab of Converged Networks Technology Peking University

Flat Routing (FR) is a routing technique that routes packet according to a globally unique flat identity. Compared with traditional IP based routing, flat routing decouples host with its location, which provides built-in mobility support and eases network management. Besides, flat routing is also considered as a building block for next generation network architecture. Previous work on flat routing is through modifying network layer protocol or extending Ethernet network, but both of the methods are difficult to scale up. In this paper, a flat routing method based on centralized network architecture called CFR (Centralized Flat Routing) is proposed and analyzed. By connecting multiple commodity Ethernet networks through a SDN/OpenFlow network, a popular centralized architecture, we show it to be a scalab.e method through proof-of-concept experiment covering various scalab.lity issues. At last, we introduce a prototype of a flat routing testbed based on NetFPGA1G OpenFlow switches and POX controller. Preliminary experiment result shows CFR work under realistic environment.

关键词： Switches Indexes Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Routing in the Centralized Identifier Network

Routing in the Centralized Identifier Network

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Wensheng Chen Hui Li Jun Lu Chaoqi Yu Fuxing Chen Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen China

ISBN: (纸本)9781479987962

We propose a clean-slate network architecture called Centralized Identifier Network (CIN) which jointly considers the ideas of both control plane/forwarding plane separation and identifier/locator separation. In such an architecture, a controller cluster is designed to perform routers' link states gathering and routing calculation/handing out. Meanwhile, a tailor-made router without routing calculation function is designed to forward packets and communicate with its controller. Furthermore, A router or a host owns a globally unique ID and a host should be registered to a router whose ID will be the host's location. Control plane/forwarding plane separation enables CIN easily re-splitting the network functions into finer optional building blocks for sufficient flexibility and adaptability. Identifier/locator separation helps CIN deal with serious scaling problems and offer support for host mobility. This article mainly shows the routing mechanism of CIN. Furthermore, numerical results are presented to demonstrate the performance of the proposed mechanism.

关键词： Routing Routing protocols Computer architecture IP networks Aerospace electronics Internet Databases

来源：评论

学校读者我要写书评

暂无评论

RCCN: A Reconfigurable Content-Centric Networking

RCCN: A Reconfigurable Content-Centric Networking

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Jun Lu Hui Li Wensheng Chen Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen China

ISBN: (纸本)9781479987962

In this paper, we present RCCN, a novel centralized Reconfigurable Content-Centric Networking for congested networks. RCCN inherits the properties from Content-Centric Networking, such as hierarchical naming, node structure and security. RCCN is designed to create a manageable and controllab.e networking to satisfy the transmission requirements of different business and to suit to the dynamic network conditions. Furthermore, RCCN adopts a multiple hierarchical control model to extend into inter-domain routing, which resolves expansion problem in centralized networking. Finally, we have implemented the prototype system of RCCN and our experiments demonstrate that RCCN can effectively eliminate the negative effects of network congestion.

关键词： Routing Network topology Business Internet Computer architecture Topology Security

来源：评论

学校读者我要写书评

暂无评论

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 unavailab.e 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

来源：评论

学校读者我要写书评

暂无评论

Exploring Cache Coding Scheme for Information-centric Networking

Exploring Cache Coding Scheme for Information-centric Networ...

引用

IEEE International Conference on Computational Science and engineering, CSE

作者： Lidu Qin Hui Li Kai Pan Fuxing Chen Wensheng Chen Chaoqi Yu Shenzhen Engineering Lab of Converged Networks Technology Peking University Shenzhen Graduate School Shenzhen China

ISBN: (纸本)9781479979820

The tremendous growth of the Internet application has driven wider efforts to advanced future Internet architecture especially Content-Centric Networking. In this paper we propose a Centralized Architecture for ICN (CAN), which efficiently combines Content-Centric Networking and network coding (NC). In order to achieve optimal coding performance, we design a global controller which is mainly responsible for calculating entire network routing tables and controlling optimal trade off among cache coding schemes. Specifically, we propose a coding chunk naming scheme and an efficient network coding management approach, which apply to recover the lost native content packets according to NC. Experiment results show that NC in CAN has a great performance for content packet loss recovery. In particular, it can reach nearly 100% recovery in sufferable packet loss rate. Meanwhile, the efficiency and performance of which are superior to the conventional CCN.

关键词： Encoding Routing Packet loss Network coding Decoding Motion pictures

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A practical approach for automatically constructing concept map in E-learning environments

A practical approach for automatically constructing concept ...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Na Yi Hui Li Shenzhen Eng. Lab. of Converged Networks Technology Peking University Shenzhen Graduate School Guangdong China

ISBN: (纸本)9781479920327

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 to automatically 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 to the dynamic character of a real system. Moreover, we apply fuzzy set theory and fuzzy reasoning basis on fuzzy rules for similarity degree between two concepts, to find direct prerequisite relationship among concepts. It provides a useful way to improve accuracy and reduce complexity of the concept map.

关键词： Electronic learning Fuzzy reasoning Silicon Adaptation models Fuzzy sets Educational institutions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：