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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Energy-Efficient and Location-Aware Ant Colony Based routing algorithms for Wireless Sensor Networks 11

Energy-Efficient and Location-Aware Ant Colony Based Routing...

引用

13th Annual Genetic and Evolutionary Computation Conference (GECCO)

作者： Dominguez-Medina, Christian Cruz-Cortes, Nareli Inst Politecn Nacl Ctr Invest Comp Mexico City DF Mexico

ISBN: (纸本)9781450305570

In recent years, advances in miniaturization, low-power circuit design, simple, low power, yet reasonably efficient wireless communication equipment, and improved small-scale energy supplies have combined with reduced manufacturing costs to make a new technological vision possible, Wireless Sensor Networks (WSN). As WSN are still a young research field, much activity is still on-going to solve many open issues. One is the data routing problem. As the size of the network increases, this problem becomes more complex due the amount of sensor nodes in the network. The meta-heuristic Ant Colony Optimization (ACO) has been proposed to solve this issue. ACO based routing algorithms can add a significant contribution to assist in the maximisation of the network lifetime and in the minimisation of the latency in data transmissions, but this is only possible by means of an adaptable and balanced algorithm that takes into account the WSN main restrictions, for example, memory and power supply. A comparison of two ACO based routing algorithms for WSN is presented, taking into account current amounts of energy consumption under a WSN scenario proposed in this work. Furthermore, a new routing algorithm is defined.

关键词： Wireless Sensor Networks (WSN) Network Lifetime routing algorithms Ant Colony Optimization (ACO)

来源：评论

学校读者我要写书评

暂无评论

Call Capacity Model and QoS routing algorithms on Multi-Channel Multi-Radio Wireless Meshes

Call Capacity Model and QoS Routing Algorithms on Multi-Chan...

引用

18th Asia-Pacific Conference on Communications (APCC) - Green and Smart Communications for IT Innovation

作者： Kim, Sunghun Ji, Myungln Ma, Joong Soo Attached Inst ETRI Daejoen South Korea ETRI Daejoen South Korea Korea Adv Inst Sci & Technol Daejoen South Korea

ISBN: (纸本)9781467347280

The capacity of the conventional wireless mesh network (WMN) with single channel single radio is limited due to co-channel interference. To resolve this capacity limitation problem, multichannel multi-radio (MCMR) protocols have been proposed, and hybrid multi-channel protocol (HMCP) is a representative MCMR protocol. However, supporting delay sensitive realtime VoIP applications over high capacity MCMR-WMNs is still challenging problem. To support VoIP service over an MCMR WMN. we need the accurate call capacity model to estimate the feasible capacity region, and route computation algorithms for allocating the routes of voice calls within the feasible region to meet qnality-of-service (QoS) constraints and improve the call capacity. In this paper, we introduce a new voice call capacity model of HMCP on MCMR WMNs. Both experimental and simulation results demonstrate that the proposed call capacity model accurately estimates the voice call capacity for G.711 and G.729 codecs within 5% of the actual call capacity. Also, we propose two QoS routing algorithms for finding feasible routes to meet QoS constraints as well as to improve the call capacity of network by utilizing the proposed call capacity model (i.e., feasibility considerations). By extensive simulations, our proposed QoS routing algorithms effectively protect voice calls and increase the call capacity.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector routing algorithms

A Probabilistic Approach to the Count-To-Infinity Problem in...

引用

8th International Conference on Dependability and Complex Systems (DepCoS-RELCOMEX)

作者： Czubak, Adam Opole Univ Inst Math & Informat PL-45052 Opole Poland

ISBN: (纸本)9783319009452

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Unicast routing algorithms in Software-Defined Networking

Efficient Unicast Routing Algorithms in Software-Defined Net...

引用

European Conference on Networks and Communications (EuCNC)

作者： Sheu, Jang-Ping Zeng, Quan-Xiang Jagadeesha, R. B. Chang, Yeh-Cheng Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

ISBN: (纸本)9781509028931

