Purpose – This paper aims to discuss problems, requirements and current trends for deploying group communication in real‐world scenarios from an integrated perspective.Design/methodology/approach – The Hybrid Shared Tree is introduced – a new architecture and routing approach to combine network – and subnetwork‐layer multicast services in end‐system domains with transparent, structured overlays on the inter‐domain level.Findings – The paper finds that The Hybrid Shared Tree solution is highly scalable and robust and offers provider‐oriented features to stimulate deployment.Originality/value – A straightforward perspective is indicated in the paper for a mobility‐agnostic routing layer for future use.

/pdf/between-underlay-and-overlay-on-deployable-efficient-4i1uhgtsdv.pdf

Between underlay and overlay: On deployable, efficient, mobility‐agnostic group communication services

This chapter provides an overview of structured Peer-to-Peer overlay algorithms. The chapter introduces basic concepts including geometries, routing algorithms, routing table maintenance, node join/leave behaviour, and bootstrapping of structured Peer-to-Peer overlay algorithms. Based on these key concepts, a number of key overlay algorithms are classified into categories and a brief over-view of these algorithms is presented. Finally, the chapter presents an ’on-a-glance’ comparison of the presented algorithms and provides an outlook on open research issues.

Overview of Structured Peer-to-Peer Overlay Algorithms

Today?s large-scale distributed systems consist of collections of nodes that have highly variable availability - a phenomenon sometimes called churn. This availability variation is often a hindrance to achieving reliability and performance for distributed applications such as multicast. This paper looks into utilizing and leveraging availability information in order to provide availability-dependent message reliability for multicast receivers. An application (e.g., a publish-subscribe system) may want to scale the multicast message reliability at each receiver according to that receiver?s availability (in terms of the fraction of time that receiver is online) - different options are that the reliability is independent of the availability, or proportional to it.. We propose several gossip-based algorithms to support several such predicates. These techniques rely on each node?s availability being monitored in a distributed manner by a small group of other nodes in such a way that the monitoring load is evenly distributed in the system. Our techniques are light-weight, scalable, and are space- and timeefficient. We analyze our algorithms and evaluate them experimentally by injecting availability traces collected from real peer-to-peer systems.

https://www.ideals.illinois.edu/bitstream/handle/2142/11205/AVCast%20New%20Approaches%20For%20Implementing%20Availability-Dependent%20Reliability%20for%20Multicast%20Receivers.pdf?sequence=2

AVCast : New Approaches For Implementing Availability-Dependent Reliability for Multicast Receivers

End-to-end quality of service seen by applications: A statistical learning approach

Application layer multicast is probably the most efficient scheme to sustain the group communication for delay sensitive applications in Internet due to its rapid deployment. However, the problem of building a degree-constrained minimum delay application layer multicast tree is proven to be NP-hard. In this paper, we investigate this optimization problem and propose a distributed protocol to explore the method of constructing distribution tree based on members' relative position in underlying network, which utilizes physical network topology information to assist the optimizing of delivery tree through employing proximity aware technique for overlay network. Evaluation results show our scheme achieves efficiency as well as may support real time applications effectively.

Constructing a Degree-Constrained Low Delay Application Layer Multicast Tree

Application-Level.- Latency and User Behaviour on a Multiplayer Game Server.- Application-Level Multicast Using Content-Addressable Networks.- Scribe: The Design of a Large-Scale Event Notification Infrastructure.- Group Management.- Scamp: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication.- Extremum Feedback for Very Large Multicast Groups.- An Overlay Tree Building Control Protocol.- Performance.- The Multicast Bandwidth Advantage in Serving a Web Site.- STAIR: Practical AIMD Multirate Multicast Congestion Control.- Impact of Tree Structure on Retransmission Efficiency for TRACK.- Security.- Framework for Authentication and Access Control of Client-Server Group Communication Systems.- Scalable IP Multicast Sender Access Control for Bi-directional Trees.- EHBT: An Efficient Protocol for Group Key Management.- Topology.- Aggregated Multicast with Inter-Group Tree Sharing.- Tree Layout for Internal Network Characterizations in Multicast Networks.

Markus Hofmann

Papers

Networked group communication : third International COST264 Workshop, NGC 2001, London, UK, November 7-9, 2001 : proceedings

Proceedings of the Third International COST264 Workshop on Networked Group Communication