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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A multi-objective evolutionary algorithm with ε-dominance to calculate multicast routes with QoS requirements

A multi-objective evolutionary algorithm with ε-dominance t...

引用

Congress on Evolutionary Computation

作者： Gina M. B. Oliveira Stefano S. B. V. Vita Universidade Federal de Uberlandia Uberlandia Brazil Universidade Federal de Alagoas Uberlandia Brazil

multicasting routing is an effective way to communicate among multiple hosts in computer networks. Usually multiple quality of service (QoS) guarantees are required in most of multicast applications. Several researchers have investigated genetic algorithms-based models for multicast route computation with QoS requirements. The evolutionary models proposed here use multi-objective approaches in a Pareto sense to solve this problem and to deal with the inheriting multiple metrics involved in QoS proposal. Basically, we construct three QoS-constrained multicasting routing algorithms; the first one was based on NSGA, the second one was based on NSGA-II and the third is an adaptation of NSGA-II incorporating the concept of epsiv-dominance. These algorithms were applied to find multicast routes over two network topologies. Three different pairs of objectives were evaluated; the first objective used in each pair is related to the total cost of a multicast route and the second metric is related to delay. The first evaluated delay metric computes the total delay involved in the tree solution; the second one computes the mean delay accumulated from the source to each destination node; the third one is the maximum delay accumulated from the source to a destination node. Our results indicated that the NSGA-II environment incorporating the concept of epsiv-dominance - named epsiv-NSGA-II multicasting routing-returned the best performance.

关键词： Evolutionary computation Quality of service Delay multicast algorithms Routing Computer networks Application software Genetics Proposals Network topology

来源：评论

学校读者我要写书评

暂无评论

Locality-preserving randomized multicast routing on k-ary n-cube

Locality-preserving randomized multicast routing on k-ary n-...

引用

International Conference on Information Networking

作者： Ting Zhou Youjian Zhao Zhenhua Liu Xiaoping Zhang Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781424445264

With the growth of interest in multicast communication networks, the importance of routing techniques for multicast connections is being emphasized. In this paper, we propose a new multicast algorithm for a k-ary n-cube network, the randomized local balance multicast (RLBM) that outperforms unicast-based multicast routing scheme. Simulation results show that if choosing the proper threshold, the RLBM performs very well under different conditions with lower average delay and higher saturation throughput.

关键词： Routing multicast algorithms Unicast Telecommunication traffic Switches Multiprocessor interconnection networks Throughput multicast communication Delay effects Internet

来源：评论

学校读者我要写书评

暂无评论

Efficient management of multicast communications in mission-critical networks

Efficient management of multicast communications in mission-...

引用

IEEE Princeton Section Sarnoff Symposium

作者： Selcuk Cevher M. Umit Uyar Mariusz A. Fecko John Sucec Sunil Samtani The City College and Graduate Center City University of New York NY USA Applied Research Area Telcordia Technologies Inc. Piscataway NJ USA

Increasing efficient use of resources, such as network bandwidth, battery life and processing power, is one of the most important challenges in multicast group design for mission-critical networks. In this paper, we present an efficient technique for multicast group planning in a mission-critical network. Our technique increases the number of transmission links shared by any two users in a shortest-path multicast tree while keeping the unwanted traffic received by users within acceptable limits. We conduct simulation experiments which show that the multicast group assignments from our approach significantly increase bandwidth efficiency of multicasting.

关键词： multicast communication Mission critical systems Bandwidth Telecommunication traffic multicast algorithms Traffic control Network topology Measurement Batteries Process planning

来源：评论

学校读者我要写书评

暂无评论

Study of Software Security Based on SLDMRP multicast Routing Protocol

Study of Software Security Based on SLDMRP Multicast Routing...

引用

International Conference on Information and Computing Science, ICIC

作者： Wang Shuda Feng Si School of Computer and Information Engineering Harbin University of Commerce Harbin China School of Computer and Information Engineering HUC Harbin China Sch. of Comput. & Inf. Eng. Harbin Univ. of Commerce Harbin China

