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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Source Adaptive Receiver Driven Layered multicast

Source Adaptive Receiver Driven Layered Multicast

引用

International Conference on Complex, Intelligent and Software Intensive Systems, CISIS

作者： Arjan Durresi Mimoza Durresi Vamsi Paruchuri Leonard Barolli Department of Computer and Information Science Indiana university-Purdue University Indianapolis Indianapolis IN USA Department of Computer Science University of Central Arkansas Conway USA Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan

ISBN: (纸本)9781424459179;9780769539676

Spatial and temporal variations in network bandwidth constraints constitute serious challenges to the multicast distribution of real-time video content. We present a video multicast algorithm that combines multi-layered video encoding with feedback-based source adaptation in order to address varying bandwidth constraints in a multicast tree. The proposed algorithm uses a novel multicast flow control mechanism in conjunction with explicit rate congestion feedback. It achieves efficient bandwidth utilization. The proposed mechanism is capable of providing a high quality video service in the presence of varying bandwidth constraints.

关键词： Bandwidth multicast algorithms Feedback Internet Quality of service Streaming media Video on demand Video sharing Computer networks Application software

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for delay delay-variation bounded least cost multicast routing

A heuristic algorithm for delay delay-variation bounded leas...

引用

IEEE International Advance Computing Conference, IACC

作者： Manas Ranjan Kabat Manoj Kumar Patel Chita Ranjan Tripathy Department of Computer Science & Engineering Veer Surendra Sai University of Technology Burla Orissa India

ISBN: (纸本)9781424447909;9781424447916

Many multimedia communication applications require a source to transmit messages to multiple destinations subject to delay and delay-variation constraints. To support delay constrained multicast communications, computer networks have to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. On the other hand, if the same message fails to arrive at each destination node at the same time, there will probably arise inconsistency and unfairness problem among users. The problem to find a minimum cost multicast tree with delay and delay variation constraints has been proven to be NP-Complete. In this paper, we present a more efficient heuristic algorithm, namely, Economic Delay and Delay Variation Bounded multicast Algorithm (EDVBMA), based on a novel heuristic function, to construct a least cost delay and delay variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.

关键词： Delay Heuristic algorithms multicast algorithms Costs Routing Multimedia communication Application software multicast communication Computer networks Upper bound

来源：评论

学校读者我要写书评

暂无评论

Scheduling Algorithm for Multi-Massive-Online Applications in multicast Mobile Networks

Scheduling Algorithm for Multi-Massive-Online Applications i...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： A. Minamikawa S. Muramatsu H. Yokoyama KDD Research and Development Laboratories Inc. Fujimino Saitama Japan

ISBN: (纸本)9781424451753;9781424451760

This paper describes a new multicast scheduling scheme for multi-massive-online (MMO) applications in mobile networks. In order to reduce the amount of traffic volume, multicast channels should be fully utilized for information sharing among users while unicast channels are used to notify the current states of the users to the servers. On the other hand, most mobile terminals cannot use both multicast and unicast channels at the same time slot. In such case, each terminal should choose either to receive data in multicast channels delivered from the servers, or to send its state information to the servers while missing the multicasted data In order to provide the optimum tradeoff between sending and receiving the relevant data of MMO, we propose a new scheduling algorithm with which multicast servers enable most mobile terminals to have upload time while they obtain the multicast contents that they prefer. The effectiveness of the proposed algorithm is numerically evaluated.

关键词： Scheduling algorithm Unicast Network servers multicast algorithms Telecommunication traffic Downlink Broadcasting Signal processing algorithms Mobile handsets Broadband communication

来源：评论

学校读者我要写书评

暂无评论

A Directed-multicast Routing Approach with Path Replication in Content Addressable Network

A Directed-Multicast Routing Approach with Path Replication ...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Wenbo Shen Weizhe Zhang Hongli Zhang Hui He School of Computer Science and Technology Harbin Institute of Technology Harbin China

ISBN: (纸本)9781424457267;9780769539614

In order to improve the efficiency of routing and resource location under large scale failure of Content Addressable Network, a directed-multicast routing approach is proposed to solve the backtrack problem of the traditional greedy approach. Possessing the advantages of directed routing approach and multicast, this new approach also has an extending coefficient to increase its feasibility. Meanwhile, we explore a new replication approach that we term Path Replication. Combining with Path Replication, the directed-multicast routing approach is more efficient in routing process. The efficiency of directed-multicast routing was proved in the simulations on PlanetSim.

关键词： Routing Peer to peer computing Large-scale systems Broadcasting Distributed computing Bandwidth Helium Computer science Computational modeling multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved multicast Algorithm for Overlay multicast in P2P Based Video Streaming

Improved Multicast Algorithm for Overlay Multicast in P2P Ba...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Lorenzo Favalli Marco Folli Matteo Lanati Dipartimento di Elettronica University of Pavia Pavia Italy Istituto Universitario Studi Superiori Eucentre Pavia Italy

In this paper we introduce some significant improvements to a well known algorithm for multicast in overlay networks, namely ZigZag. The improvements are mainly related to a better handling of peer churn, avoiding service interruption to the subtree rooted at the departed node. Since the target is a video streaming service, additional constraints are related to a minimum serving quality for outgoing links. This translates in a maximum number of children for each node depending on its outgoing link capacity: to allow this, more realistic constraints on node heterogeneity are introduced so that the multicast tree is allowed to grow unbalanced. It is also shown that exploiting the overlapped control structure with scalable coded video it is possible to minimize service interruptions due to peers departure while minimizing signaling overhead. The changes have been implemented and validated using network simulator 2 to show the effectiveness of the procedures.

