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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

QoS network coding

QoS network coding

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Amir Hesam Salavati Babak Hossein Khalaj Pedro M. Crespo Mohammad Reza Aref Information Systems and Security Lab (ISSL) Sharif University of Technology Iran Department of Electrical Engineering Sharif University of Technology Iran CEIT and Tecnun (University of Navarra) Spain

ISBN: (纸本)9781424420681

In this paper, we present a decentralized algorithm that computes minimum cost QoS flow subgraphs in network coded multicast networks. These subgraphs are minimum cost solutions that also satisfy user-specified QoS constraints, specifically handling elastic rate and delay demands. Although earlier network coding algorithms in this area have only demonstrated QoS improvements, the proposed QoS network coding is clearly different in the sense that it guarantees that given QoS constraints are met over the network.

关键词： Network coding Quality of service multicast algorithms Routing Costs Electronic mail Delay Information theory Information systems Information security

来源：评论

学校读者我要写书评

暂无评论

The Inference of Link Loss Rates with Internal Monitors

The Inference of Link Loss Rates with Internal Monitors

引用

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

作者： Haibo Su Wentao Chen Shijun Lin Depeng Jin Lieguang Zeng State Key Laboratory on Microwave and Digital Communications Tsinghua National Laboratory for Information Science and Technology Department of Electronic Engineering Tsinghua University Beijing China

Network tomography has been widely used recently as an method to infer the network internal link-level characteristics by end-to-end measurement. In this paper, we consider the problem of estimating link loss rates using network tomography. The existing methods make the inference based on the whole tree of network, which is very complex for large scale network. To overcome this limitation, we propose a low complexity inference approach named LCIA. In the LCIA, we deploy monitors at internal nodes to reduce the complexity of inferring the link loss rates. It mainly consists of two steps. The first step is to deploy monitors at specific internal nodes to divide the original tree into several sub-trees with minimum depth. The second step is to infer the link loss rates of sub-trees by a new estimator which is an explicit function of loss measurements. The LCIA has the following features. First, it greatly reduces the inference complexity as the inference on the sub-trees is much simpler. Second, it improves the accuracy of the estimated results since the variance of loss estimator on sub-trees with lower depth is smaller than that on the original tree. The analytical and simulation results demonstrate that the LCIA outperforms the existing methods both on computation complexity and inference accuracy.

关键词： Maximum likelihood estimation Laboratories Loss measurement Network topology Computed tomography Unicast multicast algorithms Inference algorithms Microwave theory and techniques Digital communication

来源：评论

学校读者我要写书评

暂无评论

Robust Network Coding Using Diversity through Backup Flows

Robust Network Coding Using Diversity through Backup Flows

引用

Workshop on Network Coding, Theory and Applications (NetCod)

作者： Hossein Bahramgiri Farshad Lahouti School of ECE College of Engineering Wireless Multimedia Communications Laboratory University of Tehran Iran

We introduce algorithms to design robust network codes in the presence of link failures for multicast in a directed acyclic network. Robustness is achieved through diversity provided by the network links and flows, while the maximum multicast rate due to max-flow min-cut bound is maintained. The proposed scheme is a receiver-based robust network coding, which exploits the diversity due to the possible gap of the specific receivers min-cut with respect to the network multicast capacity. An improved version of this scheme guarantees multicast capacity for a certain level of failures. In a multicast session, failure of a flow may not necessarily reduce the capacity of the network as other useful branches within the network could still facilitate back up routes (flows) from the source to the sinks. We introduce a scheme to employ backup flows in addition to the main flows to multicast data at maximum rate h , when possible. In a limiting case, the scheme guarantees the rate h , for all link failure patterns, which do not decrease the maximum rate below h . Here, the number of link failures may in general exceed the refined singleton bound.

关键词： Robustness Network coding Channel coding multicast algorithms Algorithm design and analysis Network topology Error correction codes Wireless communication Multimedia communication Laboratories

来源：评论

学校读者我要写书评

暂无评论

A quasipolynomial-time and deterministic source-based heuristic for multicasting multimedia information

A quasipolynomial-time and deterministic source-based heuris...

引用

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

作者： Hakim Badis Université Paris-Est LABINFO-IGM UMR CNRS 8049 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). This paper addresses the problem of effective multicast tree construction for interactive audiovisual communication. QoS metrics (bandwidth, delay, etc.) on links of some networks are not symmetric as in wireless ad hoc networks. So, the network is modelled as a directed graph. We associate an arc cost, an arc bandwidth, an arc delay, etc., with each arc in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so the QoS metrics on the path from source to each destination are bounded. Since the problem of computing the optimal constrained multicast tree is NP-complete, we present a quasipolynomial-time and deterministic approximation algorithm. Experimental results through simulations show that the performance of the heuristic is near optimal.

关键词： Quality of service Tree graphs Bandwidth Costs Videoconference Delay Mobile ad hoc networks Approximation algorithms multicast algorithms Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks

Topology-Transparent Distributed Scheduling in Multi-Hop Wir...

引用

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

