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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,586 篇 会议
718 篇 期刊文献
3 篇 学位论文
1 册 图书

馆藏范围

2,308 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,215 篇 工学
- 1,737 篇 计算机科学与技术...
- 1,176 篇 软件工程
- 870 篇 信息与通信工程
- 612 篇 电气工程
- 196 篇 动力工程及工程热...
- 168 篇 电子科学与技术（可...
- 126 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 53 篇 仪器科学与技术
- 50 篇 交通运输工程
- 40 篇 化学工程与技术
- 37 篇 航空宇航科学与技...
- 20 篇 土木工程
- 19 篇 建筑学
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 农业工程
757 篇 理学
- 461 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 40 篇 化学
- 29 篇 生物学
307 篇 管理学
- 169 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 64 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
5 篇 军事学
2 篇 艺术学

主题

2,308 篇 routing algorith...
145 篇 optical networks
97 篇 network topology
94 篇 network routing
77 篇 wireless sensor ...
59 篇 algorithms
44 篇 wavelength assig...
37 篇 network-on-chip
37 篇 interconnection ...
36 篇 routing
34 篇 energy consumpti...
33 篇 wavelength divis...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
29 篇 quality of servi...
28 篇 ganglia
26 篇 optical signals
26 篇 packet switching
25 篇 networking hardw...

机构

9 篇 beijing univ pos...
8 篇 college of infor...
7 篇 tsinghua univ de...
7 篇 beijing universi...
6 篇 univ glasgow dep...
6 篇 chongqing key la...
5 篇 univ calif davis...
5 篇 univ nebraska de...
5 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 northeastern uni...
4 篇 school of commun...
4 篇 northeastern uni...
4 篇 school of electr...
4 篇 university of el...
4 篇 school of comput...
4 篇 kth royal inst t...
4 篇 columbia univ de...
4 篇 college of compu...
4 篇 kazimierz wielki...

作者

15 篇 ren zhi
14 篇 zhang jie
13 篇 zhao yongli
8 篇 xu gang
8 篇 skeie tor
8 篇 kaneko keiichi
7 篇 wang xingwei
7 篇 duato j
7 篇 huang min
7 篇 peng shietung
6 篇 kumar shashi
6 篇 ebrahimi masoume...
6 篇 ould-khaoua m
6 篇 piechowiak macie...
6 篇 zwierzykowski pi...
6 篇 escudero-sahuqui...
6 篇 palesi maurizio
5 篇 min huang
5 篇 duan xinming
5 篇 duato j.

语言

2,160 篇 英文
79 篇 其他
66 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2308 条记录，以下是751-760 订阅

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

详细简洁

排序：

Clustered Edge routing 8

Clustered Edge Routing

引用

IEEE Pacific Visualization Symposium (PacificVis)

作者： Bouts, Quirijn W. Speckmann, Bettina TU Eindhoven Dept Math & Comp Sci Eindhoven Netherlands

ISBN: (纸本)9781467368797

The classic method to depict graphs is a node-link diagram where vertices (nodes) are associated with each object and edges (links) connect related objects. However, node-link diagrams quickly appear cluttered and unclear, even for moderately sized graphs. If the positions of the nodes are fixed then suitable link routing is the only option to reduce clutter. We present a novel link clustering and routing algorithm which respects (and if desired refines) user-defined clusters on links. If no clusters are defined a priori we cluster based on geometric criteria, that is, based on a well-separated pair decomposition (WSPD). We route link clusters individually on a sparse visibility spanner. To completely avoid ambiguity we draw each individual link and ensure that clustered links follow the same path in the routing graph. We prove that the clusters induced by the WSPD consist of compatible links according to common similarity measures as formalized by Holten and van Wijk [17]. The greedy sparsification of the visibility graph allows us to easily route around obstacles. Our experimental results are visually appealing and convey a sense of abstraction and order.

关键词： I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling Network routing Ganglia similar measure routing algorithms clutter Abstraction Clusters

来源：评论

学校读者我要写书评

暂无评论

A weighted fat-tree routing algorithm for efficient load-balancing in InfiniBand enterprise clusters 23

A <i>weighted</i> fat-tree routing algorithm for efficient l...

