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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Integration of TESLA and FLUTE over satellite networks

Integration of TESLA and FLUTE over satellite networks

引用

International Workshop on Satellite and Space Communications (IWSSC)

作者： L. Liang M. Bhutta H. Cruickshank Z. Sun C. Kulatunga G. Fairhurst CCSR University of Surrey Guildford UK University of Aberdeen Aberdeen UK

multicast research has explored the security challenges faced in group communications. multicast transport and multicast security need to work in close collaboration to realise a multicast service. However, there has been comparatively little work to combine the two technologies. In this paper the authors is presenting an example of partially integrating timed efficient stream loss-tolerant authentication (TESLA) protocol and the file delivery over unidirectional transport (FLUTE) protocol. The security concern raised by the proposed algorithm is analysed for satellite network. The proposed algorithm was implemented on a testbed with multicast tunnel between University of Surrey and University of Aberdeen and the results are presented in this paper.

关键词： Satellites Authentication Forward error correction Data security Automatic logic units Payloads Transport protocols multicast algorithms Testing XML

来源：评论

学校读者我要写书评

暂无评论

Broadcast erasure channel with feedback - Capacity and algorithms

Broadcast erasure channel with feedback - Capacity and algor...

引用

Workshop on Network Coding, Theory and Applications (NetCod)

作者： Leonidas Georgiadis Leandros Tassiulas Dept. of Elect. & Comput. Eng. Aristotle University of Thessaloniki Thessaloniki GREECE Dept. of Comput. Eng. & Telec. University of Thessaly Volos GREECE

We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques while the second relies only on XOR operations between pairs of packets. Complexity and feedback information tradeoffs for the two algorithms are discussed. For the case where, in addition to traffic destined exclusively to either one of the users there is additional multicast traffic, we present an algorithm that shows that the rate region of the system can be increased by allowing inter-session coding. Finally, for the case where there are random arrivals to the system we present an algorithm, based on the previous algorithms, whose stability region gets close to the capacity region for reasonably large packet sizes. The latter algorithm operates without knowledge of arrival process and channel statistics.

关键词： Broadcasting Feedback multicast algorithms Unicast Degradation Upper bound Network coding Transmitters Statistics Channel capacity

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of center search algorithms used for dynamic rendezvous-point relocation

Performance evaluation of center search algorithms used for ...

引用

International Conference on Ultra Modern Telecommunications and Workshops (ICUMT)

作者： Samer Sulaiman Abdelfattah Haidine Ralf Lehnert Chair for Telecommunications Technical University of Dresden Germany

The protocol independent multicast - sparse mode (PIM-SM) is a multicast routing protocol that uses one center (which we refer to as the rendezvous point ¿RP¿) for all transmitters in a multicast group. It builds source-specific trees to the transmitters whose data rates exceed a defined threshold. Investigations are done to improve and provide an efficient mechanism for switching between the shared-based mode and source-based mode. Another attractive solution investigated in the literature is the dynamic relocation of the RP depending on the transmitters or the members of the multicast group. In this paper, we propose three search algorithms used to find the optimum RP position. To evaluate the performance of these algorithms, two objective functions are used. The Hill-Climbing algorithm and the standard PIM-SM protocol with static RP-selection are used as a reference for comparison. Our dynamic RP-relocation algorithms result in a lower network load compared to the static RP-selection algorithm. However, they need additional control messages.

关键词： Heuristic algorithms multicast algorithms multicast protocols Routing protocols Transmitters Costs Unicast Streaming media Internet Delta modulation

来源：评论

学校读者我要写书评

暂无评论

A Distributed Location Service for MANET Using Swarm Intelligence

A Distributed Location Service for MANET Using Swarm Intelli...

引用

IEEE Mobile WiMAX Symposium

作者： Sanjaya Gajurel Mark Heiferling Bluetronix Inc. Chagrin Falls USA

