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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Efficiency Analysis of multicast Routing algorithms in Large Networks

Efficiency Analysis of Multicast Routing Algorithms in Large...

引用

International Conference on Networking and Services (ICNS)

作者： Maciej Piechowiak Piotr Zwierzykowski Institute of Env. Mech. and Computer Science Kazimierz Wielki University Bydgoszcz Poland Faculty of Electronics and Telecommunications Poznan University of Technology Vernon Hills Poland

ISBN: (纸本)9781424431526;9780769525588

The paper presents the research results of multicast heuristic algorithms. The paper is an extension of previous publications presented in [14, 15] that discussed small network structures reflecting real Internet topology. It approaches basic methods of generating the Internet topology - Waxman method and the Barabasi-Albert method. A performance study of multicast trees constructed by the algorithms is carried out and analysed, also with the heuristic network generator - Inet.

关键词： Algorithm design and analysis Routing multicast algorithms Network topology Costs Tree graphs Heuristic algorithms IP networks Telecommunication network topology Circuit topology

来源：评论

学校读者我要写书评

暂无评论

A Performance Analysis of MANET multicast Routing algorithms with Multiple Sources

A Performance Analysis of MANET Multicast Routing Algorithms...

引用

International Conference on Software Engineering Research, Management and Applications (SERA)

作者： Sang-Chul Kim KeeHyun Shin School of Computer Engineering Kookmin University Seoul South Korea

Since network resource of mobile ad hoc network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MANET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source- specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted.

关键词： Performance analysis Mobile ad hoc networks multicast algorithms Routing protocols multicast protocols Mobile computing Scalability Network topology Software algorithms Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Performance of Topological multicast Routing algorithms on Wireless Ad-Hoc Networks

Performance of Topological Multicast Routing Algorithms on W...

引用

Electronics, Robotics and Automotive Mechanics Conference

作者： R.A. Santos L. Villasenor J. Sanchez J.R. Gallardo A. Edwards University of Colima Mexico Research Centre CICESE Mexico University of Colima

This paper presents the performance of topological multicast routing algorithms on mobile wireless ad-hoc networks. Flooding and On-Demand multicast Routing Protocol (ODMRP) are simulated and compared with Topological multicast Routing Protocol (ToMuRo). The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers under various mobility and transmission ranges. The behavior of 250 nodes is evaluated in terms of end to end delay (EED), jitter, packet delivery ratio, and overhead. Results reveal that ToMuRo performs better in terms of packet delivery ratio and overhead, flooding has the best behavior with jitter and ODMRP with respect to EED. In general, ToMuRo has the best performance compared to the other algorithms.

关键词： multicast algorithms Ad hoc networks multicast protocols Routing protocols Floods Jitter Bandwidth Mobile communication Mobile robots Automotive engineering

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm of 3GPP MBMS Raptor Codes

An Improved Algorithm of 3GPP MBMS Raptor Codes

引用

International Conference on Measuring Technology and Mechatronics Automation, ICMTMA

作者： Quan Zhang Weizhang Xu Dongxin Shi Zhanxin Yang Commun. Univ. of China Beijing China

In this paper, an improved Raptor decoding algorithm of 3GPP MBMS (Multimedia Broadcast /multicast Services)standard is presented. Compared with the algorithm suggested in 3GPP, the improved algorithm adds preprocessing in the generator matrix. The simulation results demonstrate that the algorithm presented in the paper greatly improves the decoding speed of Raptor code rather than the standard algorithm.

关键词： Maximum likelihood decoding multicast algorithms Code standards Costs Error correction codes Parity check codes Mechatronics Automation Digital multimedia broadcasting Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Residual-Balanced Spanning Tree Problem of Topology-Aware ALM

Residual-Balanced Spanning Tree Problem of Topology-Aware AL...

引用

International Workshop on Intelligent Systems and Applications, ISA

