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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Load balanced multicast with multi-tree groups

Load balanced multicast with multi-tree groups

引用

Asia-Pacific Conference on Communications

作者： M. R. Rahimi Nima Sarsar Faculty of Engineering Software Systems Engineering University of Regina Regina SAS Canada Faculty of Engineering University of Regina Regina SK Canada University of Regina Regina SK CA

Given a fixed network infrastructure, i.e. a set of multicast sources and their corresponding receivers, we investigate the problem of constructing multicast sessions that maximize network utilization for all sources involved, under a fairness constraint. This is done by ensuring that multicast session construction protocols uniformly distribute multicast traffic over all links. In most standard IP multicast protocols (e.g., PIM), a single multicast tree is constructed for each multicast session and all data packets corresponding to a session are multicast on the same tree. A key observation in this paper is that distributing multicast traffic for a session over multiple multicast trees can dramatically increase the load balance and improve network utilization. In fact, our simulations indicate that merely using a few multicast trees per session can improve the common throughput of all sessions by a factor of up to two. We devise a standard compliant, distributed protocol which we call load balanced and cooperative multicast or LBCM to efficiently construct multiple multicast trees for each multicast group. We show how LBCM may be implemented on top of standard multicast protocols to improve network utilization in currently deployed systems.

关键词： multicast protocols Throughput Systems engineering and theory Network coding IP networks Software systems Telecommunication traffic Computer networks multicast algorithms Application software

来源：评论

学校读者我要写书评

暂无评论

Modifying the multicast tree in AMTree protocol using random core selection

Modifying the multicast tree in AMTree protocol using random...

引用

International Conference on Computer and Communication Engineering, ICCCE

作者： Ali M. Al-Sharafi Mohamed Othman Md. Nasir Sulaiman Shamala Subramaniam Faculty of Computer Science and Information Technology University Putra Serdang Malaysia

One of two approaches used to construct the tree in multicast protocols, either shortest path tree approach, or core based tree approach. In AMTree protocol, the shortest path tree approach is used with incorporation of the idea of core from core based tree approach. In this paper we propose a new technique for constructing the multicast tree using pre-selected nodes to act as cores. The idea of the proposed technique is to reduce the optimization time and the number of nodes invoking for optimization. The experiments show that the number of nodes asking for optimization process is minimized and the optimization time is reduced too. Furthermore, tree efficiency for AMTree using the proposed technique is better than that of AMTree without it.

关键词： multicast protocols Switches Computer networks Computer science Information technology Internet Telecommunication traffic multicast algorithms Computer architecture Packet switching

来源：评论

学校读者我要写书评

暂无评论

Reliable WiMAX multicast Applications

Reliable WiMAX Multicast Applications

引用

IEEE International Conference on Computer and Information Technology Workshops, CIT

作者： Jiann-Liang Chen Kung-Cheng Wang Department of Computer Science & Information Engineering National Dong Hwa University Hualien Taiwan

This study proposes a reliable multicast mechanism for WiMAX applications. The proposed mechanism is based on the core-based tree data forwarding architecture and IGMP group management, and can handle the data sending to the receivers successfully with error recovery and fast-handoff. A WiMAX multicast mechanism with mobility applications is also presented. Simulation results indicate that the proposed multicast mechanism can reduce the network load by about 35% and the average delay by about 29%.

关键词： WiMAX multicast protocols Portable media players Internet multicast algorithms Application software Telecommunication traffic Quality of service Base stations Throughput

来源：评论

学校读者我要写书评

暂无评论

Ant Based multicast Routing Algorithm with Multiple Constraints for Mobile Adhoc Networks

Ant Based Multicast Routing Algorithm with Multiple Constrai...

引用

International Conference on Security Technology, SECTECH

作者： A. Sabari K. Duraiswamy KS Rangasamy College of Technology Tichuchengode Tamil Nadu IN Dept of Computer Science and Engineering K.S.Rangasamy College of Technology Tiruchengode India

