๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Network interface multicast protocols for wormhole-based networks of workstations

โœ Scribed by Cosimo Anglano; Claudio Casetti; Emilio Leonardi; Fabio Neri


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
327 KB
Volume
29
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

โœฆ Synopsis


Wormhole-routing high-speed local area networks (e.g., Myrinet), increasingly used to build high-performance Network of Workstations, do not usually provide hardware support to multicast communication, that must instead be implemented in software by sending several point-to-point messages. Network Interface protocols allow an efficient software implementation of multicast communication, but require flow control techniques (to avoid buffer overflows) that may lead to a severe performance degradation. In this paper we address the problem of designing reliable and efficient Network Interface multicast protocols. We propose a flow control technique that provides the basis for four multicast protocols, and we perform extensive simulations to characterize the impact that various factors (such as network topology, presence of unicast traffic, composition of multicast groups, etc.) have on their performance. Interestingly, our simulation experiments sometimes lead to observations that are in contrast with previous results. In particular, the most simple multicasting algorithms (e.g., separate addressing) may outperform sophisticated algorithms usually considered more effective, such as those based on spanning-trees.


๐Ÿ“œ SIMILAR VOLUMES


On Multicast Algorithms for Heterogeneou
โœ R. Libeskind-Hadas; J.R.K. Hartline; P. Boothe; G. Rae; J. Swisher ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB

Networks of workstations (NOWs) provide an economical platform for high performance parallel computing. Such networks may comprise a variety of different types of workstations and network devices. This paper addresses the problem of efficient multicast in a heterogeneous communication model. Althoug

A dual-hamiltonian-path-based multicasti
โœ Nen-Chung Wang; Chih-Ping Chu; Tzung-Shi Chen ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercu

NLM: network-based layered multicast for
โœ K. Kang; D. Lee; H.Y. Youn; K. Chon ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 798 KB

Layered multicast has been considered to be an efยฎcient approach for coping with the network heterogeneity. Receiver-driven Layered Multicast (RLM) and its variants suggest that every receiver adjusts the reception level based on the packet loss rate. In this paper we propose a scheme called network

Exploring the design space of reliable m
โœ Dimitrios Koutsonikolas; Y. Charlie Hu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 465 KB

Many important applications in wireless mesh networks require reliable multicast communication, i.e., with 100% packet delivery ratio (PDR). Previously, numerous multicast protocols based on automatic repeat request (ARQ) have been proposed to improve the packet delivery ratio. However, these ARQ-ba

Cored-Based Tree with Forwarding Regions
โœ Sandeep K.S. Gupta; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 501 KB

In this paper we propose a new protocol for reliable multicast in a multihop mobile radio network. The protocol is reliable, i.e., it guarantees message delivery to all multicast nodes even when the topology of the network changes during multicasting. The proposed protocol uses a core-based shared t

Queuing network modeling for performance
โœ Takashi Ikegawa ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 694 KB

This paper presents a BCMP-type closed queuing network which models the error recovery defined as HDLC based protocols such as LAPB, LAPD, and LLC type 11. Throughput and average end-toend delay against the I-frame loss probability owing to bit errors are obtained by using the queuing network. With