Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905541
Ali Othman, R. Barrak, M. Mabrouk
Varactor-based tunable bandpass filters are challenging solutions for next generation mobile phones that allow using one RF front-end for multiple applications. However, these solutions suffer from varactors non-linear effects that may affect signal quality and may introduce important distortions. This paper presents a thorough study of varactors nonlinear effects and some solutions for their cancellation. These solutions are applied in tunable Dual Behavior Resonator (DBR) bandpass filter to reduce non-linear distortions. S-parameter and Harmonic balance simulations were conducted to study and compare the performances of the solutions reported in the literature.
{"title":"Varactors nonlinear effects in tunable RF filters","authors":"Ali Othman, R. Barrak, M. Mabrouk","doi":"10.1109/ICMCS.2016.7905541","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905541","url":null,"abstract":"Varactor-based tunable bandpass filters are challenging solutions for next generation mobile phones that allow using one RF front-end for multiple applications. However, these solutions suffer from varactors non-linear effects that may affect signal quality and may introduce important distortions. This paper presents a thorough study of varactors nonlinear effects and some solutions for their cancellation. These solutions are applied in tunable Dual Behavior Resonator (DBR) bandpass filter to reduce non-linear distortions. S-parameter and Harmonic balance simulations were conducted to study and compare the performances of the solutions reported in the literature.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905669
N. Torjemen, N. Tabbane, Ghayet El Mouna Zhioua
Mobile data offloading using Wi-Fi hotspots is increasingly utilized as it satisfies the huge traffic demand and boosts network capacity. For that reason, several studies have been carried out to define the best approaches to offload IP flows from LTE to Wi-Fi. In this paper, we investigate the offload optimization problem from an LTE-A network to Wireless Mesh network (WMN) owned by the operator. We propose a new offload decision algorithm based on a multiple constraints algorithm and hosted in the Packed Data Network Gateway (P-GW). It can maximize the offloaded data to the wireless mesh network while meeting the traffic QoS requirements.
{"title":"New offload decision algorithm from LTE-advanced to Wireless Mesh Network","authors":"N. Torjemen, N. Tabbane, Ghayet El Mouna Zhioua","doi":"10.1109/ICMCS.2016.7905669","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905669","url":null,"abstract":"Mobile data offloading using Wi-Fi hotspots is increasingly utilized as it satisfies the huge traffic demand and boosts network capacity. For that reason, several studies have been carried out to define the best approaches to offload IP flows from LTE to Wi-Fi. In this paper, we investigate the offload optimization problem from an LTE-A network to Wireless Mesh network (WMN) owned by the operator. We propose a new offload decision algorithm based on a multiple constraints algorithm and hosted in the Packed Data Network Gateway (P-GW). It can maximize the offloaded data to the wireless mesh network while meeting the traffic QoS requirements.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133842666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905660
S. Bouazza, A. Zeroual, K. Auhmani
In machine learning, feature selection is the process of selecting a subset of relevant features for use in model construction. A comparative evaluation between selection methods: SNR, Correlation Coefficient and Max-relevance Min-Redundancy is carried out, using the dataset of prostate cancer. The Evaluation of the dimensionality reduction was done by using the supervised classifier K Nearest Neighbors (KNN), Support Vector Machines (SVM), Linear Discriminant Analysis (LDA) and Decision Tree for supervised classification (DTC). The purpose of classification is to assign an object to a certain class. The classifier shows that the combination between SNR and the LDA classifier can present the highest accuracy.
{"title":"Gene expression data analyses for supervised prostate cancer classification based on feature subset selection combined with different classifiers","authors":"S. Bouazza, A. Zeroual, K. Auhmani","doi":"10.1109/ICMCS.2016.7905660","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905660","url":null,"abstract":"In machine learning, feature selection is the process of selecting a subset of relevant features for use in model construction. A comparative evaluation between selection methods: SNR, Correlation Coefficient and Max-relevance Min-Redundancy is carried out, using the dataset of prostate cancer. The Evaluation of the dimensionality reduction was done by using the supervised classifier K Nearest Neighbors (KNN), Support Vector Machines (SVM), Linear Discriminant Analysis (LDA) and Decision Tree for supervised classification (DTC). The purpose of classification is to assign an object to a certain class. The classifier shows that the combination between SNR and the LDA classifier can present the highest accuracy.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133537194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905600
A. Hamraoui, E. Abdelmounim, J. Zbitou, H. Bennis, M. Latrach
This paper presents a study of a new dual-band monopole antenna fed by a Coplanar Waveguide (CPW) line suitable for Radio Frequency Identification (RFID) applications especially designed for RFID readers and it operates at 2.45 GHz and 5.8 GHz. This antenna is designed with a reasonable gain, low profile and low cost achievement. The proposed antenna benefits from the advantages of the CPW line to simplify the structure of the antenna into a single metallic level, by consequent making it easier for integration with microwave integrated circuits. The simulation results carried out by ADS from Agilent technologies and CST Microwave Studio electromagnetic solvers, demonstrate that we have good performances in term of return loss, gain, radiation pattern and efficiency for the desired frequency bands. This antenna has a total area of 34×30.6mm2 and mounted on an FR4 substrate with dielectric permittivity constant 4.4, thickness of 1.6mm and loss tangent of 0.025. The gain obtained into simulation of this antenna is 1,1dB at 2.45GHz and 2dB at 5.8 GHz.
{"title":"A new compact CPW-fed dual-band monopole antenna for RFID applications","authors":"A. Hamraoui, E. Abdelmounim, J. Zbitou, H. Bennis, M. Latrach","doi":"10.1109/ICMCS.2016.7905600","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905600","url":null,"abstract":"This paper presents a study of a new dual-band monopole antenna fed by a Coplanar Waveguide (CPW) line suitable for Radio Frequency Identification (RFID) applications especially designed for RFID readers and it operates at 2.45 GHz and 5.8 GHz. This antenna is designed with a reasonable gain, low profile and low cost achievement. The proposed antenna benefits from the advantages of the CPW line to simplify the structure of the antenna into a single metallic level, by consequent making it easier for integration with microwave integrated circuits. The simulation results carried out by ADS from Agilent technologies and CST Microwave Studio electromagnetic solvers, demonstrate that we have good performances in term of return loss, gain, radiation pattern and efficiency for the desired frequency bands. This antenna has a total area of 34×30.6mm2 and mounted on an FR4 substrate with dielectric permittivity constant 4.4, thickness of 1.6mm and loss tangent of 0.025. The gain obtained into simulation of this antenna is 1,1dB at 2.45GHz and 2dB at 5.8 GHz.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905603
Souhail Haggui, F. Rouissi, Y. Mlayeh, F. Tlili
A low-complexity and high performance configurable Double Rayleigh Mobile-to-Mobile fading channel emulator is proposed as well as its High Level Synthesis. The design and implementation of the proposed architecture based on a variant of the white Gaussian noise filtering method uses a minor hardware resource. The designed system is modeled using C/C++ high level language. Then the synthesis task into a Field-Programmable Gate Arrays (FPGA) is performed using Vivado 2014.2 High-Level Synthesis tool. Implementation results into a Xilinx Zynq-7 ZC706 xc7z045ffg900-2 FPGA shows that the proposed architecture uses only 1.5% of the configurable slices, 3% of the dedicated DSP48E, 4 BlockRAMs and it can generate up to 115 million fading samples per second. The analysis of the theoretical curves compared with the simulated one, in terms first order statistical properties of a double Rayleigh mobile-to-mobile fading channel, shows that there is a good agreement between the simulated results and the theoretical curves.
{"title":"A flexible filter-based Mobile-to-Mobile Double Rayleigh Fading channel emulator","authors":"Souhail Haggui, F. Rouissi, Y. Mlayeh, F. Tlili","doi":"10.1109/ICMCS.2016.7905603","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905603","url":null,"abstract":"A low-complexity and high performance configurable Double Rayleigh Mobile-to-Mobile fading channel emulator is proposed as well as its High Level Synthesis. The design and implementation of the proposed architecture based on a variant of the white Gaussian noise filtering method uses a minor hardware resource. The designed system is modeled using C/C++ high level language. Then the synthesis task into a Field-Programmable Gate Arrays (FPGA) is performed using Vivado 2014.2 High-Level Synthesis tool. Implementation results into a Xilinx Zynq-7 ZC706 xc7z045ffg900-2 FPGA shows that the proposed architecture uses only 1.5% of the configurable slices, 3% of the dedicated DSP48E, 4 BlockRAMs and it can generate up to 115 million fading samples per second. The analysis of the theoretical curves compared with the simulated one, in terms first order statistical properties of a double Rayleigh mobile-to-mobile fading channel, shows that there is a good agreement between the simulated results and the theoretical curves.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128432223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905619
Mouaz Bezoui, A. Elmoutaouakkil, A. B. Hssane
This report describes the work done for training and testing Arabic speech recognition system using the KALDI toolkit. Each person's voice is different. Thus, the Holy Quran sound, which had been recited by most of reciters will probably tend to differ a lot from one person to another. Although those Quranic sentences were particularly taken from the same verse, but the way of the sentence in The Holy Quran been recited or delivered may be different. It may produce the contrast sounds for the different reciters. Those same combinations of letters maybe pronounced differently due to the use of diacritics. This paper explores the viability of Mel-Frequency Cepstral Coefficient (MFCC) technique to extract features from Quranic verse recitation. Features extraction is important to prepare data for classification process. MFCC is one of the most popular feature extraction techniques used in speech recognition, whereby it is based on the frequency domain of Mel scale for human ear scale. MFCCs consist of preprocessing, framing, windowing, DFT, Mel Filterbank, Logarithm and Discrete Cosine Transform DCT.
{"title":"Feature extraction of some Quranic recitation using Mel-Frequency Cepstral Coeficients (MFCC)","authors":"Mouaz Bezoui, A. Elmoutaouakkil, A. B. Hssane","doi":"10.1109/ICMCS.2016.7905619","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905619","url":null,"abstract":"This report describes the work done for training and testing Arabic speech recognition system using the KALDI toolkit. Each person's voice is different. Thus, the Holy Quran sound, which had been recited by most of reciters will probably tend to differ a lot from one person to another. Although those Quranic sentences were particularly taken from the same verse, but the way of the sentence in The Holy Quran been recited or delivered may be different. It may produce the contrast sounds for the different reciters. Those same combinations of letters maybe pronounced differently due to the use of diacritics. This paper explores the viability of Mel-Frequency Cepstral Coefficient (MFCC) technique to extract features from Quranic verse recitation. Features extraction is important to prepare data for classification process. MFCC is one of the most popular feature extraction techniques used in speech recognition, whereby it is based on the frequency domain of Mel scale for human ear scale. MFCCs consist of preprocessing, framing, windowing, DFT, Mel Filterbank, Logarithm and Discrete Cosine Transform DCT.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905644
Fatema Zahra Benchara, M. Youssfi, O. Bouattane, H. Ouajji
The aim of this paper is to present a new distributed computing middleware for High Performance Computing (HPC) based cloud micro-services. The great challenge is to maintain the scalability and efficiency of massively parallel and distributed computational system when the intensive big data processed by its applications is widely increased. Besides, the proposed middleware implements a new cooperative micro-services team works model for massively parallel and distributed computing. This model is constituted by distributed micro-services as Micro-service Virtual Processing Units (MsVPUs) with integrated load balancing service and an AMQP communication protocol that grant HPC. The paper shows the proposed distributed computational scheme and its integrated middleware accompanying by some experimental results.
{"title":"A new efficient distributed computing middleware based on cloud micro-services for HPC","authors":"Fatema Zahra Benchara, M. Youssfi, O. Bouattane, H. Ouajji","doi":"10.1109/ICMCS.2016.7905644","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905644","url":null,"abstract":"The aim of this paper is to present a new distributed computing middleware for High Performance Computing (HPC) based cloud micro-services. The great challenge is to maintain the scalability and efficiency of massively parallel and distributed computational system when the intensive big data processed by its applications is widely increased. Besides, the proposed middleware implements a new cooperative micro-services team works model for massively parallel and distributed computing. This model is constituted by distributed micro-services as Micro-service Virtual Processing Units (MsVPUs) with integrated load balancing service and an AMQP communication protocol that grant HPC. The paper shows the proposed distributed computational scheme and its integrated middleware accompanying by some experimental results.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133546155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905645
Meryam Zeryouh, M. E. Marraki, M. Essalih
Finding quantitative measures for describing and characterizing the structural properties of networks is a research topic with ongoing interest. These measures are called graph invariants and are usually referred to as topological indices. The oldest topological index is the Wiener index, it has been extensively studied in many applications such as chemical graph theory, complex network, social networks, and computer networks. After the success of the Wiener index, a large number of modifications and extensions of the Wiener index have been proposed in the literature. In this paper, we focus our attention to the most recent topological index, called the Terminal Wiener index. Then, we are going to present the structure of networks that attain the second maximal Terminal Wiener index, and we propose a network transformation that increases the Terminal Wiener index.
{"title":"On the Terminal Wiener index of networks","authors":"Meryam Zeryouh, M. E. Marraki, M. Essalih","doi":"10.1109/ICMCS.2016.7905645","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905645","url":null,"abstract":"Finding quantitative measures for describing and characterizing the structural properties of networks is a research topic with ongoing interest. These measures are called graph invariants and are usually referred to as topological indices. The oldest topological index is the Wiener index, it has been extensively studied in many applications such as chemical graph theory, complex network, social networks, and computer networks. After the success of the Wiener index, a large number of modifications and extensions of the Wiener index have been proposed in the literature. In this paper, we focus our attention to the most recent topological index, called the Terminal Wiener index. Then, we are going to present the structure of networks that attain the second maximal Terminal Wiener index, and we propose a network transformation that increases the Terminal Wiener index.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121937078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905539
Walid El Ayeb, Z. Choukair
The main goal of many researches focuses on improving subscriber experience by proposing a variety of services and features to better fit his needs and expectations. In order to improve the response to this subscriber expectation and considering the huge amount of information available in the network combined with performance expectation, we combine services' descriptions with subscriber requests and profile information (use history/log and use context) to orientate the service discovery as well as exposure processes to the needs of subscribers. To better tackle this problematic, we consider these three complementary perspectives in a coherent way. In purpose to consider a very constrained environment in terms of discovery/exposure performance, we considered the telecommunication domain which is very sensitive to all of these aspects and one of the most appetence domain in that respect. This work presents our funnel based joint dual mobile service discovery and exposure model and its mechanism in order to reduce the discard between discovered/exposed services and subscribers needs. The funnel targets gradually the discovered and exposed service. A correlation mechanism based upon an enhanced bipartite graph will help targeting the most appropriate service with better performances. Our model and its results show improvement compared with other related works on several axes.
{"title":"A funnel based joint dual mobile service discovery and exposure model","authors":"Walid El Ayeb, Z. Choukair","doi":"10.1109/ICMCS.2016.7905539","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905539","url":null,"abstract":"The main goal of many researches focuses on improving subscriber experience by proposing a variety of services and features to better fit his needs and expectations. In order to improve the response to this subscriber expectation and considering the huge amount of information available in the network combined with performance expectation, we combine services' descriptions with subscriber requests and profile information (use history/log and use context) to orientate the service discovery as well as exposure processes to the needs of subscribers. To better tackle this problematic, we consider these three complementary perspectives in a coherent way. In purpose to consider a very constrained environment in terms of discovery/exposure performance, we considered the telecommunication domain which is very sensitive to all of these aspects and one of the most appetence domain in that respect. This work presents our funnel based joint dual mobile service discovery and exposure model and its mechanism in order to reduce the discard between discovered/exposed services and subscribers needs. The funnel targets gradually the discovered and exposed service. A correlation mechanism based upon an enhanced bipartite graph will help targeting the most appropriate service with better performances. Our model and its results show improvement compared with other related works on several axes.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130201129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-01DOI: 10.1109/ICMCS.2016.7905550
El Hassane Khabbiza, R. E. Alami, H. Qjidaa
Internet Protocol (IPTV) is becoming more and more widely used to provide video and audio services for a huge number of users, thanks to the IP network expansion, quality of content, and added value service for enhancing user experience comparing with traditional TV. The channel change time (CCT) during the channel surfing is a key factor impacting the quality of experience of end user especially when the user compares this delay with the traditional TV (cable TV or TV over satellite). A few years ago many researches have been done in this domain to mitigate the IPTV CCT and improve the user experience, one of the most deployed solution is the implementation of the fast channel change solution (FCC) in the network in order to unicast the needed stream during the CCT. In this paper we propose a new solution by enabling the communication between STBs to unicast the stream needed during the channel change period.
{"title":"A new method to reduce the bandwidth of IPTV systems","authors":"El Hassane Khabbiza, R. E. Alami, H. Qjidaa","doi":"10.1109/ICMCS.2016.7905550","DOIUrl":"https://doi.org/10.1109/ICMCS.2016.7905550","url":null,"abstract":"Internet Protocol (IPTV) is becoming more and more widely used to provide video and audio services for a huge number of users, thanks to the IP network expansion, quality of content, and added value service for enhancing user experience comparing with traditional TV. The channel change time (CCT) during the channel surfing is a key factor impacting the quality of experience of end user especially when the user compares this delay with the traditional TV (cable TV or TV over satellite). A few years ago many researches have been done in this domain to mitigate the IPTV CCT and improve the user experience, one of the most deployed solution is the implementation of the fast channel change solution (FCC) in the network in order to unicast the needed stream during the CCT. In this paper we propose a new solution by enabling the communication between STBs to unicast the stream needed during the channel change period.","PeriodicalId":345854,"journal":{"name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：