One particular challenging environment for multicast is a mobile ad-hoc network (MANET). Existing studies show that tree-based and mesh based on-demand protocols are not necessarily the best choice, since associated overhead will be more. Several algorithms based on the ant colony optimization (ACO) approach minimizes the cost of the tree under multiple constraints. These algorithms treat the traffic engineering multicast problem as a single-purpose problem with several constraints. The main disadvantage of this approach is the necessity of a predefined upper bound that can exclude good trees from the final solution. This paper presents a design on ant-colony based multicast routing (AMR) algorithm for MANETs, to solve the traffic Engineering multicast problem that optimizes several objectives simultaneously. The algorithm calculates one more additional constraint in the cost metric, which is the product of average-delay and the maximum depth of the multicast tree and try to minimize this combined cost metric. Simulation results show that the proposed algorithm outperforms all previous algorithms by forming the multicast tree with varying sizes.

关键词： Routing multicast algorithms Ad hoc networks Mobile ad hoc networks Ant colony optimization Cost function Telecommunication traffic Upper bound Algorithm design and analysis Traffic control

来源：评论

学校读者我要写书评

暂无评论

Adaptive multicast Tree Construction for Elastic Data Streams

Adaptive Multicast Tree Construction for Elastic Data Stream...

引用

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

作者： Ying Zhu Ken Q. Pu University of Ontario Institute of Technology (UOIT) Oshawa ONT Canada

In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for multi-session multicasting of elastic content. Our framework allows receivers to request multiple sessions from possibly different servers. Each receiver expresses a quality-of-service requirement using a utility function. We propose an online algorithm which constructs multicast trees to maximize the overall receiver utility functions in an iterative fashion, allowing it to adapt to changes in network topology and cross-traffic.

关键词： Peer to peer computing Streaming media Quality of service Virtual reality Network servers multicast algorithms Iterative algorithms Bandwidth Telephony Network topology

来源：评论

学校读者我要写书评

暂无评论

Dynamic Power and Sub-Carrier Allocation for OFDMA-Based Wireless multicast Systems

Dynamic Power and Sub-Carrier Allocation for OFDMA-Based Wir...

引用

IEEE International Conference on Communications (ICC)

作者： J. Liu W. Chen Z. Cao K. B. Letaief China Hong Kong China

Dynamic resource allocation is a key technique that can significantly improve the performance of next generation wireless systems under guaranteed QoS to users. Most of the current resource allocation algorithms are, however, limited to unicast traffics. In practice, how to efficiently allocate various resources in multicast wireless systems is not known. In this paper, we shall study dynamic resource allocation for OFDMA-based single-cell multicast systems. Specifically, we shall formulate an optimization problem to maximize the system throughput given a set of available resources (power and sub-carriers). The optimal resource allocation solution is proposed along with a low- complexity algorithm. In two extreme cases, namely, low and high SNR regimes, the low-complexity allocation algorithm is further simplified. Numerical results will show that the system throughput is significantly improved by using our proposed algorithms.

关键词： Resource management OFDM multicast algorithms Unicast Wireless networks Quality of service Telecommunication traffic Throughput Videoconference Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

multicast Multiuser ARQ

Multicast Multiuser ARQ

引用

IEEE Conference on Wireless Communications and Networking

作者： Peter Larsson Ericsson Research Ericsson AB Stockholm Sweden

In this paper, multiuser ARQ is extended to multicasting. The core idea is that the sender, based on feedback from users regarding successfully received transmissions, adapts code weights for data packet linear combinations that are then sent. Each user exploits its previously received information in decoding the linearly combined packets. Specifically, a throughput optimal, low en-/decoding complexity enabling, low overhead and on-line multicast coding and scheduling algorithm is devised based on a per user rank increase criterion. For throughput optimality, a minimum field size criterion is derived. Relative previous work, which adaptively identifies sets of users suited to receive linearly combined packets and uses GF(2) and XOR coding, the proposed method adaptively select weights from a sufficient large finite field for optimality instead. Throughput is analyzed and simulated, and en-/decoding complexity, signaling overhead, and latency etc. are studied through realistic simulations. Overall, it is found that the throughput is significantly higher than multicast selective repeat ARQ, and that the optimal throughput for an erasure channel is attained.

