Pub Date : 2009-12-11DOI: 10.1109/ICET.2009.5353145
Samra Kahkashan, R. Badar, Amna Mahboob
Turbo code is a class of convolutional codes which have great deal of interest as they attain the ultimate limits of the capacity of communication channel. They are known as “The ultimate Error Control Codes” which made them move rapidly from research laboratories to practical applications throughout the world. The use of these codes has been proposed for several applications where highly reliable transmission is required at very low SNR. In this paper we discuss hardware implementation aspect of turbo codes along with some previous work done and their limitations. We also present the results of RTL modeling and simulation and the synthesis report of turbo encoder using Xilinx ISE 10.1. The performance of turbo codes can be optimized in terms of power consumption and resource utilization of hardware.
Turbo码是卷积码的一种，由于达到了通信信道容量的极限而备受关注。它们被称为“终极错误控制代码”，使它们迅速从研究实验室转移到世界各地的实际应用。这些代码的使用已经提出了几种应用，其中需要在非常低的信噪比下进行高可靠的传输。本文讨论了turbo码在硬件实现方面的问题，并介绍了前人的一些工作和它们的局限性。我们还介绍了RTL建模和仿真的结果以及使用Xilinx ISE 10.1的涡轮编码器的合成报告。turbo码的性能可以从硬件的功耗和资源利用率两方面进行优化。
{"title":"Optimizing the performance of turbo code HDL model for rapid prototype","authors":"Samra Kahkashan, R. Badar, Amna Mahboob","doi":"10.1109/ICET.2009.5353145","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353145","url":null,"abstract":"Turbo code is a class of convolutional codes which have great deal of interest as they attain the ultimate limits of the capacity of communication channel. They are known as “The ultimate Error Control Codes” which made them move rapidly from research laboratories to practical applications throughout the world. The use of these codes has been proposed for several applications where highly reliable transmission is required at very low SNR. In this paper we discuss hardware implementation aspect of turbo codes along with some previous work done and their limitations. We also present the results of RTL modeling and simulation and the synthesis report of turbo encoder using Xilinx ISE 10.1. The performance of turbo codes can be optimized in terms of power consumption and resource utilization of hardware.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473755","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353138
Syeda Uzma Gardazi, Haroon Khan, Syeda Faiza Gardazi, A. A. Shahid
Software architecture (SA) is considered an active research area nowadays, although it is not a new activity while developing software. Software architecture is a structure represented using Architecture Description Languages (ADLs) and graphical diagrams of the system, showing different components and relationships among them. Software Project Management (SPM) pertains to the management and controlling activities involved in Software Development Life Cycle (SDLC) and includes planning, organizing, staffing, leading and controlling the software processes. This paper aims to identify the motivational factors affecting software architects and software project managers using the survey technique. We have collected results from questionnaire surveys technique which will help software project managers and software architects to understand the factors that can affect the overall quality of the software and its architecture. The last step will be to propose an updated framework for Systematic Literature Review (SLR). This new concept of using Clustering, Genetic Algorithm and Agents in SLR was proposed to produce an efficient and optimized query search strings and searches for search engines.
{"title":"Motivation in software architecture and software project management","authors":"Syeda Uzma Gardazi, Haroon Khan, Syeda Faiza Gardazi, A. A. Shahid","doi":"10.1109/ICET.2009.5353138","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353138","url":null,"abstract":"Software architecture (SA) is considered an active research area nowadays, although it is not a new activity while developing software. Software architecture is a structure represented using Architecture Description Languages (ADLs) and graphical diagrams of the system, showing different components and relationships among them. Software Project Management (SPM) pertains to the management and controlling activities involved in Software Development Life Cycle (SDLC) and includes planning, organizing, staffing, leading and controlling the software processes. This paper aims to identify the motivational factors affecting software architects and software project managers using the survey technique. We have collected results from questionnaire surveys technique which will help software project managers and software architects to understand the factors that can affect the overall quality of the software and its architecture. The last step will be to propose an updated framework for Systematic Literature Review (SLR). This new concept of using Clustering, Genetic Algorithm and Agents in SLR was proposed to produce an efficient and optimized query search strings and searches for search engines.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124633818","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353149
Syed Hasan Adil, S. Qamar
The purpose of this paper is to implement association rule mining algorithm using Nvidia CUDA framework for general purpose computing on GPU. The major objective is to perform performance comparison of association rule mining algorithm using C based implementation on Intel Quad Core/Core2 Duo CPU with CUDA based implementation on Nvidia G80 and GTX 200 series GPU. The final outcome of this research is the bitmap based association rule mining algorithm and its performance statistics on CPU and GPU.
本文的目的是利用Nvidia CUDA框架在GPU上实现通用计算的关联规则挖掘算法。主要目标是在Intel Quad Core/Core2 Duo CPU上使用基于C的实现与Nvidia G80和GTX 200系列GPU上基于CUDA的实现进行关联规则挖掘算法的性能比较。本研究的最终成果是基于位图的关联规则挖掘算法及其在CPU和GPU上的性能统计。
{"title":"Implementation of association rule mining using CUDA","authors":"Syed Hasan Adil, S. Qamar","doi":"10.1109/ICET.2009.5353149","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353149","url":null,"abstract":"The purpose of this paper is to implement association rule mining algorithm using Nvidia CUDA framework for general purpose computing on GPU. The major objective is to perform performance comparison of association rule mining algorithm using C based implementation on Intel Quad Core/Core2 Duo CPU with CUDA based implementation on Nvidia G80 and GTX 200 series GPU. The final outcome of this research is the bitmap based association rule mining algorithm and its performance statistics on CPU and GPU.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125739955","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353184
S. Kayani, W. H. Bhatti, Khawar Khalil Jarral
An indigenous prototype mobile teleoperated robot has been designed and fabricated for urban surveillance [1]. This class of mobile robots finds its application in hazardous area exploration, explosives handling, disarming mines and improvised explosive devices (IEDs), remote monitoring and urban surveillance for law enforcement. This paper is a brief description of the design and fabrication process followed for development of the prototype robot. Robot telecontrol, real-time location identification and real-time video transfer are the main design characteristics along with development of a graphical user interface for controlling robot operation.
{"title":"On design and fabrication of a prototype teleoperated mobile surveillance robot","authors":"S. Kayani, W. H. Bhatti, Khawar Khalil Jarral","doi":"10.1109/ICET.2009.5353184","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353184","url":null,"abstract":"An indigenous prototype mobile teleoperated robot has been designed and fabricated for urban surveillance [1]. This class of mobile robots finds its application in hazardous area exploration, explosives handling, disarming mines and improvised explosive devices (IEDs), remote monitoring and urban surveillance for law enforcement. This paper is a brief description of the design and fabrication process followed for development of the prototype robot. Robot telecontrol, real-time location identification and real-time video transfer are the main design characteristics along with development of a graphical user interface for controlling robot operation.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132608675","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353209
Muhammad Asif, R. Baig
Recent studies have shown that Evolutionary Algorithms have had reasonable success at providing solutions to those problems that fall in NP-Complete class of algorithms. Ant Colony Optimization (ACO) algorithm is one of the promising field of evolutionary algorithms that gave acceptable solutions to Travelling Salesperson Problem and various Network Routing Optimization problems in polynomial time. These classic computer science problems belong to a NP-Complete class of problems that is amongst some of the most interesting in mathematics, including the Sudoku Puzzle Problem. People have tried to automate solving Sudoku Puzzle Problem using brute force, tabu search. Given the success of ACO algorithm with problems within NP-Complete class of problems, it would be interesting to see how it handles this puzzle. A novel technique is presented as modification to standard ACO algorithm. Moreover, we will compare performance matrix (quality of solution and time complexity) of ACO algorithm with other techniques presented in the past to solve the Sudoku puzzle.
{"title":"Solving NP-complete problem using ACO algorithm","authors":"Muhammad Asif, R. Baig","doi":"10.1109/ICET.2009.5353209","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353209","url":null,"abstract":"Recent studies have shown that Evolutionary Algorithms have had reasonable success at providing solutions to those problems that fall in NP-Complete class of algorithms. Ant Colony Optimization (ACO) algorithm is one of the promising field of evolutionary algorithms that gave acceptable solutions to Travelling Salesperson Problem and various Network Routing Optimization problems in polynomial time. These classic computer science problems belong to a NP-Complete class of problems that is amongst some of the most interesting in mathematics, including the Sudoku Puzzle Problem. People have tried to automate solving Sudoku Puzzle Problem using brute force, tabu search. Given the success of ACO algorithm with problems within NP-Complete class of problems, it would be interesting to see how it handles this puzzle. A novel technique is presented as modification to standard ACO algorithm. Moreover, we will compare performance matrix (quality of solution and time complexity) of ACO algorithm with other techniques presented in the past to solve the Sudoku puzzle.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132430168","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353163
Syed Yasser Arafat, M. Saleem, S. Hussain
Logo or Trademark is of high importance because it carries the goodwill of the company and the product. Products are mostly recognized by their brand logos. Their recognition is a major problem. A number of techniques are there for logo recognition. In this paper, a number of invariant techniques are compared to find out their effectiveness on various categories of brand logos. Techniques which were investigated are Hu's Invariant Moments, Log-Polar Transform (LPT), Fourier-Mellin transform (FMT), Gradient Location-Orientation Histogram (GLOH). Experiments were performed on University of Marry Land (UMD) database. Results are given, along with recognition rate and time taken. Results show that GLOH performs the best with approximately 97% recognition rate but need a more computational time while on the other extreme FMT technique performs poorest with recognition rate with average of approx. 85% but with least computational time compared to all other techniques.
标志或商标是非常重要的，因为它承载着公司和产品的商誉。产品大多是通过其品牌标识来识别的。对他们的认识是个大问题。有许多用于标识识别的技术。本文比较了几种不变量技术对不同类别品牌标识的有效性。研究了Hu不变矩、对数极变换(LPT)、傅里叶-梅林变换(FMT)、梯度位置-方向直方图(GLOH)等技术。实验在马里兰大学(University of mary Land, UMD)数据库上进行。给出了结果，以及识别率和所用时间。结果表明，GLOH算法的识别率最高，约为97%，但需要更多的计算时间;另一方面，FMT算法的识别率最低，平均约为97%。但与所有其他技术相比，计算时间最少。
{"title":"Comparative analysis of invariant schemes for logo classification","authors":"Syed Yasser Arafat, M. Saleem, S. Hussain","doi":"10.1109/ICET.2009.5353163","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353163","url":null,"abstract":"Logo or Trademark is of high importance because it carries the goodwill of the company and the product. Products are mostly recognized by their brand logos. Their recognition is a major problem. A number of techniques are there for logo recognition. In this paper, a number of invariant techniques are compared to find out their effectiveness on various categories of brand logos. Techniques which were investigated are Hu's Invariant Moments, Log-Polar Transform (LPT), Fourier-Mellin transform (FMT), Gradient Location-Orientation Histogram (GLOH). Experiments were performed on University of Marry Land (UMD) database. Results are given, along with recognition rate and time taken. Results show that GLOH performs the best with approximately 97% recognition rate but need a more computational time while on the other extreme FMT technique performs poorest with recognition rate with average of approx. 85% but with least computational time compared to all other techniques.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"151 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989275","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353152
M. Atif
This paper introduces a formal model of the distributed commit protocols in the process algebra mCRL2 and also their general requirements in the modal µ-calculus. We show how to make straightforward models of protocols and by doing so, how it becomes easy to identify problems. We apply this to the well-known Two-Phase Commit Protocol (2PC) and prove it problematic for single site failure. We also apply our method to its “amended” variant, the Three-Phase Commit Protocol (3PC) and prove it to be erroneous for simultaneous site failures. We present 2PC and 3PC in different communication settings and verify them with respect to their requirements.
{"title":"Analysis and verification of Two-Phase Commit & Three-Phase Commit Protocols","authors":"M. Atif","doi":"10.1109/ICET.2009.5353152","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353152","url":null,"abstract":"This paper introduces a formal model of the distributed commit protocols in the process algebra mCRL2 and also their general requirements in the modal µ-calculus. We show how to make straightforward models of protocols and by doing so, how it becomes easy to identify problems. We apply this to the well-known Two-Phase Commit Protocol (2PC) and prove it problematic for single site failure. We also apply our method to its “amended” variant, the Three-Phase Commit Protocol (3PC) and prove it to be erroneous for simultaneous site failures. We present 2PC and 3PC in different communication settings and verify them with respect to their requirements.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"96 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953917","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353188
I. H. Kazmi, A. I. Bhatti
In this work, an H infinity controller has been designed for regulation of output voltage of polymer electrolyte membrane (PEM) fuel cell system using Linear Matrix Inequality (LMI) framework. Load variations affect the output voltage of the system and degradation in the output voltage appears which results in the variable voltage. Variable voltage cannot be considered appropriate for almost all electrical devices. Therefore a steady voltage is necessary and in this communication, the output voltage of the system has been maintained by manipulating the reactant feed of oxidizer for small load variations. The available different linear models of the system were treated as vertices of the polytope. These linear models were identified under different loads. The LMI's have been generated from a convex region of desired pole placement. The simulation results show that the controller synthesized using the LMI framework is deemed more effective.
{"title":"Robust controller using LMI framework for PEM fuel cell system","authors":"I. H. Kazmi, A. I. Bhatti","doi":"10.1109/ICET.2009.5353188","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353188","url":null,"abstract":"In this work, an H infinity controller has been designed for regulation of output voltage of polymer electrolyte membrane (PEM) fuel cell system using Linear Matrix Inequality (LMI) framework. Load variations affect the output voltage of the system and degradation in the output voltage appears which results in the variable voltage. Variable voltage cannot be considered appropriate for almost all electrical devices. Therefore a steady voltage is necessary and in this communication, the output voltage of the system has been maintained by manipulating the reactant feed of oxidizer for small load variations. The available different linear models of the system were treated as vertices of the polytope. These linear models were identified under different loads. The LMI's have been generated from a convex region of desired pole placement. The simulation results show that the controller synthesized using the LMI framework is deemed more effective.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003079","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353123
A. H. Farooqi, Qurat-ul-ain, S. B. Kazmi, F. A. Khan
Mobile adhoc networks (MANETs) are good candidate for peer-to-peer (P2P) overlay architectures. In both, nodes work independently and are distributed in nature. P2P overlays are mostly built over traditional underlying IP network like Internet. There are two flavors of it; unstructured P2P such as Gnutella and structured P2P such as Chord. In this paper, we explain and evaluate Gnutella and Chord for different scenarios in NS-2 while keeping Adhoc On-demand Distance Vector (AODV) as underlying routing protocol. Simulation results show that unstructured P2P architecture achieves high hit rate and produces less updates. We further investigate Gnutella by changing the underlying routing protocol.
{"title":"Performance analysis of peer-to-peer overlay architectures for Mobile Ad hoc Networks","authors":"A. H. Farooqi, Qurat-ul-ain, S. B. Kazmi, F. A. Khan","doi":"10.1109/ICET.2009.5353123","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353123","url":null,"abstract":"Mobile adhoc networks (MANETs) are good candidate for peer-to-peer (P2P) overlay architectures. In both, nodes work independently and are distributed in nature. P2P overlays are mostly built over traditional underlying IP network like Internet. There are two flavors of it; unstructured P2P such as Gnutella and structured P2P such as Chord. In this paper, we explain and evaluate Gnutella and Chord for different scenarios in NS-2 while keeping Adhoc On-demand Distance Vector (AODV) as underlying routing protocol. Simulation results show that unstructured P2P architecture achieves high hit rate and produces less updates. We further investigate Gnutella by changing the underlying routing protocol.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738274","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 : 2009-12-11DOI: 10.1109/ICET.2009.5353126
M. Ahmad, Junaid Qadir, N. Rehman, A. Baig, Hammad Majeed
Internet Protocol Television — IPTV is a new form of traditional TV, in which TV content is delivered using IP based networks which are managed to provide the required level of quality of service, experience, security, interactivity and reliability. Quality of Service (QoS) and Quality of Experience (QoE) are the two major factors which need to be ensured in order to achieve IPTV customer satisfaction. Channel zapping latency is the major problem which affects QoE for IPTV users. In IPTV systems while switching channels, a delay occurs due to different factors like IGMP Join/Leave latency, video steam encoding and decoding time, network jitter and traffic load. These factors hinder the process of IPTV deployment at large scale and pose scalability issues to IPTV. In order to solve IPTV channel zapping latency problem, a number of approaches have been contributed by different researchers but due to bandwidth limitation and video quality issues, every approach has its own tradeoff. In this paper, we survey the current state-of-art in this thread of research and present the insights behind various approaches that have been proposed in literature to solve the problem of increased channel zapping time. In conclusion, we also point out open research questions and future research areas.
{"title":"Prediction-based channel zapping latency reduction techniques for IPTV systems — A survey","authors":"M. Ahmad, Junaid Qadir, N. Rehman, A. Baig, Hammad Majeed","doi":"10.1109/ICET.2009.5353126","DOIUrl":"https://doi.org/10.1109/ICET.2009.5353126","url":null,"abstract":"Internet Protocol Television — IPTV is a new form of traditional TV, in which TV content is delivered using IP based networks which are managed to provide the required level of quality of service, experience, security, interactivity and reliability. Quality of Service (QoS) and Quality of Experience (QoE) are the two major factors which need to be ensured in order to achieve IPTV customer satisfaction. Channel zapping latency is the major problem which affects QoE for IPTV users. In IPTV systems while switching channels, a delay occurs due to different factors like IGMP Join/Leave latency, video steam encoding and decoding time, network jitter and traffic load. These factors hinder the process of IPTV deployment at large scale and pose scalability issues to IPTV. In order to solve IPTV channel zapping latency problem, a number of approaches have been contributed by different researchers but due to bandwidth limitation and video quality issues, every approach has its own tradeoff. In this paper, we survey the current state-of-art in this thread of research and present the insights behind various approaches that have been proposed in literature to solve the problem of increased channel zapping time. In conclusion, we also point out open research questions and future research areas.","PeriodicalId":307661,"journal":{"name":"2009 International Conference on Emerging Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123615462","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
扫码关注我们
求助内容：
应助结果提醒方式：