scholarly journals Peer-to-Peer Multicasting Inspired by Huffman Coding

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Bartosz Polaczyk ◽  
Piotr Chołda ◽  
Andrzej Jajszczyk
Keyword(s):  
Source Coding ◽  
Peer To Peer ◽  
Multicast Tree ◽  
Huffman Coding ◽  
Live Streaming ◽  
Link Failures ◽  
Tree Construction ◽  
High Level ◽  
Streaming Multicast ◽  
Effective Use

Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.

Application Layer Multicast Based Services on Hierarchical Peer to Peer Architecture

2019 ◽  
Vol 892 ◽  
pp. 64-71
Author(s):  
Mourad Amad ◽  
Abdelmalek Boudries ◽  
Lyes Badis
Keyword(s):  
Peer To Peer ◽  
Multicast Tree ◽  
Second Step ◽  
Application Layer Multicast ◽  
Core Network ◽  
Application Layer ◽  
Construction Algorithm ◽  
Tree Construction ◽  
Proposed Model ◽  
Multicast Services

Application Layer Multicast (ALM) is considered as an attractive approach for implementing wide area multicast services. In ALM, multicast functionality is implemented at the edge instead of the core network (routers). As opposed to network-layer multicast, application layer multicast requires no infrastructure support and can be easily deployed in the Internet. In this paper, we propose a new efficient and scalable model for optimizing application layer multicast using HPM architecture (HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity). This approach benefits from P2P properties and characteristics. In this contribution, we consider our optimized tree construction algorithm simultaneously for each ring of HPM. The global tree construction algorithm is composed of two steps. In the first step, we construct a sub-tree for each ring; the second step is to build a global tree using sub sets of adjacent rings in HPM architecture. The proposed model inherits from main P2P attributes such as: scalability, fault tolerance characterized HPM. Preliminarily performance evaluations show that results are globally satisfactory, the depth of the resulting multicast tree is optimized.

scholarly journals SDN Programming for Heterogeneous Switches with Flow Table Pipelining

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Junchang Wang ◽  
Shaojin Cheng ◽  
Xiong Fu
Keyword(s):  
Building Blocks ◽  
Flow Rule ◽  
Link Failures ◽  
Flow Table ◽  
Network Link ◽  
Rule Sets ◽  
Rule Set ◽  
State Changes ◽  
High Level ◽  
Effective Use

High-level programming is one of the critical building blocks of the effective use of software-defined networking (SDN). Existing solutions, however, either (1) cannot utilize the state-of-the-art switches with flow table pipelining, a key technique to prevent flow rule set explosion or (2) force programmers to manually organize and manage hardware flow table pipelines, which is time-consuming and error-prone. This paper presents a high-level SDN programming framework to address these issues. The framework can automatically (1) generate rule sets for heterogeneous switches with different flow table pipelining designs and (2) update installed rules when the network state changes. As a result, the framework can not only generate efficient rule sets for switches but also provide programmers a centralized, intuitive, and hence easy-to-use programming API. Experiments show that the framework can generate compact rule sets that are 29–116 times smaller than those generated by other open-source SDN controllers. Besides, the framework is 5 times faster to recover from network link failures in comparison to other controllers.

Netzwerkeffizienz stabiler Overlay-Streaming-Topologien (Network Efficiency of Stable Overlay Streaming Topologies)

2007 ◽  
Vol 49 (5) ◽  
Author(s):  
Jens Wildhagen ◽  
Thorsten Strufe ◽  
Günter Schäfer
Keyword(s):  
Peer To Peer ◽  
Live Streaming ◽  
Network Efficiency

ZusammenfassungZur Verteilung von Multimediadaten werden mit Peer-to-Peer-Ansätzen Overlay-Netze konstruiert, welche die Teilnehmer logisch durch Kanten verbinden und so eine abstrakte Nachbarschaft definieren. Bei der Konstruktion solcher Overlays für multimediale Live-Streaming-Anwendungen sind zwei Eigenschaften der Topologien von besonderer Bedeutung: die Netzwerkeffizienz bei der Paketverteilung und die Stabilität sowohl gegenüber zufälligen Knotenausfällen als auch vorsätzlichen Sabotageangriffen. In bisherigen Arbeiten zur Steigerung der Stabilitätseigenschaften entstehender Topologien finden Effizienzeigenschaften zumeist keine Berücksichtigung. Um diese Lücke zu schließen, wird in dem vorliegenden Artikel ein Verfahren vorgestellt, das es ermöglicht, einen Kompromiss zwischen der Effizienz und der Stabilität konstruierter Topologien zu finden. Hierzu werden zunächst Stabilitäts- und Effizienzeigenschaften in Form von Kostenmetriken operationalisiert und darauf aufbauend ein verteilter Algorithmus zur dynamischen Topologieoptimierung vorgestellt, der eine Gesamtkostenfunktion optimiert, die durch eine parametrisierbare, gewichtete Kombination der Einzelmetriken definiert ist. Mit Hilfe einer Simulationsstudie wird gezeigt, dass auf diese Weise gute Kompromisse zwischen Effizienz und Stabilität bei der Topologiekonstruktion gefunden werden können.

scholarly journals QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

2010 ◽  
Vol 33 (4) ◽  
pp. 512-522 ◽  
Author(s):  
Hui Cheng ◽  
Xingwei Wang ◽  
Shengxiang Yang ◽  
Min Huang ◽  
Jiannong Cao
Keyword(s):  
Multicast Tree ◽  
Optical Internet ◽  
Tree Construction ◽  
Multicast Tree Construction

scholarly journals On the feasibility of centrally-coordinated Peer-to-Peer live streaming

2011 ◽  
Author(s):  
Roberto Roverso ◽  
Amgad Naiem ◽  
Mohammed Reda ◽  
Mohammed El-Beltagy ◽  
Sameh El-Ansary ◽  
...  
Keyword(s):  
Peer To Peer ◽  
Live Streaming
Sign in / Sign up

Export Citation Format

Share Document