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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Tree-Based Protection of multicast Services in WDM Mesh Networks

Tree-Based Protection of Multicast Services in WDM Mesh Netw...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Long Long Ahmed E. Kamal Department of Electrical and Computer Engineering Iowa State University Ames IA USA

In this paper we address the multicast survivability problem of using minimum resources to provision a multicast session and its protection paths (trees) in a network such that the session is protected against any single-link failure. We propose a new protection scheme, namely, Segment-based Protection Tree (SPT). In SPT scheme, a given multicast session is first provisioned as a primary multicast tree, and then each segment on the primary tree is protected by a multicast tree instead of a path, as in most existing approaches. We also analyze the recovery performance of SPT and design a Reconfiguration Calculation Algorithm to compute the average number of reconfigurations upon any link failure. We study the performance of the SPT scheme in different traffic scenarios. The numerical results show that SPT outperforms the best existing approaches. It uses less than 10% extra resources to provision a survivable multicast session over the optimal solution and 0.2-4% lower than the existing approaches in the various traffic cases and has the average number of reconfigurations 10-86% less than the best cost efficient approach.

关键词： Protection Wavelength division multiplexing WDM networks Mesh networks Telecommunication traffic Switches Network coding Algorithm design and analysis multicast algorithms Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Reliable multicast protocol adopting hierarchical tree-based repair mechanism

Reliable multicast protocol adopting hierarchical tree-based...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Lakshmi Prasad Saikia Kattamanchi Hemachandran Department of Computer Sc. & Engineering National Institute of Technology Silchar Assam India Department of Computer Science Assam University Assam India

In this work, tree based reliable multicast protocol (TRAM) is analyzed. Modified algorithmic model to improve the functioning of the protocol is implemented. In TRAM model, authors have considered an approach for Retransmission of lost data packets which minimize the resource utilization at intermediate hosts and localize the effect of slow or malicious receivers on normal recovers. TRAM is designed to support bulk data transfer from a single sender to many receivers. A dynamically formed repair tree provides local error recovery allowing the multicast group to support a large number of receivers. Here TRAM is implemented in some smaller network environments. Authors have considered an efficient retransmission control scheme which can rectify some of the disadvantages of TRAM. Under this scheme, most of additional retransmissions are performed within a local group. This feature satisfies the original goal of tree-based protocol. This study is done for the error-free case. The modified protocol optimizes the buffer requirement at intermediate hosts and improves the end-to-end parameters for normal receivers in the presence of some slow or malicious receivers.

关键词： multicast protocols Wide area networks multicast communication Transport protocols Communication system traffic control Computer science multicast algorithms Resource management Delay Clocks

来源：评论

学校读者我要写书评

暂无评论

Receiver-driven layered overlay multicast for scalable video streaming

Receiver-driven layered overlay multicast for scalable video...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Junni Zou Min Wang Leyang Li Hongkai Xiong Department of Communication Engineering Shanghai University Shanghai China Department of Electronic Engineering Shanghai Jiaotong University Shanghai China

In this paper, we seek the optimal overlay multicast performance for scalable video streaming. To adapt to layered multicast with multiple paths, a new metric layer stretch is introduced, measuring video layer's dissemination latency along the overlay. Multi-path routing, network coding based layer subscription and congest control are jointly optimized, formulating a linear programming to minimize the average layer stretch over all receivers. It not only solves the issue of inter-layer dependency of scalable video coding, but allows each receiver to determine the required video quality. Moreover, a heuristic algorithm that can be implemented in a distributed manner is provided to approximate the optimal solution. Simulation results validate the network performance of the proposed scheme.

关键词： Streaming media Delay Network coding Static VAr compensators Throughput Video coding multicast algorithms Subscriptions Heuristic algorithms Unicast

来源：评论

学校读者我要写书评

暂无评论

End-to-End Network Delay-Constrained for QoS multicast Routing

End-to-End Network Delay-Constrained for QoS Multicast Routi...

引用

International Conference on Networks and Communications (NETCOM)

