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

Near-Optimal multicast Tree Construction in Leaf-Spine Data Center Networks

IEEE SYSTEMS JOURNAL 2020年第2期14卷 2581-2584页

作者： Luo, Shouxi Xing, Huanlai Li, Ke Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 611756 Peoples R China

In this paper, we revisit the optimization problem of constructing multicast trees for cloud applications in the context of leaf-spine data center network (DCN). On one hand, we find that, the maximum multicast rate a network can provide equals to the minimum of the maximum unsplit throughput it can provide to each of the receivers. On the other hand, by taking the characteristic of leaf-spine DCN into account, we prove that the optimal construction of multicast tree in leaf-spine DCNs is equivalent to the well-known problem of minimum set cover, distinguished from the conventional wisdom that models the problem as a general-purpose directed minimum Steiner. Based on these findings, we develop simple yet near-optimal algorithms to construct multicast trees and deal with network failures.

关键词： Switches Receivers Bandwidth multicast algorithms Data centers Servers Approximation algorithms Data center network (DCN) multicast set cover

来源：评论

学校读者我要写书评

暂无评论

Progressive Linear Precoder Optimization for multicast Retransmission

Progressive Linear Precoder Optimization for Multicast Retra...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Jian Xiong Zhe Zhang Meixia Tao Dept. of Electronic Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781665450867

Our investigation concentrates on the linear pre-coder designed for the packet retransmission in the multicast sys-tem. To fully utilize the time diversity provided by the automatic repeat request (ARQ), we consider a sequential linear precoder optimization problem assisted with hybrid-ARQ (HARQ), which aims to maximize the minimum quality-of-service over all users under the peak power constraint of base station. To solve the non-convex problem, we propose a low-complexity high-performance algorithm based on convex-concave procedure (CCP) together with alternating direction method of multipliers (ADMM). The proposed algorithm not only guarantees a sub-optimal solution but also has closed-form update in each iteration. Numerical results show that the proposed algorithm can continuously improve the system performance under multiple retransmissions, including reducing the successful transmission time and the bit error rate.

关键词： Wireless communication multicast algorithms System performance Diversity reception Bit error rate Signal processing algorithms Quality of service

来源：评论

学校读者我要写书评

暂无评论

An Approach to Reduce the Redundancy of Placement Delivery Array Schemes for Random Demands

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2021年第6期10卷 1314-1318页

作者： Li, Xiaojun Zhang, Qiaoling Cheng, Minquan Wan, Kai Guangxi Normal Univ Guangxi Key Lab Multisource Informat Min & Secur Guilin 541004 Peoples R China Huaguang Coll Quanzhou Quanzhou 362121 Peoples R China Tech Univ Berlin Elect Engn & Comp Sci Dept D-10587 Berlin Germany

Centralized coded caching schemes have been widely studied in wireless networks. Placement delivery array (PDA) can be used to generate a coded caching scheme with low subpacketization when all the requested files are different. However, all existing schemes based on PDA design treat the request of each user as an independent file, without leveraging the multicast opportunities when one file is requested by several users. In this letter, for any existing scheme based on PDA design, after its coded multicast messages generation, we proposed an approach to remove the redundant multicast messages.

关键词： Handheld computers Manganese Servers multicast algorithms Cache memory Technological innovation Information theory Coded caching placement delivery array multicast opportunities PDA-d graph transmission load

来源：评论

学校读者我要写书评

暂无评论

A New Traffic Aggregation Method for Live Video Streaming in Information-Centric Networking

A New Traffic Aggregation Method for Live Video Streaming in...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Kai Sakamoto Yusaku Hayamizu Masaki Bandai Miki Yamamoto Kansai University Osaka Japan National Institute of Information and Communications Technology (NICT) Tokyo Japan Sophia University Tokyo Japan

ISBN: (数字)9798331521165

ISBN: (纸本)9798331521172

By leveraging a multicast functionality of Information-Centric Networking (ICN), adaptive bitrate (ABR) can achieve higher Quality of Experience (QoE) while reducing network traffic. An ABR initialization method has been proposed for live streaming in ICN to facilitate traffic aggregation by the multicast function. In this method, multicast performance was partially improved, yet there still exists a technical issue on the bitrate selection mismatches due to underlying congestion windows asynchronization. In this paper, we propose a new traffic aggregation method that initializes both ABR bitrate selections and congestion control algorithms to facilitate traffic aggregation by triggering multicast in various conditions. Simulation results revealed that our proposed traffic aggregation scheme increased multicast performance by 54% compared to with the existing method.

关键词： multicast algorithms Simulation Bit rate Information-centric networking Telecommunication traffic Streaming media Throughput Synchronization Quality of experience Consumer electronics

