On Reducing the Inter-AS Traffic of Box-Powered CDN

2011 IEEE International Conference on Communications (ICC)

2011

Self Cite

Time-shifted streaming (or catch-up TV) allows viewers to watch their TV programs within an expanded time window. In this paper, we emphasize the challenging characteristics of time-shifted TV systems that prevent known delivery systems to be used. We model time-shifted TV as multiple-interval graph, then we present a Peer-Assisted Catch-Up Streaming system, namely PACUS, where a set of end users' computers assists the server for the content delivery. We show in particular how the PACUS tracker server can be efficiently implemented for catch-up TV. We demonstrate the benefits of PACUS by simulations. We especially highlight that PACUS reduces the traffic at the server side with the advantages of lightweight and self-adaptive unstructured peer-to-peer systems.

Section: Peer-assisted Architecturementioning

confidence: 98%

Peer-Assisted Time-Shifted Streaming Systems: Design and Promises

Liu

2011 IEEE International Conference on Communications (ICC)

2011

Self Cite

“…A trivial implementation consists in a random choice. In previous works, we have shown that significant gains can be obtained from a label assignment that takes into account the network linkage among CRs [16]. However, the optimal assignment has been shown to be NP-complete.…”

Section: Our Contributions: Algorithms and Ccn Protocolmentioning

confidence: 99%

Time-Shifted TV in Content Centric Networks: The Case for Cooperative In-Network Caching

2011 IEEE International Conference on Communications (ICC)

2011

Self Cite

111

Abstract-Recent works on Content-Centric-Networking (CCN) enable the exploitation of the caching resources of the new generation of routers (Content Routers or CR). So far, only a basic Least Recently Used (LRU) strategy implemented on every CRs has been proposed. In this paper, we introduce a cooperative caching strategy that has been designed for the treatment of large video streams with on-demand access. This caching strategy addresses the need of Internet Service Provider by halving the cross-domain traffic. We present a first algorithm, which is a core element of this strategy, then we show the changes that have to be brought to the CCN protocol in order to implement this strategy.

“…As this paper addresses the point of view of service provider, we adopt this metric for this set of simulations. Note however that other metrics could have been chosen, for example cross-domain traffic that is of relevance to network operators [7].…”

Section: Simulationsmentioning

confidence: 99%

“…In the meantime, several concurrent studies have recently called for an even more decentralized approach of horizontal scaling [6,7,8,9,10]. The motivation comes from the observation that large-scale data-centers are difficult to manage [9,11].…”

Section: Introductionmentioning

confidence: 99%

Optimal network locality in distributed virtualized data-centers

Leblet

Computer Communications

et al. 2011

Self Cite

Cost efficiency is a key aspect in deploying distributed service in networks within decentralized service delivery architectures. In this paper, we address this aspect from an optimization and algorithmic standpoint. The research deals with the placement of service components to network sites, where the performance metric is the cost for acquiring components between the sites. The resulting optimization problem, which we refer to as the k-Component Multisite Placement Problem, is applicable to service distribution in a wide range of communication networking scenarios. We provide a theoretical analysis of the problem's computational complexity, and develop an integer programming model for providing reference results for performance benchmarking. On the algorithmic side, we present four approaches: an algorithm with approximation guarantee and three heuristics algorithms. The first heuristic is derived from graph theory on domatic partition. The second heuristic, built on intuition, admits distributed computation. The third heuristic emphasizes on fairness in cost distribution among the sites. We report simulation results for sets of networks where cost is represented by round-trip time (RTT) originating from real measurements. For small networks, the integer model is used to study algorithm performance in terms of optimality. Large networks are used to compare the al- * Corresponding author1 The work of this author is supported by CENIIT, Linköping University, Sweden 2 The work of this author is supported by Vipeer project and Agence Nationale de la Recherche, France February 11, 2011 gorithms relatively to each other. Among the algorithms, the heuristic based on intuition has close-to-optimal performance, and the fairness heuristic achieves a good balance between single-site cost and the overall one. In addition, the experiments demonstrate the significance of optimization for cost reduction in comparison to a the random allocation strategy. Preprint submitted to Elsevier