The Experts below are selected from a list of 564 Experts worldwide ranked by ideXlab platform
Hsu-feng Hsiao - One of the best experts on this subject based on the ideXlab platform.
-
TCP-friendly congestion control for the fair streaming of scalable video
Computer Communications, 2010Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:Dynamic bandwidth estimation serves as an important basis for performance optimization of real-time distributed multimedia applications. The objective of this paper is to develop a TCP-friendly and fair congestion control algorithm which regulates the sending rate robustly by inferring the end-to-end available bandwidth. In addition to network stability, we also consider the characteristics of streaming applications, such as the bandwidth resolution in scalable video coding (SVC) which can achieve fine granularity of scalability at bit level to fit the time-vary heterogeneous networks. The congestion control algorithm is mainly composed of two phases: start phase and transmission phase to better utilize the network resource by subscribing SVC layers. In the start phase, we analyze the relationship between the one-way delay and the dispersion of packet trains, and then propose an available bandwidth inference algorithm which makes use of these two features without requiring administrative access to the intermediate routers along the network path. Instead of either binary search or fixed-rate bandwidth adjustment of the probing data as proposed in literature, a top-down approach is proposed to infer the initial available bandwidth robustly and much more efficiently. After acquiring the initial available bandwidth, the missions of the transmission phase include the adaptation of the sending rate fairly by progressive probing and also the accommodation of the network resource to TCP flows. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet loss rate instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and also to avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for the estimation of the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications fairly utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
MMSP - TCP-friendly congestion control for layered video streaming using end-to-end bandwidth inference
2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
TCP-friendly congestion control for layered video streaming using end-to-end bandwidth inference
2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
Layered Congestion Control for Scalable Video Coding Based on the Efficient Bandwidth Inference
Ninth IEEE International Symposium on Multimedia Workshops (ISMW 2007), 2007Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:Scalable video coding allows greater granularity adaptation at bit level to the time-vary heterogeneous networks. In this paper, we propose a congestion control algorithm based on the bandwidth estimation techniques. In order to cooperate with H.264/MPEG-4 AVC SVC extension which can achieve fine granularity of scalability, we design an adaptation strategy to smartly switch to an efficient bandwidth inference mode during the channel probing period according to the one way delay and jitter profile so that the subscription decision of SVC layers can be made quickly to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels. The simulations show that the proposed algorithm converges fast to the available bandwidth and can adapt to the fluctuated network efficiently.
Sheng-shuen Wang - One of the best experts on this subject based on the ideXlab platform.
-
TCP-friendly congestion control for the fair streaming of scalable video
Computer Communications, 2010Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:Dynamic bandwidth estimation serves as an important basis for performance optimization of real-time distributed multimedia applications. The objective of this paper is to develop a TCP-friendly and fair congestion control algorithm which regulates the sending rate robustly by inferring the end-to-end available bandwidth. In addition to network stability, we also consider the characteristics of streaming applications, such as the bandwidth resolution in scalable video coding (SVC) which can achieve fine granularity of scalability at bit level to fit the time-vary heterogeneous networks. The congestion control algorithm is mainly composed of two phases: start phase and transmission phase to better utilize the network resource by subscribing SVC layers. In the start phase, we analyze the relationship between the one-way delay and the dispersion of packet trains, and then propose an available bandwidth inference algorithm which makes use of these two features without requiring administrative access to the intermediate routers along the network path. Instead of either binary search or fixed-rate bandwidth adjustment of the probing data as proposed in literature, a top-down approach is proposed to infer the initial available bandwidth robustly and much more efficiently. After acquiring the initial available bandwidth, the missions of the transmission phase include the adaptation of the sending rate fairly by progressive probing and also the accommodation of the network resource to TCP flows. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet loss rate instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and also to avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for the estimation of the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications fairly utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
MMSP - TCP-friendly congestion control for layered video streaming using end-to-end bandwidth inference
2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
TCP-friendly congestion control for layered video streaming using end-to-end bandwidth inference
2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:More and more streaming protocols are developed for the multimedia applications. However, many streaming protocols only consider the network stability, but not the characteristics of streaming applications. In order to cooperate with H.264/MPEG-4 AVC scalable extension which can achieve fine granularity of scalability at bit level to the time-vary heterogeneous networks, we design a TCP-friendly congestion control algorithm based on the bandwidth estimation to smoothly change sending rate to avoid unnecessary oscillations so that the subscription decision of SVC layers can be made to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the packet lost rate and the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for estimating the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications efficiently utilizes network bandwidth without hampering the performance of the existing TCP applications.
-
Layered Congestion Control for Scalable Video Coding Based on the Efficient Bandwidth Inference
Ninth IEEE International Symposium on Multimedia Workshops (ISMW 2007), 2007Co-Authors: Sheng-shuen Wang, Hsu-feng HsiaoAbstract:Scalable video coding allows greater granularity adaptation at bit level to the time-vary heterogeneous networks. In this paper, we propose a congestion control algorithm based on the bandwidth estimation techniques. In order to cooperate with H.264/MPEG-4 AVC SVC extension which can achieve fine granularity of scalability, we design an adaptation strategy to smartly switch to an efficient bandwidth inference mode during the channel probing period according to the one way delay and jitter profile so that the subscription decision of SVC layers can be made quickly to better utilize the network resource. In case of the unavoidable network congestion, we Unsubscribe scalable video layers according to the recently received throughput instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels. The simulations show that the proposed algorithm converges fast to the available bandwidth and can adapt to the fluctuated network efficiently.
Thim Strothmann - One of the best experts on this subject based on the ideXlab platform.
-
Self-Stabilizing Supervised Publish-Subscribe Systems
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018Co-Authors: Michael Feldmann, Christina Kolb, Christian Scheideler, Thim StrothmannAbstract:In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in [1]) by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or Unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
-
IPDPS - Self-Stabilizing Supervised Publish-Subscribe Systems
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018Co-Authors: Michael Feldmann, Christina Kolb, Christian Scheideler, Thim StrothmannAbstract:In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in [1]) by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or Unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
-
Self-Stabilizing Supervised Publish-Subscribe Systems
arXiv: Distributed Parallel and Cluster Computing, 2017Co-Authors: Michael Feldmann, Christina Kolb, Christian Scheideler, Thim StrothmannAbstract:In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or Unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
Shuming Chang - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - TCP-friendly window congestion control with dynamic grouping for reliable multicast
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2000Co-Authors: Shuming Chang, Hung-hsiang Jonathan ChaoAbstract:Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. We propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known "drop-to-zero" problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or Unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the "drop-to-zero" problem. Some key related issues are also discussed.
-
TCP-friendly window congestion control with dynamic grouping for reliable multicast
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2000Co-Authors: Shuming Chang, H.j. ChaoAbstract:Congestion control for reliable multicast for large multicast groups has been a challenging issue for widespread deployment of reliable multicast services. We propose a receiver-driven window congestion control scheme with dynamic grouping for reliable multicast. The main objective is to improve multicast throughput performance and to solve the well-known "drop-to-zero" problem, i.e., to prevent a slow receiver from slowing down faster receivers in the same multicast group. For this purpose, we modify the window scheme and combine it with a new dynamic grouping scheme for local recovery to achieve high-throughput performance. The basic idea is two-fold. First, the sender can tune its window size according to the fastest receiver in a virtual group instead of the slowest receiver by taking advantage of the local recovery. Second, the sender can explicitly ask a worst-case group (WCG), which can be recorded in a simple list in cache or memory, to merge with others or Unsubscribe from the multicast group. The proposed strategy is shown to be still TCP-friendly and scalable while eliminating the "drop-to-zero" problem. Some key related issues are also discussed.
Yu Wang - One of the best experts on this subject based on the ideXlab platform.
-
Maintaining Replica Consistency Using Replica Information Broadcast Tree in P2P Storage System
2009 International Conference on Research Challenges in Computer Science, 2009Co-Authors: Yu WangAbstract:In order to build highly available P2P storage system, this paper proposes a new replica consistency maintenance strategy, replica information broadcast tree (RIBT) strategy. It can effectively resolve some problems existed in structured P2P storage system, such as ¿hot spot¿ problem, node failure, privacy problem. This strategy constructs a binary tree by RIBT generation algorithm from chord-ring of structured P2P storage system, and then stores the replicas in this tree. By subscribe algorithm and Unsubscribe algorithm system can effectively update replica to maintain replica consistency. Experiment compares RIBT strategy with central control strategy. Result shows it is effective in reducing maintenance costs and avoids some related problems.
