Multimedia satellite systems are viewed as viable service vehicles for traditional entertainment broadcasting. They are also potential supplements for the existing wire-line and legacy networks in meeting the increasing demand for Internet and multimedia oriented broadband access at demographically dispersed areas. The main objective of this work is the comparison of a new Connection Admission Control (CAC) algorithm that guarantees an elevated multiplexing level and also a good quality of service to real-time multimedia traffic sources mapped over DVB-RCS standard service classes with a well-known Iterative CAC mainly designed for the managing of real-time bursty traffic sources. Simulation results show that the performances of the proposed CAC, compared with the previous one, are the same but the last one has a very low computational complexity. In particular, the proposed scheme is based on a few elementary sums and products operations and has a linear computational complexity while the reference algorithm presents a quadratic one. Both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter but the proposed one can manage also real-time multimedia traffic sources with high interactivity data level.
Multimedia GEO Satellite architecture based on DVB-RCS: admission control issue for high interactivity traffic sources
ALOI, Gianluca;PACE P;MARANO, Salvatore
2006-01-01
Abstract
Multimedia satellite systems are viewed as viable service vehicles for traditional entertainment broadcasting. They are also potential supplements for the existing wire-line and legacy networks in meeting the increasing demand for Internet and multimedia oriented broadband access at demographically dispersed areas. The main objective of this work is the comparison of a new Connection Admission Control (CAC) algorithm that guarantees an elevated multiplexing level and also a good quality of service to real-time multimedia traffic sources mapped over DVB-RCS standard service classes with a well-known Iterative CAC mainly designed for the managing of real-time bursty traffic sources. Simulation results show that the performances of the proposed CAC, compared with the previous one, are the same but the last one has a very low computational complexity. In particular, the proposed scheme is based on a few elementary sums and products operations and has a linear computational complexity while the reference algorithm presents a quadratic one. Both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter but the proposed one can manage also real-time multimedia traffic sources with high interactivity data level.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.