Ethernet aggregation and core network models for effcient and reliable IPTV services

Hermsmeyer, Christian; Hernandez-Valencia, E.; Stoll, Dieter; Tamm, Oliver

doi:10.1002/bltj.20217

Cited by 7 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CVSAP problem differs from many models studied in the context of IPTV [17], sensor networks [12,13], or fiber-optical transport [17], to just name a few, in that the number and placement of processing locations is subject to optimization as well.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation

Rost,

Schmid

2013

Preprint

View full text Add to dashboard Cite

As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, universal nodes, or datacenter middleboxes can be used to process (e.g., filter, aggregate or duplicate) data. Based on this new networking paradigm, we formulate the Constrained Virtual Steiner Arborescence Problem (CVSAP) which asks for optimal locations to perform in-network processing, in order to jointly minimize processing costs and network traffic while respecting link and node capacities. We prove that CVSAP cannot be approximated (unless P = NP ), and accordingly, develop the exact algorithm VirtuCast to compute (near) optimal solutions. VirtuCast consists of: (1) a compact single-commodity flow Integer Programming (IP) formulation; (2) a flow decomposition algorithm to reconstruct individual routes from the IP solution. The compactness of the IP formulation allows for computing lower bounds even on large instances quickly, speeding up the algorithm. We rigorously prove VirtuCast's correctness. To complement our theoretical findings, we have implemented VirtuCast and present an extensive computational evaluation, showing that, using VirtuCast, realistically sized instances can be solved (close to) optimality. We show that VirtuCast significantly improves upon naive multi-commodity formulations and also initiate the study of primal heuristics to generate feasible solutions during the branch-and-bound process.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Efficient multicasting and aggregation is a mature research field, and many important theoretical and practical results have been obtained over the last decades. Applications range from IPTV [17] over sensor networks [12,13] to fiber-optical transport [17]. Fig.…”

Section: Introductionmentioning

confidence: 99%

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation

Rost,

Schmid

2013

Preprint

View full text Add to dashboard Cite

show abstract

“…When the video sub-streams within the multimedia sub-channel leave a managed core-network, they will be accessed over various network types such as Asymmetric Digital Subscriber Line (ADSL) (Zheng & Lin, 2000), broadband wireless including IEEE 802.16 (WiMAX) (She et al, 2007), or a passive optical network (Hermsmeyer et al, 2007). For example, in Lee et al (2009) the architecture of an IPTV scheme for mobile WiMAX is illustrated.…”

Section: Introductionmentioning

confidence: 99%

Intelligent Bandwidth Allocation of IPTV Streams with Bitstream Complexity Measures

Moiron

Razavi²,

Fleury

et al. 2013

International Journal of Handheld Computing Research

View full text Add to dashboard Cite

IPTV video services are increasingly being considered for delivery to mobile devices over broadband wireless access networks. The IPTV streams or channels are multiplexed together for transport across an IP core network prior to distribution across the access network. According to the type of access network, prior bandwidth constraints exist that restrict the multiplex data-rate. This paper presents a bandwidth allocation scheme based on content complexity to equalize the overall video quality of the IPTV sub-streams, in effect a form of statistical multiplexing. Bandwidth adaptation is achieved through a bank of bit-rate transcoders. Complexity metrics serve to estimate the appropriate bandwidth share for each stream, prior to distribution over a wireless or ADSL access network.These metrics are derived after entropy decoding of the input compressed bit-streams, without the delay resulting from a full decode. Fuzzy-logic control serves to adjust the balance between spatial and temporal coding complexity. The paper examines constant and varying bandwidth scenarios. Experimental results show a significant overall gain in video quality in comparison to a fixed bandwidth allocation.

show abstract

“…Moreover, in [11], the authors performed a cost investigation of transport architectures based only on demand and physical layer capabilities. In our work, we use an Ethernet based next generation aggregation network in which the BRAS has been replaced by multipurpose Broadband Network Gateways (BNGs), Multi-Service Edge Routers (MSEs) and Video BNGs [4], [12]. We also propose multiple architectures based on the distribution and clustering of the edge functionalities.…”

Section: Background Workmentioning

confidence: 99%

Optimal Functionality Placement for Multiplay Service Provider Architectures

Papapanagiotou

Falkner

Devetsikiotis

2012

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-The proliferation of multiplay services is creating design dilemmas for service providers, related to where certain key networking functionality should be placed. For example, service providers need to know whether to distribute more network intelligence closer to the subscriber or cluster it in a central location. In view of this, we quantify the cost differences among service provider architectures, identified based on the functionality distribution (centralized vs. distributed, clustered vs. unclustered and single vs. multi edge). For this purpose, we formulate a modular mixed-integer programming model based on a set of close-to-real-case scenarios. Given the complexity of such problems, we propose methodologies that can reduce the number of locations. Our results indicate that distributing the IP intelligence and the video replication is preferable. Moreover, deploying edge systems with faster backplane has little benefit in the aggregation network, and providers should rather invest in faster interfaces.

show abstract

Ethernet aggregation and core network models for effcient and reliable IPTV services

Cited by 7 publications

References 3 publications

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation

Intelligent Bandwidth Allocation of IPTV Streams with Bitstream Complexity Measures

Optimal Functionality Placement for Multiplay Service Provider Architectures

Contact Info

Product

Resources

About