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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Layered multicast with Inter-Layer Network Coding

Layered Multicast with Inter-Layer Network Coding

引用

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

作者： S. Dumitrescu M. Shao X. Wu Department of Electrical and Computer Engineering McMaster University Hamilton ONT Canada

ISBN: (纸本)9781424435128

Multirate multicast is a powerful methodology of multimedia communication in heterogenous networks. A variant of multirate multicast motivated by scalable multimedia streaming is layered multicast, where the transmitted signal is presented in successive data layers. With recent advances of network coding theory, many layered multicast schemes using network coding have been proposed to improve the performance of traditional routing based layered multicast. They divide the network into different layers and construct a unirate multicast network code for each layer. However, these schemes do not perform network coding between data layers, and consequently cannot realize the full potential of network coding. In this paper, we propose a novel approach to layered multicast that allows network coding of data in different layers. This relaxation lends the proposed scheme greater flexibility in optimizing the data flow than previous layered solutions, and thus achieves higher throughput.

关键词： Network coding Streaming media Routing Throughput Bandwidth Communications Society Multimedia communication Decoding Tree graphs multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Holding time aware dynamic bandwidth allocation algorithm for emerging bandwidth on demand multicast applications

Holding time aware dynamic bandwidth allocation algorithm fo...

引用

International Symposium on High Capacity Optical Networks and Enabling Technologies, HONET

作者： Ali Munir Savera Tanwir S.M.Hasan Zaidi School of Electrical Engineering and Computer Science National University of Science and Technology Islamabad Pakistan

Several switching architectures like circuit switching, packet switching and burst switching have been proposed and developed for efficient utilization of high speed optical networks. Among these Dynamic Optical Circuit Switching (DOCS) has been found to be more useful for provisioning requests in backbone (core) networks due to its capability to provide huge bandwidth by establishing high capacity light-paths. Now-a-days applications like video distribution of social events, live coverage of sports, e-learning and HDTV have gained popularity, in these applications normally there are multiple users requesting a particular service simultaneously. To make efficient use of optical networks under these conditions various algorithms exist in literature. In this paper we have proposed an algorithm for provisioning of multicast (point to multipoint (P2MP)) requests which utilizes the connection duration/holding time information of the request for traffic grooming. We have done so by integrating our wavelength selection strategy with existing routing approach known as Delay constrained Shortest Path (DCSP) algorithm. Besides using traditional grooming approaches we have used the concept of using multiple wavelengths for meeting the needs of the required bandwidth demands. Results show that this policy can significantly improve the network performance in terms of call and bandwidth blocking ratios. We have provided simulation results for both On-Demand and Advance reservation request of network resources.

关键词： Channel allocation Heuristic algorithms multicast algorithms Bandwidth Switching circuits Optical packet switching Optical fiber networks Packet switching Burst switching High speed optical techniques

来源：评论

学校读者我要写书评

暂无评论

Dynamic multicast Routing and Wavelength Assignment with Minimal Conversions in Delay-Constrained WDM Networks

Dynamic Multicast Routing and Wavelength Assignment with Min...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Keen-Mun Yong Tee-Hiang Cheng Gee-Swee Poo School of Electrical and Electronics Engineering Nanyang Technological University Singapore

This paper addresses the problem of dynamic multicast routing and wavelength assignment in delay constrained wavelength-routed WDM network. Current algorithms focus in minimizing blocking probability or wavelength numbers used, but not on the number of wavelength conversions. Wavelength conversions on either optical or electronics plane are costly and time consuming, hence should be minimized to ensure good transmission quality and manageable cost. In this paper, we proposed an algorithm on generic layered auxiliary graph to construct delay constrained dynamic multicast trees with minimal conversions and low blocking, and compared it with existing optimal algorithms through simulations. The results indicate that our proposed algorithm is able to achieve near optimal performance in terms of blocking, wavelength conversions and delays between source and members.

