Quality of Future Internet Services

One way to reduce, or avoid, the loss of intrastream synchronization due to the delay variability introduced by best-effort networks, is by employing application layer buffering and scheduling at a Packet Video Receiver (PVR), resulting in a higher end-to-end delay. In this paper an analytical model is presented that captures the essential tradeoff between stream continuity and stream latency. Unlike past related work, stream continuity is not expressed as the accumulated amount of synchronization loss, but as a combination of the accumulated amount, and the variation of the duration of synchronization loss occurrences. This approach allows for a fine grained optimization of stream continuity which has the potential of providing an improved perceptual quality. It is shown that the minimization of the accumulated amount of synchronization loss, and the minimization of the variance of the duration of synchronization loss occurrences, are two competing objectives; the minimization of variance is desirable because it leads to the concealment of discontinuities. The aforementioned presentation quality metrics are considered by the optimal playout policy, which is derived by means of Markov decision theory and linear programming.

[1]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[2]  E. C. Titchmarsh,et al.  The theory of functions , 1933 .

[3]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Gerard Hooghiemstra,et al.  A scaling law for the hopcount in internet , 2000 .

[6]  P. V. Mieghem,et al.  PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Liang Guo,et al.  Search space reduction in QoS routing , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[9]  O. Barndorfi-nielsen,et al.  On the distribution of the number of admissible points in a vector , 1966 .

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Piet Van Mieghem,et al.  TAMCRA: a tunable accuracy multiple constraints routing algorithm , 2000, Comput. Commun..

[12]  Piet Van Mieghem,et al.  The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation , 1996, Queueing Syst. Theory Appl..

[13]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[14]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Anja Feldmann,et al.  Data networks as cascades: investigating the multifractal nature of Internet WAN traffic , 1998, SIGCOMM '98.

[16]  Harold M. Edwards,et al.  Riemann's Zeta Function , 1974 .

[17]  Keith Sklower,et al.  A Tree-Based Packet Routing Table for Berkeley Unix , 1991, USENIX Winter.

[18]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.