引用

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Zahid, Feroz Gran, Ernst Gunnar Bogdanski, Bartosz Johnsen, Bjorn Dag Skeie, Tor Simula Res Lab Fornebu Norway Oracle Corp Redwood City CA USA Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781479984909

InfiniBand (IB) has become a popular network interconnect for high-performance computing (HPC) systems. Many of the large IB-based HPC systems use some variant of the fat-tree topology to take advantage of the useful properties fat-trees offer. The fat-tree routing algorithm is one of the most efficient deterministic routing algorithms for fat-tree topologies. The algorithm ensures that the number of routes assigned to each link are balanced across the fabric. However, one problem with its load-balancing technique is that it assumes uniform traffic distribution in the network. When routes towards nodes that mainly consume large amount of data are assigned to share links in the fabric while alternative links are underutilized, sub-optimal network throughput is obtained. Also, as the fat-tree algorithm routes nodes according to the indexing order, the performance may differ for two systems cabled in the exact same way. In this paper, we propose wFatTree, a novel fat-tree routing algorithm, which considers node traffic characteristics to balance load across the network links more evenly, and with predictable network performance. Our experiments and simulations show an improvement of up to 60% in total network throughput on large fat-tree installations when using wFatTree routing. Furthermore, wFatTree can also be used to prioritize traffic flowing towards the critical nodes in the network.

关键词： Infini Band fat-trees interconnection networks load-balancing routing algorithms Load balancing routing algorithms Interconnection networks Network throughput Ganglia Traffic distribution number of routes High Performance Computing

来源：评论

学校读者我要写书评

暂无评论

SlimUpdate: Minimal routing Update for Performance-based Reconfigurations in Fat-Trees

SlimUpdate: Minimal Routing Update for Performance-based Rec...

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Zahid, Feroz Gran, Ernst Gunnar Bogdanski, Bartosz Johnsen, Bjorn Dag Skeie, Tor Simula Res Lab Fornebu Norway Oracle Corp Oslo Norway Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781467365987

As the size of high-performance computing systems grows, the number of events requiring a network reconfiguration, as well as the complexity of each reconfiguration, is likely to increase. In large systems, the probability of component failure is high. At the same time, with more network components, ensuring high utilization of network resources becomes challenging. Reconfiguration in interconnection networks, like InfiniBand (IB), typically involves computation and distribution of a new set of routes in order to maintain connectivity and performance. In general, current routing algorithms do not consider the existing routes in a network when calculating new ones. Such configuration-oblivious routing might result in substantial modifications to the existing paths, and the reconfiguration becomes costly as it potentially involves a large number of source-destination pairs. In this paper, we propose a novel routing algorithm for IB based fat-tree topologies, SlimUpdate. SlimUpdate employs techniques to preserve existing forwarding entries in switches to ensure a minimal routing update, without any performance penalty, and with minimal computational overhead. We present an implementation of SlimUpdate in OpenSM, and compare it with the current de facto fat-tree routing algorithm. Our experiments and simulations show a decrease of up to 80% in the number of total path modifications when using SlimUpdate routing, while achieving similar or even better performance than the fat-tree routing in most reconfiguration scenarios.

关键词： network routing parallel processing resource allocation trees (mathematics) HPC system SlimUpdate fat-tree topology high-performance computing system minimal routing algorithm network resource utilization performance-based network reconfiguration Bandwidth Heuristic algorithms Network topology Ports (Computers) Radiation detectors routing Topology InfiniBand dynamic network reconfiguration high-performance computing interconnection networks minimal routing update routing algorithms Network routing routing algorithms High Performance Computing Infiniband Interconnection networks Resource utilization Network reconfiguration Radiation detectors Heuristic algorithms Network topology PARALLEL PROCESSING (COMPUTERS) Reconfiguration Bandwidth topology Web resources

来源：评论

学校读者我要写书评

暂无评论

Applying Power Series routing Algorithm in Transparent Elastic Optical Networks

Applying Power Series Routing Algorithm in Transparent Elast...

引用

Microwave and Optoelectronics Conference (IMOC), 2015 SBMO/IEEE MTT-S International

