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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

End-host distribution in application-layer multicast: Main issues and solutions

End-host distribution in application-layer multicast: Main i...

引用

Roedunet International Conference (RoEduNet)

作者： Genge Béla Haller Piroska Department of Electrical Engineering Petru Maior University of Târgu Mureş Mures Romania

ISBN: (纸本)9781424473359

Application-layer multicast implements the multicast functionality at the application layer. The main goal of application-layer multicast is to construct and maintain efficient distribution structures between end-hosts. In this paper we focus on the implementation of an application-layer multicast distribution algorithm. We observe that the total time required to measure network latency over TCP is influenced dramatically by the TCP connection time. We argue that end-host distribution is not only influenced by the quality of network links but also by the time required to make connections between nodes. We provide several solutions to decrease the total end-host distribution time.

关键词： Extraterrestrial measurements Time measurement Delay Routing multicast protocols Topology multicast algorithms Communication industry Proposals Internet

来源：评论

学校读者我要写书评

暂无评论

Dynamic Load-Balanced multicast for Data-Intensive Applications on Clouds 10

Dynamic Load-Balanced Multicast for Data-Intensive Applicati...

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： Tatsuhiro Chiba Mathijs den Burger Thilo Kielmann Satoshi Matsuoka Department of Math and Computing Sciences Tokyo Institute of Technology Meguro Tokyo Japan Department of Computer Science Vrije Universiteit Amsterdam Amsterdam Netherlands National Institute of Information Japan

ISBN: (纸本)9780769540399

Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algorithms have been proposed for clusters and grid environments. The most common approach is to construct one or more spanning trees based on the network topology and network monitoring data in order to maximize available bandwidth and avoid bottleneck links. However, delivering optimal performance becomes difficult once the available bandwidth changes dynamically. In this paper, we focus on Amazon EC2/S3 (the most commonly used cloud platform today) and propose two high performance multicast algorithms. These algorithms make it possible to efficiently transfer large amounts of data stored in Amazon S3 to multiple Amazon EC2 nodes. The three salient features of our algorithms are (1) to construct an overlay network on clouds without network topology information, (2) to optimize the total throughput dynamically, and (3) to increase the download throughput by letting nodes cooperate with each other. The two algorithms differ in the way nodes cooperate: the first `non-steal' algorithm lets each node download an equal share of all data, while the second `steal' algorithm uses work stealing to counter the effect of heterogeneous download bandwidth. As a result, all nodes can download files from S3 quickly, even when the network performance changes while the algorithm is running. We evaluate our algorithms on EC2/S3, and show that they are scalable and consistently achieve high throughput. Both algorithms perform much better than having each node downloading all data directly from S3.

关键词： multicast algorithms Cloud computing Concurrent computing Application software Bandwidth Distributed computing Grid computing Throughput Network topology Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Optical multicast Routing under Light Splitter Constraints

Optical Multicast Routing under Light Splitter Constraints

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Shadi Jawhar Bernard Cousin University of Rennes I France

In network communications, there are many methods to exchange packets to deliver data from sources to destinations. During the past few years, we have observed the emergence of new applications that use multicast transmission. multicasting requires “multicast routing”, to deliver packets to a “group” of hosts, scattered throughout the Internet. For a multicast routing algorithm to be applicable in optical networks, it must route data only to group members, optimize and maintain loop-free routes, and concentrate the routes on a subset of network links. For an all-optical switch to play the role of a branching router, it must be equipped with a light splitter. Light splitters are expensive equipments and therefore it will be very expensive to implement splitters on all optical switches. Optical light splitters are only implemented on some optical switches. That limited availability of light splitters raises a new problem when we want to implement multicast protocols in optical network (because usual multicast protocols make the assumption that all nodes have branching capabilities) Another issue is the knowledge of the locations of light splitters in the optical network. Nodes in the network should be able to identify the locations of light splitters scattered in the optical network so it can construct multicast trees. This means that any node must be able to identify if other nodes in the network are multicast capable optical cross connect MC-OXC or multicast incapable ordinary cross connect OXC. These problems must be resolved by implementing a multicast routing protocol that must take into consideration that not all nodes can be branching node. As a result, a new signaling process must be implemented so that light paths can be created, spanning from source to the group members.

