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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

632 篇 会议
620 篇 期刊文献
6 篇 学位论文
2 册 图书

馆藏范围

1,260 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,198 篇 工学
- 765 篇 计算机科学与技术...
- 567 篇 电气工程
- 448 篇 信息与通信工程
- 171 篇 电子科学与技术（可...
- 112 篇 软件工程
- 95 篇 仪器科学与技术
- 90 篇 控制科学与工程
- 55 篇 机械工程
- 28 篇 材料科学与工程（可...
- 21 篇 交通运输工程
- 11 篇 网络空间安全
- 10 篇 航空宇航科学与技...
- 8 篇 力学（可授工学、理...
- 8 篇 光学工程
- 8 篇 石油与天然气工程
- 7 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 土木工程
- 3 篇 建筑学
- 3 篇 化学工程与技术
103 篇 管理学
- 95 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
99 篇 理学
- 40 篇 物理学
- 26 篇 数学
- 26 篇 化学
- 18 篇 生物学
- 10 篇 系统科学
- 4 篇 地球物理学
- 3 篇 地理学
10 篇 医学
- 7 篇 临床医学
3 篇 经济学
3 篇 法学
3 篇 军事学
2 篇 教育学
2 篇 文学
2 篇 艺术学
1 篇 历史学
1 篇 农学

主题

1,260 篇 routing algorith...
80 篇 wireless sensor ...
78 篇 network-on-chip
60 篇 wireless sensor ...
45 篇 interconnection ...
44 篇 routing
41 篇 fault tolerance
30 篇 clustering
28 篇 reliability
28 篇 load balancing
24 篇 topology
23 篇 interconnection ...
20 篇 noc
18 篇 opportunistic ne...
18 篇 network topology
18 篇 wsn
18 篇 network on chip
18 篇 networks-on-chip
17 篇 qos
16 篇 energy consumpti...

机构

8 篇 xidian univ stat...
7 篇 univ calif santa...
6 篇 hosei univ dept ...
6 篇 sharif univ tech...
6 篇 xidian univ stat...
5 篇 south china univ...
5 篇 univ chinese aca...
5 篇 xidian univ sch ...
5 篇 northeastern uni...
5 篇 school of inform...
5 篇 inst res fundame...
5 篇 guangdong univ f...
4 篇 tianjin polytech...
4 篇 tsinghua univ de...
4 篇 shaanxi normal u...
4 篇 college of infor...
4 篇 inner mongolia u...
4 篇 xidian univ inst...
4 篇 henan univ sch c...
4 篇 shenyang ligong ...

作者

16 篇 gu huaxi
11 篇 wang kun
9 篇 patooghy ahmad
8 篇 plosila juha
8 篇 palesi maurizio
7 篇 yang yintang
7 篇 kaneko keiichi
7 篇 liljeberg pasi
7 篇 tang minghua
7 篇 watanabe takahir...
6 篇 valinataj mojtab...
6 篇 xu gang
6 篇 jiang xin
6 篇 amano h
6 篇 li yamin
5 篇 tenhunen hannu
5 篇 duan xinming
5 篇 wang liang
5 篇 zhang feng
5 篇 lin xiaola

语言

1,201 篇 英文
33 篇 其他
26 篇 中文

检索条件"主题词=Routing Algorithm"

共 1260 条记录，以下是191-200 订阅

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

详细简洁

排序：

A New Approach to Fault-Tolerant routing algorithm on SLmesh

A New Approach to Fault-Tolerant Routing Algorithm on SLmesh

引用

14th IEEE International Conference on Communication Technology (ICCT)

作者： Zhong, Xiongqing Bao, Peilei Gu, Huaxi Zhang, Na Chen, Ke Xidian Univ State Key Lab ISN Xian Peoples R China

ISBN: (纸本)9781467321013;9781467321006

