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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Radio Resource Allocation for Overlapping MBS Zones

Radio Resource Allocation for Overlapping MBS Zones

引用

IEEE Mobile WiMAX Symposium

作者： Ray-Guang Cheng Kuo-Jui Huang Jen-Shun Yang Department of Electronic Engineering National Taiwan University of Science and Technology Taipei Taiwan Information and Communications Research Laboratories Industrial Technology and Research Institute Hsinchu Taiwan

multicast and broadcast service (MBS) is one of the important services for next generation wireless systems. In WiMAX, the radio resource unit (i.e., time, frequency, code, etc.) for MBS is centralized allocated by a network device named Anchor ASN-GW. The ASN-GW has to ensure that non-overlapping radio resource units are allocated to BSs for delivering different MBS contents. This paper presents a method to allocate radio resource units in overlapping MBS Zones. We proposed radio resource allocation and re-allocation algorithms to minimize the number of re-allocated resource unit due to the change of MBS zones topology. Simulation result shows that the proposed algorithms can reduce the number of re-allocations and thus, reduce the signaling message exchanged in the air interface and the core network.

关键词： Resource management Radio broadcasting Multimedia communication Network topology Optimal scheduling WiMAX multicast algorithms Digital multimedia broadcasting Computational complexity Radio spectrum management

来源：评论

学校读者我要写书评

暂无评论

On a theory of network equivalence

On a theory of network equivalence

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Ralf Koetter Michelle Effros Muriel Medard Germany USA

We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a noiseless bit pipe with throughput equal to the noisy link capacity. This result was previously known only for multicast connections.

关键词： Network coding Information theory Throughput multicast algorithms Complexity theory Signal to noise ratio Signal analysis Heart Unicast Routing

来源：评论

学校读者我要写书评

暂无评论

Conditional Fault-Tolerant Cycle Embedding of Star Graphs

Conditional Fault-Tolerant Cycle Embedding of Star Graphs

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Ming-Chien Yang Department of Knowledge Management Aletheia University Tainan County Taiwan

The star graph has been an attractive interconnection network, and possesses many nice properties. In this paper, we consider the cycle embedding problem in star graphs with conditional edge faults. We show that there exist cycles of all even lengths from 6 to n! in an n-dimensional star graph with ¿ 2n - 7 edge faults in which each vertex is incident with at least two healthy edges for n ¿ 4.

关键词： Fault tolerance Tin Multiprocessor interconnection networks Distributed computing Knowledge management Parallel algorithms Data structures Computer networks multicast algorithms Routing

来源：评论

学校读者我要写书评

暂无评论

Almost optimal distributed M2M multicasting in Wireless Mesh Networks

Almost optimal distributed M2M multicasting in Wireless Mesh...

引用

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

作者： Qin Xin Fredrik Manne Yan Zhang Jianping Wang Zeyu Zheng Simula Research Laboratory Oslo Norway Department of Informatics University of Bergen Bergen Norway Department of Computer Science City University of Hong Kong Hong Kong China

