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

Novel recursive multicast algorithms in multistage interconnection networks for ATM switches

JOURNAL OF HIGH SPEED NETWORKS 1999年第4期8卷 265-280页

作者： Park, J Yoon, H Elect & Telecommun Res Inst Switching & Transmiss Technol Dept Yuseong Gu Taejon 305350 South Korea Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea

In this paper, we study the multicast communication in the self-routing multistage interconnection network (MIN) for constructing asynchronous transfer mode (ATM) switch architectures. Many of these applications require multicast communications in addition to conventional point-to-point communications. multicast communication which the same message is delivered from a source to an arbitrary number of destinations, is fundamental in supporting collective communication primitives including cable TV, teleconferencing, and video-on-demand services. This paper presents a novel approach to supporting multicast communication, on the basis of the restricted address encoding scheme which constructs a short fixed-size multicast header and the recursive scheme that recycles a multicast packet one or more times through the network to reach at desired destinations. We also propose novel recursive multicast algorithms providing deadlock-freedom in MIN-based ATM switches. The emphasis is on evaluating the performance of these algorithms in terms of the number of recycling passes, the complexity of switching elements, and the number of links used. The proposed algorithms can be easily applicable to buffered MIN-based ATM switches.

关键词： multicast algorithms multistage interconnection networks ATM switch architectures recursive scheme header encoding schemes deadlock freedom

来源：评论

学校读者我要写书评

暂无评论

multicast algorithms for Multi-Channel Wireless Mesh Networks

Multicast Algorithms for Multi-Channel Wireless Mesh Network...

引用

The 15th IEEE International Conference on Network Protocols(ICNP 2007)(第15届IEEE国际网络协议大会)

作者： Guokai Zeng Bo Wang Yong Ding Li Xiao Matt Mutka Department of Computer Science and Engineering Michigan State University

multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multi cast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, respectively. However, in wireless mesh networks, which are required to provide high quality service to end users as the "last-mile" of the Internet, throughput maximization conflicting with scarce bandwidth has the paramount priority. We propose a Level Channel Assignment (LCA) algorithm and a Multi-Channel multicast (MCM) algorithm to optimize throughput for multi-channel and multi interface mesh networks. The algorithms first build a multicast structure by minimizing the number of relay nodes and hop count distances between the source and destinations, and use dedicated channel assignment strategies to improve the network capacity by reducing interference. We also illustrate that the use of partially overlapping channels can further improve the throughput. Simulations show that our algorithms greatly outperform the single-channel multicast algorithm. We observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.

关键词： multicast algorithms Wireless mesh networks Throughput Data communication Wireless sensor networks Spread spectrum communication Algorithm design and analysis Energy efficiency IP networks Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Distributed QoS constrained multicast algorithms

Distributed QoS constrained multicast algorithms

引用

Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： A. Karaman H. Hassanein School of Computing Queen's University Kingston ONT Canada

Broadband group communication over the Internet is becoming ubiquitous over a wide range of services. These applications are usually delay-sensitive and demanding on network resources. The multicast QoS-routing problem is usually described as the construction of constrained Steiner minimal tree (SMT). In this paper, we examine the proposed SMT heuristics in the literature confining our attention to constrained, distributed, asymmetric heuristics. We present a constrained-SMT algorithm, which is highly feasible for distributed processing.

关键词： multicast algorithms Surface-mount technology Routing Costs Delay Steiner trees Internet multicast protocols Distributed algorithms Pervasive computing

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast algorithms for high-speed routers

Efficient multicast algorithms for high-speed routers

引用

IEEE Workshop on High Performance Switching and Routing

作者： D. Stiliadis Bell Laboratories Holmdel NJ USA

Several types of applications, like broadcast video, interactive gaming, remote collaboration, etc., require multicast distribution of content. An important problem, from the router architecture perspective, is to distribute multicast content at high-speeds and over a large number of physical or logical interfaces. In order to forward multicast packets, the system must replicate the same packet, or pointers of the packet, to multiple interfaces. This function requires significant speed-up from the memories and the forwarding engines, and has become a key bottleneck for wide deployment of multicasting. Previous efforts to solve this problem have only led to statistical solutions that cannot provide a deterministic performance. As a result, temporary overload in multicast traffic could lead to unnecessary packet losses, even for unicast connections that share the same interfaces. We present a novel algorithm for managing multicast sessions, that offers isolation between interfaces, deterministic performance, and flexibility in the offered delays. To the best of our knowledge, this is the first algorithm proposed that can provide deterministic performance for multicast sessions in high-speed switches and routers, without any speed-up requirements.

关键词： multicast algorithms Switches Bandwidth Packet switching Delay Fabrics multicast protocols Payloads Multimedia communication Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Minimum hop-count multicast algorithms for reliable multiple-stream communications

Minimum hop-count multicast algorithms for reliable multiple...

引用

GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record

作者： Longsong Lin Lih-Chyau Wuu Cheng-Chin Lin Department of Electronic and Information Engineering National Yunlin University of Science and Technology Taiwan

ISBN: (纸本)0780341988

This article is concerned with the multicast problem in which many destinations simultaneously request multiple data streams from a source, and require them to be delivered reliably and in minimum hop distance. The basic idea is to induce a sub-graph from a given network using the breadth-first-search principle, and then based on this sub-graph, to construct the minimum hop-count multicast tree. After that, a bandwidth assignment algorithm and a level-by-level acknowledgment method are employed to enforce the reliable, concurrent delivery of the multiple streams. It is shown, through analysis and simulations on a class of random graphs, that our approach significantly reduces the number of transmissions and average packet delay.