To focus on the current problem from the multicast routing protocols that are only considered about them, and then rarely take the security needs of less common into account. It is an ideal state protocol that is established without any infrastructure communications. During the procedure of data transfer, it is extremely vulnerable to eavesdrop, swindle, tampering or replay (Relay) routing information security. Thus, the SLDMRP protocol that it based on security put forward in this paper. This protocol is designed on the basis of the multicast routing LDMRP, while this protocol creating and maintaining multicast group, sending control message, to carry out security policy that is underwritten and verified the data packets, in order to prevent the control message from eavesdropping and tampering. Finally, through simulation results show that its security strategy is effective.

关键词： multicast protocols Routing protocols Data security Wireless sensor networks Information security Cryptography multicast algorithms Computer security Relays Computer networks

来源：评论

学校读者我要写书评

暂无评论

QuoCast: A Resource-Aware Algorithm for Reliable Peer-to-Peer multicast

QuoCast: A Resource-Aware Algorithm for Reliable Peer-to-Pee...

引用

IEEE International Symposium on Network Computing and Applications

作者： Mouna Allani Benoît Garbinato Amirhossein Malekpour Fernando Pedone University of Lausanne Switzerland University of Lugano Switzerland

This paper presents QuoCast, a resource-aware protocol for reliable stream diffusion in unreliable environments, where processes may crash and communication links may lose messages. QuoCast is resource-aware in the sense that it takes into account memory, CPU, and bandwidth constraints. Memory constraints are captured by the limited knowledge each process has of its neighborhood. CPU and bandwidth constraints are captured by a fixed quota on the number of messages that a process can use for streaming. Both incoming and outgoing traffic are accounted for. QuoCast maximizes the probability that each streamed packet reaches all consumers while respecting their incoming and outgoing quotas. The algorithm is based on a tree-construction technique that dynamically distributes the forwarding load among processes and links, based on their reliabilities and on their available quotas. The evaluation results show that the adaptiveness of QuoCast to several contraints provides better reliability when compared to other adaptive approaches.

关键词： multicast algorithms Peer to peer computing Bandwidth Web and internet services Telecommunication network reliability multicast protocols Computer crashes Memory management Streaming media Context-aware services

来源：评论

学校读者我要写书评

暂无评论

Joint optimization of the redundancy of multiple-description coders for multicast

Joint optimization of the redundancy of multiple-description...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ermin Kozica W. Bastiaan Kleijn ACCESS Linnaeus Center Electrical Engineering KTH Royal Institute of Technology Stockholm Sweden

We consider the optimization of multicast over packet-switched communication networks with a non-zero packet-loss probability. For the system setup consisting of a number of multiple-description coders, we jointly optimize these coders. We propose an analytic solution, asymptotically optimal in the number of multiple-description coders. The analytic solution allows for fast system adaptation to changing network conditions. A locally optimal optimization algorithm that is useful when the number of multicast groups is small is derived. Simulations show that the utilization of the analytic solution incurs a low overhead on the performance when compared to the locally optimal solution, even for a small number of multiple-description coders.

关键词： Robustness multicast algorithms Redundancy Forward error correction Communication networks Analytical models Performance analysis Performance loss Jitter Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Guaranteed multicast in Multi-Channel Multi-Interface Wireless Mesh Networks

Bandwidth-Guaranteed Multicast in Multi-Channel Multi-Interf...

引用

IEEE International Conference on Communications (ICC)

作者： H. S. Chiu K. L. Yeung K.-S. Lui Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong PRC

We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other to be active at different time slots. When a (point-to- multipoint) multicast call arrives, the call is accepted if a multicast distribution tree can be established for connecting the source node with all the receiving nodes, and with sufficient bandwidth reserved on each link. Otherwise, the call is rejected. To maximize the call acceptance rate, the multicast tree must be constructed judiciously upon each call arrival. Aiming at minimizing the carried load on the most-heavily loaded channel, and maximizing the residual capacity of the most heavily loaded node, an integer linear program (ILP) is formulated for multicast tree construction. Since solving ILP can be time-consuming, an efficient heuristic algorithm is then proposed. We compare the two tree construction algorithms by simulations. We found that both algorithms give comparable call acceptance rate, but the heuristic algorithm requires much shorter running time.

关键词： Wireless mesh networks multicast algorithms Bandwidth Streaming media Heuristic algorithms Broadcasting multicast protocols Peer to peer computing Spine Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Aware Minimum Power multicast Routing in Wireless Networks

