TY - GEN
T1 - Packet Size Variability in Real Time Transmission of Smoothed MPEG-4 Streams
AU - Pereira, Rubem
AU - Pereira, Ella G
N1 - [1] Bewick C., Pereira R., and Merabti M. “Network
Constrained Smoothing: Enhanced Multiplexing of MPEG-4
Video”, IEEE Symposium in Computer and Communication
ISCC'02. July 2002. Taormina, Italy. ISBN 0 7695 1671 8
[2] Bewick C., Pereira R., and Merabti M. “Admission
Control and Routing of Smoothed Video Streams”,
International Journal of Simulation, Systems, Science and
Technology, Vol. 6, Numbers 3-4, pp. 61-68, 2005.
[3] Pereira R, Pereira E: “Packet Scheduling for Real-Time
Smoothed Video”, 22nd UK Performance Engineering
Workshop, 6,7 July 2006, Bournemouth, UK, pp 48-55.
[4] Salehi J., Zhang Z., Kurose J., Twosley D., “Supporting
Stored Video: Reducing Rate Variability and End-to-End
Resource Requirements Through Optimal Smoothing”.
IEEE/ACM Trans. Networking, 1998. 6(4).Pp 397-410
[5] Rao S.G. and Raghavan S.V., “Fast Techniques for the
Optimal Smoothing of Stored Video”. Multimedia Systems,
1999, 7(3): p. 222-233
[6] Hadar O. and Cohen R. , “PCRTT Enhancement for offline
Video Smoothing.” The Journal of Real Time Imaging,
June 2001 7(3).Pp 301-314
[7] Hadar O. and Greenberg S. “Statistical Multiplexing and
Admission Control Policy for Smoothed Video Streams
Using e-PCRTT Algorithm.” in International Conference on
Information Technology: Coding and Computing (ITCC'00).
2000. Las Vegas, Nevada.Pp 272-277
[8] Zeng X.,. Lung C.-H, Huang C., and Srinivasan A..: 'A
Bandwidth-Efficient Scheduler for MPLS DiffServ
Networks,' Proc. of the 12th Annual Meeting of the IEEE /
ACM International Symposium on Modeling, Analysis, and
Simulation of Computer and Telecommunication Systems
(MASCOTS), Volendam, The Netherlands, 2004.
[9] Minagawa T. and Kitami K.: 'Packet size based dynamic
scheduling for assured services in DiffServ network,' Tr. of
IEICE, 2004, J87-B(2): pp. 181-189.
[10] Zhang H. and Ferrari D.: 'Rate-Controlled Static-
Priority Queueing,' Proceedings of INFOCOM'93, San
Francisco, CA, 1993.
[11] Bennett J., Stephens D. C., and Zhang Z.: 'High Speed,
Scalable, and Accurate Implementation of Fair Queueing
Algorithms in ATM Networks,' ICNP'97, 1997.
12] Jacobson V, Nichols K, and Poduri K.: 'An Expedited
Forwarding PHB,' Internet Draft, 1999
[13] Ferrari T. and Chimento P. F.: 'A Measurement-based
Analysis of Expedited Forwarding PHB Mechanisms,'
Proceedings of IWQoS'2000, Pittsburgh, 2000.
[14] Pereira R, Mokhtar H., “A Packetized Round Robin
Service Discipline for IP Audio Streams in MPLS DiffServ
Networks”, the 3rd International Conference on Performance
Modelling and Evaluation of Heterogeneous Networks – Het
Nets 05, Ilkley, July 2005
PY - 2008/3
Y1 - 2008/3
N2 - It is desirable for the IP packet size variability of real time traffic classes to be small. This enables the adoption of schedulers such as weighted round robin, which are of low complexity and, under the assumption of approximately constant packet sizes, are suitable to real time traffic. Compressed video exhibits high variability in different time scales, so video smoothing techniques have been developed in order to reduce bit rate variability. This facilitates resource allocation to video streams. In particular, it may lead to schedulers that assume constant bit rate (CBR) on a per interval basis, as most smoothing techniques lead to a sequence of intervals of CBR. One such scheme is a version of weighted Round Robin scheduling. We carry out an experiment using traces of compressed video (MPEG-4) in order to establish how easily they can be packetised into fixed size packets.
AB - It is desirable for the IP packet size variability of real time traffic classes to be small. This enables the adoption of schedulers such as weighted round robin, which are of low complexity and, under the assumption of approximately constant packet sizes, are suitable to real time traffic. Compressed video exhibits high variability in different time scales, so video smoothing techniques have been developed in order to reduce bit rate variability. This facilitates resource allocation to video streams. In particular, it may lead to schedulers that assume constant bit rate (CBR) on a per interval basis, as most smoothing techniques lead to a sequence of intervals of CBR. One such scheme is a version of weighted Round Robin scheduling. We carry out an experiment using traces of compressed video (MPEG-4) in order to establish how easily they can be packetised into fixed size packets.
U2 - 10.1109/WAINA.2008.107
DO - 10.1109/WAINA.2008.107
M3 - Conference proceeding (ISBN)
SN - 9780769530963
SP - 1456
EP - 1461
BT - Proceedings of the 22nd International Conference on Advanced Information Networking and Applications Workshops/Symposia, Gino-wan, Okinawa, Japan 25–28 March 2008
A2 - O'Conner, L.
PB - IEEE
T2 - IEEE 22nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)
Y2 - 25 March 2008 through 28 March 2008
ER -