来源：评论

学校读者我要写书评

暂无评论

Relay-Assisted multicast With Markov Mobility

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2020年第3期7卷 1055-1066页

作者： Gan, Xiaoying Feng, Chen Qin, Zhida Zhang, Ge Wu, Huaying Fu, Luoyi Wang, Xinbing Ma, Huadong Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 211189 Peoples R China Beijing Univ Posts & Telecommun Sch Comp Sci Beijing 100876 Peoples R China

In this paper, we investigate the capacity and delay tradeoff under multicast scheme in the MANET, based on a general Markovian mobility model. To reduce the delay of the network, we propose a relay-assisted multicast scheme. Specifically, a two-hop relay algorithm is developed, in which Lyapunov drift is utilized to derive the average packet delay. In addition, we utilize the cache in relay nodes and propose the two-hop relay algorithm with redundancy. Theoretical analysis indicates that the network delay is significantly decreased, whereas the capacity remains the same. To guarantee the fairness and efficiency of the network, a two-hop relay selection algorithm with redundancy is proposed to decide which packet to serve in a queue. Moreover, the minimum energy function is applied to characterize the energy consumption of each node. We accordingly derive the accurate minimum energy function under the proposed relay-assisted multicast scheme. Furthermore, we design an efficient minimum energy algorithm, which pushes the actual energy consumption arbitrarily close to the minimum energy function at the cost of increasing delay. Theoretical results show that the optimal energy-delay tradeoff is achieved in our proposed algorithm. Numerous experiments are carried out to evaluate the performance of our proposed algorithms, where the experimental results well conform our theoretical findings.

关键词： Delays Relays Mobile ad hoc networks multicast algorithms Redundancy Wireless networks Energy consumption Mobile ad hoc networks multicast capacity delay tradeoff

来源：评论

学校读者我要写书评

暂无评论

Task-Oriented Semantic Information Allocation Based on Rate Splitting for Cost Minimization

Task-Oriented Semantic Information Allocation Based on Rate ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Jiarong Lu Xi Li Heli Zhang Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

Task-oriented semantic communication effectively facilitates the completion of specific tasks by conveying users' interests. Nevertheless, when a base station conveys task-oriented semantic information to multiple users, these users exhibit both shared and distinct interests, which leads to increased redundancy and communication costs. To reduce transmission redundancy and cost, in this paper, a flexible and efficient multicast and unicast transmission scheme based on task-oriented semantic information is investigated for users with overlapping interests. Specifically, a joint energy-delay cost function is adopted to measure the communication cost caused by transmission redundancy, which facilitates a trade-off between energy consumption and transmission delay. Then, to minimize the network cost, this paper leverages the inherent benefits of common and private streams in rate splitting multiple access (RSMA) and design a semantic information allocation strategy. The RSMA common stream is further divided into the super-common and user-common streams. A semantic information allocation mechanism is established according to the common and private streams to flexibly allocate multiple semantic information. Then, semantic information selection on super-common stream, the proportional strategy of user-common stream, and rate splitting are jointly designed to minimize the network cost. The problem is a mixed-integer problem. Block coordinate descent and successive convex approximation technique are adopted to address it. An algorithm, namely SURA, is proposed for semantic information allocation in RSMA networks. Simulation results demonstrate the proposed SURA algorithm can adaptively allocate semantic information and reduce the network cost.

关键词： Costs multicast algorithms Unicast Simulation Semantics Redundancy Minimization Approximation algorithms Resource management Streams

来源：评论

学校读者我要写书评

暂无评论

Recursive Broadcasting Approach

Recursive Broadcasting Approach

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Hovhannes A. Harutyunyan Narek Hovhannisyan Department of Computer Science and Software Engineering Concordia University Montreal QC Canada NAS RA Institute for Informatics and Automation Problems Yerevan Armenia

ISBN: (数字)9798331524937

ISBN: (纸本)9798331524944

Broadcasting is one of the fundamental information dissemination primitives in interconnection networks, where a message is passed from one node (called originator) to all other nodes in the network. Following the increasing interest in interconnection networks, extensive research was dedicated to broadcasting. Two main research goals of this area are finding inexpensive network structures that maintain efficient broadcasting and finding the broadcast time for well-known and widely used network topologies. In the scope of this study, we will mainly focus on determining the broadcast time and nearoptimal broadcasting schemes in networks. Determination of the broadcast time of any node in an arbitrary network is known to be NP-hard. Polynomial time solutions are known only for a few network topologies. There also exist various heuristic and approximation algorithms for different network topologies. In this study, we consider the broadcast time problem on graphs that comprise some recursive structures. We initiate a novel direction to designing broadcasting algorithms on recursively defined graphs. We provide a theoretical foundation for future broadcasting studies, as well as discuss several practical applications of the approach we introduce.

