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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是181-190 订阅

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

详细简洁

排序：

Genetic routing algorithm based on Adjacency-constraint Matrix 4

Genetic Routing Algorithm based on Adjacency-constraint Matr...

引用

4th International Conference on Software Engineering and Computer Systems (ICSECS)

作者： Abdullah, Nibras Al-wesabi, Ola A. Kadhum, Mohammed. M. Univ Sains Malaysia Natl Adv IPv6 Ctr NAv6 George Town 11800 Malaysia Univ Sains Malaysia Sch Comp Sci George Town 11800 Malaysia

ISBN: (纸本)9781467367226

MANETs are systematic infrastructureless networks formed of nodes that act as sender, receiver, or router. Node mobility causes frequent topology changes which have negative impact on the network connectivity and performance. Therefore, routing is a serious challenge in such a dynamic environment as reliable paths and most efficient are always required between sources and their destinations. This paper presents routing algorithm based on an adjacency-constraint matrix using Genetic algorithm (GA). GA presents the feasible paths that encoded in chromosomes that created based on the connectivity matrix. The evaluation function that is based on the adjacency-constraint matrix calculates the fitness values to select the most efficient path. With only two constraints, the performance simulation results of the proposed method showed that it outperforms Dynamic Source routing (DSR) in term of transmission delay, which is decreased by about 25%.

关键词： MANET routing algorithm DSR GA

来源：评论

学校读者我要写书评

暂无评论

An Effective routing algorithm to Avoid Unnecessary Link Abandon in 2D Mesh NoCs

An Effective Routing Algorithm to Avoid Unnecessary Link Aba...

引用

16th Euromicro Conference on Digital System Design (DSD)

作者： Chen, Changlin Cotofana, Sorin D. Delft Univ Technol Delft Netherlands

ISBN: (纸本)9780769550749

In NoCs where each interconnection between neighboring routers is composed of a pair of unidirectional links, a broken link usually leads to the abandon of the entire interconnection, even if the other one is still functional. In this paper, we propose a fault tolerant routing algorithm (RA) which can efficiently utilize these fault free links when their pair broken links have available misrouting-contour sides. Constraints on the usage of Virtual Channels are adaptively applied according to the fault distribution, to avoid deadlock and unnecessary resource reservation. When compared with solid fault region tolerant RAs, which always abandon the entire interconnection, the proposed algorithm has twice higher saturation point under synthetic uniform traffics, and can on average diminish the execution time overhead for the evaluated applications, sample and satell, by 62.6% and 76.6%, respectively. Our experiments indicate that the embedding of the proposed algorithm into a baseline router increases the area cost and power consumption by 7.43% and 4.43%, respectively, which is not that significant given that the platform area is usually dominated by the computing cores area.

关键词： Networks-on-Chip Fault tolerant routing algorithm Unidirectional links

来源：评论

学校读者我要写书评

暂无评论

A fully adaptive routing algorithm in torus switching fabrics

A fully adaptive routing algorithm in torus switching fabric...

引用

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

作者： Zhu, XD Li, LM Univ Elect Sci & Technol China Key Lab Broadband Opt Transmiss & Commun Networks Chengdu Peoples R China

ISBN: (纸本)0819451762

Recently, The k-ary n-cube direct interconnect network is considered to construct high performance switching fabric for Internet routers. routing algorithm, which specify how packets can be sent along switching elements in network, are crucial for the high throughput and low latency of switching fabric. For maximum performance, the routing algorithm should exhibit the following important features: avoidance of deadlocks, ability to work well under varying traffic patterns and supporting QoS(Quality of Service). In this paper we present a recovery-based minimal routing algorithm to reach such targets. As with recover-based approach, the detection scheme has significant impact on the performance. A simple and efficient recover scheme is proposed in this paper, queue length and timer-based deadlock detection scheme (QTDS). Then, QTDS-based routing algorithm is proposed (QTDS-R). QTDS-R is applied on a three dimensional (3D) torus architecture. Changing the size of the fabric, the length of packets and the number of virtual channel, the performance of QTDS-R is measured in terms of throughput, average packets latency. The performance comparisons have been done on OPENT simulation tool. Numerical results show that this algorithm is better than other existed adaptive algorithms.