关键词： multicast algorithms Streaming media Peer to peer computing Content management Collaborative software Proposals Routing Communications Society Electronic mail IP networks

来源：评论

学校读者我要写书评

暂无评论

Constraints QoS multicast Routing Based on MOEA

Constraints QoS Multicast Routing Based on MOEA

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Guangming Lin ChengBo Huang Xin Lu Huijie Wang Shenzhen Institute of Information Technology Shenzhen China School of Information Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781424463275;9780769539898

The multi-constrained QoS multicast routing problem has been shown to be NP-complete. Many researchers used some single-objective optimization algorithms to solve the problem. However, the constraint-handling approaches in these methods have some drawbacks. In this paper, we converted the constraints sing-objective problem into a multi-objective problem, and gave a Multi-Objective Evolutionary Algorithm (MOEA) to solve it. By simulation experiments, we find this approach for constraint handling not only can find the constrained optimality, but also can provide the decision maker with a group of trade-off solutions with slightly constraint violation and meanwhile with substantial gain in the objective function.

关键词： Routing Delta modulation Delay Evolutionary computation Constraint optimization Cost function Mobile communication Mobile computing Information technology multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Probability and Receiver List based multicast routing in DTNs

Probability and Receiver List based multicast routing in DTN...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Minghui Ma Zhaoxiang Zhang Xudong An Chao Li Yuanda Cao School of Computer Science Beijing Institute of Technology Network Optimization Center China Mobile Communications Corporation Beijing Co. Ltd. China Telecommunication Metrology Center of MIIT School of Computer Science Beijing Institute of Technology China

ISBN: (纸本)9781424454273;9788955191455

Delay/Disruption Tolerant Networks (DNTs) enables nodes to communicate by means of asynchronous sending messages without the need for an end-to-end path. In this paper, we study the problem of multicasting in DTNs. Several schemes have been proposed for multicast routing assuming the group of message receivers is known by sender, and the group members do not change during the process of message delivery. In this paper, we propose a Probability and Receiver List based multicast routing scheme to address the message routing problem, which can handle multicast group members changing problem. Simulation results show that our routing strategies can achieve higher message delivery ratios and lower delivery latency than existing approaches.

关键词： Routing Disruption tolerant networking multicast algorithms Mobile ad hoc networks Tree graphs Delay Mobile communication IP networks multicast protocols Chaotic communication

来源：评论

学校读者我要写书评

暂无评论

A novel QoS restoration scheme based on domination set in IP over WDM multicast network

A novel QoS restoration scheme based on domination set in IP...

引用

International Conference on Telecommunications (ICT)

作者： San-Nan Lee Department of Computer Science and Information Engineering Vanung University Chungli Taiwan

Due to the advance in WDM technology and real-time applications, multicast communication is discussed recently. An important issue for real-time communication, fault restoration schemes, lets multicast communication reliable. In this paper, a novel QoS restoration scheme based on domination set (HFR-DS) is proposed. The domination node can provide dynamic method to generate the restoration path. This method is not only used for link failure, but also for node failure. The simulation results show that the proposed scheme has better performance in terms of hop count and blocking probability. The delay could be guaranteed to meet the requirements of different kinds of multicast group, such as real-time streams.

关键词： Wavelength division multiplexing WDM networks Quality of service Signal restoration multicast communication Delay Bandwidth IP networks multicast algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel multicast Key Exchange Algorithm Based on Extended Chebyshev Map

A Novel Multicast Key Exchange Algorithm Based on Extended C...

引用

International Conference on Complex, Intelligent and Software Intensive Systems, CISIS

作者： Ke Qin Mingtian Zhou Yong Feng Laboratory of Computer Reasoning and Trustworthy Computation School of Computer Science and Engineering University of Electronic Science and Technology Chengdu Sichuan China

The Chebyshev map is a typical chaotic map which has been widely investigated for cryptography. However, researchers argue that almost all the encryption algorithms based on some chaotic maps are not as secure as they are announced. In this paper, the limitations of some multicast key agreement schemes are discussed. To eliminate those false and remain novelty, we consider how the chaotic maps can be improved to fulfill the cryptographic demands. To achieve this, we extend the domain of Chebyshev maps from real number set to finite field. Based on this extension, this paper proposes a novel multicast key exchange algorithm. By detailed experiments and analysis, we show that this algorithm is secure and efficient. As far as we know, such a multicast key exchange algorithm has not been reported. The results given here, to the best of our knowledge, are novel.

关键词： multicast algorithms Chebyshev approximation Cryptography Chaos Algorithm design and analysis Unicast Security Competitive intelligence Software systems Software algorithms

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm for Building Energy-Efficient Group-Shared multicast Tree in Ad Hoc Networks

A Distributed Algorithm for Building Energy-Efficient Group-...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Yuhong Luo Jianxin Wang Weihua Gui School of Information Science & Engineer Central South University Hunan Radio and TV University Changsha China School of Information Science & Engineer Central South University Changsha China

ISBN: (纸本)9781424465972;9780769540115

The group-based multicast is widely applied in wireless ad hoc networks because it has lower storage status messages in the nodes and lesser overhead cost in the shared tree. Reducing energy consumption and extending network lifetime in multicasting are two important issues. In this paper, a distributed algorithm called B-REMiT is proposed for building an energy efficient shared tree in ad hoc network. The algorithm BREMiT focuses on the metric TEC (Total Energy Consumption) while its refining is guided by the metric SL (System Lifetime) of shared tree. Such a nice integration seems to well balance the two metrics by improving SL of multicast trees efficiently with little sacrifice on TEC.

关键词： Distributed algorithms Energy efficiency Ad hoc networks Mobile ad hoc networks multicast algorithms Energy consumption Information science Power engineering and energy Costs multicast protocols

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：