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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,584 篇 会议
698 篇 期刊文献
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

2,192 篇 工学
- 1,727 篇 计算机科学与技术...
- 1,172 篇 软件工程
- 863 篇 信息与通信工程
- 600 篇 电气工程
- 196 篇 动力工程及工程热...
- 165 篇 电子科学与技术（可...
- 125 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 51 篇 仪器科学与技术
- 50 篇 交通运输工程
- 40 篇 化学工程与技术
- 36 篇 航空宇航科学与技...
- 18 篇 土木工程
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 17 篇 建筑学
- 16 篇 农业工程
755 篇 理学
- 459 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 40 篇 化学
- 29 篇 生物学
306 篇 管理学
- 168 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 64 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
4 篇 军事学
2 篇 艺术学

主题

2,285 篇 routing algorith...
145 篇 optical networks
97 篇 network topology
90 篇 network routing
75 篇 wireless sensor ...
55 篇 algorithms
44 篇 wavelength assig...
37 篇 network-on-chip
37 篇 interconnection ...
36 篇 routing
33 篇 wavelength divis...
31 篇 energy consumpti...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
27 篇 ganglia
26 篇 optical signals
25 篇 networking hardw...
25 篇 quality of servi...
25 篇 packet switching

机构

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,151 篇 英文
66 篇 其他
63 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2285 条记录，以下是61-70 订阅

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

详细简洁

排序：

On the Methodology for the Evaluation of Unconstrained Multicast routing algorithms

On the Methodology for the Evaluation of Unconstrained Multi...

引用

16th International Conference on Telecommunications (ICT)

作者： Stasiak, Maciej Piechowiak, Maciej Zwierzykowski, Piotr Poznan Univ Tech Poznan Poland Kazimierz Wielki Univ Bydgoszcz Poland Poznan Univ Tech Poznan Poland

ISBN: (纸本)9781424429363

Having in mind various implementations of methods for generating network topology [1], [2], [3], there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.

关键词： multicast routing algorithms network topology optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

On routing algorithms with end-to-end delay guarantees 7

On routing algorithms with end-to-end delay guarantees

引用

7th International Conference on Computer Communications and Networks

作者： Rao, NSV Batsell, SG Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)0818690143

We consider the transmission. of a message of size r from a source to a destination. over a computer network with n nodes and m links. There are three sources of delays: (a) propagation delays along the links, (b) delays due to bandwidth availability on the links, and (c) queuing delays at the intermediate nodes. First, we consider that the delays on various links and nodes are given. as functions of the message site. If the delay in (b) is a non-increasing function Of the bandwidth, we propose O(m(2) + mnlogn) time algorithm to compute a path with the minimum end-to-end delay for any given message size r. We then consider that the queuing delay in (c) is a random variable correlated with the message size according to an unknown distribution. At each node. the measurements of queuing delays and message sizes are available. We propose too algorithms to compute paths whose delays are close to optimal delays with a high probability, irrespective of the distribution of the delays.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Effective routing algorithms Based on Node Usage Probability from a Complex Network Perspective

Effective Routing Algorithms Based on Node Usage Probability...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Wu, Jiajing Tse, Chi K. Lau, Francis C. M. Hong Kong Polytech Univ Dept Elect & Informat Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781479934324

In this paper, we study the traffic performance in communication networks from a complex network perspective. The node usage probability is an effective metric for characterizing the traffic load distribution and how frequently a node is chosen to relay packets in a network. Based on the concept of node usage probability, we propose an effective routing strategy to maintain balanced traffic loads in the network nodes by avoiding overuse of certain nodes. Simulation results show that routing algorithms based on the proposed strategy can effectively balance traffic loads and improve the overall traffic performance.

关键词： Barium Communication networks Complex networks Erbium Heuristic algorithms Internet routing complex networks networks(communications) Heuristic algorithms Erbium Network routing barium routing algorithms Telecommunications Internets Transportation load Line of nodes

来源：评论

学校读者我要写书评

暂无评论

Maze routing algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs 12

