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

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

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of three multicast resource allocation algorithms

Performance analysis of three multicast resource allocation ...

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： A.S. Anpalagan R.K. Pankaj Department of Electrical and Computer Engineering University of Toronto Toronto Canada

multicast applications such as electronic news delivery and live sports Webcasting grow with the Internet. These Web-based services demand high quality of service in the competitive global Internet business. Resources such as bandwidth and buffer space need to be reserved for different sessions to provide such guaranteed services. We analyze the performance of three multicast resource allocation algorithms, namely equal allocation with reclaim on all links (EAR-ALL), EAR-OPT and EAR-LL-a simple algorithm that reclaims only on the last link as opposed to all possible links. Simulation results using packetized voice sources on the MBONE network are reported comparing the performance in terms of bandwidth, call blocking and new receiver joining probability.

关键词： Performance analysis Resource management multicast algorithms Quality of service Bandwidth Algorithm design and analysis Routing Application software Web and internet services Teleconferencing

来源：评论

学校读者我要写书评

暂无评论

Learning to Beamform in Joint multicast and Unicast Transmission With Imperfect CSI

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第5期71卷 2711-2723页

作者： Zhang, Zhe Tao, Meixia Liu, Ya-Feng Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Cooperat Medianet Innovat Ctr CMIC Shanghai 200240 Peoples R China Chinese Acad Sci Inst Computat Math & Sci Engn Comp Acad Math & Syst Sci State Key Lab Sci & Engn Comp Beijing 100190 Peoples R China

With the rapid development of mobile Internet, the demand for multicast is growing rapidly, such as content pushing and video streaming. The multicast service is usually offered to users without interrupting their on-going unicast transmission, and thus the multicast and unicast beamformers needs to be jointly designed, which generally requires perfect channel state information (CSI). However, perfect CSI is usually unavailable due to the channel estimation error. In this paper, we propose a learning based approach to jointly design the multicast and unicast beamformers with imperfect CSI. To learn the beamforming strategy, a new graph neural network (GNN) based architecture named unicast-multicast GNN (UMGNN) is proposed, which only requires the estimated channel. UMGNN can guarantee the permutation invariance/equivalence and model the special property in the multicast transmission, i.e., the multicast rate is determined by the worst user. Moreover, by sharing the parameters across different users, UMGNN exhibits a pretty good scalability to different number of users. Numerical results show that UMGNN outperforms a fully connected neural network and a widely used sampling-based algorithm. To highlight its performance in the multicast transmission, we also show that UMGNN can find the correct worst user that determines the multicast rate.

关键词： Unicast Array signal processing Optimization multicast algorithms Graph neural networks Channel estimation Interference Joint multicast and unicast transmission beamforming imperfect CSI UMGNN

来源：评论

学校读者我要写书评

暂无评论

Practical algorithms for multicast support in input queued switches

Practical algorithms for multicast support in input queued s...

引用

IEEE Workshop on High Performance Switching and Routing

作者： A. Bianco P. Giaccone C. Piglione S. Sessa Dipartimento di Elettronica Politecnico di Turino Torino Italy

This paper deals with multicast flow support in NtimesN input queued switch architectures. A practical approach to support multicast traffic is presented, assuming that O(N) queues are available at each input port. The focus is on dynamic queueing policies, where, at each input port, multicast flows are assigned to one among the available queues when flows become active: flows are assigned to queues according to switch queue status and, possibly, to flow information. We discuss queueing assignments, scheduling algorithms and flow activity definition models. We explain why dynamic queueing disciplines may outperform static policies, and we show that, even in the most favorable conditions for static policies, they provide comparable performance

关键词： multicast algorithms Switches Traffic control Fabrics Unicast Load management Scheduling algorithm Packet switching Bandwidth Scalability

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for Batch Re-Keying Operations in Secure multicast

Efficient Algorithms for Batch Re-Keying Operations in Secur...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： M.H. Heydari L. Morales I.H. Sudborough Department of Computer Science James Madison University Harrisonburg VA U.S.A Department of Computer Science and Information Systems Texas A and M University Commerce TX USA Department of Computer Science and Information Systems Texas A&M University-Commerce Commerce TX U.S.A Department of Computer Science University of Texas at Dallas Dallas TX U.S.A

Secure multicast has a variety of applications in e-commerce, e-banking, command and control, video-on-demand, and other internet-based services. In this paper, we present algorithms to improve on the number of re-keying messages (overhead) needed to add and delete sets of users to a secure multicast group. We present upper and lower bounds on the number of re-keying bits to add or delete groups of users from secure multicast groups. We also show how to amortize the cost of group re-keying over time to avoid long periods of system overhead that can potentially block the transmission of desired data at times when large numbers of users simultaneously join or leave multicast sessions.

关键词： multicast algorithms Computer science Cryptography Electronic commerce Command and control systems Web and internet services Data security Binary trees Information systems Business

来源：评论

学校读者我要写书评

