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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

WDM multicast Tree Construction algorithms for Minimizing Blocking Probability under a Delay Constraint

WDM Multicast Tree Construction Algorithms for Minimizing Bl...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Tsutomu Makabe Toyofumi Takenaka Department of Computer Science Graduate School of Engineering Nihon University Fukushima Japan

We propose novel tree construction algorithms for multicast communication in photonic networks. Since multicast communications consume many more link resources than unicast communications, effective algorithms for route selection and wavelength allocation are required. We propose novel tree construction algorithms called the weighted Steiner tree (WST) algorithm and the composite weighted Steiner tree (CWST) algorithm. Since the proposed Weighted Steiner Tree algorithm takes account of the number of wavelengths available for each link, this algorithm can select those links which have larger number of available wavelengths. By using this link selection technique, this algorithm can accept many more multicast requests than other multicast tree construction algorithms. However, under certain delay constraints, the blocking characteristics of the proposed weighted Steiner tree algorithm deteriorate since some light paths between source and destination use long hops and cannot satisfy the delay constraint. In order to adapt the approach to the delay-sensitive environments, we have devised the composite weighted Steiner tree algorithm comprising the weighted Steiner tree algorithm and the Dijkstra algorithm for use in a delay constrained environment such as an IPTV application. In this paper, we also give the results of simulation experiments which demonstrate the superiority of the proposed composite weighted Steiner tree algorithm compared with the distributed minimum hop tree (DMHT) algorithm, from the viewpoint of the light-tree request blocking probability.

关键词： Wavelength division multiplexing multicast algorithms Delay Photonics multicast communication IPTV Computer science WDM networks Large-scale systems Next generation networking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Approximation and heuristic algorithms for minimum delay application-layer multicast trees

Approximation and heuristic algorithms for minimum delay app...

引用

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

作者： E. Brosh Y. Shavitt Department of EE-Systems Tel-Aviv University Ramat-Aviv Israel

We investigate the problem of finding the minimum delay application-layer multicast trees, such as the trees constructed in overlay networks. It is accepted that shortest path trees are not a good solution for the problem since such trees can have nodes with very large degree, termed high load nodes. The load on these nodes makes them a bottleneck in the distribution tree, due to computation load and access link bandwidth constrains. Many previous solutions limited the maximal degree of the nodes by introducing arbitrary constraints. In this work, we show how to directly map the node load to the delay penalty at the application host, and create a new model that captures the trade offs between the desire to select shortest path trees and the need to constrain the load on the hosts. In this model the problem is shown to be NP-hard. Therefore, we present a logarithmic approximation algorithm and an alternative heuristic solution. Our heuristic algorithm is shown by simulations to be scalable for large group sizes, and produces results that are very close to optimal.

关键词： Approximation algorithms Heuristic algorithms multicast algorithms Delay Routing Bandwidth Cost function Proposals Hydrogen Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for multicast path setup in data networks

Distributed algorithms for multicast path setup in data netw...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： F. Bauer A. Varma Computer Engineering Department University of California Santa Cruz CA USA

Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding multicast trees in point-to-point data networks. These algorithms are based on two centralized Steiner heuristics, the shortest path heuristic (SPH) and the Kruskal-based shortest path heuristic (K-SPH), and have the advantage that only the multicast members and nodes in the neighborhood of the multicast tree need to participate in the execution of the algorithm. We compare our algorithms by simulation against a baseline algorithm, the pruned minimum spanning-tree heuristic, which is the basis of many previously published algorithms for finding multicast trees. Our results show that the competitiveness (the ratio of the sum of the heuristic tree's edge weights to that of the best solution found) of both of our algorithms was on the average 25 percent better in comparison to those produced by the pruned spanning-tree approach. In addition, our algorithm's competitiveness in almost all cases was within 10 percent of the best solution found by any of the Steiner heuristics considered, including both centralized and distributed algorithms.

关键词： Distributed algorithms Intelligent networks Steiner trees multicast algorithms Computer networks Electronic mail Radio access networks Upper bound Algorithm design and analysis Analytical models

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for computation of fair rates in multirate multicast trees

Distributed algorithms for computation of fair rates in mult...

引用

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

作者： S. Sarkar L. Tassiulas Department of Electrical and Computer Engineering and Institute for Syslcnis Research University of Maryland College Park MD USA University System of Maryland Adelphi MD US

We study fairness in arbitrary networks with multicast capabilities. multicast traffic in Internet and ATM provides a motivation for studying these networks. A study of fairness in multicast networks poses several interesting problems, e.g., the issue of inter-session fairness in addition to that of inter-session fairness in unicast networks. We develop a mathematical framework to model the fair allocation of bandwidth in multirate multicast networks with minimum and maximum rate constraints. We present distributed algorithms for computation of maxmin fair rates allocated to various source-destination pairs.

关键词： Distributed algorithms Distributed computing Computer networks multicast protocols Video sharing Intelligent networks Educational institutions IP networks Mathematical model multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：