The recently developed Software-Defined Networking (SDN) provides flexibility, scalability and reduce the cost of hardware for operators and vendors. In this paper, we propose four routing algorithms in SDN to minimize network latency and balance the traffic load of each switch link in a network. The first routing algorithm is the shortest path first (SPF) algorithm. The SPF algorithm can find the shortest path with maximum bottleneck bandwidth (MBB) among all shortest paths. The second algorithm is the bandwidth aware routing (BAR) algorithm. The BAR algorithm can find a path with MBB on a network. The third algorithm is the k-SPF, which can find a path with MBB among the first k shortest paths. Finally, our fourth algorithm k-BAR can find the shortest path among the first k MBB paths on a network. Simulation results show that the performance of our algorithms is better than previous works.

关键词： Load balance routing algorithms Software-defined networking

来源：评论

学校读者我要写书评

暂无评论

Ensembling routing algorithms 14

Ensembling Routing Algorithms

引用

IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI)

作者： Wu, ZhenHao Falcon, Rafael Groza, Voicu Petriu, Emil Univ Ottawa Elect Engn & Comp Sci EECS Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781728173764

Energy and time consumption are the two most common challenges regarding communication optimization in the Wireless sensor network (WSN) routing algorithms. There are many different approaches for solving these two major issues in WSNs. These approaches optimize over time or energy separately and yet rarely take into account multiple criteria when choosing the next hop on the route. In order to address this open problem in WSNs, it is advantageous to combine multiple criteria during the next hop selection step. In this paper, we propose a new concept called routing Ensembles. Our approach takes into account the individual selection criterion for the next hop using various multiple routing algorithms and applies a voting mechanism to decide on the next hop in the route collectively. We tested our routing ensemble with five well-known base routing methods, i.e., Greedy, NFP, MPoPR, MFR, and Compass and then selected the most voted node as the next hop. This process repeats until either the destination node is reached or the routing process fails. This concept was tested and validated using multiple simulated networks of varying sizes. The experimental analysis concluded that the routing ensembles allowed us to: (1) increase the delivery rate regardless of the network field size, (2) minimize both the energy and time consumption and (3) enhance the network performance only using traditional and directly routing algorithms.

关键词： routing algorithms wireless sensors network residual energy delivery time transmission distance

来源：评论

学校读者我要写书评

暂无评论

The Evaluation of Unconstrained Multicast routing algorithms in Ad-Hoc Networks

The Evaluation of Unconstrained Multicast Routing Algorithms...

引用

19th International Conference on Computer Networks

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

ISBN: (纸本)9783642312168

Wireless ad-hoc networks are playing an important role in extending the implementation of traditional wireless infrastructure (cellular networks, wireless LAN, etc). routing design in ad-hoc networks is a challenge because of limited node resources. Thus efficient data transmission techniques like multicasting are under scrutiny. The article analyzes and explores the performance of multicast heuristic algorithms without constraints and quality of multicast trees in ad-hoc networks and proves the thesis that well-known multicast heuristic algorithms designed for packet networks have a good performance in ad-hoc networks with grid structure.

关键词： ad-hoc networks multicast routing algorithms network topology

来源：评论

学校读者我要写书评

暂无评论

On the Forwarding Paths Produced by Internet routing algorithms

On the Forwarding Paths Produced by Internet Routing Algorit...

引用

21st IEEE International Conference on Network Protocols (ICNP)

作者： Dynerowicz, Seweryn Griffin, Timothy G. Univ Namur Fac Comp Sci Namur Belgium Univ Cambridge Comp Lab Cambridge CB2 1TN England

ISBN: (纸本)9781479912704;9781479912704

Most Internet routing protocols have one of two algorithms lurking at their core - either Dijkstra's algorithm in the case of link-state protocols or a distributed Bellman-Ford algorithm in the case of distance-vector or path-vector protocols. When computing simple shortest paths these protocols can be modified to utilize all best paths with a combination of next-hop sets and Equal Cost Multi-Path (ECMP) forwarding. We show that this picture breaks down even for simple modifications to the shortest path metric. This is illustrated with widest-shortest paths where among all shortest paths only those with greatest bandwidth are considered best. In this case Bellman-Ford and Dijkstra may compute different sets of paths and neither can compute all best paths. In addition, some paths computed by Dijkstra's algorithm cannot be implemented with next-hop forwarding. We provide a general algebraic model that helps to clarify such anomalies. This is accomplished by computing paths within the route metric rather than with specialized algorithmic extensions. Our results depend on the distinction between global and local optima that has hitherto been applied almost exclusively to more exotic routing protocols such as BGP.