关键词： Routing Optical scattering Optical fiber networks Optical switches multicast protocols Light scattering Internet multicast algorithms Availability Signal resolution

来源：评论

学校读者我要写书评

暂无评论

Nonblocking multicast Clos networks

Nonblocking multicast Clos networks

引用

International Conference on Wireless and Optical Communications ( WOCC)

作者： Yujie Wan Tony T. Lee Department of Information Engineering Chinese University of Hong Kong New Territories Hong Kong China

ISBN: (纸本)9781424475971;9781424475964

This paper studies the necessary and sufficient nonblocking conditions for multicast Clos network or v(m, n 1 , r 1 , n 2 , r 2 ) network, wherein there are r 1 /r 2 switch modules at first/third stage, n 1 input/n 2 output ports on each first/third stage switch module, and m central stage modules. We prove that given constant n 1 , n 2 , if r 1 ≥ L = n 2 (( n 2 -1 m )-1)+1, r 2 ≥ n 1 n2 ( n 2 L ), m ≥ n 1 n 2 is a necessary and sufficient nonblocking condition. Analogy to point-to-point Clos network, this result is independent of r 1 ,r 2 and improves on the current best sufficient condition at the given region. We also present a wide-sense nonblocking routing algorithm for satisfying each input multicast call.

关键词： Switches Sufficient conditions Routing multicast algorithms Algorithm design and analysis Upper bound

来源：评论

学校读者我要写书评

暂无评论

Subcarrier Allocation for multicast Services in Multicarrier Wireless Systems with QoS Guarantees

Subcarrier Allocation for Multicast Services in Multicarrier...

引用

IEEE Conference on Wireless Communications and Networking

作者： Lin Tian Di Pang Yubo Yang Jinglin Shi Gengfa Fang Eryk Dutkiewicz Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy and Sciences China Department of Physics and Engineering Macquarie University Sydney NSW Australia

ISBN: (纸本)9781424463961;9781424463985

The throughput of conventional multicast transmission in wireless systems is limited by the user with the worst channel quality in the multicast service group. The subcarrier allocation for multicast services in multicarrier systems is a feasible solution to overcome the capacity limitation by exploiting the frequency diversity among subcarriers. However, most of the current subcarrier allocation algorithms are limited to unicast services. In this paper, we propose an optimal subcarrier allocation algorithm for multicast services with Quality of Services (QoS) guarantees. A low-complexity suboptimal algorithm is also proposed, which includes three steps: Conservative Allocation, Greedy Step and Iterative Enhancement. Simulation results show that the proposed algorithms significantly outperform the conventional multicast transmission scheme while at the same time guaranteeing the minimum data rates of all users. Moreover, simulation results also show that the performance difference between the optimal and suboptimal algorithms is small.

关键词： multicast algorithms Quality of service Throughput Iterative algorithms Unicast Multimedia communication Radio broadcasting Decoding Frequency diversity Physical layer

来源：评论

学校读者我要写书评

暂无评论

Minimum cost optimization of multicast wireless networks with network coding 44th

Minimum cost optimization of multicast wireless networks wit...

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Chengyu Xiong Xiaohua Li Department of ECE State University of New York Binghamton Binghamton NY USA

ISBN: (纸本)9781424474165

Minimum cost optimization for multicast with network coding has attracted great research interests. In this paper, based on an information model that differentiates intermediate nodes in a multicast network into network coding, routing or replicating nodes, a method is developed to solve the minimum energy cost multicast problem in wireless networks. Besides transmission energy, many other important parameters can be conveniently optimized as well, such as the number of packets undergoing network coding, the number of network coding nodes, as well as node classification. Some simulations results are shown to verify that the proposed method is promising, especially since network coding may be expensive or impossible for certain wireless nodes.