暂无评论

On multicast path finding algorithms

On multicast path finding algorithms

引用

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

作者： C.-H. Chow Bell Communications Research Inc. Morristown NJ USA

Three multicast path-finding algorithms for networks with directed links are designed and implemented: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show that the heuristic algorithms can find multicast paths whose costs are close to optimal and can operate with reasonable response time for large networks. Applications of these path-finding algorithms to set up multipoint connections for broadband multimedia multiparty services are discussed.< >

关键词： multicast algorithms Heuristic algorithms Cost function Dynamic programming Communication switching Multimedia communication Polynomials Tree graphs Algorithm design and analysis Computer networks

来源：评论

学校读者我要写书评

暂无评论

How to use multicast in distributed mutual exclusion algorithms for grid file systems

How to use multicast in distributed mutual exclusion algorit...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Aurelien Ortiz Francois Thiebolt Jacques Jorda Abdelaziz M'zoughi IRIT Université Paul Sabatier Toulouse III Toulouse Cedex France

In a file system, critical sections are represented by means of read or write operations on useful data (i.e files) as well as metadata of the system. The processes must be synchronized to reach these shared resources, thanks to mutual exclusion algorithms which guarantee data consistency. In a grid environment, processes are compared to grid nodes and their synchronization is ensured by the sending of messages on the network. Moreover, the access time to a critical section is conditioned by the high latency of the network. In this paper, we propose a method based on the use of the multicast, which makes it possible in some cases to decrease the access time to critical sections. This solution was implemented within a token- and tree-based distributed mutual exclusion algorithm and it was integrated in the grid middleware named ViSaGe.

关键词： multicast algorithms File systems Delay Middleware Testing Network servers Network topology Distributed algorithms Concurrent computing File servers

来源：评论

学校读者我要写书评

暂无评论

Toward Concurrent Video multicast Orchestration for Caching-Assisted Mobile Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第12期70卷 13205-13220页

作者： Zhang, Xinchang Wang, Yinglong Yang, Meihong Geng, Guanggang Qilu Univ Technol Shandong Acad Sci Coll Comp Sci & Technol Jinan 250014 Peoples R China Qilu Univ Technol Shandong Acad Sci Shandong Prov Key Lab Comp Networks Jinan 250014 Peoples R China Jinan Univ Coll CyberSecur Guangzhou 510632 Peoples R China

multicasting does not work well for video applications such as video on demand, where individual users request video content at discrete and unpredictable moments. In this paper, we study a concurrent video multicast orchestration solution for the caching-assisted and centrally controlled mobile networks. The proposed solution strives to obtain rapid video prefetch and effective traffic reduction. By rapid video prefetch, user devices can cache required contents in advance, which can effectively improve the streaming fluency in unsteady wireless environments, especially the highly mobile vehicular environment. We introduce a maximum-rate concurrent multicast (MRCM) problem whose solution is intended to maximize the total video delivery rate by a concurrent multicast manner, and prove that the MRCM problem is NP-hard. Then, we propose a dynamic concurrent multicast tree construction algorithm and a global concurrent multicast tree optimization algorithm to approximately solve the MRCM problem in polynomial time. We also introduce a cache competition mechanism that strives to maximize the total cache hit rate when the cache space is insufficient. Performance evaluations show that compared with the existing cache-assisted multicast delivery solutions, the proposed solution significantly reduces the video delivery duration and the traffic stress of backhaul links.

关键词： Streaming media Heuristic algorithms Optimization Wireless communication Prefetching multicast algorithms Device-to-device communication Content caching multicast vehicular video streaming mobile network

来源：评论

学校读者我要写书评

暂无评论

Solving QoS multicast routing with genetic algorithms

Solving QoS multicast routing with genetic algorithms

引用

International Conference on Information, Communications and Signal Processing

作者： H.T. Tran R.J. Harris School of Electrical and Computer Engineering RMIT University Melbourne Australia

Proliferation of group-based real-time applications, such as online games and video conferencing motivates research into QoS multicast routing. This type of applications requires consideration of both end-to-end delay (i.e., packet delay from the source to all destinations is bounded) and group synchronisation (i.e., the difference in packet delay from the source to different destinations is bounded) constraints. In this paper, we describe the combined problem of multicast routing and delay partitioning with end-to-end delay and group synchronization constraints in a QoS framework where a delay dependent cost function is associated with each network link [H.T. Tran and R. J. Harris, 2003]. Due to NP-completeness of this problem, a genetic algorithm (GA) based algorithm, that computes a source-based multicast tree that meet both requirements with near-optimal cost, is developed. In our GA, we compare two different tree encoding techniques: link weight and link bias encoding, and by the means of simulation, find that link weight encoding is less effective than link bias coding. The simulation result also shows that our GA consistently performs better than two other simple heuristics.

关键词： Routing Genetic algorithms Delay Encoding Computational modeling Games Videoconference Cost function multicast algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：