作者： S.P. Balakannan Yier Yan Jae Seung Yang Moon Ho Lee Chonbuk National University Jeonju Jeollabuk-do KR Department of Information and Communication Chonbuk National University Jeonju South Korea

multicast services are used in emerging multimedia applications based on Quality of Service (QoS) development of multimedia group application and the construction of multicast routing tree is significant. Upper bound on the delay between sender and receiver is one of the common QoS constraints. Delay-constrained routing protocols are used to find paths subject to the delay constraint while efficiently using network resources, also the delay constrained routing problem is difficult because, different constraints can conflict with another. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, we propose a new approach for end-to-end delay-constrained routing in a network, which captures the trade-off between cost minimization and the risk level regarding to the delay constraint. We propose a method called delay-constrained routing agent (DCRA) that implements our approach using a simple and efficient parameterized selection function.

关键词： Quality of service Costs multicast protocols Routing protocols multicast algorithms Delay effects Upper bound multicast communication Jitter Moon

来源：评论

学校读者我要写书评

暂无评论

An immune algorithm for the optimization of aggregated multicast

An immune algorithm for the optimization of aggregated multi...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Hua Wang Zuquan Ge Fangji Zhu Chaoying Yu School of Computer Science and Technology Shandong University Jinan Shandong China

Large-scale deployment of multicast applications is limited by the number of states that are set in routers for multicast groups. Aggregation is a natural solution to reducing the multicast forwarding states. In the way of sharing a common distribution tree among several groups, the approach to aggregated multicast reduces the number of forwarding states and improves network performance. Finding the best aggregation tree is an NP-complete problem, which requires approximate algorithms for the solution. Traditional greedy algorithm is not suitable for large scale network because of long computation time and low degree of aggregation. In this paper, an immune algorithm is proposed to solve the problem of aggregated multicast optimization. The immune approach achieves better solution by generating antibody of different antigens, which enables the algorithm to search in the vast space for the best solution. Simulations have shown that the immune algorithm has better performance than other algorithms in both the aggregation degree and the state reduction ratio.

关键词： multicast algorithms Internet Large-scale systems NP-complete problem Greedy algorithms Routing Scalability Chaotic communication Computer science Application software

来源：评论

学校读者我要写书评

暂无评论

QoS multicast Routing Problem Based on Artificial Fish-Swarm Algorithm

QoS Multicast Routing Problem Based on Artificial Fish-Swarm...

引用

International Workshop on Education Technology and Computer Science, ETCS

作者： Chun-bo Liu Hui-jin Wang Zhi-ping Luo Xiu-qin Yu Li-hua Liu Department of Computer Information Science and Technology Jinan University Guangzhou China Lab of SDII Computer and Engineering South China University of Technology Guangzhou China Department of Statistics Economics College Jinan University Guangzhou China Department of Education Jinggangshan University Jian Jiangxi China

Bandwidth-delay-constrained multicast routing problem is an NP-complete problem. In this paper, we propose a QoS multicast routing algorithm based on artificial fish swarm optimization. Meeting with the bandwidth-delay-constrained, the proposed algorithm can search the least-cost multicast routing tree quickly. Simulation results show that this algorithm has high reliability and good performance of global optimization, and suit for real-time, high-speed multimedia transmission network.

关键词： Routing multicast algorithms Quality of service Bandwidth Educational technology Delay Mathematical model Costs Computer science education Information science

来源：评论

学校读者我要写书评

暂无评论

On Maximizing IP multicast Throughput in Multi-Source Applications

On Maximizing IP Multicast Throughput in Multi-Source Applic...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： M. R. Rahimi N. Sarshar Faculty of Engineering University of Regina Regina SAS Canada