作者： Jianqun Cui Keming Jia Libing Wu Department of Computer Science Huazhong Normal University Wuhan China School of Computer Wuhan University of China Wuhan China

ISBN: (纸本)9781424458721;9781424458745

Topology-aware application layer multicast takes the real underlying physical network connections into consideration while constructing multicast tree. The aim is to shorten end-to-end data forwarding delay, but it may lead to some end systems with high bandwidth close to the source node need to provide data forwarding service for many sub-nodes, and finally become the bottleneck of the multicast tree. To balance the requirement mentioned above, we propose a more comprehensive problem model MDDLRB (Minimum Delay, Degree-Limited Residual-Balanced) to construct application layer multicast spanning tree. Furthermore, to solve the MDDLRB problem, we present a heuristic algorithm based on delay increment and equilibrium optimization strategy. The simulation results show that the algorithm can get a better system performance.

关键词： Delay multicast algorithms Heuristic algorithms Routing Computer science Bandwidth Telecommunication traffic Computer networks Physics computing Application software

来源：评论

学校读者我要写书评

暂无评论

Maximum-Bandwidth ALM Tree on Tree Network

Maximum-Bandwidth ALM Tree on Tree Network

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Takamichi Kikkawa Takamichi Miyata Katsunori Yamaoka Tokyo Institute of Technology Meguro Tokyo Japan

ISBN: (纸本)9781424451753;9781424451760

It is important to use an ALM (application layer multicast) tree with broad bandwidth to ensure the quality of streaming applications. However, when constructing an ALM tree without information on underlay traffic, we cannot know how much congestion there is in links. Therefore, if unexpected congestion in links occurs, the quality of ALM transmissions may worsen. However, no polynomial-time algorithms for constructing maximum-bandwidth ALM trees with information on underlay traffic exist. We regarded an underlay network as a tree network topology in our previous work, and presented a polynomial-time algorithm that was used to construct a maximum-bandwidth ALM tree. We also proved that we could obtain an optimal ALM tree. However, we had not yet evaluated our algorithm by simulation. Here, we discuss our evaluation of the algorithm we propose and a conventional one. We found our algorithm could achieve a broader bandwidth ALM tree at lower computational cost, especially in large networks.

关键词： Bandwidth Network topology Telecommunication traffic Polynomials multicast algorithms Internet Traffic control Computational modeling Bit rate Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable Video Transmission on Overlay Networks

Scalable Video Transmission on Overlay Networks

引用

International Conference on Advances in Multimedia, MMEDIA

作者： Tien Anh Le Hang Nguyen Hongguang Zhang Department of Wireless Networks and Multimedia Services TELECOM & Management SudParis Evry France

Scalable Video Coding is the multi-layer extension of Advanced Video Coding with the advantage of providing visual services for customers with heterogeneous network conditions and terminals' capabilities. In this research, advanced features of Scalable Video Coding are investigated and compared with Advanced Video Coding. A new video transmission evaluation platform is proposed to support the latest Network Abstract Layer Units of Scalable Video Coding. A new interface between the scalable video evaluation platform and an overlay simulation platform is developed so that the transmission performance of Scalable Video Coding bit-streams on an overlay network will be evaluated. Both structural similarity index (SSIM) and peak signal-to-noise ratio (PSNR) measurements are applied to evaluate the performance of the video transmission session. New measurement results are also provided so that other SVC-based service designers can select the right video scalability for their service.

关键词： Video coding Static VAr compensators Videoconference PSNR Streaming media Automatic voltage control Bandwidth Codecs multicast algorithms Wireless networks

来源：评论

学校读者我要写书评

暂无评论

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing

引用

IEEE International Conference on Communications (ICC)

作者： D. Papadimitriou P. Pedroso D. Careglio Alcatel-Lucent Bell Laboratories Antwerp Belgium Universitat Poliltècnica de Catalunya Barcelona Spain

