This paper presents an effective IPTV channel management method using SVC (scalable video coding) that considers concurrently both channel zapping time and network utilization. A broadcasting channel is encoded in two-layered bitstream (base-layer channel and
enhancement-layer channel) to supply for heterogeneous environments. The proposed algorithm locates only a limited numbers of base-layer channels close to users to reduce the network delay part of channel zapping time and adjusts the length of GOP (group of picture) into each base-layer channel to decrease the video decoding delay part of channel zapping time, which are performed based on user's channel preference information. Finally, the experimental results are provided to show the performance of the proposed schemes.
In this work, we present an effective overlay multicast tree constructing algorithm to meet delay constraint for real-time media service with the minimum networking price over Differentiated-Service networks. In addition, a dynamic and scalable tree maintaining algorithm is proposed for seamless service by updating the small parts of the tree when some End-systems join or leave the multicast group. An effective solution is obtained by changing the tree structure among Data-server, Proxy-senders and End-systems and the class vector of Proxy-senders. Finally, experimental results are
presented to compare the performance of the proposed algorithm.
In this paper, we present effective quality-of-service renegotiating schemes for streaming video. The conventional network supporting quality-of-service generally allows a negotiation at call setup. However, it is not efficient for the video application since the compressed video traffic is statistically non-stationary. Thus, we consider the network supporting quality-of-service renegotiations during the data transmission, and study effective quality-of-service renegotiating schemes for streaming video. Simple token bucket model, whose parameters are token filling rate and token bucket size, is adopted for the video traffic model. The renegotiating time instants and the parameters are determined by analyzing the statistical information of compressed video traffic. In this paper, two renegotiating approaches, i.e. fixed renegotiating interval case and variable renegotiating interval case, are examined. Finally, the experimental results are provided to show the performance of the proposed schemes.