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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Real-Time Video multicast in WiMAX Networks

Real-Time Video Multicast in WiMAX Networks

引用

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

作者： S. Deb S. Jaiswal K. Nagaraj Bell Laboratories India

IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such as IPTV, broadcast of live events etc.). These applications are bandwidth hungry and have stringent delay constraints. Thus, scalable support for such applications is a challenging problem. To address this challenge, we consider a combination of approaches using multicast, layer encoded video and adaptive modulation of transmissions. Using these, we develop algorithms to ensure efficient, fair and timely delivery of video in WiMAX networks. The corresponding resource allocation problem is challenging because scheduling decisions (within a WiMAX base station) are performed in real-time across two dimensions, time and frequency. Moreover, combining layered video with appropriate modulation calls for novel MAC algorithms. We model the multicast resource allocation problem in WiMAX and demonstrate this problem to be NP-hard. We present a fast greedy algorithm that is (i) provably within a constant approximation of the optimal solution (based on a metric that reflects video quality as perceived by the user), and (ii) performs within 87-95% of the optimal as demonstrated by realistic simulations. We also demonstrate that our algorithm offers a 25% improvement over a naive algorithm. Moreover, in terms of the average rate received by each user, our algorithm out-performs the naive algorithm by more than 50%.

关键词： WiMAX multicast algorithms Resource management IPTV Multimedia communication Broadcasting Bandwidth Delay Base stations Radio spectrum management

来源：评论

学校读者我要写书评

暂无评论

An MAODV-Based Energy Saving multicast Routing Algorithm

An MAODV-Based Energy Saving Multicast Routing Algorithm

引用

IFIP International Conference on Network and Parallel Computing (NPC)

作者： Guo-feng Zhao Wei Yang Hong Tang Yan-bing Liu Key Lab. on Comput. Technol. & Commun. Networks Chongqing Univ. of Posts & Telecommun. Chongqing

The wireless ad hoc networks (WANET) is an open system that is constituted by fix or mobile nodes. In WANET, each node can be a router or a host. Considering that most nodes may use battery as its energy, it is necessary to improve on energy-saving method. Based on the MAODV protocol, we bring forward a new method called PPEF that uses both hops and energy consumption level of each node together for multicast routing. The simulation results show that our approach is effective.

关键词： multicast algorithms multicast protocols Energy consumption Mobile ad hoc networks Routing protocols Ad hoc networks Broadcasting Load forecasting Computer science education Parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Layered multicast Tree for Reliable Real-Time Video Transmission of OMN

A Layered Multicast Tree for Reliable Real-Time Video Transm...

引用

International Conference on Intelligent Computation Technology and Automation, ICICTA

作者： Deqiang Cheng Yu Jin Jiansheng Qian School of Information and Electronic Engineering China University of Mining and Technology Xuzhou China Xuhai College China University of Mining and Technology Xuzhou China

In order to guarantee the reliable real-time video transmission of overlay multicast network (OMN), a layered multicast tree with three-level is proposed based on NICE protocol to manage multicast service nodes. This solution can improve the data-transmitting efficiency, and minimize the redundant packets in OMN. Also, for the reliable video transmission in bandwidth-limited links of OMN, a QoS algorithm is analyzed by discarding the redundant frames of the video sequences according to the detected network condition. Finally, the performance test verifies the validity of proposed layered multicast tree for reliable video transmission.

关键词： multicast protocols Streaming media Network topology multicast algorithms Video sequences Delay Communication system control Videoconference Reliability engineering Testing

来源：评论

学校读者我要写书评

暂无评论

Proactive Rearrangement in Delay Constrained multicast with Dynamic Membership Support

Proactive Rearrangement in Delay Constrained Multicast with ...

引用

International Conference on Computer Communications and Networks (ICCCN)

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

We propose an efficient heuristic algorithm to rearrange multicast trees proactively in delay constrained dynamic membership multicast networks. The objective is to construct low cost multicast tree with controlled number of disrupted members within a very short rearrangement time when a member joins and leaves the tree. In addition, a heuristic algorithm to obtain near-optimal solution to the problem is introduced as the benchmark. A new performance index to gauge the efficiency of the proposed heuristics more accurately is also introduced. Better performance is obtained when compared with existing methods using simulations.