关键词： routing algorithm packet switching fabric routers

来源：评论

学校读者我要写书评

暂无评论

An Energy And Load-based routing algorithm In Wireless Sensor Network

An Energy And Load-based Routing Algorithm In Wireless Senso...

引用

2nd International Symposium on Computational Intelligence and Design

作者： Wang Jinghua Guan Tingting He Huan Chen Yuanyuan Huazhong Normal Univ Dept Comp Sci Wuhan Peoples R China

ISBN: (纸本)9780769538655

In wireless sensor networks, limiting energy consumption of sensors and prolonging the network lifetime haw been important reasons to evaluate routing protocol's performance. This paper proposes a routing metric, which takes into remaining energy and load of the sensor nodes, trying to balance network traffic and protect the low-power and high-load nodes. Base on this metric, we also propose a new routing algorithm called Energy and Load-based routing (ELR). Simulation results show that the new method can even load distribution and node energy.

关键词： wireless sensor network energy load routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Nearest Access routing algorithm for the ZigBee Network in 5G Environment 1

引用

4th International Conference on Communications, Signal Processing, and Systems (CSPS)

作者： Mu, Jiasong Jiang, Shu Tianjin Normal Univ Coll Elect & Commun Engn Tianjin Peoples R China China Shipbldg Ind Corp Inst 704 Shanghai 200031 Peoples R China

ISBN: (数字)9783662498316

ISBN: (纸本)9783662498316;9783662498293

ZigBee network uses a mixed routing mechanism combined with hierarchical tree routing (HRP) and ad hoc on demand distance vector (AODV) to meet the different demands. However, the existing scheme cannot fully satisfy the applications. The 5G communication network is featured by the smarter devices and the native support for the M2 M communication. The 5G terminals have the potential to optimize the data transmission in the ZigBee network. In this paper, we proposed a nearest access routing algorithm for the ZigBee network in 5G environment. Based on the accessibility to various kinds of wireless network of the 5G terminal, the data flow in its neighbourhood is converged and transmitted in the IP network. By that mechanism, the bandwidth and energy resources in the ZigBee network can be saved. The simulation results show that the proposed algorithm effectively share the traffic for the ZigBee network by reducing and balancing the throughput.

关键词： ZigBee routing algorithm 5G Throughput

来源：评论

学校读者我要写书评

暂无评论

DBAR: An Efficient routing algorithm to Support Multiple Concurrent Applications in Networks-on-Chip 11

DBAR: An Efficient Routing Algorithm to Support Multiple Con...

引用

38th Annual International Symposium on Computer Architecture

作者： Ma, Sheng Jerger, Natalie Enright Wang, Zhiying Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781450304726

With the emergence of many-core architectures, it is quite likely that multiple applications will run concurrently on a system. Existing locally and globally adaptive routing algorithms largely overlook issues associated with workload consolidation. The shortsightedness of locally adaptive routing algorithms limits performance due to poor network congestion avoidance. Globally adaptive routing algorithms attack this issue by introducing a congestion propagation network to obtain network status information beyond neighboring nodes. However, they may suffer from intra-and inter-application interference during output port selection for consolidated workloads, coupling the behavior of otherwise independent applications and negatively affecting performance. To address these two issues, we propose Destination-Based Adaptive routing (DBAR). We design a novel low-cost congestion propagation network that leverages both local and non-local network information for more accurate congestion estimates. Thus, DBAR offers effective adaptivity for congestion beyond neighboring nodes. More importantly, by integrating the destination into the selection function, DBAR mitigates infra-and inter-application interference and offers dynarnic isolation among regions. Experimental results show that DBAR can offer better performance than the best baseline algorithm for all measured configurations;it is well suited for workload consolidation. The wiring overhead of DBAR is low and DBAR provides improvement in the energy-delay product for medium and high injection rates.

关键词： Networks-on-chip routing algorithm Workload Consolidation

来源：评论

学校读者我要写书评

暂无评论

Accelerating a Bellman-Ford routing algorithm Using GPU 1

引用

FTRA International Symposium on Frontier and Innovation in Future Computing and Communications (FCC)

