An optimal discrete rate allocation for overlay video multicasting

2009 7th International Workshop on Design of Reliable Communication Networks

2009

At the present time there are many Peer-to-Peer (P2P) multicasting systems supporting live streaming, i.e. real-time dissemination of various content issued at a source node towards a set of receivers. The objective of content distributing can be twofold: maximization of the system throughput (i.e. the streaming rate) and minimization of the streaming cost while guaranteeing the particular streaming rate. In this we paper we focus on P2P multicasting applied for delivering very important content, which need delivery guarantees, e.g. weather forecast, hurricane warnings, distribution of security updates, stock exchange data, etc. To protect the system against failures several (at least two) multicasting trees are established. We tackle the question of how additional survivability constraints guaranteeing failure-disjoint trees influence the cost and throughput of the P2P multicasting system. We consider failures of the following network elements: overlay link, upstream node and ISP link. To investigate the problem we use both simulations and offline optimization methods. According to our results, the additional requirements necessary for protection do not have a substantial impact on the P2P multicasting system performance.

Section: A Conceptmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Survivability of P2P multicasting

2009 7th International Workshop on Design of Reliable Communication Networks

2009

“…In delay tolerant applications such as live streaming, the time is very critical, and the content quickly loses relevance after a few seconds of delay. Many proposed solutions have taken into account P2P or application-layer multicasting, which are the names for the overlay streaming approaches [7], [8], [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Heuristic algorithm for maximizing streaming rate in overlay multicast with budget constraint

Szostak

2012 15th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)

2012

Computers have taken over leadership from the radio and television and became one the most ubiquitous of consumerelectronic appliances. Thanks to the Internet, not only do they incorporate all radio's and television's features like Digital TV and Radio Broadcasting, but they also introduce new facilities. This causes rapid increase of the number of network users, which in turn translates into necessity for high bandwidth. Upgrading physical links in traditional Content Distribution Networks (CDN) is very expensive, therefore many approaches to content distribution have been developed over the last decade. In this paper we focus on overlay multicast due to its relatively low cost of implementation. This is accomplished thanks to the fact that overlay multicast systems are built on the top of the existing network infrastructure. Based on the previous works, we focus on the problem of simultaneous optimization of multicast flows and links' capacity of nodes participating in the overlay multicast. We assume a system with one central source of content, streaming multiple substreams to peers requesting particular amount of them, depending on the quality of the service required. The objective is to maximize the overall streaming rate of the network with additional constraint of budget to be spent on the system deployment. We propose an effective heuristic algorithm to solve the problem and compare it with results delivered by CPLEX solver. Moreover, in numerical experiments we show how various constraints following from real systems influence the behavior of the system.

“…It derives from the fact that the overlay architecture for multicast streaming reduces many pure network layer drawbacks and provides potential scalability and easy deployment of new protocols independent of the network layer solutions and service providers interfaces at relatively low costs. Over the years, a lot of research have been devoted to support overlay multicast and many protocols for such concepts have been already proposed [3,5,27,28,37,38,46,49].…”

Section: Introductionmentioning

confidence: 99%

Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees

Kucharzak

2013

Telecommun Syst

Overlay networks employ underlying network technologies in order to provide end-system related communication and over the years overlays have been getting more and more attention in research community and in business world as well. Since overlays tackle many drawbacks present in pure "link-router-network" engineering, they have become an excellent solution for multimedia-oriented applications. A good example comprises multicast communications, where an overlay system, in contrast to IP Multicast, eliminates many issues related to scalability or management control. This paper focuses on modeling and optimization of overlay multicast networks aimed at realizing maximum throughput with survivability constraints, where survivability defines the ability of a multicast system to limit potential throughput losses in case of a failure of single virtual link. We present linear formulation derived from fractional tree packing problems based on predefined topologies which may route multicast traffic. Linear model might be used for obtaining optimal multicast structures, however its applicability is limited by increasing sizes of networks. Hence, we also design and evaluate heuristic searches dedicated to optimization of maximum flow survivable overlay multicast networks.