关键词： Wavelength routing Wavelength assignment Wavelength conversion Propagation delay WDM networks multicast algorithms Optical wavelength conversion Quality management Costs Tree graphs

来源：评论

学校读者我要写书评

暂无评论

Optimization of multicast logd(N, m, p) Switching Networks

Optimization of Multicast logd(N, m, p) Switching Networks

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Grzegorz Danilewicz Chair of Communication and Computer Networks Poznan University of Technology Poznan Poland

The general case of multiplane wide-sense nonblocking multicast switching networks which are based on the baseline network are considered in this paper. Up to now, wide-sense nonblocking (WSNB) log 2 (N, 0, p), log 2 (N, m, p) and log d (N, 0, p) switching networks have been considered for multicast connections. A control algorithm under which these networks are WSNB is called the variable-size blocking window algorithm. In this paper, the path-searching algorithm is adopted for log d (N, m, p) networks with m extra stages and for general case d ¿ 2. The WSNB multicast conditions for log d (N, m, p) networks are presented (without proofs) and the optimal multicast switching networks are investigated.

关键词： multicast algorithms Communication switching Broadcasting Communications technology Computer networks Switching systems Multimedia communication Joining processes Hardware Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Recipient Maximization Routing Scheme for multicast over IEEE 802.16j Relay Networks

Recipient Maximization Routing Scheme for Multicast over IEE...

引用

IEEE International Conference on Communications (ICC)

作者： W.-H. Kuo Department of Electrical Engineering Yuan-Ze University Taoyuan Taiwan

In this paper, we consider the resource allocation problem for multicast over IEEE 802.16j WiMAX networks, which use relay stations to transmit data between the base station and subscriber stations to improve the transmission quality. Our objective is to maximize the total number of recipients by allocating resource among the base station and relay stations subject to the resource budget and the channel quality. We prove that the problem is NP-hard, and design a polynomial-time algorithm to solve it. The algorithm can be integrated with the multicast mechanism defined in the WiMAX standards, and can also be applied to any kind of wireless networks that support adaptive modulation and coding schemes. The performance of the algorithm is evaluated through simulations. We show that the typical routing approach is inefficient, whereas our scheme can always utilize relay stations to achieve a superior performance under different channel qualities and resource budgets.

关键词： Routing Relays multicast algorithms Resource management WiMAX Base stations Algorithm design and analysis Polynomials Wireless networks Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Feedback Based multicast Approach for Video Conferencing in Ad Hoc Networks

Feedback Based Multicast Approach for Video Conferencing in ...

引用

IEEE International Advance Computing Conference, IACC

作者： Philip Samuel Neelesh Kumar Kumar Gaurav Division of Information Technology School of Engineering Cochin University of Science and Technology Kochi India

In spite of continuous research in the field of ad hoc networks by the research community, it still is quite away from the wide scale use by the common masses. We have developed a protocol named feedback dependent multicast routing protocol (FDMRP) to implement video conferencing in ad hoc networks. The protocol uses mobility prediction and feed back mechanism as its principal tools and hence has less control packet overhead and high immunity to error propagation. It also avoids delay during transmission and hence minimizes the freezing of video signals at the receiver. In this paper we describe an algorithm to implement our protocol for the purpose of video conferencing. We have compared our protocol's merits with that of a well known protocol named ODMRP (on demand multicast routing protocol). FDMRP has clear advantages over existing routing protocols for video conferencing.

关键词： Feedback Videoconference Ad hoc networks Routing protocols multicast protocols Video on demand Feeds Error correction Delay multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

multicast routing and channel assignment in wireless mesh networks

Multicast routing and channel assignment in wireless mesh ne...

引用

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

作者： Chia-Sheng Chou Chien Chen Ying-Yu Chen Rong-Hong Jan Cheng-Chung Hsieh Department of Computer Science National Chiao Tung University Hsinchu Taiwan Department of Computer Science Networks and Multimedia Institute Institute for Information Industry Taipei Taiwan

ISBN: (纸本)9781424451142