作者： Jeong, In-Kyu Uddin, Jia Kang, Myeongsu Kim, Cheol-Hong Kim, Jong-Myon Univ Ulsan Sch Elect Engn Ulsan 680749 South Korea Chonnam Natl Univ Sch Elect & Comp Engn Gwangju South Korea

ISBN: (数字)9789401787987

ISBN: (纸本)9789401787987;9789401787970

This paper presents a graphics processing unit (GPU)-based implementation of the Bellman-Ford (BF) routing algorithm used in distance-vector routing protocols. In the proposed GPU-based approach, multiple threads concurrently run in numerous streaming processors in the GPU to update the routing information instead of computing the individual vertex distances one-by-one, where an individual vertex distance is considered as a single thread. This paper compares the performance and energy consumption of the GPU-based approach with those of the equivalent central processing unit (CPU) implementation for varying the number of vertices. Experiment results show that the proposed approach outperforms the equivalent sequential CPU implementation in terms of execution time by exploiting massive parallelism inherent in the BF routing algorithm.

关键词： Bellman-Ford algorithm Internet protocol routing Graphics processing unit routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Topology routing algorithm for Opportunistic Network Based on Self-attention Mechanism 1

引用

21st International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Wu, Xiaorui Xu, Gang Hao, Xinyu Huang, Baoqi Bai, Xiangyu Inner Mongolia Univ Coll Comp Sci Hohhot 010021 Peoples R China Inner Mongolia Univ Inner Mongolia AR Key Lab Wireless Networking & M Hohhot Peoples R China

ISBN: (数字)9783030953843

ISBN: (纸本)9783030953843;9783030953836

In opportunistic networks, it is difficult to find the best relay node, which not only makes the message transmission inefficient but also wastes resources in the network. Most of the existing routing algorithms based on node similarity often choose relay nodes from a single point of view such as time or space. In this paper, a new neural network architecture is designed, namely, OSAN. It combined with the self-attention mechanism, the spatial and temporal variation characteristics of nodes in two dimensions are taken into account comprehensively to the maximum. Firstly, we divide the opportunistic networks into opportunity network snapshots according to the time window and input each opportunity network snapshot into the spatial structure self-attention layer. At the same time, to capture the interaction between different snapshots, we use the temporal self-attention mechanism. Thus, the Spatio-temporal characteristics of nodes in different snapshots are extracted. Finally, the similarity between nodes is calculated according to the Spatio-temporal characteristics extracted by nodes, so we propose a Spatio-temporal topology routing algorithm in opportunistic networks based on the self-attention mechanism (STSA). The simulation results show that STSA has advantages in several common performance indexes.

关键词： Opportunistic networks Dynamic graph embedding Self-attention mechanism Node spatio-temporal feature extraction routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Link Failure Aware routing algorithm for Networks-on-Chip in Nano Technologies

A Link Failure Aware Routing Algorithm for Networks-on-Chip ...

引用

9th IEEE Conference on Nanotechnology (IEEE-NANO)

作者： Valinataj, Mojtaba Mohammadi, Siamak Safari, Saeed Plosila, Juha Univ Tehran Sch Elect & Comp Engn Tehran Iran Univ Turku Dept Informat Technol Turku Finland

ISBN: (纸本)9789810836948

As nanotechnology scales down, the reliability issues are becoming more crucial, especially for Network-on-Chip (NoC) which must provide the communication requirements of Multi-Processor System-on-Chip (MP-SoC) even in presence of faults. In this paper we present a low cost faulty-link-tolerant routing algorithm through dynamic reconfiguration when the regular mesh topology is altered by faulty links. This algorithm is a reconfigurable extension of deterministic routing algorithms and is deadlock free by prohibiting a few turns. The performance and total energy consumption overheads which are very small under the low loads are evaluated through appropriate simulations.

关键词： NoC routing algorithm permanent fault reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Agent routing algorithm in Wireless Sensor Networks

Agent Routing Algorithm in Wireless Sensor Networks

引用

4th International Conference on Graphic and Image Processing (ICGIP)

作者： Zhang Yuqing Yang Shuqun Fujian Normal Univ Fac Software Fuzhou Peoples R China

ISBN: (纸本)9780819495662

Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.

关键词： Agent wireless sensor network energy consumptio routing algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：