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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,587 篇 会议
708 篇 期刊文献
2 篇 学位论文
1 册 图书

馆藏范围

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

日期分布

学科分类号

2,206 篇 工学
- 1,728 篇 计算机科学与技术...
- 1,166 篇 软件工程
- 866 篇 信息与通信工程
- 608 篇 电气工程
- 195 篇 动力工程及工程热...
- 166 篇 电子科学与技术（可...
- 126 篇 控制科学与工程
- 103 篇 光学工程
- 73 篇 机械工程
- 53 篇 仪器科学与技术
- 49 篇 交通运输工程
- 39 篇 化学工程与技术
- 37 篇 航空宇航科学与技...
- 19 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 农业工程
754 篇 理学
- 459 篇 数学
- 229 篇 物理学
- 46 篇 统计学（可授理学、...
- 45 篇 系统科学
- 39 篇 化学
- 29 篇 生物学
306 篇 管理学
- 168 篇 管理科学与工程(可...
- 153 篇 图书情报与档案管...
- 63 篇 工商管理
32 篇 经济学
- 32 篇 应用经济学
18 篇 医学
- 15 篇 临床医学
17 篇 农学
- 17 篇 作物学
11 篇 法学
6 篇 文学
5 篇 教育学
5 篇 军事学
2 篇 艺术学

主题

2,298 篇 routing algorith...
145 篇 optical networks
98 篇 network topology
94 篇 network routing
77 篇 wireless sensor ...
59 篇 algorithms
44 篇 wavelength assig...
38 篇 interconnection ...
37 篇 network-on-chip
36 篇 routing
34 篇 energy consumpti...
33 篇 wavelength divis...
30 篇 multicast
30 篇 fiber optics and...
29 篇 networks (060.42...
29 篇 quality of servi...
28 篇 ganglia
27 篇 packet switching
26 篇 optical signals
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,098 篇 英文
142 篇 其他
55 篇 中文
2 篇 西班牙文
2 篇 朝鲜文
1 篇 土耳其文

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

共 2298 条记录，以下是1461-1470 订阅

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

详细简洁

排序：

Analysis of the contact graph routing algorithm: Bounding interplanetary paths

Analysis of the contact graph routing algorithm: Bounding in...

引用

作者： Birrane, Edward Burleigh, Scott Kasch, Niels Johns Hopkins University Applied Physics Laboratory United States Jet Propulsion Laboratory United States University of Maryland Baltimore County MD United States

ISBN: (纸本)9781617823688

Interplanetary communications networks comprise orbiters, deep-space relays, and stations on planetary surfaces. These networks must overcome node mobility, constrained resources, and significant propagation delays. Opportunities for wireless contact rely on calculating transmit and receive opportunities, but the Euclidian-distance diameter of these networks (measured in light-seconds and light-minutes) preclude node discovery and contact negotiation. Propagation delay may be larger than the line-of-sight contact between nodes. For example, Mars and Earth orbiters may be separated by up to 20.8 minutes of signal propagation time. Such spacecraft may never share line-of-sight, but may unidirectionally communicate if one orbiter knows the other's future position. The Contact Graph routing (CGR) approach is a family of algorithms presented to solve the messaging problem of interplanetary communications. These algorithms exploit networks where nodes exhibit deterministic mobility. For CGR, mobility and bandwidth information is preconfigured throughout the network allowing nodes to construct transmit opportunities. Once constructed, routing algorithms operate on this contact graph to build an efficient path through the network. The interpretation of the contact graph, and the construction of a bounded approximate path, is critically important for adoption in operational systems. Brute force approaches, while effective in small networks, are computationally expensive and will not scale. Methods of inferring cycles or other librations within the graph are difficult to detect and will guide the practical implementation of any routing algorithm. This paper presents a mathematical analysis of a multi-destination contact graph algorithm (MD-CGR), demonstrates that it is NP-complete, and proposes realistic constraints that make the problem solvable in polynomial time, as is the case with the originally proposed CGR algorithm. An analysis of path construction to complement hop-b

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Waveband Switching in WDM Networks

Adaptive Waveband Switching in WDM Networks

引用

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

作者： Wang, Yang Cao, Xiaojun Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

This work proposes an adaptive routing scheme based on ant optimization techniques and novel graph-based waveband assignment algorithm to accommodate and group online lightpath requests while minimizing the blocking a... 详细信息

ISBN: (纸本)9781557528841

关键词： Assignment algorithms Demultiplexers routing algorithms Wavelength assignment Wavelength division multiplexing Wavelength routing Fiber optics and optical communications (060.0060) Networks (060.4250) Optical communications (060.4510)

来源：评论

学校读者我要写书评

暂无评论

Efficient Topologies for Large-scale Cluster Networks

Efficient Topologies for Large-scale Cluster Networks

引用

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

作者： Kim, John Dally, William J. Abts, Dennis Korea Adv Inst Sci & Technol Taejon 305701 South Korea Stanford Univ Stanford CA 94305 USA Google Inc Madison WI USA

ISBN: (纸本)9781557528841

Increasing integrated-circuit pin bandwidth has motivated a corresponding increase in the degree or radix of interconnection networks and their routers. This paper describes the flattened butterfly, a cost-efficient topology for high-radix networks. On benign (load-balanced) traffic, the flattened butterfly approaches the cost/performance of a butterfly network and has roughly half the cost of a comparable performance Clos network. The advantage over the Clos is achieved by eliminating redundant hops when they are not needed for load balance. On adversarial traffic, the flattened butterfly matches the cost/performance of a folded-Clos network and provides an order of magnitude better performance than a conventional butterfly. In this case, global adaptive routing is used to switch the flattened butterfly from minimal to non-minimal routing-using redundant hops only when they are needed. Different routing algorithms are evaluated on the flattened butterfly and compared against alternative topologies. We also provide a detailed cost model for an interconnection network and compare the cost of the flattened butterfly to alternative topologies to show the cost advantages of the flattened butterfly.

关键词： Network topology Networking hardware Ring networks routing algorithms General science (000.2700)

来源：评论

学校读者我要写书评

暂无评论

On Operating Shared-Path-Protected WDM Networks Non-Revertively by Using Backup Path Reprovisioning

On Operating Shared-Path-Protected WDM Networks Non-Revertiv...

引用

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

作者： Ni, Wenda Patzak, Erwin Schlosser, Michael Ye, Yabin Zhang, Hanyi Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

Performance of using backup path reprovisioning for non-revertive operations of shared-path-protected optical networks is assessed in terms of connection availability. Numerical results indicate that the approach is a... 详细信息

ISBN: (纸本)9781557528841

关键词： Network topology Numerical simulation Optical networks routing algorithms Surface plasmon polaritons Wavelength division multiplexing Fiber optics and optical communications (060.0060) Networks, network survivability (060.4257) Networks, protection and restoration (060.4261)

来源：评论

学校读者我要写书评

暂无评论

Bridge-And-Roll Demonstration in GRIPhoN (Globally Reconfigurable Intelligent Photonic Network)

Bridge-And-Roll Demonstration in GRIPhoN (Globally Reconfigu...

引用

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

作者： Zhang, Xiaolan J. Birk, Martin Chiu, Angela Doverspike, Robert Feuer, Mark D. Magill, Peter Mavrogiorgis, Emmanuil Pastor, Jorge Woodward, Sheryl L. Yates, Jennifer Univ Illinois Dept Elect & Comp Engn 1406 W Green St Urbana IL 61801 USA AT&T Labs Res Middletown NJ USA AT&T Labs Res Florham Pk NJ USA

We describe a ROADM architecture for a dynamically reconfigurable photonic network and demonstrate the performance of a photonic-layer bridge-and-roll that could improve the operational flexibility of optical transpor... 详细信息

ISBN: (纸本)9781557528841

关键词： Multiplexers Networking hardware Optical networks Reconfigurable optical add drop multiplexers routing algorithms Switching Fiber optics and optical communications (060.0060) Networks, protection and restoration (060.4261) Networks, wavelength routing (060.4265)

来源：评论

学校读者我要写书评

暂无评论

A Novel Indoor Navigation Approach Employing Motion Statistics

A Novel Indoor Navigation Approach Employing Motion Statisti...

引用

IEEE 72nd Vehicular Technology Conference Fall 2010

作者： Le, Manh-Hung V. Saragas, Dimitris Webb, Nathan M. Vaz, Richard F. Wyglinski, Alexander M. Barry, Michael McGrath, Sean Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA Univ Limerick Dept Elect & Comp Engn Limerick Ireland

ISBN: (纸本)9781424435746

In this paper, we devised a novel indoor navigation system based on a probabilistic approach that employs data from the wireless adapter, accelerometer, and compass of the mobile device in order to determine user position. A routing algorithm employed by the device calculates the optimal path between user position and its destination. Experimental results verified that two meter accuracy was achieved by the proposed design. This technique shows promise for future handheld indoor navigation systems that can be used in malls, museums, hospitals, and college campuses.

关键词： shopping mall compasses optimal path Navigation systems colleges hospital Mobile devices Campuses Museums Application Adapter routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance property analysis for asymptotically minimal node-degree topology

Fault tolerance property analysis for asymptotically minimal...

引用

2nd International Conference on Information Science and Engineering, ICISE2010

作者： Yang, Guanghui Zhao, Youjian Wu, Jianping Yan, Zhaobo Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781424480968

Scalable routers can satisfy the urgent demand of rapid traffic increase on the Internet. However, link and node failures happen frequently thus fault-tolerance must be considered in the research and implementation of scalable routers. In this paper, we model fault-tolerant mechanism inside the scalable routers based on P2i (Plus 2∧i) topology of our prior work. P2i makes a tradeoff between performance and expansion cost. And it can expand at the minimal granularity while maintain the growth of scalable network diameter at O(log n). Based on this property, we provide a Fault-Tolerant Eigen Path (FTEP) routing algorithm. Using FTEP, we model the link and node failures of P2i and result shows that 100% throughput can be achieved when the speedup ratio equal to (k+2)/2 and k as the number of link failures. © 2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Bridging overloaded nodes in an overlay network by long distance links

Bridging overloaded nodes in an overlay network by long dist...

引用

作者： Lertsuwanakul, Lada-On Unger, Herwig Mututanon, Noppadol Kajadsarapadpai, Pongpan FernUniversität in Hagen Universitätsstralße 27 - PRG 58084 Hagen Germany King Mongkut's University of Technology North Bangkok 1518 Pibulsongkram Rd. Bangkok 10800 Thailand

ISBN: (纸本)9780889868571

This paper proposes a decentralized algorithm in a mesh overlay network in order to build shortcuts across an overloaded node or an area using long distance links. The present method aims to improve the routing performance and increase transmission reliability. This approach runs locally on a grid structure overlaying the basic network. Two groups of agents work cooperatively to build bridges across the traffic peer. The experimental results sustain the proposed idea that bridges give a better success delivery ratio and routing time using greedy routing algorithms. Besides, system shows better load balancing.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved ELGossiping data distribution technique with emphasis on reliability and resource constraints in wireless sensor network

An improved ELGossiping data distribution technique with emp...

引用

2010 International Conference on Electronic Computer Technology, ICECT 2010

作者： Norouzi, Ali Dabbaghian, Mehdi Hatamizadeh, Alireza Ustundag, Burak Berk Amiri, Fatemeh Computer Eng. Dep. Istanbul Technical University Istanbul Turkey Computer Eng. Dep. Roozbeh Institute of Higher Education Zanjan Iran Institute of IT Azerbaijan National Academy of Sciences Baku Azerbaijan Information Technology Dep. Azad University of Mashhad Mashhad Iran

ISBN: (纸本)9781424474059

Sensor networks are composed of many sensors usually far from the region is available. routing in wireless sensor networks for the transfer of information from sensor nodes to base station is especially important. Optimum consumption of energy is important requirements in wireless sensor networks because sensor systems typically use battery power. In this paper with a routing algorithm to determine the optimal path of energy consumption viewpoint for information transfer from sensor nodes to base station with the data transmission we have presented multi-skip. In this algorithm when a sensor felt event, the node that was in transmission radius of sensor and it had minimum distance to the main station as next step is selected and send to only one node is selected. Finally, the proposed algorithm compare with Gossiping and LGossiping algorithms as simulation results show the proposed algorithm has better performance. ©2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A family of interconnection networks for multiprocessor systems

A family of interconnection networks for multiprocessor syst...

引用

2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010

作者： Xu, Chengbo Li, Gang School of Science University of Jinan Jinan China Science and Technology Bureau Zouping China

ISBN: (纸本)9781424465408

In this paper, we proposed a broad family of interconnection networks, denoted as Petersen-Gaussian(PG) networks, based on well-known Petersen network and Gaussian network. And the new networks include part of previously proposed Peterson-torus networks. Firstly, we extend the degree of Gaussian network from 4 to 10, and then set Petersen network as modules on grid points of the extended Gaussian network. In this way, Petersen-Gaussian networks with regular degree 4 are constructed. We obtain upper bounds of diameter and average distance respectively. A routing algorithm of PG is also proposed. In addition, we compare the diameters of PG(b + bi) and honeycomb mesh, diagonal mesh, torus and find PG(b + bi) has smaller diameter and cost. © 2010 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共230页 << < 143 144 145 146 147 148 149 150 151 152 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：