作者： Cavalcante, M. A. Pereira, H. A. Chaves, D. A. R. Almeida, R. C., Jr. Univ Fed Campina Grande Comp & Elect Engn Ctr Dept Elect Engn Radiometry Res Grp BR-58429900 Campina Grande PB Brazil Univ Pernambuco Polytech Sch Pernambuco BR-50720001 Recife PE Brazil Univ Fed Pernambuco Elect & Syst Dept BR-50740550 Recife PE Brazil

ISBN: (纸本)9781467394925

In this paper, we propose two adaptations of the Power Series routing (PSR) algorithm for transparent elastic optical networks: PSR algorithm with normalized distance and slot availability (PSRNDA) and PSR algorithm for normalized distance and slot contiguity (PSRNDC). In our analysis, we consider amplified spontaneous emission as physical impairment, different modulation formats and bit transmission rates, as well as losses on spectrum selective switch (SSS) devices. The results are obtained in terms of call blocking probability as a function of the network load. Comparing our proposed algorithms to several others present in the literature, our proposals overcame all of them.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Programmable Wavelength Locking and routing in a Silicon-Photonic Interconnection Network Implementation

Programmable Wavelength Locking and Routing in a Silicon-Pho...

引用

Optical Fiber Communications Conference and Exhibition (OFC)

作者： Calhoun, David M. Li, Qi Browning, Colm Abrams, Nathan C. Liu, Yang Ding, Ran Barry, Liam P. Baehr-Jones, Tom Hochberg, Michael Bergman, Keren Columbia Univ Dept Elect Engn New York NY 10027 USA Dublin City Univ Rince Inst Dublin 9 Ireland Coriant Adv Technol Grp New York NY 10011 USA

A programmable control system for wavelength locking WDM channels on microring arrays is used to demonstrate arbitrary demultiplexing and selection of fast switchable wavelengths. Successful data measurements verify t... 详细信息

ISBN: (纸本)9781557529374

关键词： Demultiplexers Diode lasers Optical networks routing algorithms Signal processing Wavelength routing

来源：评论

学校读者我要写书评

暂无评论

Maximally Adaptive, Deadlock-Free routing in Spidergon-Donut Network for Large Multicore NOCs 14

Maximally Adaptive, Deadlock-Free Routing in Spidergon-Donut...

引用

IEEE 14th International Symposium on Parallel and Distributed Computing (ISPDC)

作者： Albughdar, Marwah Mahmood, Ausif Univ Bridgeport Comp Engn Bridgeport CT 06604 USA Univ Bridgeport Comp Sci & Engn Bridgeport CT USA

ISBN: (纸本)9781467371483

With increasing number of cores in modern processors, an efficient network on a chip (NOC) is the key to next generation processors. Of the many NOC architectures being proposed, the Spidergon network has gained popularity due to its low cost and high performance, and has been implemented in commercial processors. Recently, an improved version of this network termed as the Spidergon-Donut (SD) network that extends the Spidergon network in a second dimension was developed. The SD network results in lower diameter than a 2-D mesh and thus it is a good candidate for future NOC implementations. This paper presents a new routing algorithm for the SD network that is deadlock free and maximally adaptive. By employing our deadlock free algorithm on one of the virtual channels, maximal flexibility can be achieved in routing. We compute the flexibility provided by our deadlock free routing and show that it results in balanced traffic in the network without causing hotspots.

关键词： Network on chip multi-core processors routing algorithms deadlock free routing

来源：评论

学校读者我要写书评

暂无评论

AntWMNet - A Hybrid routing Algorithm for Wireless Mesh Networks Based on Ant Colony Optimisation 13th

AntWMNet - A Hybrid Routing Algorithm for Wireless Mesh Netw...

引用

13th International Conference on Wired and Wireless Internet Communications (WWIC)

作者： Mariscal, Luis J. Trivino, Alicia Boavida, Fernando Univ Malaga E-29071 Malaga Spain Univ Coimbra Dept Informat Engn CISUC Coimbra Portugal

ISBN: (纸本)9783319225722;9783319225715