关键词： multicast algorithms Cost function Heuristic algorithms Disruption tolerant networking Delay effects Performance analysis Optimal control Tree data structures

来源：评论

学校读者我要写书评

暂无评论

An ant colony algorithm based on orientation factor for QoS multicast routing in ad hoc networks

An ant colony algorithm based on orientation factor for QoS ...

引用

International Conference on Communications and Networking in China (CHINACOM)

作者： Hua Wang Zhao Shi School of Computer Science and Technology Shandong University Jinan Shandong China

The ad hoc network has been attracting more and more attention for its special attributes and applications. This paper proposes an ant colony algorithm with orientation factor and applies it to multicast routing problem with multi-constraints QoS in the ad hoc network. The orientation factor is a heuristic element based on GPS, which enables the ant to get rid of the initial blindness when searching paths, and overcome the drawbacks of slow convergence existing in the basic ant colony algorithm, increasing the speed of convergence and speeding up the finding of feasible solution to the multi-constraint problem. Simulation results show that the modified algorithm makes it possible to find feasible solution to the multicast routing problem with delay and delay variation-bounded. And compared with the conventional ant colony algorithm, the convergence speed of the modified algorithm is improved and the number of packets used for computing routing decreases obviously.

关键词： multicast algorithms Ad hoc networks Global Positioning System Bandwidth Multimedia communication Delay Ant colony optimization Jitter Routing protocols Computer science

来源：评论

学校读者我要写书评

暂无评论

A QoS-aware multicast overlay spanning tree protocol for multimedia applications in MANETs

A QoS-aware multicast overlay spanning tree protocol for mul...

引用

International Telecommunication Networking Workshop on QoS in Multiservice IP Networks, IT-NEWS

作者： Hakim Badis LABINFO-IGM UMR CNRS 8049 Université Paris-Est France

Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). Traditional multicast routing algorithms used for solving the Sterner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. Moreover, with QoS metrics consideration, the problem of computing optimal constrained multicast tree is known as NP-complete. In this paper, we propose a new QoS-aware multicast Overlay Spanning Tree (QMOST) protocol to support multiple-metric routing criteria in mobile ad hoc networks. It computes low cost trees with multiple-metric bounded paths in polynomial time using an efficient source- based optimization heuristic. Unlike common multicast protocols where data packets are transmitted in a broadcast mode, in QMOST data packets are encapsulated in unicast packets before being forwarded to the overlay tunnels. multicasting is achieved when each node forwards multicast packets to its successors in the overlay tree. QMOST must be used in conjunction with a unicast QoS link state protocol (QOLSR) and can be integrated in a QoS model. This later offers the needed service guarantee using distributed admission control to check if the multicast QoS flows are admissible, resource reservation mechanism and congestion control. Simulation results show that our QMOST protocol achieves better performance than the QOLSR protocol.

关键词： multicast protocols Quality of service Unicast Videoconference Delay multicast algorithms Routing protocols Mobile ad hoc networks Cost function Polynomials

来源：评论

学校读者我要写书评

暂无评论

RelayCast: Scalable multicast routing in Delay Tolerant Networks

RelayCast: Scalable multicast routing in Delay Tolerant Netw...

引用

International Conference on Network Protocols

作者： Uichin Lee Soon Young Oh Kang-Won Lee Mario Gerla UCLA USA IBM Research USA

ISBN: (纸本)9781424425068

Mobile wireless networks with intermittent connectivity, often called delay/disruption tolerant networks (DTNs), have recently received a lot of attention because of their applicability in various applications, including multicasting. To overcome intermittent connectivity, DTN routing protocols utilize mobility-assist routing by letting the nodes carry and forward the data. In this paper, we study the scalability of DTN multicast routing. As Gupta and Kumar showed that unicast routing is not scalable, recent reports on multicast routing also showed that the use of a multicast tree results in a poor scaling behavior. However, Grossglauser and Tse showed that in delay tolerant applications, the unicast routing overhead can be relaxed using the two-hop relay routing where a source forwards packets to relay nodes and the relay nodes in turn deliver packets to the destination via ldquomobility,rdquo thus achieving a perfect scaling behavior of Theta(1). Inspired by this result, we seek to improve the throughput bound of wireless multicast in a delay tolerant setting using mobility-assist routing. To this end, we propose RelayCast, a routing scheme that extends the two-hop relay algorithm in the multicast scenario. Given that there are n s sources each of which is associated with n d random destinations, our results show that RelayCast can achieve the throughput upper bound of Theta(min(1, n/n s n d )). We also analyze the impact of various network parameters and routing strategies (such as buffer size, multi-user diversity among multicast receivers, and delay constraints) on the throughput and delay scaling properties of RelayCast. Finally, we validate our analytical results with a simulation study.