With the increasing scale of integrated circuits, fault appears more than ever in the chips. It's significant to apply fault-tolerant routing algorithms. In this paper, we proposed an algorithm based on spare links mesh which will fully utilizes the idle ports while keeping the router size unchanged. When a faulty router is detected, its neighboring routers change the links of their idle ports to route the packets around the faulty router. As a result, XY routing algorithm in mesh can work even a faulty router exist in the network. Furthermore, the algorithm can provide partially-adaptive routing in some neighboring routers around the faulty router. Thus, these neighboring routers won't be easily congested and it may reduce the latency by decreasing some hops of the packets. The experimental results show that this algorithm is feasible and the performance of delay and throughput of the network is improved.

关键词： fault-tolerant routing algorithm reconfiguration performance NoC

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm based on Social Closeness and Spatio-Temporal Interaction Degree 46

A Routing Algorithm based on Social Closeness and Spatio-Tem...

引用

46th Annual IEEE-Computer-Society International Computers, Software, and Applications Conference (COMPSAC) - Computers, Software, and Applications in an Uncertain World

作者： Liu, Zhanguo Xu, Gang Hang, Ruijie Cheng, Yuan Huang, Baoqi Bai, Xiangyu Inner Mongolia Univ Coll Comp Sci Hohhot Peoples R China Inner Mongolia AR Key Lab Wireless Networking & M Hohhot Peoples R China

ISBN: (纸本)9781665488105

In sparse opportunistic networks with social attributes and limited cache space, routing algorithms based on long-term and stable social relations have low message delivery rates in a short period of time, and do not consider the impact of delivered message copies on communication efficiency. To solve the problem of low delivery rates, the paper integrates social attributes and space-time constrained characteristics and proposes social closeness and spatio-temporal interaction degree based on historical information. Then we design a routing algorithm (SC-STID) based on these two metrics. SC-STID takes into account the social closeness and spatio-temporal interaction of nodes to select relay nodes comprehensively and uses the delivered message deletion mechanism to remove the copies of delivered messages from the network. Experimental data shows that SC-STID improves the success rate of message delivery and reduces network resource consumption compared to existing routing algorithms (Prophet, Epidemic, ORRF) in a sparse opportunistic network of nodes with social attributes.

关键词： spatio-temporal interaction degree sparse opportunistic networks social closeness sociability routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Test Strategy and Fault-Tolerant routing algorithm for NoC Routers

A Novel Test Strategy and Fault-Tolerant Routing Algorithm f...

引用

17th CSI International Symposium on Computer Architecture and Digital Systems (CADS)

作者： Alamian, Sanaz Sadat Fallahzadeh, Ramin Hessabi, Shaahin Alirezaie, Javad Sharif Univ Technol Dept Comp Engn Tehran Iran Ryerson Univ Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781479905621;9781479905638

In this paper, we present a novel routing algorithm in order to avoid deadlock and packet dropping. In our proposed algorithm the network-on-chip (NoC) is capable of tolerating faults in presence of control faults in combinational parts of routers. In addition, by modifying the functionality of the router, the router is enabled to test its own, as well as the preceding router's functionality based on the routing algorithm, destination address and previous router's situation. Each router recognizes the faulty neighbor and announces it to successive routers. In this scheme no extra packets will be generated. We analyze the effects of our method on latency, power consumption and drop rate. Our experimental results illustrate that, fault coverage for routers can reach up to 100% with yet low power consumption and significant improvement in latency compared to the baseline approach.

关键词： NoC Routers Fault-tolerant NoC Functional Test routing algorithm Latency

来源：评论

学校读者我要写书评

暂无评论

A Fault-Aware, Reconfigurable and Adaptive routing algorithm for NoC Applications

A Fault-Aware, Reconfigurable and Adaptive Routing Algorithm...

引用

18th IEEE/IFIP International Conference on VLSI and System-on-Chip

作者： Valinataj, Mojtaba Mohammadi, Siamak Univ Tehran Sch Elect & Comp Engn Tehran Iran

ISBN: (纸本)9781424464708