关键词： multicast algorithms Network topology Multiprocessor interconnection Heuristic algorithms Broadcasting Approximation algorithms Polynomials Topology

来源：评论

学校读者我要写书评

暂无评论

Robust Design for the IRS-Assisted multicast Communications with Statistical CSI Errors

Robust Design for the IRS-Assisted Multicast Communications ...

引用

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Bolin Chen Jiangtian Nie Weiheng Jiang Xiaonan Zhang Zehui Xiong School of Microelectronics and Communication Engineering Chongqing University Chongqing China School of Computer Science and Engineering Nanyang Technological University Singapore Department of Computer Science Florida State University Florida USA Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore

ISBN: (纸本)9781665435413

Intelligent reflecting surface (IRS) is considered as an effective technology to enhance the performance of wireless communication systems. In this paper, the robust optimization design of the IRS-assisted wireless multi-group multicast MISO system with statistical CSI errors is investigated. Two optimization problems, namely max-min fairness problem and QoS problem, are discussed separately. In order to deal with the non-convex imperfect CSI constraint, the Bernstein-type inequality is utilized to transform the outage probability constraint into a second-order cone (SOC) constraint and linear inequalities. Furthermore, two efficient algorithms based on alternating optimization (AD) are proposed to solve the reformulated problems, respectively. In particular, the semi-definite relaxation (SDR) technique is applied to optimize the transmit beamforming and IRS reflection coefficients. The numerical simulation results indicate that by deploying IRS and utilizing the proposed algorithms, the system performance can be improved significantly. However, the gain of introducing IRS in the system heavily depends on the bound of the CSI error.

关键词： Wireless communication multicast algorithms Uncertainty System performance Simulation Transforms Quality of service

来源：评论

学校读者我要写书评

暂无评论

Cache Update algorithms for multicasting Without File Splitting

Cache Update Algorithms for Multicasting Without File Splitt...

引用

Asilomar Conference on Signals, Systems & Computers

作者： David Garrido Hashem Moradmand Borja Peleato Signal Theory and Communications Universidad Carlos III de Madrid Spain Satellite Broadcast Station IRIB Iran The Instituto de Investigación Sanitaria Gregorio Marañón (IiSGM).

ISBN: (数字)9798350354058

ISBN: (纸本)9798350354065

Coded caching reduces peak transmission rates on shared wireless links by pre-storing content at user terminals during low-traffic periods and using multicasting during peak hours. However, most current methods require dividing each file into many segments and sending numerous messages, making these methods impractical for large systems due to complex book-keeping and sub-packetization. This work proposes and evaluates three decentralized algorithms for cache updating using intercepted messages: Max-Pairs, which maximizes expected pairings; a deep-Q-learning (DQL) algorithm for selfish users; and a reinforcement learning scheme that balances service times. These algorithms assume that files are cached as whole units and an uninterrupted stream of user requests. Simulations show that our approaches outperform Uniform Caching and Least Frequently Used (LFU) policies.

关键词： Computers multicast algorithms Heuristic algorithms Wireless networks Reinforcement learning multicast communication Numerical simulation Servers Resource management

来源：评论

学校读者我要写书评

暂无评论

algorithms and Simulation Design of DTP Multi-Mode Configuration

Algorithms and Simulation Design of DTP Multi-Mode Configura...

引用

International Conference on Microwave and Millimeter Wave Technology Proceedings

作者： Kang Liu Cheng Zhang Pengfei Qin Longteng Yi Kaiqiang Qi China Academy of Space Technology Beijing China

ISBN: (数字)9798350389968

ISBN: (纸本)9798350389975

Digital Transparent Processor (DTP) is becoming an important direction for the development of flexible digital payload because of its flexible channel routing capability. In order to realize the communication of DTP in unicast and multicast mode, it is necessary to configure the routing and switching network, named TST (Time-Space-Time) of DTP. In order to meet the demand for the hinge of specified DTP sub-band, the unicast configuration, incremental configuration and multicast configuration algorithms based on column priority permutation are proposed. Two intermediate matrices representing the routing path of TST network are solved, so as to complete the configuration of DTP multi-mode sub-band hinge relationship. Finally, the DTP digital simulation and verification system is carried out to demonstrate and verify the flexible routing ability of DTP, which provides a reference for the system design of flexible digital payload in the future.

关键词： Microwave integrated circuits multicast algorithms Unicast Millimeter wave technology Switches Fasteners Routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：