关键词： Relays Disruption tolerant networking Throughput Unicast Delay Wireless networks Routing protocols Scalability multicast algorithms Upper bound

来源：评论

学校读者我要写书评

暂无评论

Maximum reliability k-hop multicast strategy in tree networks

Maximum reliability k-hop multicast strategy in tree network...

引用

IEEE International Symposium on Consumer Electronics (ISCE)

作者： Mugurel Ionut Andreica Nicolae Tapus Computer Science Department Polytechnic University of Bucharest Bucharest Romania

ISBN: (纸本)9781424424221

In this paper we consider directed tree networks, for which the reliability of each edge (a real number between 0 and 1) is known. For these networks, we investigate the problem of finding a k-hop multicast strategy of maximum reliability. This problem is equivalent to the k-station placement problem, which was previously solved in polynomial time for trees. We present here O(kldrn 2 ) and O(kldrn 3 ) dynamic programming algorithms for the problem, which improve upon the previous best known solution, which is O(kldrn 2 ldrlog(n)) and rather complicated to implement. We then extend the algorithms to general directed graphs and also present some new algorithms for this case.

关键词： Tree graphs multicast algorithms Computer network reliability Distribution strategy Computer science Polynomials Dynamic programming Heuristic algorithms Distributed algorithms Probability

来源：评论

学校读者我要写书评

暂无评论

An efficient buffered crossbar switching architecture with multiple multicast virtual output queues for mixed uni- and multicast traffic

An efficient buffered crossbar switching architecture with m...

引用

Asia-Pacific Conference on Communications

作者： Fong-Cheng Lee Wen-Fong Wang Ming-Da Liu National Yunlin University of Science and Technology Taiwan

ISBN: (纸本)9784885522321

In this study, we purpose an efficient buffered crossbar switching architecture with multiple multicast virtual output queues called kMVOQ-CPX switch. The kMVOQ-CPX switch consists of N virtual output queues (VOQs), k multicast VOQs , an (N+ k ) x N buffered crossbar fabric, N+ k Input scheduler and N output scheduler. It has the features of simple architecture and great capability to support multicast services. For achieving service quality of multicast applications, we also propose two practical scheduling scheme- MF and MFRR for output schedulers. To evaluate the performance of k MVOQ-CPX switch, we assume the k equals to one. We have done simulations under different proportions of unicast to multicast traffic. The simulation results show that the 1MVOQ-CPX switch can achieve dramatic service quality of multicast applications and has great capability to supports both unicast and multicast services.

关键词： Traffic control Switches Unicast Packet switching multicast algorithms Scheduling Fabrics Throughput Explosives Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Predictive Energy-Efficient multicast for Large-Scale Mobile Ad Hoc Networks

Predictive Energy-Efficient Multicast for Large-Scale Mobile...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Jung-Chun Kao Radu Marculescu Carnegie Mellon University Pittsburgh PA USA

Energy-efficient multicast routing is of primary concern for mobile ad hoc networks (MANET). However, none of existing energy-efficient multicast algorithms is applicable to large-scale MANETs, either due to their complexity (which is either NP-hard or polynomial with respect to the network size), or due to the huge overhead caused by frequent exchanges of location information. To solve the scalability and overhead issues, we propose the Predictive .Energy-efficient multicast Algorithm (PEMA) which exploits statistical properties of the network, as opposed to relying on route details or network topology. The running time of PEMA depends on the multicast group size, not network size; this makes PEMA fast enough even for MANETs consisting of 1000 or more nodes. Simulation results show that PEMA not only results in significant energy savings compared to other existing algorithms, but also attains good packet delivery ratio in mobile environments.

关键词： Energy efficiency Large-scale systems Mobile ad hoc networks multicast algorithms Routing Approximation algorithms Network topology Energy consumption Mixed integer linear programming Unicast

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：