This paper presents a very low cost routing method to tolerate faulty links and routers in mesh-based Networks-on-Chip (NoC). With reconfigurability, this new algorithm supports irregular topologies caused by faulty components in a network. It concurrently uses both fault and congestion information to route the packets by utilizing only two virtual channels for both fault-tolerance and adaptivity. This method has a multi-level fault-tolerance capability and therefore it is capable to tolerate more faulty components with additional costs. Its performance and overhead are evaluated through appropriate simulations and syntheses. The experimental results show that a significant reliability improvement is achieved against multiple component failures with only a few percent area and power overheads.

关键词： Network-on-Chip routing algorithm fault-tolerance reliability reconfiguration congestion

来源：评论

学校读者我要写书评

暂无评论

Based on the cloud data center optical switching scheduling and routing algorithm research and practice 4

Based on the cloud data center optical switching scheduling ...

引用

4th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)

作者： Cheng, Yunli Guangzhou Nanyang Polytech Coll Guangzhou 510925 Peoples R China

ISBN: (纸本)9781728146898

the trend of diversification, convenience and scale development of cloud services brings new challenges to the optimization of network performance of data *** paper around the exchange of data center network performance optimization scheduling and routing algorithm design problems put forward two based on the Input Queue (IQ: Input Queue) optical switching scheduling algorithm of SDF (Stringent Delay First) and m - SDF (m - order Stringent Delay First).Study two data center network models: multiple independent data center network mi-dcn (Multiple Independent DCN) and Integrated Distributed *** concept of Software Defined Network (SDN) is introduced into the data center, and the transmission routing algorithm is designed to realize load balancing of data center resources.

关键词： data center optical switching scheduling SDN routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Implementation of Efficient seamless non-broadcast routing algorithm for Wireless Mesh Network

引用

International Conference on Systems, Computing Sciences and Software Engineering

作者： Kbar, Ghassan Mansoor, Wathiq Amer Univ Dubai Dubai U Arab Emirates

ISBN: (纸本)9789048136599

Wireless Mesh Networks become popular and are used everywhere as an alternative to broadband connections. The ease of configuration of wireless mesh LAN, the mobility of clients, and the large coverage make it attractive choice for supporting wireless technology in LAN and MAN. However, there are some concerns in assigning the multiple channels for different node and having efficient routing algorithm to route packet seamlessly without affecting the network performance. Multiple channel usage has been addressed in previous research paper, but efficient routing algorithm still to be researched. In this paper an efficient seamless non-broadcast routing algorithm has been developed and implemented in C++ to support the wireless mesh network. This algorithm is based on mapping the mesh wireless routing nodes geographically according to 2 coordinates. Each node will apply this algorithm to find the closet neighboring node that leads to destination based on the mapped network without the need for broadcast such as the one used in traditional routing protocol in RIP, and OSPF.

关键词： routing algorithm Wireless Mesh Network Non-Broadcasting algorithm Wireless routing Protocol

来源：评论

学校读者我要写书评

暂无评论

Design and performance simulation of dynamic integrated routing algorithm

Design and performance simulation of dynamic integrated rout...

引用

Asia-Pacific Optical and Wireless Communications Conference (APOC 2003)

作者： Wei, W Zeng, QJ Shanghai Jiao Tong Univ R&D Ctr Broadband Opt Networking Technol Shanghai 200030 Peoples R China

ISBN: (纸本)0819451770

For the integrated optical Internet model, we designed a novel dynamic integrated routing algorithm with Quality of Service and fairness guarantee that employs adaptive unified routing strategies according to the priority and granularity of the traffic connection request. Performance simulation results of this algorithm showed that our adaptive approach outperforms in terms of network throughput performance than traditional overlay sequential routing scheme such as optical-layer-first routing (OFR) and electrical-layer-first routing (EFR) schemes. This algorithm gets the better trade-off of QoS and fairness of routing for integrated IP/WDM networks.

关键词： optical internet multi-layer integrated routing (MLIR) generalized multi-protocol label switching (GMPLS) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Assessing Self-Adapting routing algorithm in an Industrial IoT Environment 67

Assessing Self-Adapting Routing Algorithm in an Industrial I...

引用

67th Annual Reliability and Maintainability Symposium (RAMS)