关键词： Paths Byways shortest path forward path protocols routing algorithms routing protocols Internets

来源：评论

学校读者我要写书评

暂无评论

Reducing end-to-end delay in multi-path routing algorithms for mobile ad hoc networks

Reducing end-to-end delay in multi-path routing algorithms f...

引用

3rd International Conference on Mobile Ad-Hoc and Sensor Networks

作者： Javan, Nastooh Taheri Dehghan, Mehdi Amirkabir Univ Technol Dept Comp Engn Ad Hoc Network Lab Tehran Iran

ISBN: (纸本)9783540770237

Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find node-disjoint paths to achieve higher fault tolerance capability. By using node-disjoint paths, it is expected that the end-to-end delay in each path should be independent of each other. However, because of natural properties of wireless media and medium access mechanisms in ad hoc networks, the end-to-end delay between any source and destination depends on the pattern of communication in the neighborhood region. In this case some of the intermediate nodes should be silent to reverence their neighbors and this matter increases the average of end-to-end delay. To avoid this problem, multi-path routing algorithms can use zone-disjoint paths instead of node-disjoint paths. Two routes with no pair of neighbor nodes are called zone-disjoint paths. In this paper we propose a new multi-path routing algorithm that selects zone-disjoint paths, using omni-directional antenna. We evaluate our algorithm in several different scenarios. The simulation results show that the proposed approach is very effective in decreasing delay and packet loss.

关键词： MANET routing algorithms multi-path routing zone-disjoint paths

来源：评论

学校读者我要写书评

暂无评论

Effect of links on DHT routing algorithms 2nd

引用

2nd International Workshop on Grid and Cooperative Computing

作者： Zou, FT Zhang, L Li, Y Ma, FY Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)3540219889

Various DHT routing algorithms have been proposed in recent years. All these algorithms have tried to keep an uniform structured geometry while nodes join and leave. In this paper, we use links to capture the dynamic characteristics of the geometry and suggest there are three kinds of links in the geometry: the basic short link, the redundant short link, and the long links. Several current DHT systems have been investigated to argue these links are inherent in them and pointed out the possible improved directions of performance based on the characteristics of links. We analyze how links impact the routing performance and observe it with simulation experiments. Our experimental results show that each kind of links has its special contribution to the performance of P2P systems and it needs to take the effect of links into account as designing DHT routing algorithms.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

COMPARATIVE STUDY OF LOAD BALANCING routing algorithms IN HYBRID NETWORKS 16

COMPARATIVE STUDY OF LOAD BALANCING ROUTING ALGORITHMS IN HY...

引用

International Conference on Intelligent Information Processing (ICIIP)

作者： Netshikweta, R. Hamam, Y. Du, S. Univ South Africa Dept Elect & Min Engn ZA-0003 Pretoria South Africa Tshwane Univ Technol Fac Engn & Built Environm FSATI ZA-0001 Pretoria South Africa Tshwane Univ Technol Dept Mech Engn ZA-0001 Pretoria South Africa

ISBN: (纸本)9781450347990

In this paper, a comparative study of routing protocols is performed in a hybrid network to recommend the best routing protocol to perform load balancing for Internet traffic. Open Shortest Path First (OSPF), Interior Gateway routing Protocol (IGRP) and Intermediate System to Intermediate System (IS-IS) routing protocols are compared in OPNET modeller 14 to investigate their capability of ensuring fair distribution of traffic in a hybrid network. The network simulated is scaled to a campus. The network loads are varied in size and performance study is made by running simulations with all the protocols. The only considered performance factors for observation are packet drop, network delay, throughput and network load. IGRP presented better performance as compared to other protocols. The benefit of using IGRP is reduced packet drop, reduced network delay, increased throughput while offering relative better distribution of traffic in a hybrid network.

关键词： Load balancing routing algorithms hybrid networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：