In this paper, a location service algorithm using swarm intelligence techniques, called SLS has been developed to provide location service to all MANET (Mobile Ad Hoc Network) routing protocols. MANET is a network with mobile nodes without Internet like infrastructure where every mobile node acts as a router. The location service is intended to solve the existing problems in MANET due to frequent movements of nodes. A node can know its location using GPS or triangulation based on radio signal characteristics or hardcoded location information if it is a stationary node. There are some location services available for MANET, however, to the best of our knowledge, SLS is the only technique to learn the location of other nodes intelligently and efficiently using swarm concept. SLS has been applied to the Swarm Autonomous Routing Algorithm (SARA) protocol and simulation is performed in QualNet The simulation results have showed better network performance using SLS than without using it.

关键词： Mobile ad hoc networks Particle swarm optimization Laser sintering Routing protocols Global Positioning System Access protocols multicast algorithms Insects WiMAX IP networks

来源：评论

学校读者我要写书评

暂无评论

The Improvement of Ant Colony Algorithm and Its Application to TSP Problem

The Improvement of Ant Colony Algorithm and Its Application ...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Jin Zhang Huaishan Liu Siyou Tong Ling Wang Key Laboratory of Submarine geosciences and Prospecting Technique Ministry Education Ocean University of China Qingdao China Key Laboratory of Submarine Geosciences and Prospecting Technique Ministry Education Ocean University of China Qingdao China Qingdao College Ocean University of China Qingdao China

The researches and applications on ant colony algorithm have made great progress in recent years. A number of results have proved the validity of the algorithm and its advantages in some fields. However, its basic shortcomings, which are long searching time and easily jumping into local optimal solution, have not been completely solved. This paper analyzes the reasons of stagnation and then introduces a new solution for avoiding stagnation, which includes the direct exchange of pheromone of some edges and dynamically setting evaporation rate for each edge. The simulation results demonstrate that the above approach is reasonable and efficient.

关键词： multicast algorithms Cities and towns Ant colony optimization Feedback Oceans Routing Underwater vehicles Geology Educational institutions Parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Performance Study of Path Based multicast Communication algorithms

A Performance Study of Path Based Multicast Communication Al...

引用

International Conference on Parallel Computing in Electrical Engineering (PARLEC)

作者： A. Al-Dubai I. Romdhani School of Computing Napier University Edinburgh UK

multicast communication's history has been driven by many schemes; however, a few have shown their efficiency on interconnection networks. Among these schemes, path based multicast has been proven to be more efficient in handling multicast, than those classified either as unicast based or tree-based schemes. This paper, therefore, focuses on path based scheme, examining some well-known path-based algorithms. Many experiments have been conducted to evaluate these algorithms in various operating scenarios and traffic conditions. The relative strengths, weaknesses and applicability of each algorithm to diverse situations are discussed. Our results have shown the superiority of our proposed QG algorithms against some of the well know multicast algorithms

关键词： multicast communication multicast algorithms Multiprocessor interconnection networks Parallel processing Parallel machines Network topology Telecommunication traffic Computer networks Electronic mail History

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Pareto-Optimal Genetic Algorithm for QoS multicasting

A Multi-Objective Pareto-Optimal Genetic Algorithm for QoS M...

引用

IEEE International Advance Computing Conference, IACC

作者： S. C. Rai B. B. Misra A. K. Nayak R. Mall S. Pradhan Department of Computer science and Engineering Silicon Institute of Technology Bhubaneswar India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Department of Computer Science and Application Utkal University Bhubaneswar India

The increasing demand of real-time multimedia applications in wireless environment requires stringent quality of service (QoS) provisioning to the mobile hosts (MH). The scenario becomes more complex during group communication from single source to multiple destinations. Fulfilling users demand with respect to delay, jitter, available bandwidth, packet loss rate and cost associated with the communication needs multi-objective optimization (MOO) with QoS satisfaction, is a NP-complete problem. In this paper we propose a multi-objective optimal algorithm to determine a min-cost multicast tree with end-to-end delay, jitter, packet loss rate and blocking probability constraints. The simulation result shows that the proposed algorithm satisfies QoS requirements (like high availability, good load balancing and fault-tolerance) made by the hosts in varying topology and bursty data traffic for multimedia communication networks. The performance of the algorithm for scalability is also highly encouraged.