This paper investigates routing algorithms that compute paths along which combined unicast and multicast traffic can be forwarded altogether, i.e., over the same path. For this purpose, the concept of AnyTraffic group is introduced that defines a set of nodes capable to process both unicast and multicast traffic received from the same (AnyTraffic) tree. The resulting scheme is referred to as AnyTraffic routing. This paper defines a heuristic algorithm to accommodate the AnyTraffic group and to find the proper set of branch nodes of the tree. The algorithm supports dynamic changes of the leaf node set during multicast session lifetime by adapting the corresponding tree upon deterioration threshold detection. Studies are performed for both static and dynamic traffic scenarios to i) determine the dependencies of the algorithm (node degree, clustering coefficient and group size); and ii) evaluate its performance under dynamic conditions. Initial results show that the AnyTraffic algorithm can successfully handle dynamic requests while achieving considerable reduction of forwarding state consumption with small increase in bandwidth utilization compared to the Steiner Tree algorithm.

关键词： Unicast multicast algorithms Telecommunication traffic Peer to peer computing multicast protocols Heuristic algorithms Clustering algorithms Routing protocols Bandwidth Streaming media

来源：评论

学校读者我要写书评

暂无评论

Latency-Efficient Distributed M2M multicasting in Wireless Mesh Networks under Physical Interference Model

Latency-Efficient Distributed M2M Multicasting in Wireless M...

引用

IEEE Conference on Wireless Communications and Networking

作者： Qin Xin Yanbo J. Wang Simula Research Laboratory Oslo Norway Information Management Center China Minsheng Banking Corporation Limited Beijing China

Wireless Mesh Network (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the problem of multipoint-to-multipoint (M 2 M) multicasting in a WMN which aims to use the minimum number of time slots (minimum latency) to exchange messages among a group of k mesh nodes in a WMN with n mesh nodes under physical interference model. We study the M 2 M multicasting problem in a distributed environment where each participant only knows that there are k participants and it does not know who are other k - 1 participants among n mesh nodes. It is well known that the computation of an optimal M 2 M multicasting schedule is NP-hard. We present a fully distributed deterministic algorithm for such an M 2 M multicasting problem and analyze its time complexity. We show that if the maximum hop distance between any two out of the k participants is d, then the studied M 2 M multicasting problem can be solved in time O(d log n + k) with a polynomial-time computation in unit disk graphs, which is an almost optimal scheme in the sense that there exists a WMN topology, e.g., a line, in which the M 2 M multicasting cannot be completed in less than Ω(d + k) units of time. From our best knowledge, it is the first time to investigate M 2 M multicasting problem in WMNs under physical interference model.

关键词： Wireless mesh networks Interference Broadcasting Mesh networks Peer to peer computing multicast algorithms Telecommunication network reliability Routing Network topology Communications Society

来源：评论

学校读者我要写书评

暂无评论

Realizing Optimization Opportunities for Distributed Applications in the Middleware Layer by Utilizing InDiGO Framework

Realizing Optimization Opportunities for Distributed Applica...

引用

International Symposium on Parallel and Distributed Computing

作者： Valeriy Kolesnikov Computer Science Baker University Baldwin KS USA

InDiGO framework provides an infrastructure to develop generic but customizable middleware services. It also provides tools to customize the middleware algorithms for specific applications. Such customization allows one to optimize algorithms by removing communication which is redundant in the context of a specific application. In this paper, we apply InDiGO framework to study a class of bidding distributed applications. In particular, we will study how optimization level is affected by varying several application parameters, such as number of clusters, number of components per cluster, number of clusters with local ordering and number of components per process. The results of this study will help us to answer questions like: What type of application information is useful for optimization in InDiGO framework? or How does the application structure or its size affect the level of optimization? We present experimental results to demonstrate the optimizations when our infrastructure is utilized.

关键词： Middleware Algorithm design and analysis Application software Engines Context Design optimization Information analysis multicast algorithms Constraint optimization Assembly

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：