关键词： Automatic repeat request Throughput Decoding Feedback Unicast Telecommunication network reliability Analytical models Network coding Forward error correction multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Layered multicast with Network Coding: Mathematical Model and Empirical Studies

Optimal Layered Multicast with Network Coding: Mathematical ...

引用

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

作者： Ajay Gopinathan Zongpeng Li University of Calgary Canada

Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them efficiently computable. While most such algorithm design assume a single file/layer being multicast, layered coding introduces new challenges into the paradigm due to its cumulative decoding nature. Layered coding is designed to handle heterogeneity in receiver capacities, and a node may decode layer k only if it successfully receives all layers in 1..k. We show that recently proposed optimization models for layered multicast do not correctly address this challenge. We argue that in order to achieve the absolute maximum throughput (or minimum cost), it is necessary to decouple application layer throughput from network layer throughput. In particular, a node should be able to receive a non-consecutive layer or a partial layer even if it cannot decode and utilize it (e.g., for playback in media streaming applications). The rationale is that nodes at critical network locations need to receive data just for helping other peers. We present a mathematical programming model that addresses the above challenges and achieves the absolute optimal performance. Simulation results show considerable throughput gain (cost reduction) compared with previous models, in a broad range of network scenarios. We further generalize our model for studying the optimal progression of layer sizes. We show that such optimization is non-convex, and apply a Simulated Annealing algorithm to solve it, with flexible trade-off between solution quality and running time.

关键词： Network coding Mathematical model Peer to peer computing Throughput Decoding multicast algorithms Costs Streaming media Routing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Optimized multicast Routing for Improved Survivability of Mobile Ad Hoc Networks

Optimized Multicast Routing for Improved Survivability of Mo...

引用

International Conference on Computer and Electrical Engineering, ICCEE

作者： J. Thriveni K. R. Vishwanath V. Jayashree S. Neelima B. M. Parinitha K. Sneha K. Shaila K. R. Venugopal L. M. Patnaik Dept.of CSE Dr. M.G.R. University Chennai Department of CSE University of Visvesvaraya College of Engineering Bangalore University India Vice Chancellor Defence Institute of Advanced Technology Pune India

A Wireless Ad hoc Network consists of mobile nodes with energy constrained batteries. In this paper, we have proposed an Optimized Lifetime multicast Tree (OLMT) algorithm that constructs a minimum energy multicast tree resulting in minimum total transmission power consumption,thereby increasing the lifetime of the network. We observe that, simulations carried on NS2 provides significant improvement in the number of multicast requests realised when compared with earlier works.

关键词： Mobile ad hoc networks multicast algorithms multicast protocols Energy consumption Ad hoc networks Routing protocols Mobile communication Bandwidth Energy efficiency Computer networks

来源：评论

学校读者我要写书评

暂无评论

Delay bound multicast routing algorithm using evolutionary programming

Delay bound multicast routing algorithm using evolutionary p...

引用

IEEE International Conference on Networks

作者： Sushma Jain Jaydev Sharma Computer Science & Engineering Department Thapar University Patiala Patiala India Electrical Engineering Department Indian Institute of Technology Roorkee India

The real time communication networks are designed to support multimedia applications requiring quality of services (QoS). The multicasting is needed when number of users want to communicate simultaneously. This paper present an approach based on evolutionary programming to solve the QoS constrained multicast routing problem, which is a NP complete problem. The multicast tree is obtained corresponding to optimum (minimum) routing cost subjected to end-to-end delay constraints. The algorithm is tested to obtain optimum multicast trees for different sets of source and destinations on 8-node undirected and 10-node directed networks. The convergence of the proposed algorithm is fast because it relies on mutation and selection and the optimum solution is obtained for both undirected and directed graphs.

关键词： Delay Routing multicast algorithms Genetic programming Communication networks Quality of service Cost function Testing Tree graphs Genetic mutations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 60 61 62 63 64 65 66 67 68 69 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：