作者： Cerotti, Davide Bobbio, Andrea Bruneo, Dario Distefano, Salvatore Scarpa, Marco Gribaudo, Marco Univ Piemonte Orientale DiSit I-15121 Alessandria Italy Univ Messina Piazza Pugliatti 1 I-98100 Messina Italy Politecn Milan DEIB I-20133 Milan Italy

ISBN: (纸本)9781728180175

An important application domain for the Internet of Things (IoT) is the area of industry and manufacturing where the production may be spread in different sites and hostile environments, even geographically. This paper studies an industrial application where nodes, not necessarily Internet connected, must forward their data to an IoT gateway in a multi/hop fashion adopting a swarm intelligence-based routing algorithm. In order to deal with the issues raised by the industrial domain, a mobile gateway-sink is adopted. The reliability of the communication system is investigated by a case study on a factory taken as example. A Markovian Agent Model is developed, demonstrating the effectiveness of the swarm intelligent routing protocol coupled with the mobile sink, especially when resource constrained devices (e.g. battery powered) or particularly stressing conditions (e.g. shocks, fatigue) have to be considered. Preliminary experiments show that the proposed solution is quite effective in ensuring high communication reliability in such industrial contexts.

关键词： IoT Industry 4.0 Sensor networks routing algorithm Markovian Agents

来源：评论

学校读者我要写书评

暂无评论

Secure routing algorithm Based on Power-Efficient for Wireless Sensor Networks

Secure Routing Algorithm Based on Power-Efficient for Wirele...

引用

Pacific-Asia Conference on Circuits, Communications and Systems

作者： Wu Bo Li La-yuan Wuhan Univ Technol Sch Comp Sci & Technol Wuhan 430070 Peoples R China

ISBN: (纸本)9780769536149

To the problems of threat to routing security and limited energy of the nodes in sensor network, this paper presents a secure routing algorithm based on power efficient (PESR). The algorithms takes energy optimization, improvements of secure routing, and shorten of transmission delay as its design targets. With the multi-pile policy nodes with more energy storages will undertake more tasks of data switching, which can obtain optimal routing and prolong network lifetime. Security of routing is also efficiently improved through pre-distribution of public and private key pair. Detailed process of routing finding, routing choosing and routing deleting are given in this paper. The affectivity of this algorithm is proved with emulative experiment.

关键词： wireless sensor networks network security routing algorithm energy optimization multi-pile policy

来源：评论

学校读者我要写书评

暂无评论

Node Constraint routing algorithm based on Reinforcement Learning 13

Node Constraint Routing Algorithm based on Reinforcement Lea...

引用

13th IEEE International Conference on Signal Processing (ICSP)

作者： Dong, Weihang Zhang, Wei Yang, Wei UESTC Res Inst Elect Sci & Technol Chengdu Sichuan Peoples R China

ISBN: (纸本)9781509013456

Also named as the path-finding algorithm, the routing algorithm aims at finding a good way between the source point and destination point under some constraint conditions (the path "cost" is the lowest). Specifying part of necessary nodes by the algorithm, the node constraint routing algorithm finds the "good" path and must pass the necessary nodes without the loop;otherwise, the path is invalid. The node constraint shortest path problem is regarded one HP-Hard problem, and the current research generally adopts the violent algorithm or the screening function approach (screen out some paths passing the most of the currently necessary nodes);however, these methods have the loop or own much high time complexity or space complexity, which easily causes the intermittent interruption of the path loop or the network. For the end-to-end node constraint path-finding problem of the common directed network graph, this thesis designs one heuristic search algorithm based on the reinforcement learning the breadth-first traversal;the algorithm adopts thought of combining the breadth-first search and the greedy algorithm to expand the path, adopts the reinforcement learning to predict and screen the importance degree of the path as well and finally gets the path passing all the necessary nodes. The simulation experiments result demonstrates that the algorithm proposed by the thesis can be applicable to the network graph with the larger scale, has good performance in the path weight and the computing time and is regarded as one practically applicable algorithm.

关键词： node constraint routing algorithm reinforcement learning breadth first search shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：