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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Selfishness-Aware Data-Driven Overlay Network

Selfishness-Aware Data-Driven Overlay Network

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Miao Wang Yujun Zhang Guojie Li Chinese Academy and Sciences Beijing China Graduate School of Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China

Data-driven overlay network (DONet) especially works well with live-event streaming because data can be propagated in a relatively continuous way even with node dynamics. However, optimal streaming demands the cooperation of individual nodes. In the real world, some selfish participants which might delay forwarding or stop forwarding data can affect the overall streaming quality. To address the selfishness issue, we propose a selfishness-aware DONet (SA-DONet) in this paper. SA-DONet allows each node associative with an altruism value for its contributions to peers. Based on the altruism value, segment requesting and sending algorithms are designed to ensure the more altruistic nodes will have more chances to be served. The primary characteristic of our mechanism lies in three aspects. Firstly, SA-DONet can discover the selfish nodes in a decentralized manner and adjust the segment sending and requesting strategy dynamically. Secondly, selfish assessment (altruism value) comes from the node's history and doesn't require any extra probe and measuring packets. Lastly, our algorithms remain comparable computing complexity to DONet. Simulation results show that compared with DONet, even with a significant portion of nodes being selfish, SA-DONet can improve the streaming quality of global multicast session with low control overhead.

关键词： Peer to peer computing multicast algorithms Delay multicast protocols Bandwidth Computers Algorithm design and analysis History Probes Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained Broadcasting and multicasting in wireless ad hoc networks with directional antennas

Interference and power constrained Broadcasting and Multicas...

引用

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

作者： Zheng Li Deying Li Ming Liu Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China China School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781424451142

Broadcasting/multicasting problems have been well studied in wireless ad hoc networks. However, only a few approaches take into account the low interference and energy efficiency as the optimization objective simultaneously. In this paper, we study the interference and power constrained broadcast/multicast and the delay-bounded interference and power constrained broadcast/multicast routing problems in wireless ad hoc networks using directional antennas. We propose an approximation and a heuristic algorithm for the two problems, respectively. Importantly, motivated by the study of above optimization problems, we propose approximation schemes for two multi-constrained directed Steiner tree problems, respectively. Broadcast/multicast message by using the trees found by our algorithms tend to have less channel collisions and higher network throughput. The theoretical results are corroborated by simulation studies.

关键词： Interference constraints Broadcasting Mobile ad hoc networks Directional antennas multicast algorithms Energy efficiency Routing Approximation algorithms Heuristic algorithms Throughput

来源：评论

学校读者我要写书评

暂无评论

Multi-Team Data Flow Optimization in Wireless Multi-Rate Multi-Hop Networks

Multi-Team Data Flow Optimization in Wireless Multi-Rate Mul...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Jiayi Chen Qian Zhang Hong Kong University of Science and Technology Hong Kong China

In this article, we study the problem of join routing and scheduling of multi-team data flows multicasting in wireless multi-rate multi-hop networks with the objective of minimizing the time required to complete the transmission transactions. We prove in this paper that the optimal join routing and scheduling problem is NP-hard. Instead of trying to solve the optimization problem, we reformulate the problem into an intuitive form which provides intuitions to achieve optimal solution. Base on these observations, we propose a heuristic algorithm that locally optimally chooses multicast relays and multicast rates. The aim is to locally minimize the schedule time length within two-hop range so that the total transmission time approaches optimal. This algorithm explores multi-team multicast advantages as well as the multi-rate range tradeoffs. Simulations based on practical ISM band channel model and current IEEE802.11 standards' parameters show superior of our proposed algorithm in approaching optimal solution.

关键词： Spread spectrum communication Routing multicast algorithms Scheduling Relays Heuristic algorithms Wireless networks Broadcasting Interference Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Improving QoS in multicasting Through Adaptive Redundancy

Improving QoS in Multicasting Through Adaptive Redundancy

引用

IEEE Conference on Wireless Communications and Networking

作者： Tolga Numanoglu Wendi Heinzelman Department of Electrical and Computer Engineering University of Rochester Rochester NY USA

