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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Improved steiner tree algorithm applied to P2MP traffic engineering

Improved steiner tree algorithm applied to P2MP traffic engi...

引用

IEEE Symposium on Network Operations and Management

作者： Hiroshi Matsuura Naotaka Morita Kazumasa Takami NTT Service Integration Laboratories Musashino Tokyo Japan Faculty of Engineering Soka University USA

ISBN: (纸本)9781424453665

Steiner tree algorithms have been investigated for multicast services. The traffic on a multicast service is streamed from a server to multiple terminals, thus a directed Steiner tree should be used. Our proposed algorithm of this type, multiplex-aware route selection (MARS), produces the same tree as minimum-cost path heuristics (MPH). However, the computational complexity of MARS is O(mnlog(m)) compared with the O(m 2 n) of MPH, where m indicates the number of end nodes of the tree and n indicates the number of nodes on the network. We implemented the MARS algorithm and compared it with MPH and selective closest terminal first algorithm, which is an improvement of MPH, and also demonstrated the efficiency of MARS in terms of processing time and multicast tree cost.

关键词： multicast algorithms Mars Costs Computational complexity Telecommunication traffic IPTV Next generation networking Quality of service Steiner trees Surface-mount technology

来源：评论

学校读者我要写书评

暂无评论

Network Coding for Multi-Resolution multicast

Network Coding for Multi-Resolution Multicast

引用

2010 Proceedings IEEE INFOCOM

作者： MinJi Kim Daniel Lucani Xiaomeng Shi Fang Zhao Muriel Medard Massachusetts Institute of Technology Cambridge MA 02139 USA

ISBN: (纸本)9781424458363

Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-source multicast of multi-resolution codes. The goal of this pushback algorithm is to maximize the total rate achieved by all receivers, while guaranteeing decodability of the base layer at each receiver. By conducting pushback and code assignment stages, this algorithm takes advantage of inter-layer as well as intra-layer coding. Numerical simulations show that in terms of total rate achieved, the pushback algorithm outperforms routing and intra-layer coding schemes, even with field sizes as small as 2~(10)(10 bits). In addition, the performance gap widens as the number of receivers and the number of nodes in the network increases. We also observe that naive inter-layer coding schemes may perform worse than intra-layer schemes under certain network conditions.

关键词： Network coding multicast algorithms Streaming media Decoding Positron emission tomography Routing Encoding Subcontracting Communications Society USA Councils

来源：评论

学校读者我要写书评

暂无评论

How to use multicast in distributed mutual exclusion algorithms for grid file systems

How to use multicast in distributed mutual exclusion algorit...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Aurelien Ortiz Francois Thiebolt Jacques Jorda Abdelaziz M'zoughi IRIT Université Paul Sabatier Toulouse III Toulouse Cedex France

In a file system, critical sections are represented by means of read or write operations on useful data (i.e files) as well as metadata of the system. The processes must be synchronized to reach these shared resources, thanks to mutual exclusion algorithms which guarantee data consistency. In a grid environment, processes are compared to grid nodes and their synchronization is ensured by the sending of messages on the network. Moreover, the access time to a critical section is conditioned by the high latency of the network. In this paper, we propose a method based on the use of the multicast, which makes it possible in some cases to decrease the access time to critical sections. This solution was implemented within a token- and tree-based distributed mutual exclusion algorithm and it was integrated in the grid middleware named ViSaGe.

关键词： multicast algorithms File systems Delay Middleware Testing Network servers Network topology Distributed algorithms Concurrent computing File servers

来源：评论

学校读者我要写书评

暂无评论

Sequence-Based Data Dissemination algorithms for Peer-to-Peer multicast Protocols

Sequence-Based Data Dissemination Algorithms for Peer-to-Pee...

引用

International Conference on Future Computer and Communication, ICFCC

作者： Mohammad Javad Rostami Masoud Saeed Seyed Mohammad Hoseininasab Bahonar University Kerman Iran

Data dissemination in the existing peer-to-peer multicast protocols is performed from source node by delivering data to destination nodes over either a tree or a partial-mesh path structure covering all the multicast nodes. In this paper, we show that the existing tree-based or partial-mesh-based data dissemination algorithms do not perform efficiently in traditional customer-provider networks. We propose a new class of data dissemination algorithms called SBDD that considers a full-mesh path structure between multicast nodes. We show that SBDD improves multicast throughput, latency, fairness, and node dependency over the tree-based or partial-mesh-based algorithms in traditional customer-provider networks. Furthermore, it can also be used in heterogeouse multicast environments with a low computational complexity and a low overhead in comparison with the existing algorithms for such environments.

关键词： multicast algorithms Peer to peer computing multicast protocols Electronic mail Delay Bandwidth Java Throughput Computational complexity Costs

来源：评论

学校读者我要写书评

暂无评论

An ABC Supported QoS multicast Routing Scheme Based on Ant Algorithm

An ABC Supported QoS Multicast Routing Scheme Based on Ant A...

引用

WRI International Conference on Communications and Mobile Computing

作者： Wang, Xingwei Zou, Rongzhu Huang, Min Northeastern Univ Coll Informat Sci & Engn Shenyang 110004 Peoples R China

ISBN: (纸本)9780769535012

In this paper, a QoS multicast routing scheme with ABC (Always Best Connected) supported is proposed based on the ant algorithm. To deal with the inaccurate network stains and the imprecise user QoS requirement, it uses the range to describe them, introduces the edge bandwidth pricing, the edge evaluation and the tree evaluation, and tries to find a QoS multicast tree with the Pareto optimum under the Nash equilibrium on both the network provider utility and the user utility achieved or approached,

