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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
114 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

2,117 篇 multicast algori...
677 篇 routing
531 篇 bandwidth
508 篇 multicast protoc...
425 篇 delay
385 篇 unicast
332 篇 costs
328 篇 computer science
281 篇 algorithm design...
271 篇 network topology
264 篇 broadcasting
260 篇 quality of servi...
258 篇 heuristic algori...
240 篇 intelligent netw...
238 篇 computer network...
230 篇 telecommunicatio...
225 篇 internet
213 篇 streaming media
207 篇 multicast commun...
195 篇 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,105 篇 英文
11 篇 中文
1 篇 其他

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

共 2117 条记录，以下是21-30 订阅

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

详细简洁

排序：

An evaluation of three multicast routing algorithms

An evaluation of three multicast routing algorithms

引用

Southeastern Symposium on System Theory

作者： T.R. Plunkett J.R. McDearman D.T. Marlow Department of Electrical Engineering Tennessee Technological University Cookeville TN USA Dahlgren Division Naval Surface Warfare Center Dahlgren VA USA

This paper looks at the operation of the three multicast routing algorithms being studied for use in an inter-domain routing environment. The three algorithms are Scalable Reverse Path multicasting, Core Based Trees, and Protocol Independent multicasting-Sparse Mode. These three algorithms are evaluated with respect to a list of criteria to determine how well they scale to the large sizes of inter-domain computer networks.< >

关键词： multicast algorithms Computer networks Unicast Routing protocols multicast protocols IP networks Military computing LAN interconnection Local area networks Information resources

来源：评论

学校读者我要写书评

暂无评论

Efficient Barrier and Allreduce on Infiniband clusters using multicast and adaptive algorithms

Efficient Barrier and Allreduce on Infiniband clusters using...

引用

IEEE International Conference on Cluster Computing

作者： A.R. Mamidala Jiuxing Liu D.K. Panda Department of Computer Science and Engineering Ohio State Uinversity Columbus OH USA

Popular algorithms proposed in the literature for doing Barrier and Allreduce in clusters, such as pair-wise exchange, dissemination and gather-broadcast do not give an optimal performance when there is skew among the nodes in the cluster. In pair-wise exchange and dissemination, all the nodes must arrive for the completion of each step. The gather-broadcast algorithm assumes a fixed tree topology. We propose to use hardware multicast of InfiniBand in the design of an adaptive algorithm that performs well in the presence of skew. In this approach, the topology of the tree is not fixed but adapts depending on the skew. The last arriving node becomes the root of the tree if the skew is sufficiently large. We have carried out in-depth evaluation of our scheme and use synchronization delay as the performance metric for Barrier and Allreduce in the presence of skew. Our performance evaluation shows that our design scales very well with system size. Our designs can reduce the synchronization delay by a factor of 2.28 for Barrier and by a factor of 2.18 in the case of Allreduce. We have examined different skew scenarios and showed that the adaptive design performs either better or comparably to the existing schemes.

关键词： Hardware Adaptive algorithm Clustering algorithms multicast algorithms Topology Delay Computer science Algorithm design and analysis Measurement Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

multicast routing algorithms in high speed networks

Multicast routing algorithms in high speed networks

引用

IEEE Workshop on Future Trends of Distributed Computing Systems

作者： Yongjun Im Youngsuk Lee Sunjoo Wi Eangwon Lee Yanghee Choi Chongsang Kim Department of Computer Engineering Seoul National University Seoul South Korea Seoul National University Gwanak-gu Seoul KR Dept. of Comput. Eng. Seoul Nat. Univ. South Korea

ISBN: (纸本)0818671254

We propose two multicast routing algorithms. One is a delay-constrained multicast algorithm that finds a multicast tree between one source node and multiple destination nodes. The other is a dynamic multicast algorithm that allows multiple nodes to dynamically join or leave a multicast group during a session. The first algorithm, which provides multicasting and guaranteed QoS (Quality-of-Service) services at the network layer, is a distributed routing algorithm where the reduced multicast tree is computed through a single round of message exchanges between network nodes, consequently reducing the number of messages and the accompanying computation time. The distributed algorithm is shown to generate within much less time a multicast tree slightly more expensive than that by the centralized one. The second algorithm is efficient under dynamic network environment, with frequent status changes for network nodes or links and multicast group members.

关键词： Routing multicast algorithms Intelligent networks High-speed networks Delay Distributed computing Costs Computer networks Bandwidth Resource management

来源：评论

学校读者我要写书评

暂无评论

multicast routing algorithms for 3-stage Clos ATM switching networks

Multicast routing algorithms for 3-stage Clos ATM switching ...

引用

IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record

作者： S.C. Liew Bellcore Laboratories Morristown NJ USA

The author investigates the general problem of multicast routing in the three-stage Clos switching network, with point-to-point routing as a special case. An optimal and a heuristic algorithm have been designed and tested. The results show that the heuristic algorithm can find multicast routes that are close to optimal within a response time that is significantly lower than that of the optimal algorithm. Further analysis of the experimental data suggests a hybrid implementation in which the optimal and heuristic algorithms are run in parallel with a set time limit. The algorithms and the discussion provided also apply to other networks, including wide-area communication networks, with a two-hop structure.< >

关键词： Routing multicast algorithms Asynchronous transfer mode Switches Packet switching Heuristic algorithms Communication switching Communication networks Traffic control Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

Comparison of dynamic multicast routing algorithms for wide-...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： J. Kadirire G. Knight Computer Science Department University College London London UK