In mobile ad hoc networks (MANETs), Quality of Service (QoS) of a multicast protocol is one of the most important performance metrics. Channel conditions and network topology frequently change, and in order to achieve a certain QoS, complex algorithms and protocols are needed. Often channel conditions are neglected during the design of a multicast protocol. However, vulnerability against channel errors can severely cripple the performance of a multicast protocol. Mesh networking inspired multicasting approaches introduce increased redundancy in the routing process to overcome the performance loss due to channel errors. Although utilizing multiple paths from senders to receivers results in higher reliability, under better channel conditions the additional redundancy may not be needed in terms of reliability, and increased redundancy causes increased overhead. Therefore, we propose a mesh networking inspired approach that adapts the amount of redundancy according to the current link conditions. We show that this approach can achieve good QoS levels for real-time traffic scenarios while simultaneously reducing unnecessary energy dissipation.

关键词： Quality of service Redundancy multicast protocols Mobile ad hoc networks Measurement Network topology multicast algorithms Routing Performance loss Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

A PSO Algorithm Based on Orthogonal Test Design

A PSO Algorithm Based on Orthogonal Test Design

引用

International Conference on Natural Computation (ICNC)

作者： Shu Wang Ling Chen Department of Computer Science Yangzhou University Yangzhou China State Key Laboratory of Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9781424445424

We present a particle swarm optimization algorithm OT-PSO using orthogonal test technique. Based on the classical PSO, OT-PSO searches for local optimum in the neighbor area of the global best solution by using the method of orthogonal test design. OT-PSO can probe the solutions uniformly distributed in the search space and select the better ones. Using those better solutions OT-PSO can guide the particles searching towards the correct direction in the latter iterations so as to speed up the convergence, get more precise solutions and avoid local optimum. Our experimental results show that OT-PSO algorithm not only has faster convergence speed, but also can improve the accuracy of solutions effectively and enhance the robustness of the algorithm.

关键词： Testing Algorithm design and analysis Particle swarm optimization Genetic algorithms Robustness Software algorithms Design optimization multicast algorithms Streaming media Routing

来源：评论

学校读者我要写书评

暂无评论

Shadow Prices vs. Vickrey Prices in Multipath Routing

Shadow Prices vs. Vickrey Prices in Multipath Routing

引用

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

作者： P. Ramanujam Z. Li L. Higham Department of Computer Science University of Calgary Canada

ISBN: (纸本)9781424435128

Shadow price and Vickrey price are two classic metrics that can be applied to measure the relative importance of links in a communication network. Each metric has been extensively investigated and enjoys important applications. We study the underlying connections between these two metrics with seemingly different definitions, under a general mathematical model of multipath multi-session multicast routing. We show that Vickrey prices provide upper-bounds for shadow prices in general, and the fine granularity version of Vickrey price, unit Vickrey price, equals exactly the maximum shadow price. We further design an efficient algorithm that computes all-link max/min shadow prices and unit Vickrey prices simultaneously, for unicast routing, reducing the complexity of a straightforward algorithm by an order of O(|E|).

关键词： Routing multicast algorithms Game theory Cost function Communication networks Unicast Telecommunication traffic Communications Society Computer science Application software

来源：评论

学校读者我要写书评

暂无评论

Simple media-aware packet discard algorithms

Simple media-aware packet discard algorithms

引用

International Conference on Information Networking

作者： Bruno Guedes Ricardo Lopes Pereira Antonio Varela Teresa Vazao Department of Computer Science and Engineering Instituto Superior Técnico INESC-ID Porto Salvo Portugal

ISBN: (纸本)9781424445264

IPTV solutions are emerging in the market today, both competing with traditional distribution mediums, such as cable TV, and creating new markets, such as mobile TV viewing using cellular networks. The distribution of IPTV is usually performed using a single stream, resorting multicast. This is not compatible with the growing number of devices which may be used to watch TV, from PDAs to laptops, desktops and high definition TVs, each with different processing and networking capacities. This has prompted research into scalable video coding and adaptation techniques, where a single video stream may be used for a large number of differentiated clients. In this paper we propose and evaluate two different metrics for IP packet discard by a media-aware network element, allowing it to reduce the bandwidth of an original video stream in case of congestion on a downstream link. The first metric consists in discarding the last IP packet of P frames. The second consists in discarding entire P frames. Through experimental evaluation, using subjective viewing scores, we conclude that both of our proposals allow for a much better viewing experience than random packet dropping, although quality still deteriorates rapidly as the drop rate increases.

