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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Network Topology Inference Based on Delay Variation

Network Topology Inference Based on Delay Variation

引用

International Conference on Advanced Computer Control, ICACC

作者： Hong-Hua Zhao Ming Chen Inst. of Command Autom. PLA Univ. of Sci. & Tech. Nanjing

Network topology could be inferred based on one way delay in unicast networks, but time synchronization was needed between source node and destination nodes when measuring one way delay. In order to reduce the limit of time synchronization, a measurement method named 4-packets train was proposed which did not need time synchronization and could measure delay variation. Then a topology inference algorithm based on delay variation was put forward. Second the feasibility and correctness of topology inference algorithm based on delay variation were analyzed theoretically. At last the topology inference algorithm and 4-packets train measurement method were validated through simulation tool of NS2, the results of simulation indicated that the topology inference algorithm based on delay variation and 4-packets train measurement could infer network topology efficiently and correctly.

关键词： Network topology Inference algorithms Probes Delay effects Computer networks Time measurement Unicast Hamming distance multicast algorithms Tomography

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput

A Dynamic Frame Sizing Algorithm for CICQ Switches with 100%...

引用

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

作者： C.-S. Chang Y.-H. Hsu J. Cheng D.-S. Lee Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan Taiwan

A Combined Input and Crosspoint Queueing (CICQ) switch is a switch that has both buffers at the crosspoints of the switch fabric and buffers at the inputs. Inspired by the fixed frame based algorithm for an input-buffered switch and the smooth scheduling algorithm for a CICQ switch, in this paper we propose using a dynamic frame sizing algorithm for a CICQ switch. It is formally shown that such a CICQ switch indeed achieves 100% throughput for certain Poisson-like traffic models. This is done without using the framed Birkhoff-von Neumann decomposition needed. Moreover, such a CICQ switch only requires a two-cell buffer at each crosspoint when there is only unicast traffic. Unlike input-buffered switches, the dynamic frame sizing algorithm also achieves 100% throughput in the setting of multicast traffic. This is done at the cost of increasing the buffer size at each crosspoint.

关键词： Heuristic algorithms Switches Throughput Traffic control Communication switching Scheduling algorithm Fabrics Communications Society Unicast multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

An all-optical OFDM system based on time lenses

An all-optical OFDM system based on time lenses

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Junyao Mei Wei li Chuanbiao Wang Xiao jun Liang Yaojun Qiao Wuhan National Laboratory of Optoelectronics Huazhong University of Science and Technology Wuhan China Key Laboratory Information Photonics and Optical Communication ministry of Education Beijing University of Posts and Telecommunications China

We experimentally demonstrate a multi-pulse all-optical time domain continuous Fourier transformation (MOFT) based on a time lens. With two of MOFT devices, one is at transmitter, the other is at receiver, we experimentally show a successful all-optical OFDM fiber transmission system with 20Gbit/s 200km transmission without any dispersion compensations.

关键词： OFDM Lenses Optical wavelength conversion multicast algorithms Optical fiber networks Unicast Telecommunication traffic Optical fiber communication Resource management Optical switches

来源：评论

学校读者我要写书评

暂无评论

Rate Distortion Optimization for Mesh-Based P2P Video Streaming

Rate Distortion Optimization for Mesh-Based P2P Video Stream...

引用

IEEE International Conference on Communications (ICC)

作者： T. Hossain Y. Cui Y. Xue Vanderbilt Advanced NETwork Systems Laboratory Department of Electrical Engineering and Computer Science Vanderbilt University Nashville TN USA

This paper addresses the problem of optimal rate allocation for video streaming in a multi-path peer-to-peer mesh network. We present a distributed rate allocation algorithm that minimizes the total rate distortion among receiving peers. The scheme assumes that video streams can be transcoded/re-quantized at intermediate peers. We deploy a double pricing solution that simultaneously incorporates both the network and the relay constraints. We compare it with a single pricing solution where the relay constraint is applied only after all the communicating peers have converged. Our simulation shows that the double pricing solution consistently achieves a smaller aggregate distortion for all peers in comparison to the single pricing solution and thus achieves higher video quality.

关键词： Rate-distortion Streaming media Pricing Relays Aggregates Peer to peer computing Videoconference Internet Bandwidth multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Estimation of Network Size and Diameter

Probabilistic Estimation of Network Size and Diameter

引用

Latin-American Symposium on Dependable Computing, LADC

作者： Jorge C. S. Cardoso Carlos Baquero Paulo Sérgio Almeida E.Artes / CITAR Universidade Católica Portuguesa Porto Portugal DI/CCTC Universidade do Minho Braga Portugal

Determining the size of a network and its diameter are important functions in distributed systems, as there are a number of algorithms which rely on such parameters, or at least on estimates of those values. The Extrema Propagation technique allows the estimation of the size of a network in a fast, distributed and fault tolerant manner. The technique was previously studied in a simulation setting where rounds advance synchronously and where there is no message loss. This work presents two main contributions. The first, is the study of the Extrema Propagation technique under asynchronous rounds and integrated in the Network Friendly Epidemic multicast (NeEM) framework. The second, is the evaluation of a diameter estimation technique associated with the Extrema Propagation. This study also presents a small enhancement to the Extrema Propagation in terms of communication cost and points out some other possible enhancements. Results show that there is a clear trade-off between time and communication that must be considered when configuring the protocol-a faster convergence time implies a higher communication cost. Results also show that its possible to reduce the total communication cost by more than 18% using a simple approach. The diameter estimation technique is shown to have a relative error of less than 10% even when using a small sample of nodes.