作者： Qiong Sun Victor O. K. Li Ka-Cheong Leung Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong China

Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple- access (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. Our proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, we maximize the minimum expected throughput, and we consider multicasting and broadcasting. The simulation result shows that the performance of our algorithm is better than the conventional TDMA and other existing algorithms in most cases.

关键词： Spread spectrum communication Wireless networks Time division multiple access multicast algorithms Scheduling algorithm Throughput Algorithm design and analysis Network topology Broadcasting Analytical models

来源：评论

学校读者我要写书评

暂无评论

Multi-bit revocable network coding scheme for butterfly-like network

Multi-bit revocable network coding scheme for butterfly-like...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Hidenori Kuwakado Masakatu Mori Department of Electrical and Electronic Engineering Kobe University Kobe Japan Kobe Daigaku Kobe Hyogo JP

ISBN: (纸本)9781424420681

This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.

关键词： Network coding Robustness Electronic mail Information theory Encoding Throughput Channel capacity multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Is rate adaptation beneficial for inter-session network coding?

Is rate adaptation beneficial for inter-session network codi...

引用

MILCOM, Military Communications Conference

作者： Yuchul Kim Gustavo de Veciana Wireless Networking and Communications Group Department of Electrical and Computer Engineering University of Texas Austin USA

This paper considers the interplay between rate adaptation and inter-session network coding gains in wireless ad hoc or mesh networks. Inter-session network coding opportunities at relay nodes depend on packets being overheard by surrounding nodes - the more packets nodes overhear, the more opportunities relays have to combine packets, resulting in a potential increase in network throughput. Thus, by adapting its transmission rate, a node can increase the range over which its packets are overheard, enabling additional opportunities for coding and increased overall throughput. This paper considers inter-session coding, restricted to a single relay (bottleneck) node, or star topology. Even for such simple topologies the optimal joint rate adaptation and network coding policy is known to be NP-hard, so we consider an optimal pairwise coding policy which can be formulated as a linear programming and provide a simple heuristic for rate adaptation for network *** evaluate the averaged throughput in two different scenarios, in which relays have different access opportunities, giving some intuition on the impact of rate adaption in lightly and heavily loaded systems. The gains of joint rate adaptation and network coding are marginal when relay has higher access opportunity than other nodes, or when MAC operates ideally. The gain ranges from 9%to 19% compared to a network without network coding and is around 4% over a network using regular network ***, when the relay has equal access opportunity as other source nodes, which is more typical of todays MAC protocols under heavy loads, the gain ranges from 40% to 62% as compared to standard relaying case and is up to around 20% as compared to a network with regular pairwise network coding. And we further increase this gain from 40% to 120% by replacing pairwise coding with sub-optimal general network coding scheme.

关键词： Network coding Relays Throughput Network topology Wireless networks Polynomials multicast algorithms Wireless communication Computer networks Mesh networks

来源：评论

学校读者我要写书评

暂无评论

A Message Complexity Oriented Design of Distributed Algorithm for Long-Lived multicasting in Wireless Sensor Networks

A Message Complexity Oriented Design of Distributed Algorith...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Xiaofei Liu Song Guo Abdulmotaleb El Saddik Department of Computer Science University of Ottawa Ottawa ONT Canada School of Computer Science and Engineering University of Aizu Aizu-Wakamatsu Japan

We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree rooted at the source node and including all the destination nodes such that the lifetime of the tree is maximized. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, we show that its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed suboptimal algorithm that achieves a good balance on the algorithm-optimality and message complexity. In particular, we prove that it has a linear-message complexity. The tradeoff between algorithm sub-optimality and message complexity is also studied by simulations.

关键词： Algorithm design and analysis Distributed algorithms Wireless sensor networks multicast algorithms Computer science Energy efficiency Batteries Broadcasting Design engineering Design optimization

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Opportunistic Network Coding for Wireless Networks

Energy Efficient Opportunistic Network Coding for Wireless N...

引用

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

作者： T. Cui L. Chen T. Ho Division of Engineering and Applied Science California Institute of Technology Pasadena CA USA

We consider energy efficient network coding design in wireless networks with multiple unicast sessions. Our approach decomposes multiple unicast sessions into a superposition of multicast and unicast sessions, with coding occurring only within each session. We give an optimization approach that is more general than the existing poison-remedy optimization formulation. For the case of wireless, we consider XOR coding and give an achievable rate region for a primary interference model. To simplify network operation, we give an oblivious backpressure algorithm which does not optimize overhearing of transmissions, and a practical protocol called COPR based on the oblivious backpressure algorithm. Simulation experiments show that COPR largely reduces network power consumption over existing algorithms.

关键词： Energy efficiency Network coding Wireless networks Unicast Scheduling algorithm Interference Algorithm design and analysis Routing Protocols multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Data Routing algorithms in Extended Lucas Cube Networks

Data Routing Algorithms in Extended Lucas Cube Networks

引用

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Ernastuti Ravi A. Salim A. Juarna Department of Computer Science Gunadarma University Indonesia

We introduce a class of novel interconnection topologies called extended Lucas cube (ELC). The ELC is an induced subgraph of hypercube defined in terms of Fibonacci strings. The hypercube is a powerful network that is able to perform various kinds of parallel computation and simulate many other networks. ELC can serve as a framework for studying degraded hypercube due to faulty nodes or links. Hypercube has a simple routing algorithm. ELC maintains virtually almost all the desirable properties of hypercube. The focus of this paper is on the data communication aspects in the ELC. Data communication is the delivery of message from the source to the destination. Efficient routing and broadcasting messages is a key issue to the performance of parallel and/or distributed systems. An important property of any message routing algorithm is to avoid deadlock. In this paper, we study data routing algorithms in the ELC, namely, unicast, broadcast and multicast algorithms. The unicast algorithm always succeeds in finding a path between them and ensures deadlock free in ELC. The time and traffic steps are used to measure the efficiency of routing algorithms. The unicast algorithm for ELC, which uses a Hamming distance path for any two nodes, is time and traffic optimal. The broadcast algorithm which employs the extended Lucas tree is traffic optimal and near time optimal. Two multicast algorithms are presented; they are based on an extended Lucas tree and a Hamiltonian cycle, respectively.

关键词： Routing multicast algorithms Hypercubes Broadcasting Unicast Data communication System recovery Network topology Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：