Given a fixed network of routers, a set of multicast sources and their corresponding receivers, we investigate the problem of constructing multicast sessions that maximize the multicast throughput of all sessions under fairness constraints. It is known that for problems with only one source node, heuristic algorithms based on packing maximum-rate Steiner trees may achieve throughput close to network capacity for some networks of interest. In almost all practical applications, however, multiple multicast sessions must be concurrently supported by the same network. We find that greedy strategies such as maximum-rate Steiner tree packing fail to perform well in dense problems, where the number of sources are large. We then propose a heuristic round-robin algorithm, called Cooperative Shortest Path Tree Packing Algorithm (CSPT), that performs uniformly well in the whole spectrum of problems from sparse to dense. Simulations on random networks show up to 5 times increase in throughput when compared to conventional methods in which there is only one tree per multicast session, and on average achieving 92% of the network capacity, when network coding is allowed. Finally, we show how CSPT can be implemented, with relative ease, on top of the current standard IP protocols.

关键词： Throughput multicast protocols multicast algorithms Network coding Routing protocols Heuristic algorithms Round robin Fault tolerance Bandwidth Collaboration

来源：评论

学校读者我要写书评

暂无评论

A Novel Graph Model for Dynamic multicast Flow Aggregation in Optical Networks

A Novel Graph Model for Dynamic Multicast Flow Aggregation i...

引用

IEEE International Conference on Communications (ICC)

作者： Y. Zhu A. N. Patel J. P. Jue Department of Computer Science University of Technology Richardson TX USA

In this paper, we address the dynamic multicast flow aggregation problem and propose a novel graph model with different aggregation policies. We first give the network model with an auxiliary graph for the aggregation. We then discuss an aggregation algorithm using the auxiliary graph and propose three policies for aggregating multicast flows. Numerical results show that aggregation can tremendously reduce the total trees in the network while the three policies can achieve good performance for various scenarios.

关键词： Image motion analysis Optical fiber networks Bandwidth multicast algorithms Communications Society Computer science Electronic mail WDM networks Spread spectrum communication Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Optimal multicast in multi-channel multi-radio wireless networks

Optimal multicast in multi-channel multi-radio wireless netw...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Ajay Gopinathan Zongpeng Li Carey Williamson Department of Computer Science University of Calgary Canada

ISBN: (纸本)9781424449279

Recent advances in wireless technology have made it increasingly feasible to equip wireless nodes with multiple radios, thereby allowing each radio to exploit channel diversity in the form of orthogonal, non-overlapping transmission spectrums. Multi-channel operation mitigates interference, but at the same time raises new challenges for network optimization, in terms of judicious channel assignment for efficient bandwidth utilization. While previous research mostly studies optimizing channel assignment for unicast, we focus instead on multicast, which is an efficient mechanism for one-to-many data dissemination. We derive a model for optimal multicast in multi-channel multi-radio wireless networks under the assumption that channel assignment is static. Our model employs network coding as the multicast mechanism of choice, and exploits the broadcast nature of omnidirectional antennas for efficient bandwidth utilization. Based on the model derived, we formulate optimal multicast as a linear integer program. Two accompanying solutions are proposed: a greedy channel assignment scheme and an improved iterative scheme inspired by primal-dual algorithm design. The effectiveness of the two schemes are empirically examined through simulation studies, and are compared to results obtained from solving the integer program as well as its linear programming relaxation. Finally, we present an alternate model for optimal multicast under the assumption that transmission frequencies are not fixed divisions of the usable spectrum.

关键词： Wireless networks Bandwidth Interference Unicast Network coding Broadcasting multicast algorithms Iterative algorithms Algorithm design and analysis Linear programming

来源：评论

学校读者我要写书评

暂无评论

An SFL-Based multicast Routing Optimization Algorithm

An SFL-Based Multicast Routing Optimization Algorithm

引用

International Workshop on Intelligent Systems and Applications, ISA

作者： Xia Sun Ziqiang Wang School of Information Science and Engineering Henan University of Technology Zhengzhou China

The problem of computing the bandwidth-delay-constrained least-cost QoS multicast routing is a NP-complete problem. A novel shuffled frog leaping (SFL) algorithm is proposed to deal with the Qos multicast routing problem effectively and efficiently in this paper. The experimental results show that the proposed algorithm can find optimal solution quickly and has a good scalability.

关键词： Routing multicast algorithms Quality of service Streaming media Application software Costs Delay Information science Scalability Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：