关键词： multicast algorithms Streaming media Bandwidth Tree graphs Telecommunication traffic Web and internet services Network servers Web server Reliability engineering Telecommunication network reliability

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast algorithms for switch-based irregular heterogeneous networks of workstations

Efficient multicast algorithms for switch-based irregular he...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： A. Singhal M. Banikazemi P. Sadayappan D.K. Panda Department of Computer Science Ohio State Uinversity Columbus OH USA

ISBN: (纸本)0769509908

This paper considers the problem of efficient multicast on worm-hole routed irregular heterogeneous networks of workstations, using multiple unicast messages. The fundamental issues are the avoidance of link contention and effective use of the faster nodes in the system for distributing the multicast message. Previously proposed schemes have either considered optimization for heterogeneity or elimination of contention, but not both together. We present two algorithms that addresses both issues and demonstrate their superiority through simulation studies.

关键词： multicast algorithms Workstations Switches Communication switching Routing Unicast Scheduling System recovery Computer science Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Two hybrid multicast algorithms for optimizing resources in a distributed VoD system

Two hybrid multicast algorithms for optimizing resources in ...

引用

International Conference on Multimedia Modeling (MMM)

作者： S. Gonzalez A. Navarro J. Lopez E. Zapata Computer Architecture Dpt. University of Màlaga Malaga Spain

Among many different multicast approaches, batching and patching are two commonly used policies. In this paper, we propose two hybrid multicast algorithms inspired by the maximum factored queue length (MFQL) batching scheme - used to decide which video queue will be serviced with a multicast session - and by a threshold-based patching scheme - applied to control the partial streams transmission before a threshold is reached during an ongoing multicast session. The novelty is that our algorithms have been designed to efficiently handle the requests in a distributed VoD system while optimizing the usage of the sever/network resources. Precisely, one key issue in the optimization of these resources is the computation of the threshold. We show in this paper how that threshold is derived to deliver a service. In addition, we conduct some simulation experiments that provides us some insightful information about the impact that our threshold based multicast algorithms have in the average waiting time in a distributed VoD system.

关键词： multicast algorithms Switches Bandwidth Network servers Asynchronous transfer mode Streaming media Video on demand Computer architecture Algorithm design and analysis Design optimization

来源：评论

学校读者我要写书评

暂无评论

WSNp1-7: Distributed multicast algorithms for Lifetime Maximization in Wireless Ad Hoc Networks with Omni-directional and Directional Antennas

WSNp1-7: Distributed Multicast Algorithms for Lifetime Maxim...

引用

IEEE Globecom 2006

作者： Song Guo Victor C. M. Leung Oliver W. W. Yang Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada School of Information Technology and Engineering University of Ottawa Ottawa Canada

We consider the problem of maximizing the network lifetime for multicast connections in a wireless ad hoc network (WANET) that use omni-directional / directional antennas and have limited energy resources. Unlike most centralized multicast algorithms, we provide a globally optimal solution to this problem in a distributed manner in a WANET with omnidirectional antennas. This graph theoretic approach provides us insights into more general case of using directional antennas, and inspires us to produce a group of distributed algorithms. Simulation results show that our distributed algorithms outperform other centralized multicast algorithms significantly in terms of network lifetime.

关键词： multicast algorithms Mobile ad hoc networks Directional antennas Broadcasting Distributed algorithms Routing Energy efficiency Bandwidth Radio frequency Batteries

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast algorithms in all-port wormhole-routed hypercubes

Efficient multicast algorithms in all-port wormhole-routed h...

引用

International Conference on Parallel Processing (ICPP)

作者： V. Halwan F. Ozguner Department of Electrical Engineering Ohio State Uinversity Columbus OH USA

This paper presents several recursive heuristic methods for multicasting in all-port dimension-ordered wormhole-routed hypercubes. The methods described are stepwise contention-free and are primarily designed to reduce the number of communication steps. Experiments show that the number of steps can be significantly reduced compared to depth contention-free solutions previously described. These methods are also shown to be source-controlled depth contention-free and can be considered a generalization of the broadcast method described by C.T. Ho and M. Kao (1995) which is the most efficient method known.

关键词： multicast algorithms Hypercubes Signal processing algorithms Partitioning algorithms Network topology Broadcasting Signal processing Parallel machines Fault tolerance Terminology

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast algorithms for Mesh-connected Multicomputers

Efficient Multicast Algorithms for Mesh-connected Multicompu...

引用

International Conference on Information Visualisation (IV)

作者： H.A. Harutyunyan Shengjian Wang Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada

Performance of multicomputers largely depends on that of the underlying network communications such as multicast. Two major parameters used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic which refers to the total number of links involved. Mesh is a network topology widely used in multicomputers. It has been proved that, in mesh network, it is NP-hard to find the multicast routing which is optimal on both time and traffic. In this paper, we proposed two efficient multicast algorithms designed for store-and-forward switched mesh-connected multicomputers: DIAG and DDS. They are both tree-based shortest path multicast algorithms whose complexity is O(KN) or less. Performance evaluations of these algorithms resulted from simulations are given at the end

关键词： multicast algorithms Tree graphs Routing Telecommunication traffic multicast communication Network topology Algorithm design and analysis Computer science Software engineering Mesh networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：