关键词： Streaming media IPTV multicast algorithms Cable TV Mobile TV Land mobile radio cellular systems Watches Personal digital assistants Portable computers HDTV

来源：评论

学校读者我要写书评

暂无评论

Some results on communicating the sum of sources over a network

Some results on communicating the sum of sources over a netw...

引用

Workshop on Network Coding, Theory and Applications (NetCod)

作者： Brijesh Kumar Rai Bikash Kumar Dey Abhay Karandikar Department of Electrical Engineering Indian Institute of Technology Bombay Mumbai India

We consider the problem of communicating the sum of m sources to n terminals in a directed acyclic network. Recently, it was shown that for a network of unit capacity links with either m = 2 or n = 2, the sum of the sources can be communicated to the terminals using scalar/vector linear network coding if and only if every source-terminal pair is connected in the network. We show in this paper that for any finite set of primes, there exists a network where the sum of the sources can be communicated to the terminals only over finite fields of characteristic belonging to that set. As a corollary, this gives networks where the sum can not be communicated over any finite field using vector linear network coding even though every source is connected to every terminal.

关键词： Network coding Vectors Computer networks Galois fields Distributed computing Routing Robustness multicast algorithms Algorithm design and analysis Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

Incremental channelization

Incremental channelization

引用

MILCOM, Military Communications Conference

作者： Fei Che Errol L. Lloyd University of Delaware Newark DE USA

ISBN: (纸本)9781424452385

Channelization is the problem of forming multicast groups from inputs of a set of flows, a set of users and a set of user preferences, along with an upper bound on the number of groups. Channelization aims to construct groups such that the network cost is substantially smaller than using a single multicast group which delivers all flows to all users. In this paper we introduce an incremental version of channelization wherein the input may change over time. When such a change occurs, one approach is to totally recompute the channelization solution. In contrast, in the incremental approach taken here, the solution for the original channelization instance is updated to become a solution for the modified channelization instance. The goal is to produce a solution of high quality in substantially less time than it would take to do a full recomputation. In this context we study incremental channelization problems corresponding to adding a flow and adding a user. For these two problems we provide complexity results and incremental algorithms. Specifically we show: 1) that natural incremental approaches are NP-hard; 2) that approximating the optimal solution within a log factor is unlikely; and 3) give a greedy algorithm with a performance within a log factor of the optimal (in light of our result 2, this is the best possible approximation result). In addition to the theoretical results, a case study is given for the problem of adding a flow, providing simulation results comparing the effectiveness of the solutions produced by our incremental algorithms with solutions from algorithms doing full recomputation.

关键词： Costs multicast algorithms Collaboration Government Topology Upper bound Greedy algorithms Context modeling

来源：评论

学校读者我要写书评

暂无评论

Research on Application of Network Coding in Hybrid Mesh ALM Model

Research on Application of Network Coding in Hybrid Mesh ALM...

引用

International Conference on Multimedia Information Networking and Security (MINES)

作者： Lian He Chanle Wu Jun Yue Shi Cheng Gang Ye Computer School Wuhan University of China Wuhan China National Engineering Research Center for Multimedia Soft The State Key Laboratory of Software Engineering Wuhan University of China Wuhan China

In the study of ALM, how to improve the performance of multicast system is a hotspot. Theoretical study shows that network coding can improve the performance of network multicast. In this paper, in accordance with the actual structure and features of HM-ALM, a cluster-oriented, and hybrid mesh ALM model, we select the deterministic linear coding strategy, and design the appropriate coding algorithm. The experimental results show that, using network coding in ALM system with hybrid mesh model can reduce transmission delay and enhance the system robustness with a certain amount of link redundancy.

关键词： Network coding Robustness Encoding Vectors Application software Computer networks Throughput Algorithm design and analysis Clustering algorithms multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 51 52 53 54 55 56 57 58 59 60 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：