routing in wireless mesh networks is of paramount importance to their good performance. As this type of network is becoming key to many application scenarios, it is fundamental to guarantee that routing is as efficient as possible. Despite extensive research work carried out in the past, existing routing algorithms have problems in terms of latency, throughput, network overhead, and/or scalability, depending on their type. In the current paper we propose a hybrid wireless mesh networks routing algorithm that addresses the referred problems, exploring the ant colony optimisation paradigm. The algorithm, named AntWMNet, was extensively studied through simulation using OMNET++, and the results show that it clearly outperforms the reference AODV algorithm.

关键词： Wireless mesh networks routing algorithms Ant colony optimisation

来源：评论

学校读者我要写书评

暂无评论

XORAdap: A HoL-blocking aware adaptive routing algorithm 23

XORAdap: A HoL-blocking aware adaptive routing algorithm

引用

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Penaranda, Roberto Gomez, Crispin Engracia Gomez, Maria Lopez, Pedro Univ Politecn Valencia Valencia Spain

ISBN: (纸本)9781479984909

routing is a key parameter in the design of the interconnection network of large parallel computers. Depending on the number of routing options available for each packet, routing algorithms can be deterministic (one available path) or adaptive (several ones). Adaptive routing usually outperforms deterministic routing but it also may increase the Head-of-Line blocking effect. Usually, adaptive routing uses virtual channels to provide routing flexibility and to guarantee deadlock freedom. On the other hand, deterministic routing is simpler and therefore it has lower routing delay. In this paper, we take the challenge of developing new routing algorithms for direct topologies that exploit virtual channels in an efficient way combining the good properties of both routing algorithms types: flexibility and reduced HoL blocking. To do that, this paper proposes several hybrid (combination of adaptivity and determinism) simple mechanisms to perform an efficient distribution of packets among virtual channels based on their destination. The resulting routing mechanisms are able to adapt to the different traffic patterns to obtain the best performance while keeping the simplicity of routing.

关键词： Direct topologies Head of line blocking adaptive algorithms deterministic algorithms Network routing deterministic algorithms virtual channels routing algorithms Adaptive algorithms traffic patterns Interconnection networks parametric design Packet Self tuning

来源：评论

学校读者我要写书评

暂无评论

A Buffer-limited Maximum Throughput routing Algorithm for Satellite Network 22

A Buffer-limited Maximum Throughput Routing Algorithm for Sa...

引用

22nd International Conference on Telecommunications (ICT)

作者： Lin, Bing Li, Hongyan Long, Yan Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China

ISBN: (纸本)9781479980789

Satellite network has played an important role in the future global network, due to its advantages of global coverage and short round-trip time (RTT). Its characteristic of intermittent connection causes no-existence of end-to-end path in general in Disruption Tolerant Network (DTN), and thus the store-carry-forward mechanism is adopted. However, the store-carry-forward routing does not consider the buffer constraint on nodes, and thus a novel routing scheme should be designed for such scenario. In this paper, a novel model based on time-varying graph (TVG) is devised, which keeps the richness of the original DTN information. Based on early-connect-early-select path mechanism, we design the labeling algorithm for DTN (LAD) under buffer constraint to maximize the network throughput. Numerical simulation shows that the proposed mechanism can effectively achieve better throughput performance than the algorithm which selects path randomly.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Intra-Vehicle Network routing Algorithm for Wiring Weight and Wireless Transmit Power Minimization 20

Intra-Vehicle Network Routing Algorithm for Wiring Weight an...

引用

The 20th Asia and South Pacific Design Automation Conference

作者： Huang, Ta-Yang Chang, Chia-Jui Lin, Chung-Wei Roy, Sudip Ho, Tsung-Yi Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

ISBN: (纸本)9781479977925

As the complexity of vehicular distributed systems increases rapidly, several hundreds of devices (sensors, actuators, etc.) are being placed in a modern automotive system. With the increase in wiring cables connecting these devices, the weight of a car increases significantly, which degrades the fuel efficiency in driving. In order to reduce the weight of a car, wireless communication has been introduced to replace wiring cables between some devices. However, the extra energy consumption for packet transmissions by wireless devices requires frequent maintenance, e.g., recharging of batteries. In this paper, we propose an intra-vehicle network routing algorithm to simultaneously minimize the wiring weight and the transmit power for wireless communication. Experimental results show that the proposed method can effectively minimize the wiring weight and the transmit power for wireless communication.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共231页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：