Maze Routing Algorithms with Exact Matching Constraints for ...

引用

IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Ozdal, Muhammet Mustafa Hentschke, Renato Fernandes Intel Corp Strateg CAD Labs Hillsboro OR 97124 USA Intel Corp Core CAD Technol Hillsboro OR 97124 USA

ISBN: (纸本)9781450315739

Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with non-uniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for multiple nets. We also propose a scalable framework that utilizes the proposed maze routing algorithm for realistic problem sizes. Compared to the pattern routing algorithms proposed recently [8], our algorithms allow a more thorough exploration of the solution space by allowing bends to be inserted to avoid congested regions. The experimental study demonstrates that the proposed algorithm leads to significant reductions in congestion costs compared to the previous algorithm.

关键词： Signal design Solution space Analog routing algorithms Mazes Computer-Aided Design Analog Exact

来源：评论

学校读者我要写书评

暂无评论

The Evaluation of Multicast routing algorithms with Delay Constraints in Mesh Networks

The Evaluation of Multicast Routing Algorithms with Delay Co...

引用

8th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP)

作者： Piechowiak, Maciej Zwierzykowski, Piotr Univ Econ Inst Informat & Mechatron Bydgoszcz Poland Poznan Univ Tech Chair Commun & Comp Networks Poznan Poland

ISBN: (纸本)9781457714733

Wireless mesh networks are playing an important role in extending the implementation of traditional wireless infrastructure (cellular networks, wireless LAN, etc). routing design in mesh networks is a challenge because of limited node resources. Thus efficient data transmission techniques like multicasting regarding quality of service requirements are under scrutiny. The article analyzes and explores the performance of multicast heuristic algorithms and quality of multicast trees in mesh networks.

关键词： Mesh networks routing algorithms Multicast Quality of service Wireless mesh networks PASSAGE PLANNING

来源：评论

学校读者我要写书评

暂无评论

Power-aware 3D position-based routing algorithms for ad hoc networks

Power-aware 3D position-based routing algorithms for ad hoc ...

引用

IEEE International Conference on Communications (ICC 2007)

作者： Abdallah, A. E. Fevens, T. Opatrny, J. Concordia Univ Dept Comp Sci & Software Engn Montreal PQ H3G 1M8 Canada

ISBN: (纸本)9781424403523

A crucial problem in ad hoc networks is finding an efficient and correct route between a source and a destination;however for many networks, a more important problem is providing an energy efficient route because of, for example, the limited battery life of the wireless nodes. Most previous routing protocols make the routing decision without taking into account the energy budget of the nodes. In addition, when using a fixed transmission power, nodes may waste power by transmitting with more power than is needed for correct reception. In position-based routing algorithms, the nodes use the geographical position of the nodes to make the routing decisions. In this paper we present several localized power-aware 313 position-based routing algorithms that increase the life-time of the network by maximizing the life time of the nodes. These new algorithms use the idea of replacing the constant transmission power of the node with an adjusted transmission power during two stages - first a lower power while discovering the neighboring nodes, and, if needed, a second higher transmission power during the routing process. We evaluate our algorithms and compare their power savings with the current power-aware routing algorithms. The simulation results show a significant improvement in the energy saving (up to 50%).

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

LOGARITHMICALLY SCALABLE routing algorithms IN LARGE OPTICAL NETWORKS

LOGARITHMICALLY SCALABLE ROUTING ALGORITHMS IN LARGE OPTICAL...

引用

14th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 95) - Bringing Information to People

作者： ZHANG, ZS GUO, DY ACAMPORA, A COLUMBIA UNIV CTR TELECOMMUN RESNEW YORKNY 10027

ISBN: (纸本)081866990X

