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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Multi-Group multicast Beamforming in LEO Satellite Communications

Multi-Group Multicast Beamforming in LEO Satellite Communica...

引用

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Dapeng Wu Chen Qin Yaping Cui Peng He Ruyan Wang School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Advanced Network and Intelligent Connection Technology Key Laboratory of Chongqing Education Commission of China Chongqing China Chongqing Key Laboratory of Ubiquitous Sensing and Networking Chongqing China

ISBN: (纸本)9781665435413

This paper investigates user grouping and beam-forming design in multi-beam low earth orbit (LEO) satellite communication (SATCOM) systems. To serve a great many user terminals (UTs) with a limited number of beams and improve the system performance, we formulate the weighted sum rate (WSR) maximization problem subject to the constraints of the UTs grouping, the satellite total power, and the minimum rate requirements of UTs. For solving this problem, we propose a multi-group multi-beamforming (MGMBF) scheme. In this scheme, all UTs are firstly adaptively grouped based on the channel correlation coefficients. Further, the beam centers are determined to ensure that all UTs are covered. After UTs grouping, slack variables are introduced to convert the beamforming design into a difference-of-convex (DC) programming problem. Moreover, an iterative algorithm is presented to solve the problem based on the convex-concave procedure (CCP), in which the beamforming vectors and slack variables are updated jointly by solving the convex sub-problem. Simulation results demonstrate that the MGMBF scheme improves the WSR by 25.1% compared with the MBIM algorithm, verifying the significant advantages of the proposed scheme.

关键词： Correlation coefficient Satellites multicast algorithms Array signal processing Simulation System performance Low earth orbit satellites

来源：评论

学校读者我要写书评

暂无评论

Short Video List Reshuffling for Minimized Wireless Resources through Video multicast

Short Video List Reshuffling for Minimized Wireless Resource...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Zhipeng Gao Chunxi Li Yongxiang Zhao Baoxian Zhang Cheng Li School of Electronic and Information Engineering Beijing Jiaotong University China Research Center of Ubiqutious Sensor Networks University of Chinese Academy of Sciences China Department of Electrical and Computer Engineering Memorial University of Newfoundland Canada

The explosive development of short video applications has brought severe pressure on radio resources at hotspot areas. The features of short video recommendations-and-pushing techniques provide us an opportunity to relieve the radio resource pressure via wireless multicast: An edge server can be deployed at the base station, which receives short video lists recommended by remote video server and then pushes such mobile video services to local users through wireless multicast. In this paper, we study how to reshuffle the video lists received from remote server so as to facilitate wireless multicast to maximally reduce the required wireless resource while considering the fact that a user client can only buffer one short video for watching based on off-the-shelf short video APPs. We formulate the problem of video list reshuffling for minimizing the total wireless resources consumption as an integer programming problem. We design a Minimum degree of Freedom based Maximum Filling video reshuffling algorithm (MFMF) to address this problem. MFMF moves videos from the original video lists into same sized but reshuffled video lists in a greedy manner, once for a video, whose moving can satisfy the most reshuffled video lists, and if multiple such choices exist, selects the one having the least position options. This process continues until all the videos are moved. We deduce the computation complexity of MFMF. Numerical results demonstrate the significantly high performance of MFMF.

关键词： Wireless communication Integer programming multicast algorithms Shape Simulation Streaming media Mobile video

来源：评论

学校读者我要写书评

暂无评论

Dynamic multicast Access Technique in SC-PTM 5G Networks: Subgrouping with OM/NOM

Dynamic Multicast Access Technique in SC-PTM 5G Networks: Su...

引用

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Ernesto Fontes Pupo Claudia Carballo Gonzá lez Luigi Atzori Maurizio Murroni Department of Electrical and Electronic Engineering (DIEE/UdR CNIT) University of Cagliairi Cagliari Italy LACETEL Havana Cuba

The future 5G and beyond networks need to efficiently integrate the best of all available and under development technologies. In line with this premise, multicast/broadcast technologies bring essential capabilities to boost the potential of future broadband networks. The novel under development multicast broadcast system (5G-MBS) is expected to provide an effective mixed unicast/multicast/broadcast mode embracing the radio bearers single-cell point-to-multipoint (SC-PTM) and multicast/broadcast single frequency networks (MBSFN). This work proposes a dynamic multicast access technique selection algorithm based on subgrouping with orthogonal multiplexing (OM)/non-orthogonal multiplexing (NOM) in SC-PTM 5G networks. The proposal shows the advantages of dynamically selecting among a conventional multicast scheme, a subgrouping approach based on OM, or a subgrouping approach based on NOM, in terms of efficiency of the resource allocation. The dynamic selection is determined by the specific multicast multimedia service constraints and the reception conditions of the users. The effectiveness of the proposal is validated through numerical simulation results. As validation criteria, we consider the system aggregated data rate (ADR), proportional fairness (PF), and the minimum dissatisfaction index (MDI) by considering multiple multimedia service constraints, system resources, number of users, and users' distributions.