关键词： Costs Fault tolerance multicast algorithms Computer networks Distributed computing Convergence Routing protocols Bandwidth Propagation losses Delay

来源：评论

学校读者我要写书评

暂无评论

Efficient Network Coding algorithms for Dynamic Networks

Efficient Network Coding Algorithms for Dynamic Networks

引用

IEEE Annual Communications Society Sensor, Mesh and Ad Hoc Communications and Networks SECON Workshops

作者： Mohammad Asad Chaudhry Salim El Rouayheb Alex Sprintson Department of Electrical and Computer Engineering Texas A&M University College Station Texas

Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets received on their incoming edges. The central problem in the design of network coding schemes is to assign local encoding coefficients for the intermediate edges in a way that allows every terminal node to decode the packets generated by the source node. The main applications of the network coding technique include content distribution, peer-to-peer networks, and wireless ad-hoc networks. Such networks are characterized by highly dynamic set of users and frequent topological changes. In this paper we focus on the design of efficient multicast network codes for dynamic networks. First, we consider the problem of maintaining the feasibility of a given network code upon a change in the network topology or the addition of a new user. Our goal is to minimize the number of encoding coefficients that needs to be modified to keep the network code feasible. Second, we present a new network coding algorithm that uses path-based coding assignments to efficiently handle frequent changes in the network topology and the multicast group.

关键词： Network coding Heuristic algorithms Peer to peer computing Encoding Network topology multicast algorithms Decoding Wireless networks Ad hoc networks Distributed computing

来源：评论

学校读者我要写书评

暂无评论

On Efficient Content Matching in Distributed Pub/Sub Systems

On Efficient Content Matching in Distributed Pub/Sub Systems

引用

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

作者： W. Rao L. Chen A. W.-C. Fu H. Chen F. Zou Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong China Department of Computing Sci Hong Kong University of Science and Technology Hong Kong China School of Computer Science Huazhong University of Science and Technology China School of Information Security Engineering Shanghai Jiaotong University China

ISBN: (纸本)9781424435128

The efficiency of matching structures is the key issue for content publish/subscribe systems. In this paper, we propose an efficient matching tree structure, named CobasTree, for a distributed environment. Particularly, we model a predicate in each subscription filter as an interval and published content value as a data point. The CobasTree is designed to index all subscription intervals and a matching algorithm is proposed to match the data points to these indexed intervals. Through a set of techniques including selective multicast by bounding intervals, cost model-based interval division, and CobasTree merging, CobasTree can match the published contents against subscription filters with a high efficiency. We call the whole framework including CobasTree and the associated techniques as COBAS. The performance evaluation in simulation environment and PlanetLab environment shows COBAS significantly outperforms two counterparts with low cost and fast forwarding.

关键词： Matched filters Subscriptions Delay Tree data structures Costs Communications Society Distributed computing Information security Algorithm design and analysis multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Architecture and Peer Selection Mechanism for Decentralized-Trackerless BitTorrent Using Dynamic Overlays

A Novel Architecture and Peer Selection Mechanism for Decent...

引用

International Symposium on Computer Science and its Applications, CSA

作者： Venkatesh Karthik Srinivasan Naveen Somasundaram Srikant R Madhu RM Arvind Subramaniam R Saswati Mukherjee Department of Computer Science and Engineering College of Engineering Anna University Chennai India

来源：评论

学校读者我要写书评

暂无评论

Load Balance multicast Routing algorithms on Leased Overlay Network

Load Balance Multicast Routing Algorithms on Leased Overlay ...

引用

International Conference on Networking and Services (ICNS)

作者： Xiaoyu Zhang Guangzhao Zhang Department of Electronics and Communication Engineering Sun Yat-sen University Guangzhou China

Overlay networks have been recently developed to support multicast framework. Specially, overlay architectures based on proxies and leased lines can provide applications with optimal performance in terms of bandwidth, reliability, delay guarantee, etc. In this paper, we propose a balanced multicast routing algorithm for these proxy-based overlay architectures to utilize the network resources efficiently while keeping the delay guarantee for each multicast session. We first model the routing problem as a delay-constraint Steiner tree problem. Then, a balanced solution with the aid of precomputing is proposed. Extensive simulations show that our multicast routing algorithm provides superior performance with respect to other heuristics

关键词： Routing multicast algorithms Bandwidth Delay IP networks Streaming media Costs Video on demand Videoconference Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Proof of optimal algorithm for maximum-bandwidth ALM tree construction

Proof of optimal algorithm for maximum-bandwidth ALM tree co...

引用

IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR

作者： Takamichi Kikkawa Takamichi Miyata Katsunori Yamaoka Tokyo Institute of Technology Meguro Tokyo Japan

We construct an ALM (application layer multicast) tree that achieves the maximum bandwidth by using underlay traffic information. Since this problem was previously shown to be NP-hard, no polynomial-time algorithms for maximum-bandwidth ALM tree construction exist. In our work, we assume that the underlay network has a tree network topology, and we show a polynomial-time algorithm that constructs a maximum-bandwidth ALM tree on such a tree network topology. We propose an ALM tree construction algorithm that achieves bandwidth b and apply this algorithm with various bandwidth values b. We show that it can make a maximum-bandwidth ALM tree in polynomial time.

关键词： Bandwidth Peer to peer computing Streaming media multicast algorithms Polynomials Network topology Internet Telecommunication traffic multicast protocols Bit rate

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：