In this paper, we present three logarithmically scalable routing algorithms for very large optical networks. The algorithms are based on a hierarchical approach. Each algorithm requires a different amount of information to be stored at each node, and results in a different efficiency. The network capacity provided by each algorithm is compared with that provided by the global shortest path algorithm (which is not scalable). It is found that the network capacities of the three algorithms are almost the same as that of the global shortest path algorithm. For fixed routing algorithms, we use an approximate analysis from which the blocking probability at a fixed network load can iterately be obtained (we use call blocking probability as our quality objective and compare network capacity by observing the difference in the offered load which produces the same blocking probability). The approximate analysis is validated through simulation and is found to be very accurate. Scalable, quasi-dynamic routing algorithms are also studied. Numerical results show that, when the node-capacity is equal to the capacity of a single wavelength and the bandwidth required per call is large (greater than 24% of the link capacity), the capacity provided by the quasi-dynamic routing algorithm is very close to that of an infinite capacity centralized switch (lowest possible call blocking caused exclusively by congestion on the finite capacity user input/output links, never by the switch fabric itself). In all the examples considered, the improvement of the quasi-dynamic routing algorithm over the fixed routing algorithm is significant © Copyright 2009 IEEE - All Rights Reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparative Evaluation of FPGA and ASIC Implementations of Bufferless and Buffered routing algorithms for On-Chip Networks 16

Comparative Evaluation of FPGA and ASIC Implementations of B...

引用

16th International Symposium on Quality Electronic Design (ISQED)

作者： Cai, Yu Mai, Ken Mutlu, Onur Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781479975815

Most existing packet-based on-chip networks assume routers have buffers to buffer packets at times of contention. Recently, deflection-based bufferless routing algorithms have been proposed as an alternative design to reduce the area, power, and complexity disadvantages associated with buffering in routers. While bufferless routing shows significant promise at an algorithmic level, these algorithms have not been shown to be efficiently implementable in practice. Neither were they extensively compared to existing buffered routing algorithms in realistic designs. This paper presents our comparative evaluation of and experiences with realistic FPGA and ASIC designs of state-of-the-art (1) virtual-channel buffered, (2) deflection-based bufferless, and (3) deflection-based buffered routing algorithms using two different network topologies and network sizes. We show that bufferless routing algorithms are implementable without significant complexity, and compare their performance, area, frequency, and power consumption to their buffered counterparts. Our results indicate that bufferless routing can lead to significant area (38%), power consumption (30%), and router cycle time (8%) reductions over the best buffered router implementation on 65nm ASIC design, while operating at higher frequency.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Opportunity Cost Analysis of Online routing algorithms for Dynamic Wavelength Routed Mesh Networks

Opportunity Cost Analysis of Online Routing Algorithms for D...

引用

Conference on Optical Fiber Communication (OFC)/Collocated National Fiber Optic Engineers (NFOEC)

作者： Zhang, Xiaolan J. kim, Sun-il Lumetta, Steven S. Univ Illinois Dept Elect & Comp Engn 1406 W Green St Urbana IL 61801 USA Univ Alaska Anchorage Comp Syst Engn Anchorage AK 99508 USA

We introduce a new cost model to analyze end-to-end online routing algorithms in dynamic wavelength routed mesh networks. This model leads to the design of simple and efficient routing algorithms with congestion aware... 详细信息

ISBN: (纸本)9781557528841

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparative performance evaluation of Software-Based fault-tolerant routing algorithms in adaptively-routed tori

Comparative performance evaluation of Software-Based fault-t...

引用

6th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA-08)

作者： Safaei, F. Khonsari, A. Shantia, A. H. Shahid Beheshti Univ Med Sci Dept Elect & Comp Engn Tehran Iran Univ Tehran Dept Elect & Comp Engn Tehran 14174 Iran Islamic Azad Univ Tehran Iran

ISBN: (纸本)9781424419678

Fault-tolerance and network routing have been among the most widely studied topics in the research of parallel processing and computer networking. A fault-tolerant routing algorithm should guarantee the delivery of messages in the presence of faulty components. In this paper, we present a comparative performance study of nine prominent fault-tolerant routings in 2-D wormhole-switched tori. These networks carry the Software-Based routing scheme which has been suggested as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer networks due to its ability to preserve both communication performance and fault-tolerant demands in such systems. The performance measures studied are the throughput, average message latency, power, and average usage of virtual channels per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidates in most faulty networks.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：