Wireless Mesh Network (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the problem of multipoint-to-multipoint (M2M) multicasting in a WMN which aims to use the minimum number of time slots to exchange messages among a group of k mesh nodes in a multi-hop WMN with n mesh nodes. We study the M2M multicasting problem in a distributed environment where each participant only knows that there are k participants and it does not know who are other k -1 participants among n mesh nodes. It is known that the computation of an optimal M2M multicasting schedule is NP-hard. We present a fully distributed deterministic algorithm for such an M2M multicasting problem and analyze its time complexity. We show that if the maximum hop distance between any two out of the k participants is d, then the studied M2M multicasting problem can be solved in time O(d log 2 n+k log 3 n/log k) with a polynomial-time computation, which is an almost optimal scheme due to the lower bound Omega(d+ k log n/log k) given in [5]. Our algorithm also improves the currently best known result with running time O(d log 2 n + k log 4 n) in [13]. In this paper, we also propose a distributed deterministic algorithm which accomplishes the M2M multicasting in time O(d+k) with a polynomial-time computation in unit disk graphs. This is an asymptotically optimal algorithm in the sense that there exists a WMN topology, e.g., a line, a ring, a star or a complete graph, in which the M2M multicasting cannot be completed in less than Omega(d+k) units of time.

关键词： Wireless mesh networks multicast algorithms Broadcasting Mesh networks Network topology Telecommunication network reliability Polynomials Distributed computing Routing Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach

Fast Resource Allocation for Network-Coded Traffic - A Coded...

引用

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

作者： C.-C. Wang X. Lin School of Electrical and Computer Engineering Purdue University USA

ISBN: (纸本)9781424435128

In this paper, we develop a fast resource allocation algorithm that takes advantage of intra-session network coding. The algorithm maximizes the total utility of multiple unicast (or multicast) sessions subject to capacity constraints, where packets are coded within each session. Our solution is a primal solution that does not use duality or congestion prices. Thus, it does not require building up queues to achieve the optimal resource allocation. Hence, the queueing delay of the packets can be tightly controlled. The existing primal solution in the literature requires a separate graph-theoretic algorithm to find the min-cut of each session, whose complexity grows quadratically with the total number of nodes. In contrast, we provide a new coded-feedback approach whose complexity grows only linearly with the total number of nodes. More explicitly, by letting the ACK/feedback packets on the return paths also carry coding coefficients as does the forward coded traffic, key network information can be obtained more efficiently, which leads to a fast resource allocation scheme fully integrated with the network coding operation.

关键词： Resource management Telecommunication traffic Network coding multicast algorithms Unicast Routing Traffic control Throughput Delay Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Run-time resource management in fault-tolerant network on reconfigurable chips

Run-time resource management in fault-tolerant network on re...

引用

International Conference on Field Programmable Logic and Applications

作者： Mohammad Hosseinabady Jose L. Nunez-Yanez University of Bristol Bristol UK

This paper investigates the challenges of run-time resource management in future coarse-grained network-on-reconfigurable-chips (NoRCs). Run-time reconfiguration is a key feature expected in future processing systems which must support multiple applications whose processing requirements are not known at design time. This paper investigates a stochastic routing algorithm in a NoC-based system with dynamically reconfigurable tiles, able to cope with the dynamic behaviour of run-time task mapping. Experimental results show the efficiency of the proposed stochastic task mapping.

关键词： Runtime Resource management Fault tolerance Tiles Routing Hardware Stochastic processes Field programmable gate arrays multicast algorithms Application software

来源：评论

学校读者我要写书评

暂无评论

Data aggregation based topology inference for wireless sensor networks

Data aggregation based topology inference for wireless senso...

引用

International Conference on Apperceiving Computing and Intelligence Analysis, ICACIA

作者： Zhi-Yong Zhang Guang-Min Hu Key Lab of Broadband Optical Fiber Transmission and Communication Networks University of Electronic Science and Technology Chengdu China

Knowledge of topology in wireless sensor networks is significant for network management and maintenance. In this paper, a conditional probability of data loss theorem is proposed for wireless sensor networks based on the data aggregation *** probability of data loss theorem. It reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based on this theorem, we propose a novel algorithm to infer topologies of sensor networks using end-to-end loss measurements. The algorithm does not incur any additional burden to the network. A large number of networks are simulated in different scenarios with NS-2. The results show that our proposed algorithm can identify more than 95% of topologies within a small data collection rounds.

关键词： Network topology Wireless sensor networks Inference algorithms Circuit topology Loss measurement Tomography multicast algorithms Optical fibers Communication networks Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Polynomial Time Construction Algorithm of BCNC for Network Coding in Cyclic Networks

Polynomial Time Construction Algorithm of BCNC for Network C...

引用

International Conference on Computer and Information Science (ACIS)

作者： Jiaqing Huang Liang Wang Wenqing Cheng Hui Li Department of Electronics and Information Engineering Hubei Provincial Key Laboratory of Smart Internet Huazhong University of Science and Technology Wuhan China The Key Laboratory of Integrated Microsystems Shenzhen Graduate School of Peking University Shenzhen China

Network coding in cyclic networks meets more problems than in acyclic networks. Recently, S.-*** et *** a framework of convolutional network coding (CNC) as well as its four properties for cyclic networks with theoretic fundamentals of discrete valuation ring (DVR). The four properties, convolutional multicast (CM), convolutional broadcast (CB), convolutional dispersion (CD) and basic convolutional network code (BCNC), are notions of increasing strength in this order with regard to linear independence among the global encoding kernels. The existence of a BCNC then implies the existence ofthe rest. That is, BCNC is the best convolutional network code in terms of linear independence. However, the code construction algorithm of BCNC was not presented explicitly. To the best of our knowledge, this is the first paper to propose a polynomial time construction algorithm of BCNC for network coding in cyclic networks, which can deal with different characteristics of cycles in terms of topology, including link cycles but flow acyclic, simple flow cycles and knots. Finally, polynomial time complexity of the algorithm was proved as well as its effectiveness.

关键词： Polynomials Network coding Convolutional codes Broadcasting Dispersion multicast algorithms Encoding Kernel Computer numerical control Laboratories

来源：评论

学校读者我要写书评

暂无评论

A new construction method for networks from matroids

A new construction method for networks from matroids

引用

IEEE International Symposium on Information Theory

作者： Salim El Rouayheb Alex Sprintson Costas Georghiades Department of Electrical and Computer Engineering Texas A and M University College Station TX USA

ISBN: (纸本)9781424443123

We study the problem of information flow in communication networks with noiseless links in which the dependency relations among the data flowing on the different network edges satisfy matroidal constraints. We present a construction that maps any given matroid to a network that admits vector linear network codes over a certain field if and only if the matroid has a multilinear representation over the same field. This new construction strengthens previous results in the literature and, thus, establishes a deeper connection between network coding and matroid theory. We also explore another, more general, mathematical construct referred to as FD-relation which is more suitable than matroids in capturing the dependency relations in general networks.

关键词： Network coding Buildings Vectors multicast algorithms Communication networks Interference Transportation Routing Linear algebra Information theory

来源：评论

学校读者我要写书评

暂无评论

Improved QoS-aware switching mechanism for PIM-SM protocol

Improved QoS-aware switching mechanism for PIM-SM protocol

引用

International Conference on Internet Multimedia Services Architecture and Applications, IMSAA

作者： Samer Sulaiman Ralf Lehnert Qin Dai Germany

ISBN: (纸本)9781424447923;9781424447930

PIM-SM (Protocol Independent multicast - Sparse Mode) is a multicast routing protocol that uses one central node (which we refer to with the Rendezvous Point ¿RP¿) for all transmitters in a multicast group. It builds source-specific trees to the transmitters whose data rates exceed a predefined threshold. Investigations have been done to improve and provide an efficient mechanism for switching between the shared-based mode and source-based mode in order to limit some Quality of Service (QoS) such as end-to-end delay, bandwidth, etc. In this paper, we improve the switching mechanism proposed by [FD02]. To evaluate the performance of our improvement, two PIM-SM models (without a switching mechanism and with a rate based switching mechanism) are used as a reference for comparison. Our improved switching mechanism results in a lower network load compared to the standard switching mechanism and keeps the end-to-end delay within a predefined threshold. The additional control load overload is presented.

关键词： Routing protocols multicast protocols Transmitters Packet switching Quality of service Switches Bandwidth Unicast Delay estimation multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：