关键词： Genetic algorithms Quality of service Mobile communication Delay Jitter multicast algorithms Bandwidth Cost function NP-complete problem Availability

来源：评论

学校读者我要写书评

暂无评论

A Historical Connection Information Based Inter-Overlay Optimization Algorithm

A Historical Connection Information Based Inter-Overlay Opti...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Yingsong Hu Liangbin Chen Qiang Li Shengsheng Yu Department of Computer Science Huazhong University of Science and Technology Wuhan China Department of Foundation First Aeronautical College of Air Force Xinyang China

Peer-to-peer streaming system has increasingly wide applications. To improve the performance of the system, most researches are based on intra-overlay optimization at present. However this method has some disadvantages, such as the structure of the overlay is not globally optimal, the efficiency of resources utilization is low, and all of the leaf nodes cannot contribute any bandwidth to other nodes in multicast trees. In this paper, a historical connection information based inter-overlay optimization algorithm (HCI) is proposed, where each peer maintains multiple inter-tree connection tables as well as one intra-tree connection table. The algorithm makes full use of the original historical connection information. This results in that the nodes participating in multicast can use their nearest neighbour nodes so that the quality of streaming service is guaranteed. This algorithm can balance the load among the multicast group members to improve global resource utilization of P2P streaming system. The simulation results show that the HCI algorithm is flexible, easy for implementation, and able to efficiently improve the performance of the system.

关键词： Streaming media Peer to peer computing multicast algorithms Bandwidth Costs Computer science Human computer interaction Resource management Delay Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient and Secure Rekeying for IEEE 802.16e WiMAX Networks

Towards Efficient and Secure Rekeying for IEEE 802.16e WiMAX...

引用

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

作者： Jeremy Brown Xiaojiang Du Department of Computer Science North Dakota State University Fargo ND USA Department of Computer and Information Sciences Temple University Philadelphia PA USA

In this paper, we study the rekeying issue in IEEE 802.16e WiMAX networks. The existing rekeying scheme the multicast and Broadcast Rekeying Algorithm (MBRA) unicasts new keys to each subscriber station (SS). This scheme does not scale well since it incurs large communication overhead when the number of SSs increase. In our work, first we propose a general tree-based rekeying scheme, which is more efficient than the MBRA. We then formulate an optimization problem to determine the optimal tree structure for a given number of SSs. Furthermore, we design a novel and efficient rekeying scheme for WiMAX networks. Our new rekeying scheme utilizes efficient security primitives and application features of WiMAX networks. Both analysis and performance evaluation show that the new rekeying scheme can significantly reduce communication overhead.

关键词： WiMAX Authentication Computer crime Cryptography Protocols USA Councils Broadcasting multicast algorithms Unicast Information security

来源：评论

学校读者我要写书评

暂无评论

Maximizing the Degree of Concurrency and Consistency in Distributed Parallel Processing Environment

Maximizing the Degree of Concurrency and Consistency in Dist...

引用

International Conference on Future Networks, ICFN

作者： Tin Tin Nyo Department of Engineering Physics Mandalay Technological University Mandalay Myanmar

This paper attempt to develop the technique of maximizing the degree of concurrency and consistency in distributed parallel processing environment by using Ricart and Agrawala's algorithm, which developed an algorithm to implement mutual exclusion between processes that is based upon multicast. This will support the mutual exclusion system in client/server distributed environment and avoid the deadlock between the system spawned client threads. Additionally, it will promote the effective starvation solving system and to implement the timing control between the mutually running processes. Application of such algorithm in implementing client/server distributed library system is discussed.

关键词： Concurrent computing Parallel processing System recovery multicast algorithms Authentication Application software Tin Libraries Clocks Resource management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：