This paper studies the problem of multicast routing and channel assignment in multi-channel and multi-interface wireless mesh networks. The advantage of the wireless broadcast's nature is used to reduce interference and improve network throughput. The employed network model is first described. Next, a heuristic channel assignment algorithm that makes use of the wireless broadcast's advantage is presented. Simulation results reveal that the proposed heuristic algorithm can reduce interference and increase the network throughput in multi-channel multi-interface wireless mesh networks.

关键词： Routing Wireless mesh networks Interference Heuristic algorithms multicast algorithms Computer science Throughput Broadcasting Switches Costs

来源：评论

学校读者我要写书评

暂无评论

Quantum-inspired evolutionary multicast algorithm

Quantum-inspired evolutionary multicast algorithm

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yangyang Li Licheng Jiao Jingjing Zhao Qiuyi Wu Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an China

As a global optimizing algorithm, genetic algorithm (GA) is applied to solve the problem of multicast more and more. GA has more powerful searching ability than traditional algorithm, however its property of ¿prematurity¿ makes it difficult to get a good multicast tree. A quantum-inspired evolutionary algorithm (QEA) to deal with multicast routing problem is presented in this paper, which saliently solves the ¿prematurity¿ problem in genetic based multicast algorithm. Furthermore, in QEA, the individuals in a population are represented by multistate gene quantum bits and this representation has a better characteristic of generating diversity in population than any other representations. In the individual's updating, the quantum rotation gate strategy is applied to accelerate convergence. The algorithm has the property of simple realization and flexible control. The simulation results show that QEA has a better performance than CS and conventional GA.

关键词： multicast algorithms Competitive intelligence Laboratories Information processing Evolutionary computation Routing Genetic algorithms Quality of service Quantum computing Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

multicast Routing with Multiple QoS Constraints Based on Artificial Immune Networks

Multicast Routing with Multiple QoS Constraints Based on Art...

引用

International Conference on Advances in Recent Technologies in Communication and Computing, ARTCom

作者： Antariksha Bhaduri

ISBN: (纸本)9781424451043

Due to the massive popularity and spread of internet and advent of many new multimedia applications like Video Conferencing etc, the issue of multicast routing with multiple quality of service (QoS) constraints becomes more important. For Example, in order to ensure smooth playback of multimedia data, a video conference require guarantee on both end to end delay and loss probability. Artificial Immune Networks (AIN) which are algorithm developed with inspiration from natural immune system processes have been used to solve various kinds of real life processes with success. Opt-aiNet algorithm, an immune network algorithm designed for optimization, works mainly on the principle of clonal selection and antibody suppression. This paper explores the possibility of application of opt-aiNet to solve the problem of multicast Routing with Multiple QoS Constraints. The original opt-aiNet algorithm is further modified to make it suitable for the current problem. The performance of the modified opt-aiNet is compared with that of GA and the modified opt-aiNet is found to outperform GA in terms of convergence rate and the result obtained.

关键词： Routing Quality of service multicast algorithms Videoconference Web and internet services Delay Immune system Algorithm design and analysis Design optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

A new delay-constrained multicast routing algorithm for packet networks

A new delay-constrained multicast routing algorithm for pack...

引用

AFRICON Conference

作者： Maciej Piechowiak Piotr Zwierzykowski Faculty of Electronics and Telecommunications Poznan University of Technology Poznan Poland

There have been many heuristic algorithms finding multicast trees proposed in the literature. The necessity for finding a better and more suitable algorithm is still topical and relevant. The paper presents a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the proposed KSPMA algorithm is to minimize cost of constrained paths between the source and destination nodes using the generalized Dijkstra's algorithm regarding maximum delay bound along each path. A wide range of simulation research carried out by the authors, for many network topologies and parameters, has confirmed the effectiveness of the proposed algorithm.

关键词： Routing multicast algorithms Costs Telecommunication traffic Heuristic algorithms Traffic control Computer networks Delay Network topology IPTV

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：