This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms.

关键词： Routing Heuristic algorithms multicast algorithms Packet switching Asynchronous transfer mode Greedy algorithms Electronic mail Educational institutions Computer science Communication switching

来源：评论

学校读者我要写书评

暂无评论

Load Balance multicast Routing algorithms on Leased Overlay Network

Load Balance Multicast Routing Algorithms on Leased Overlay ...

引用

International Conference on Networking and Services (ICNS)

作者： Xiaoyu Zhang Guangzhao Zhang Department of Electronics and Communication Engineering Sun Yat-sen University Guangzhou China

Overlay networks have been recently developed to support multicast framework. Specially, overlay architectures based on proxies and leased lines can provide applications with optimal performance in terms of bandwidth, reliability, delay guarantee, etc. In this paper, we propose a balanced multicast routing algorithm for these proxy-based overlay architectures to utilize the network resources efficiently while keeping the delay guarantee for each multicast session. We first model the routing problem as a delay-constraint Steiner tree problem. Then, a balanced solution with the aid of precomputing is proposed. Extensive simulations show that our multicast routing algorithm provides superior performance with respect to other heuristics

关键词： Routing multicast algorithms Bandwidth Delay IP networks Streaming media Costs Video on demand Videoconference Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Analyzing multicast Routing algorithms on Software Defined Network

Analyzing Multicast Routing Algorithms on Software Defined N...

引用

IEEE Region 10 Symposium

作者： Sabila Nawshin Sarah Ahsin Iffat Jahan Rabaya Jalal Moon A.K.M. Mazharul Haque Nasif Muslim Salekul Islam United International University Dhaka Bangladesh Department of Computer Science and Engineering United International University Dhaka Bangladesh

ISBN: (数字)9781728173665

ISBN: (纸本)9781728173672

The existing Internet is a network consisting of several routers and communication links, where each of the routers has the information about its adjacent routers only. As a result, the algorithms in practice are decentralized and work in a distributed setting. When forwarding a packet from a single source to multiple destinations, multicasting is the concept of sending only one packet for the common path between the source and the destinations and replicating it when the paths are divided. As the routing algorithms operate only on localized information in the present network, multicasting is a difficult task to implement. Software Defined Network (SDN) provides us with a centralized view of the whole topology, opening up the opportunity to deploy more complex and efficient algorithms for multicasting. Much research has already been carried out on this field based on various dimensions of SDN. In this paper, we reviewed some of the existing algorithms associating with our target. We also tested the existing routing algorithms on SDN and conducted a comparative analysis among the algorithms to determine which one would efficiently deploy multicast routing.

关键词： multicast algorithms multicast communication Topology Routing Delays Streaming media Software algorithms

来源：评论

学校读者我要写书评

暂无评论

On-demand multicast routing algorithms for streaming video on asymmetric transmission network

On-demand multicast routing algorithms for streaming video o...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Te-Chou Su Chen-Long Chan Jia-Shung Wang Department of Computer Science National Tsing Hua University Hsinchu Taiwan

来源：评论

学校读者我要写书评

暂无评论

Depth-Latency Tradeoffs in multicast Tree algorithms

Depth-Latency Tradeoffs in Multicast Tree Algorithms

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Michael T. Helmick Fred S. Annexstein Department of Computer Science University of Cincinnati Cincinnati OH USA

The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding the degree. In this paper, we study the problem of determining a degree-bounded directed spanning tree of minimum average-latency in a complete graph where the inter-node latencies are used to determine a metric. In particular, we focus on measuring the effects on average latency when imposing depth constraints (i.e., bounds on hop count) on degree-bounded spanning trees. The general problem is a well known NP-hard problem, and several works have proposed approximate solutions which aim at minimizing either depth or latency. In this work, we present a new heuristic algorithm which improves upon previous solutions by considering both depth and latency and the tradeoffs between them. Our algorithms are shown to improve the theoretical worst-case approximation factors, and we demonstrate improvements under empirical evaluation. Our experiments examine and analyze several different topologies, including, low-dimensional random geometric networks, random transit-stub networks, and high- dimensional hypercube networks. We show how our solutions can be applied in the context of enabling multicasting support in locality aware peer-to-peer overlay networks.

关键词： multicast algorithms Delay Tree graphs Particle measurements NP-hard problem Heuristic algorithms Approximation algorithms Network topology Hypercubes Context awareness

来源：评论

学校读者我要写书评

暂无评论

QoS multicast routing algorithms based on Tabu Search with Elite candidate list

QoS multicast routing algorithms based on Tabu Search with E...

引用

International Conference on Application of Information and Communication Technologies (AICT)

作者： Mahsa Armaghan Abolfazl T. Haghighat Mohammadreza Armaghan Department of Electrical Computer & IT Islamic Azad University Qazvin Branch Qazvin Iran Islamic Azad University Tehran Tehran IR Department of Computer Engineering Islamic Azad University Tehran-South Branch Tehran Iran

Quality-of-Service multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the neglected aspects of Tabu Search, candidate list strategy. We evaluate the performance and efficiency of the proposed algorithms on a variety of random generated networks. Evaluation results indicate that the proposed algorithms overcome the other existing short-term memory version of TS-based algorithms and heuristics regarding average tree cost and running time.

关键词： Routing multicast algorithms Quality of service Costs Computer networks NP-complete problem Heuristic algorithms Communication networks Competitive intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：