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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,003 篇 会议
115 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

361 篇 工学
- 183 篇 信息与通信工程
- 167 篇 计算机科学与技术...
- 142 篇 电气工程
- 31 篇 软件工程
- 27 篇 电子科学与技术（可...
- 21 篇 仪器科学与技术
- 10 篇 控制科学与工程
- 10 篇 交通运输工程
- 6 篇 机械工程
- 6 篇 网络空间安全
- 2 篇 航空宇航科学与技...
- 1 篇 光学工程
- 1 篇 生物医学工程（可授...
42 篇 管理学
- 42 篇 管理科学与工程(可...
22 篇 文学
- 22 篇 新闻传播学
15 篇 理学
- 8 篇 物理学
- 3 篇 数学
- 3 篇 系统科学
- 1 篇 生物学
2 篇 军事学
- 2 篇 军队指挥学
1 篇 医学
- 1 篇 临床医学

主题

2,118 篇 multicast algori...
677 篇 routing
532 篇 bandwidth
509 篇 multicast protoc...
425 篇 delay
386 篇 unicast
332 篇 costs
328 篇 computer science
281 篇 algorithm design...
271 篇 network topology
264 篇 broadcasting
260 篇 quality of servi...
259 篇 heuristic algori...
240 篇 intelligent netw...
237 篇 computer network...
230 篇 telecommunicatio...
225 篇 internet
213 篇 streaming media
207 篇 multicast commun...
196 篇 routing protocol...

机构

19 篇 department of co...
19 篇 department of co...
16 篇 department of el...
13 篇 department of co...
9 篇 department of co...
8 篇 school of inform...
8 篇 department of co...
8 篇 school of inform...
8 篇 department of co...
8 篇 information tech...
8 篇 department of co...
7 篇 department of in...
7 篇 department of co...
7 篇 department of el...
7 篇 department of in...
7 篇 institute of com...
7 篇 department of el...
6 篇 jet propulsion l...
6 篇 department of el...
6 篇 beijing universi...

作者

14 篇 xingwei wang
12 篇 xiaohua jia
11 篇 l.m. ni
10 篇 min huang
10 篇 jiannong cao
9 篇 m. gerla
9 篇 weijia jia
9 篇 a. ephremides
9 篇 hwa-chun lin
9 篇 song guo
8 篇 j.e. wieselthier
8 篇 d. towsley
7 篇 g.d. nguyen
7 篇 a.k. das
7 篇 m. kadoch
7 篇 n.k. chilamkurti
7 篇 o. yang
7 篇 gang feng
6 篇 m. el-sharkawi
6 篇 p. arabshahi

语言

2,106 篇 英文
11 篇 中文
1 篇 其他

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

共 2118 条记录，以下是281-290 订阅

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

详细简洁

排序：

An Improved ACO Algorithm for multicast in Ad Hoc Networks

An Improved ACO Algorithm for Multicast in Ad Hoc Networks

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Ping Yuan Long Hai School of Urban Railway Transportation Shanghai University Engineering of Science Shanghai China

multicast is important development of Ad hoc networks. But a route discovery is one of difficult problems of multicast routing protocol. Recently, many intelligent algorithms had been applied to find a route. Ant colony optimization routing algorithm (ACO) is typical one of them. However, ACO which is applied in the multicast has its limitation, which is the route to multiobjective can not be found at the same time. In this paper, an improved scheme named CACO for multicast in Ad hoc networks is proposed. Some ant will be copied to find the routing from the contrary direction when a ant reaches a receiver node. After that the original ant will continue to find other multicast destinations with the same operating. The simulation results show that CACO can not only reduce the detention of finding multiobjective but also improve the convergence rate of the ant colony algorithm.

关键词： multicast algorithms Ad hoc networks multicast protocols Routing protocols Rail transportation Railway engineering Mobile communication Mobile computing Computer networks Information science

来源：评论

学校读者我要写书评

暂无评论

Power savings of cyclic network coding for multicast on wireless networks

Power savings of cyclic network coding for multicast on wire...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Mohammad Ravanbakhsh Ángela I. Barbero Dag Haugland Øyvind Ytrehus Department of Informatics University of Bergen Bergen Norway Department of Applied Mathematics University of Valladolid Valladolid Spain

We study power requirements of network coding on a network with broadcast links, for a given multicast session. A common approach to network coding is to extract a subgraph from the network, to which network coding is applied. In order to facilitate network encoding, it is possible to impose the constraint that this subgraph is acyclic. However, in a network based on wireless broadcast links, it is more power efficient to allow cycles in the subgraph, at the expense of a slight increase in the encoding complexity.

关键词： Network coding Wireless networks Flow graphs Broadcasting Encoding Costs Informatics Mathematics multicast algorithms Delay

来源：评论

学校读者我要写书评

暂无评论

Research on the improvement of multicast Ad Hoc On-demand Distance Vector in MANETS

Research on the improvement of multicast Ad Hoc On-demand Di...

引用

International Conference on Computer and Automation Engineering, ICCAE

作者： Weiliang Li Jianjun Hao School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424455690

Tree-based multicast routing provides fast and most efficient way of routing establishment for the communications of mobile nodes in wireless Ad Hoc networks. MAODV (multicast Ad Hoc On-demand Distance Vector) is one commonly known tree-based multicast routing protocol, which has minimal control overhead and route acquisition latency. This paper presents a way to improve the throughput of the system and reduce the number of mobile nodes participating in multicast routing algorithms, which will significantly reduce the routing-related control overhead. A systematic performance evaluation is done by performing certain simulations under NS-2. The applicability of these protocols to diverse situation are also studied and discussed.

关键词： Mobile ad hoc networks multicast protocols Mobile communication Routing protocols Communication system control Delay Throughput multicast algorithms Control systems Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Routing and wavelength assignment computed jointly for a given set of multicast trees reduces the total wavelength conversion

Routing and wavelength assignment computed jointly for a giv...

引用

International Conference on Transparent Optical Networks

作者： Wanjun Huang Limin Tang Miguel Razo Arularasi Sivasankaran Marco Tacca Andrea Fumagalli OpNeAR Lab Erik Jonsson School of Engineering and Computer Science University of Texas Dallas Richardson TX USA

A significant drawback when establishing multicast optical trees (light-tree) using lambda channels in wavelength division multiplexing (WDM) network is the potentially large amount of wavelength converters (WCs), which are required when the wavelength continuity constraint cannot be satisfied across each light-tree. Prior works address this challenge by solving the routing and wavelength assignment (RWA) problem for each individual light-tree sequentially, to locally minimize the number of WCs required by each light-tree. In this paper, the authors intend to solve the RWA problem for a group of light-trees with the objective of globally minimizing the number of WCs that are required to support the entire group of multicast requests. The rationale for using the proposed RWA solution is that a joint solution of the RWA problem across the whole set of requested multicast trees may significantly reduce the number of WCs overall.

关键词： Wavelength routing Wavelength assignment Optical wavelength conversion WDM networks Wavelength division multiplexing Optical fiber networks multicast algorithms Computer networks Optical computing Computer science

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for minimum cost multicast routing in OTN network

A heuristic algorithm for minimum cost multicast routing in ...

引用

International Conference on Wireless and Optical Communications ( WOCC)

作者： Chao Fang Chunfang Feng Xue Chen Key Laboratory of Information Photonics and Optical Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424475971

It is important to support the multicast in the OTN network since multicast services are becoming more popular and multicasting will result in the improvement of resource utilization rate. To support multicast in a cost-effective way, the multicast of OTN should be realized in electronic domain based on ODU-level rather than optical domain in our point of view. In order to implement multicast routing in OTN, a new minimum cost tree heuristic algorithm is brought forward by us, which takes account of path sharing and load balancing. The simulation results show that the proposed multicast routing algorithm can achieve the preferable performance.

关键词： Heuristic algorithms multicast algorithms Costs Routing Optical transmitters Bandwidth Optical network units Telecommunication traffic Internet WDM networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Application Layer multicast with Hierarchically Distributed Nodes

Hybrid Application Layer Multicast with Hierarchically Distr...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Zhou Su Suphakit Awiphan Kazumine Ogura Jiro Katto Yasuhiko Yasuda Faculty of Science and Engineering Waseda University Japan

ISBN: (纸本)9781424451753

The hybrid application layer multicast (ALM) has been shown its efficiency by leveraging the conventionally main structures of application layer multicast, tree-based and mesh-based. However, how to select the proper node to construct the overlay and how to establish the connection between any two nodes are still unsolved. Therefore, this paper is to design a novel construction algorithm for the hybrid ALM to resolve the above two issues. Firstly, by carrying out the analysis of nodes' characteristics, all nodes are divided into groups and a node priority is proposed to select the super node within each group. Secondly, by using the selected super node, all nodes are hierarchically controlled and different kinds of connections are carried out in the ALM, where the connection between super node and other nodes is set to be a tree to enhance the efficient utilization of network resource while the connection between other normal nodes is decided to be a mesh to reduce the overhead. Simulation results show that the proposal outperforms other conventional methods.

关键词： Peer to peer computing multicast algorithms Telecommunication traffic Traffic control Delay Bandwidth Communications Society Algorithm design and analysis Proposals Routing

来源：评论

学校读者我要写书评

暂无评论

Optimization of Wireless Multi-source multicast Ad-Hoc Networks Using Asymmetric Matrix Games

Optimization of Wireless Multi-source Multicast Ad-Hoc Netwo...

引用

IEEE International Conference on Communications

作者： Ebrahim Karami Savo Glisic Centre of Wireless Communications (CWC) University of Oulu Oulu Finland

In this paper, we use matrix games framework for joint optimization of routing and network coding under conflict free scheduling for multi-source wireless ad-hoc networks. The impact of multicast diversity on scheduling is controlled by using topology compression concept quantified through compressed multicast topology matrix. To define topology matrix, first a set of all possible paths, including network coded paths, is identified and compressed. Depending on the nature of data selected path can be unicast or multicast. Then by switching between these paths with appropriate rates (frequencies), achievable scaled throughput is maximized. A link conflict free environment is designed by appropriate conflict free network partitioning using network graph coloring algorithm. For each possible coloring scheme and considering priority assigned to each source, link scheduling partitions topology matrix into multiple sub-matrices, one for each partial topologies. Each sub-matrix is used as a payoff matrix for an asymmetrical matrix game where against any single move of the second player, first player has multiple (K) moves, corresponding to different partial topologies or their equivalent colors. The strategy sets for the players are links and paths respectively. Such a game will be formally referred to as Asymmetrical Matrix Game with notation AMG (2, K, 1) and the value of this game is inverse of the scaled throughput. In this notation 2 indicates two dimensional games. At the equilibrium, mixed strategy vector of the first player indicates optimum percentage of time or optimum number of time slots dedicated to the selected partial topologies for a given partitioning of the network graph while, mixed strategy vectors of the second player is proportional to optimum usage rates of the paths. Numerical results are presented for a simple butterfly network including 6 nodes and 2 sources. One source transmits multicast and second one unicast data with different priority.

关键词： Ad hoc networks Network topology Unicast Throughput Routing Network coding Frequency Algorithm design and analysis multicast algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Approaches for latency reduction in multicast overlay network

Approaches for latency reduction in multicast overlay networ...

引用

International Conference on Computer Design and Applications (ICCDA)

作者： Yousef Alipour Amirmasoud Bidgoli Mohsen Moradi Computer Department Islamic Azad University Khuzestan Iran Computer Department University of Tehran Tehran Iran Computer Department Islamic Azad University Iran

ISBN: (纸本)9781424471645;9781424471638

Efforts to take service of multicast IP is very slow and is facing problems such as lack of address polling places, lack of reliable data transfer, crowd control, etc. To implement multi-broadcast in the network, new access router mechanisms are needed to send forward the data in addition to the existing methods of broadcast. In recent years, the overlay multicast has been put forward as a practical solution to resolve these problems. We present a systematic approach to reducing host multicast group. Latency reduction is achieved by adding links to an existing overlay network. To reduce latency in the overlay tree, adding some links to the tree is an effective method, but how a group decides to add the middle links to the overlay tree? It is an important question in this regard. For this purpose we try to find out a dependence on the characteristics of a considerable measurement site and a delay reduction calculations to any middle link between the pair nodes. A protocol based on these heuristics called Overlay multicast Tree Protocol (OMTP) has been developed. The OMTP protocol can be used to make the overlay tree, and our tests show that the OMTP can reduce the latency between pair nodes with selected shortcuts by using the new useful function that makes use of the standard deviation.

关键词： Delay multicast protocols Tree graphs Computer networks multicast algorithms Routing Computer network reliability Broadcasting Testing Relays

来源：评论

学校读者我要写书评

暂无评论

Statistical characterization of multicast performance in dense wireless networks

Statistical characterization of multicast performance in den...

引用

International Symposium on Wireless Pervasive Computing (ISWPC)

作者： Laura Galluccio Giacomo Morabito Sergio Palazzo Dipartimento di Ingegneria Informatica e delle Telecomunicazioni Universita Catania Italy

ISBN: (纸本)9781424468553;9781424468584

multicast is a fundamental service in several scenarios involving wireless multihop communications, such as in ad hoc and sensor networks. Accordingly, appropriate solutions are required that achieve resource efficiency and scalability. It is possible to state the problem of optimal multicast in dense wireless networks in the terms of the Euclidean Steiner Tree problem. This has been thoroughly studied in the past as it can be applied in several engineering scenarios. However, it is well known that the Euclidean Steiner Tree problem is NP hard and even heuristics and approximation algorithms proposed in the literature cannot be applied in distributed environments like those addressed in this paper. Accordingly, solutions should be considered in which any intermediate node in the multicast tree is responsible of building a small part of the tree itself. In this paper, a geographical multicast protocol is considered in which each intermediate node decides the direction or the directions (if it identifies the need for a fork in the tree) along which the packet should be forwarded. The main contribution of this paper is to study and characterize the statistical properties of the multicast trees that can be obtained with such distributed approach. Indeed, simulation results show that the cost of the tree can be represented by a Gaussian random variable in which the average value and the variance comply to well defined laws.

关键词： Wireless networks Wireless sensor networks Wireless communication Spread spectrum communication Sensor phenomena and characterization Scalability Approximation algorithms Heuristic algorithms multicast algorithms multicast protocols

来源：评论

学校读者我要写书评

暂无评论

multicast Capacity Gain and Routing Algorithm in Static Network with Network Coding

Multicast Capacity Gain and Routing Algorithm in Static Netw...

引用

IEEE International Conference on Communications (ICC)

作者： F. Gong X. Wang Q. Zhang Department of Electronic Engineering Shanghai Jiaotong University China Department of Computer Science and Engineering Honk Kong University of Science and Technology Hong Kong China

This paper studies the multicast capacity gain with network coding in static ad hoc wireless network. We consider n nodes deployed in a square with k nodes formulating multicast tree to employ network coding. In static unicast network, Liu et al. have proved that the capacity gain with network coding is a constant without order change. In our work, we focus on the capacity gain with network coding in static multicast network, under the system model of Li's. Firstly, we modify the routing algorithm of multicast model and propose that the multicast capacity bound in is just a theoretical result but not very tight in practical scenario. Then in static multicast transmission we calculate the probability of existing the butterfly model to employ network coding. Our result shows that there is no order change of the capacity. Finally, We prove that the bound of the capacity gain with network coding is τ/√2, where τ = √3/2 · τ(2), and τ(2) is a constant in dimension two, when network coding is applied to static multicast network.

关键词： Routing multicast algorithms Network coding Throughput Wireless networks Unicast Probability Peer to peer computing Graphics Upper bound

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：