Bandwidth-Aware Minimum Power Multicast Routing in Wireless ...

引用

International Symposium on Parallel Architectures, algorithms and Networks (ISPAN)

作者： Hong-Hsu Yen Steven S. W. Lee Department of Information Management Shih Hsin University Taiwan Department of Communications Engineering National Chung Cheng University Taiwan

Energy efficient multicast routing has been a blooming research field in wireless networks. However, this kind of multicast routing only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks. We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangean relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach outperforms the existing pure power efficient multicast routing approaches under all tested cases, especially in large bandwidth request and fine radius granularity.

关键词： Routing Wireless networks Bandwidth multicast algorithms Broadcasting Transmitters Energy efficiency Lagrangian functions Energy consumption Costs

来源：评论

学校读者我要写书评

暂无评论

Throughput performance of d-tree multicast capable optical cross-connect under synchronous traffic

Throughput performance of d-tree multicast capable optical c...

引用

International Conference on Information, Communications and Signal Processing

作者： Hong Du Changyong Chen Fangfang Yan Weisheng Hu Hao He Weiqiang Sun Yaohui Jin Wei Guo Yi Dong Shilin Xiao State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai Jiaotong University Shanghai China

ISBN: (纸本)9781424446568

This paper investigates the throughput performance of the d-tree multicast capable optical cross-connect (MC-OXC) by using the separated unicast/multicast splitter-and-delivery (SUM-SaD) switches under synchronous traffic. A d-tree property is introduced to constrain the ability that the MC-OXC and SUM-SaD can accommodate the numbers of light trees. We propose the maximal independent set (MIS) model of the conflict graph to establish as most sessions as possible. It needs to find the d-constrained MIS (d-MIS) of multicast conflict graph and the MIS of the remained unicast conflict graph to maximize the throughput under the assumption that the multicast sessions have higher priority than the unicast ones. The MIS problem of the conflict graph is NP-complete, and two heuristic conflict-based algorithms: minimal conflict first (MCF) and first see first service (FSFS) are proposed to find the MIS of the conflict graph. The minimal member first (MMF) and maximal member first (MAMF) algorithms are applied to determine the d-MIS of multicast conflict graph uniquely. Simulation results show that the d-tree MC-OXC at d ¿ 2 achieves favorable throughput performance. When the wavelength resource on each fiber link is scarce, the performances of the four conflict-based MIS algorithms are different and behave in the order of MCF, MMF, FSFS and MAMF from best to worst.

关键词： Throughput Unicast Optical switches multicast algorithms Optical fiber networks Traffic control Heuristic algorithms State feedback Optical packet switching Optical wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

Genuine versus Non-Genuine Atomic multicast Protocols for Wide Area Networks: An Empirical Study

Genuine versus Non-Genuine Atomic Multicast Protocols for Wi...

引用

Reliable Distributed Systems

作者： Nicolas Schiper Pierre Sutra Fernando Pedone University of Lugano Lugano Switzerland Université Paris VI and INRIA Rocquencourt Paris France

We study atomic multicast, a fundamental abstraction for building fault-tolerant systems. We suppose a system composed of data centers, or groups, that host many processes connected through high-end local links; a few groups exist, interconnected through high-latency communication links. A recent paper showed that no multicast protocol can deliver messages addressed to multiple groups in one inter-group delay and be genuine, i.e., to deliver a message m, only the addressees of m are involved in the protocol. We propose a non-genuine multicast protocol that may deliver messages addressed to multiple groups in one inter-group delay. Experimental comparisons against a latency-optimal genuine protocol show that the non-genuine protocol offers better performance in almost all considered scenarios. We also identify a convoy effect in multicast algorithms that may delay the delivery of local messages, i.e., messages addressed to a single group, by as much as the latency of global messages, i.e., messages addressed to multiple groups, and propose techniques to minimize this effect. To complete our study, we evaluate a latency-optimal protocol that tolerates disasters, i.e., group crashes.

关键词： multicast protocols Wide area networks multicast algorithms Broadcasting Fault tolerant systems Delay effects Computer crashes Mobile communication Bandwidth Scalability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：