关键词： Routing multicast algorithms Bandwidth Delay effects Jitter Error analysis Resonance light scattering Tree graphs Mobile communication Mobile computing

来源：评论

学校读者我要写书评

暂无评论

WSNp1-7: Distributed multicast algorithms for Lifetime Maximization in Wireless Ad Hoc Networks with Omni-directional and Directional Antennas

WSNp1-7: Distributed Multicast Algorithms for Lifetime Maxim...

引用

IEEE Globecom 2006

作者： Song Guo Victor C. M. Leung Oliver W. W. Yang Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada School of Information Technology and Engineering University of Ottawa Ottawa Canada

We consider the problem of maximizing the network lifetime for multicast connections in a wireless ad hoc network (WANET) that use omni-directional / directional antennas and have limited energy resources. Unlike most centralized multicast algorithms, we provide a globally optimal solution to this problem in a distributed manner in a WANET with omnidirectional antennas. This graph theoretic approach provides us insights into more general case of using directional antennas, and inspires us to produce a group of distributed algorithms. Simulation results show that our distributed algorithms outperform other centralized multicast algorithms significantly in terms of network lifetime.

关键词： multicast algorithms Mobile ad hoc networks Directional antennas Broadcasting Distributed algorithms Routing Energy efficiency Bandwidth Radio frequency Batteries

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast algorithms for Mesh-connected Multicomputers

Efficient Multicast Algorithms for Mesh-connected Multicompu...

引用

International Conference on Information Visualisation (IV)

作者： H.A. Harutyunyan Shengjian Wang Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada

Performance of multicomputers largely depends on that of the underlying network communications such as multicast. Two major parameters used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic which refers to the total number of links involved. Mesh is a network topology widely used in multicomputers. It has been proved that, in mesh network, it is NP-hard to find the multicast routing which is optimal on both time and traffic. In this paper, we proposed two efficient multicast algorithms designed for store-and-forward switched mesh-connected multicomputers: DIAG and DDS. They are both tree-based shortest path multicast algorithms whose complexity is O(KN) or less. Performance evaluations of these algorithms resulted from simulations are given at the end

关键词： multicast algorithms Tree graphs Routing Telecommunication traffic multicast communication Network topology Algorithm design and analysis Computer science Software engineering Mesh networks

来源：评论

学校读者我要写书评

暂无评论

Reliable multicast in wireless networks using network coding

Reliable multicast in wireless networks using network coding

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Cheng Zhan Yinlong Xu Jianping Wang Victor Lee Department of Computer Science University of Science and Technology Hefei China Department of Computer Science City University of Hong Kong Hong Kong China

ISBN: (纸本)9781424451142

Reliable multicast in wireless networks has been well studied in the sense to solve the feedback implosion issue, which, however, can not reduce the number of retransmissions in order to recover all lost packets at receivers. Most recently, it has been proposed to use network coding for reliable multicast in wireless LANs to reduce the number of retransmissions. In this paper, we propose two new models to further reduce the number of retransmissions for reliable multicast. In the first model, each retransmission encoding decision is made according to the latest ldquowantedrdquo packet set at all receivers. Thus, the maximum number of receivers can potentially decode out one ldquowantedrdquo packet from each encoded retransmission packet. Such a model is referred to as dynamic multicast retransmission encoding (DMRE) model. This model is a memoryless model where a receiver will not buffer encoded retransmission packets for later use. In the second model, a receiver will buffer all received encoded retransmission packets and decode out their ldquowantedrdquo packets at the end of the retransmission batch. Such a model is referred to as cache-based multicast retransmission encoding(CMRE) model. The problem to minimize the number of retransmissions under both DMRE and CMRE models are NP-hard. Effective heuristic algorithms are proposed in this paper. We analyze the impact of packet delivery ratio on the gain of network coding. We derive the lower bound of the expected number of retransmissions using network coding, which provides the insights of the maximum potential gain using network coding in reliable multicast.

关键词： Wireless networks Network coding Feedback Encoding Computer science Decoding Computer network reliability Wireless LAN Heuristic algorithms multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

TCP Vegas-like Expert-Controlled multicast Congestion Control Algorithm for Wireless Networks

TCP Vegas-like Expert-Controlled Multicast Congestion Contro...

引用

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Qiaoyan Kang Jianfeng Wang Xiangru Meng Telecommun. Eng. Inst. Air Force Eng. Univ. Xi'an China

In order to improve the performance of existing multicast congestion control algorithm applied to wireless networks, in this paper, a TCP Vegas-like expert-controlled multicast congestion control mechanism (VEMCC) is proposed, which uses a recently proposed TCP Vegas throughput model. In VEMCC, the network congestion state is detected according to network relative queuing delay and packet loss; the packet loss reason is distinguished between wireless link errors and network congestion; and the current state of the network is judged accurately; then different multicast source control strategies are taken to adjust the sending rate. The simulation results show that, VEMCC algorithm enhances the capability to distinguish between network congestion and random errors, and improves the network throughput. VEMCC can be applied to wireless networks well, and achieve some extent on TCP-friendliness over low packet error rate wireless link.

关键词： multicast algorithms Wireless networks Throughput Error correction Telecommunication congestion control Force control Telecommunication control Unicast Control systems Out of order

来源：评论

学校读者我要写书评

暂无评论

An effective candidate list strategy for Tabu Search based QoS multicast routing

An effective candidate list strategy for Tabu Search based Q...

引用

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 Iran Department of Computer Engineering Islamic Azad University Tehran Iran

multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu search. The main feature of proposed TS-based algorithms is use of an effective candidate list strategy. By the use of this strategy not only search speed but also solution quality will be improved. 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.

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：