关键词： multicast algorithms 5G mobile communication Heuristic algorithms multicast communication Numerical simulation Broadband communication Proposals

来源：评论

学校读者我要写书评

暂无评论

Multidimensional Direct Fractional Programming based multicast Beamforming Design in Space-Ground Integration Networks

Multidimensional Direct Fractional Programming based Multica...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Huizhen Qiu Hongming Zhang Mugen Peng School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781665450867

This paper studies the multicast beamforming opti-mization design problem for space-ground integration network (SGIN). Firstly, a centralized processor (CP) is deployed for performing user scheduling and multicast beamforming in SGIN. Then, the in-band interference induced rate distortion problem in SG IN is detailed. In order to tackle this problem, we propose a multidimensional direct fractional programming (MDFP) based beamforming design algorithm for both satellite and base stations (BSs) at the CP, where the corresponding sum rates are maximized by subjecting to the transmission power budget of satellite and ground BSs. Finally, simulation results are provided, showing that our proposed algorithm is capable of obtaining feasible solutions with multiple iterations.

关键词： Wireless communication multicast algorithms Satellites Array signal processing Processor scheduling Simulation System performance

来源：评论

学校读者我要写书评

暂无评论

Multipath In-band Network Telemetry

Multipath In-band Network Telemetry

引用

IEEE Conference on Computer Communications Workshops (IEEE INFOCOM)

作者： Zheng, Yan Pan, Tian Zhang, Yan Song, Enge Huang, Tao Liu, Yunjie Purple Mt Labs Nanjing 211111 Peoples R China BUPT State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9781665404433

multicast is a popular way of data dissemination. How to monitor the multicast traffic is essential to tackle network bottlenecks and performance woes. The original In-band Network Telemetry (INT) provides a low-latency and fine-grained monitoring solution. However, to apply INT directly to multicast traffic causes problems like telemetry data redundancy and network bandwidth waste since the telemetry data collected from the same device may be duplicated several times. In this work, we propose MPINT, a telemetry framework dedicated to multicast traffic monitoring, which is cost-effective with minor bandwidth overhead. Evaluation shows, compared with the original INT, MPINT reduces the INT bandwidth overhead by 80% and eliminates 50% of the telemetry data uploaded to the controller. In addition, it takes less than 0.5s to complete the entire multicast tree recovery and packet loss estimation on 180 devices.

关键词： Performance evaluation multicast algorithms Conferences Redundancy Data dissemination Packet loss Estimation

来源：评论

学校读者我要写书评

暂无评论

Oktopus: Service Chaining for multicast Traffic 28

Oktopus: Service Chaining for Multicast Traffic

引用

28th IEEE International Conference on Network Protocols (IEEE ICNP)

作者： Diab, Khaled Lee, Carlos Hefeeda, Mohamed Simon Fraser Univ Sch Comp Sci Burnaby BC Canada

ISBN: (数字)9781728169927

ISBN: (纸本)9781728169927

multicast service chaining refers to the orchestration of network services for multicast traffic. Paths of a multicast session that span the source, destinations and required services form a complex structure that we refer to as the multicast distribution graph. In this paper, we propose a new path-based algorithm, called Oktopus, that runs at the control plane of the ISP network to calculate the multicast distribution graph for a given session. Oktopus aims at minimizing the routing cost for each multicast session while satisfying all service chaining requirements. Oktopus consists of two steps. The first one generates a set of segments from the given ISP network topology, and the second step uses these segments to efficiently calculate the multicast distribution graph. Oktopus has a fine-grained control over the selection of links in the distribution graphs that leads to significant improvements. Specifically, Oktopus increases the number of allocated sessions because it can reach ISP locations that have the required services, and thus includes them in the calculated graph. Moreover, Oktopus can reduce the routing cost per session as it carefully chooses links belonging to the graph. We compared Oktopus against the optimal and closest algorithms using real ISP topologies. Our results show that Oktopus has an optimality gap of 5% on average, and it computes the distribution graphs multiple orders of magnitude faster than the optimal algorithm. Moreover, Oktopus outperforms the closest algorithm in the literature in terms of the number of allocated multicast sessions by up to 37%.

关键词： multicast algorithms Routing Topology Network topology Unicast Streaming media Search problems

来源：评论

学校读者我要写书评

暂无评论

Robust multicasting and an Upper Bound on the Mismatch Capacity of the DMC

Robust Multicasting and an Upper Bound on the Mismatch Capac...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Somekh-Baruch, Anelia Bar Ilan Univ Ramat Gan Israel

