Optimal node-selection algorithm for parallel download in overlay content-distribution networks

Han, Seung Chul; Xia, Ye

doi:10.1016/j.comnet.2009.01.011

Cited by 11 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The efficiency and simplicity of our algorithm allow scaling the network to a large enough size capable of handling massive IPTV services. This work extends our earlier work [1], [3] on node selection, which minimizes the WLS in the hypercube. We have conducted simulations on the research platform, PlanetLab, with a convincingly large number of nodes.…”

Section: Introductionsupporting

confidence: 77%

“…When a user is interested in viewing a specific video, the user identifies peers containing the wanted file or file chunks, and selects a subset of the peers. Then, the user connects to the selected peers simultaneously and receives data from each peer in parallel Such a P2P technique, called swarming, can avoid server or network overload, achieve higher throughput, and be more resilient to failure and traffic fluctuation [1], [2]. Furthermore, it enhances scalability to support a potentially unlimited number of service channels, while imposing very little demand for equipment on the network service providers.…”

Section: Introductionmentioning

confidence: 99%

“…Existing distribution systems handle server selection in a variety of (usually ad-hoc) ways. 1 The infrastructure-based content distribution networks (CDN) (e.g., Akamai [4]) and web caches generally assign the closest server to each client. In FastReplica [5], server selection is essentially done randomly.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks

Han

Xia

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

In this paper, we investigate the issue of server selection for P2P IPTV system on fiber to the node networks. To achieve high performance and resilience to failures, a peer can make connections with multiple peers simultaneously and receive different portions of the data in parallel. Prior work mostly focuses on user-centric performance objectives, such as reducing the round-trip time or the completion time of individual download, but tend to ignore the congestion caused by the concurrent connections or the network load balance. The latter performance concerns are important for the network operators who provide and manage IPTV services. In this paper, we consider two performance metrics, the worst-case link stress (WLS) and the degree of interference (DOI), and present a server selection scheme that generates the optimal server set with respect to the WLS criterion. Through experiments on PlanetLab, we show that the proposed scheme has the advantages over the random scheme and the closest scheme in the following aspects. First, it minimizes the level of congestion at the bottleneck link. Second, it consumes less network resources in terms of the total bandwidth usage. Third, the network load is well balanced.

show abstract

Section: Introductionsupporting

confidence: 77%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks

Han

Xia

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…However, they did not consider the impact against the networks and focused on just maximizing the throughput of each user. Han et al proposed the server selection method minimizing the worst-case link stress (WLS), the maximum number of paths taking each link, when there are multiple mirror servers on the hypercube overlay network [13]. They proposed a heuristic algorithm based on the Min-Max algorithm to derive the server set for each source node.…”

Section: Related Workmentioning

confidence: 99%

Parallel video streaming optimizing network throughput

Kamiyama

Kawahara

Mori

et al. 2011

Computer Communications

View full text Add to dashboard Cite

“…Stress(WLS) [12] 와 Dgree of Interference (DOI) [11] 에 초 점이 맞춰져 있다. WLS는 링크를 지나간 횟수가 가장 큰 것을 말하고 네트워크의 혼잡 수준과 밀접한 관련이 있다.…”

unclassified

Simulation Analysis of User Grouping Algorithms for Massive Smart TV Services

Jeon¹,

Lee²,

Jou³

et al. 2011

Journal of the Korea Society for Simulation

View full text Add to dashboard Cite

Smart TV System will lead to drastic change of communication and media industries as one of the emerging next generation network services. However, when the number of concurrent users increases rapidly, the issue of service quality degradation occurs because providing services to many users simultaneously stresses both the server and the network. The server limitation can be circumvented by deploying server clusters. but the network limitation is far less easy to cope with, due to the difficulty in determining the cause and location of congestion and in provisioning extra resources. In order to alleviate these problems, a number of schemes have been developed. Prior works mostly focus on reducing user-centric performance metrics of individual connection, such as the round-trip time(RTT), downloading time or packet loss rate, but tend to ignore the network loads caused by the concurrent connections or global network load balance. In this work, we make an in-depth investigation on the issue of user grouping for massive Smart TV services through simulations on actual Internet test-bed, PlanetLab. 인프라-기반 콘텐츠 배급 네트워크(infrastructure-based content distribution networks) (CDN) (e.g., Akamai

show abstract

Optimal node-selection algorithm for parallel download in overlay content-distribution networks

Cited by 11 publications

References 17 publications

An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks

An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) Networks

Parallel video streaming optimizing network throughput

Simulation Analysis of User Grouping Algorithms for Massive Smart TV Services

Contact Info

Product

Resources

About