关键词： Cost function Wireless networks Network coding Routing Computer networks Batteries Upper bound Polynomials multicast algorithms Unicast

来源：评论

学校读者我要写书评

暂无评论

Construction of multicast Protection Tree Based on Single Node Failure

Construction of Multicast Protection Tree Based on Single No...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Shang Wang Chun He Yide Zhang Gang Feng Research Institute of electronic science and technology University of Electronic Science and Technology Chengdu China National communication laboratory University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781424463275;9780769539898

To reduce influence of node failure and achieve high reliability in communications, research on node protection algorithm is needed. In this paper, we first provide an overview of current research of redundant tree algorithm (RT). Then we propose a new algorithm called single node protection algorithm (SNP) based on previous redundant tree algorithm, which is used to achieve recovery form single node failure. Compared with APS which employs backup tree in the forming of routing tree, simulation shows that SNP decrease the number of affected nodes as group size increasing in multicast communication.

关键词： Protection multicast algorithms Tree graphs Routing Multiprotocol label switching Quality of service Mobile communication multicast communication Wireless sensor networks Mobile computing

来源：评论

学校读者我要写书评

暂无评论

CARMA Based MST Approximation for multicast Provision in P2P Networks

CARMA Based MST Approximation for Multicast Provision in P2P...

引用

International Conference on Networking and Services (ICNS)

作者： Gennadiy Poryev Hermann Schloss Rainer Oechsle National Technical University Kiev Ukraine University of Trier Trier Germany Trier University of Applied Sciences Trier Germany

ISBN: (纸本)9781424459278;9780769539690

The Minimum Spanning Tree (MST) problem is one of the most popular and important problems in the research area of distributed computing and networks. Contrary to the theoretical models where we usually have a global knowledge of all nodes and the corresponding distances for MST construction, in a realistic network (e.g., Internet) a node always has to rely on local knowledge only, that is it neither knows all other nodes nor exact distances between these nodes. In this paper we propose an approach for MST approximation based on local knowledge of a small subset of existing nodes by using the CARMA metric as a distance substitute. According to the evaluation results, our approach achieves a good MST approximation with respect to a communication cost and avoids extraneous communication needed for latency measurements.

关键词： Costs Delay Distributed computing IP networks Network topology Telecommunication traffic Computer network management Nearest neighbor searches Approximation algorithms multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Subcarrier, Bit and Time Slot Allocation for multicast Precoded OFDM Systems

Subcarrier, Bit and Time Slot Allocation for Multicast Preco...

引用

IEEE International Conference on Communications (ICC)

作者： A. Maiga J.-Y. Baudais J.-F. Helard Institute of Electronics and Telecommunications of Rennes Rennes France

The conventional resource allocation method in multicast OFDM systems adapts the physical layer to the worst user link conditions. In this paper, we propose new subcarrier, bit and time slot allocation algorithms for multicast OFDM systems in indoor powerline communication (PLC) context. To increase the multicast bit rate, these algorithms jointly use linear precoded OFDM (LP-OFDM) modulation technique and the conventional multicast approach to exploit the channel frequency selectivity experienced by each user. The LP technique applied to OFDM systems has already proved its ability to significantly increase the system throughput in a PLC context. Here, different groups of multicast users according to their channel conditions are created and different ways of gathering users, leading to different modes, are analyzed. Simulations are run over indoor PLC channels and it is shown that the proposed modes combined with the LP-OFDM solution offer a significant bit rate gain compared to the conventional multicast approach. In addition, the interest of gathering multicast users into groups for multicast OFDM systems in PLC context is shown.

关键词： Programmable control Bit rate Resource management Physical layer multicast algorithms Chirp modulation OFDM modulation Context Communications Society Reflection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：