ISBN: (纸本)9781538682098

We revisit the multicasting approach to the analysis of converse bounds that we recently introduced, and present a refined proof technique for upper bounding the mismatch capacity of the DMC P-Y vertical bar X with decoding metric q. To this end, we present an algorithm, which given a 2-user broadcast channel P-YZ vertical bar X, decoding metrics (q, p), and rate-R codebook, produces a sub-codebook of possibly lower rate R', which has the property that the intersecting event of erroneous rho-decoding by the Z receiver and correct q-decoding of the Y receiver has a vanishing probability. This results in a bound on the mismatch capacity of the channel to the Y-receiver that is given in terms of the sum of an achievable rate for a Z receiver of any broadcast channel having marginal P-Y vertical bar X plus the corresponding rate reduction R-R'. We further detect the rho* metric which yields the tightest bound out of all the type-dependent metrics, and focusing on the case of zero rate reduction, we show that the resulting bound is at least as tight as our previous best known upper bound [1]. We conclude by presenting sufficient conditions for the tightness of our bound and equivalence classes of code composition-channel-metric triplets.

关键词： Measurement Sufficient conditions Upper bound Monte Carlo methods multicast algorithms Channel capacity Focusing

来源：评论

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning Approach for Shared Caching 27

A Deep Reinforcement Learning Approach for Shared Caching

引用

27th National Conference on Communications (NCC)

作者： Trinadh, Pruthvi Thomas, Anoop Indian Inst Technol Sch Elect Sci Bhubaneswar Odisha India

ISBN: (纸本)9781665441773

A client-server network in which multiple clients are connected to a single server possessing files/data through a shared error free link is considered. Each client is associated with a cache memory and demands a file from the server. The server loads the cache memory with a portion of files during off-peak hours to reduce the delivery rate during peak hours. A decentralized placement approach which is more practical for large networks is considered for filling the cache contents. In this paper, the shared caching problem in which each cache can be accessed by multiple clients is considered. A Deep Reinforcement Learning (DRL) based framework is proposed for optimizing the delivery rate of the requested contents by the users. The system is strategically modelled as a Markov decision process, to deploy our DRL agent and enable it to learn how to make decisions. The DRL agent learns to multicast coded bits from the file library of the server in such a way that the user requests are met with minimum transmissions of these coded bits. It is shown that the proposed DRL based agent outperforms the existing decentralized algorithms for the shared caching problem in terms of normalized delivery rate. For the conventional caching problem which is a special case of the shared caching problem, simulation results show that the proposed DRL agent outperforms the existing algorithms.

关键词： Training multicast algorithms Simulation Cache memory Reinforcement learning Markov processes Libraries

来源：评论

学校读者我要写书评

暂无评论

Routing Algorithm of Wireless Mobile Communication based on Network Coding

Routing Algorithm of Wireless Mobile Communication based on ...

引用

Smart Data Intelligence (ICSMDI), International Conference on

作者： ShuSheng Wang Space Star Technology Co. Ltd Beijing China

The significant challenge faced by traditional Ad Hoc network is that when the communication range increases, the chance of encountering nodes and the duration of encounters will increase, resulting in an increase in the corresponding operation and network overhead in each algorithm. Hence, to face with this challenge, this research studies the routing algorithm of wireless mobile communication based on network coding. For our designed scenario, the random direction movement model, and multicast routing algorithm is considered based on network coding searches for the group path family for all receiving nodes in the network. This is then applied to construct the efficient coding scenario. Through the experiment, this study has tested the model with the trained datasets.

关键词： Wireless communication Wireless sensor networks multicast algorithms Network coding Routing Mobile communication Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Causal Ordering in the Presence of Byzantine Processes

Causal Ordering in the Presence of Byzantine Processes

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Anshuman Misra Ajay D. Kshemkalyani University of Illinois at Chicago USA

Causal ordering of messages in distributed systems is important for capturing application-level semantics. To the best of our knowledge, Byzantine fault-tolerant causal ordering has not been attempted for point-to-point communication in an asynchronous setting. In this paper, we first prove that it is impossible to causally order messages under point-to-point communication in an asynchronous system with one or more Byzantine processes. In the face of this impossibility, we then present an algorithm that can causally order messages under point-to-point communication in the face of Byzantine failures, assuming the network provides a known upper bound on the message latency. We also prove that it is impossible to causally order multicasts in an asynchronous setting with one or more Byzantine processes. We then give an extension of our algorithm for unicasts to provide Byzantine fault-tolerant causal ordering of multicasts under the assumption of a known upper bound on the message latency.

关键词： Fault tolerance Upper bound multicast algorithms Fault tolerant systems Semantics Faces

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共212页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：