Pub Date : 2016-06-04DOI: 10.1109/ICCSN.2016.7587210
Yuwen Huang, Zhanji Wu, Chengxin Jiang, Kun Lu
Complex field network coding can earn larger diversity gain, better system reliability and higher network throughput in wireless communication with relay cooperative. An improved complex filed network coding scheme for large scale density network with user clustering and relay selection strategy will be proposed in this paper. The multiuser detector we employ is not based on maximum likelihood algorithm, but based on complex filed belief propagation algorithm improved from belief propagation decode algorithm of low density parity check code. As the same time, network decoding and channel decoding are combined together to form a joint network channel iterative decoder, in which the extrinsic information derive from network decode and that derive from channel decode can work well for each other. Numerical results are given to illustrate that our proposed scheme can provide better reliability, larger network diversity gain and higher throughput, more importantly, it can be well applied to large scale dense network when compared with traditional schemes.
{"title":"An improved scheme for large scale complex field network coding based on user clustering and relay selection strategy in wireless cooperative communication","authors":"Yuwen Huang, Zhanji Wu, Chengxin Jiang, Kun Lu","doi":"10.1109/ICCSN.2016.7587210","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7587210","url":null,"abstract":"Complex field network coding can earn larger diversity gain, better system reliability and higher network throughput in wireless communication with relay cooperative. An improved complex filed network coding scheme for large scale density network with user clustering and relay selection strategy will be proposed in this paper. The multiuser detector we employ is not based on maximum likelihood algorithm, but based on complex filed belief propagation algorithm improved from belief propagation decode algorithm of low density parity check code. As the same time, network decoding and channel decoding are combined together to form a joint network channel iterative decoder, in which the extrinsic information derive from network decode and that derive from channel decode can work well for each other. Numerical results are given to illustrate that our proposed scheme can provide better reliability, larger network diversity gain and higher throughput, more importantly, it can be well applied to large scale dense network when compared with traditional schemes.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133758649","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-06-04DOI: 10.1109/ICCSN.2016.7586637
Hongliang Fu, Lianf Chao
In order to solve the problem of feedback link overhead in MIMO-OFDM system, and improve the transmission efficiency, a limited feedback method based on KL domain is proposed in this paper. In this method, the state information which is obtained from the channel estimation performed in KL domain sparse at the receiving end. Thereby a small amount of linear measurements are obtained which represents the total channel state information, Then these measurements are fed back to the transmitting end. In the transmitter, the channel state information is reconstructed through orthogonal matching pursuit algorithm. The simulation results show that the proposed limited feedback based on KL (Karhuner-Loeve) domain method can achieve full channel state feedback effect and decreases the overhead in the feedback link.
{"title":"Research on compressed sensing of KL domain with limited feedback in MIMO-OFDM system","authors":"Hongliang Fu, Lianf Chao","doi":"10.1109/ICCSN.2016.7586637","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586637","url":null,"abstract":"In order to solve the problem of feedback link overhead in MIMO-OFDM system, and improve the transmission efficiency, a limited feedback method based on KL domain is proposed in this paper. In this method, the state information which is obtained from the channel estimation performed in KL domain sparse at the receiving end. Thereby a small amount of linear measurements are obtained which represents the total channel state information, Then these measurements are fed back to the transmitting end. In the transmitter, the channel state information is reconstructed through orthogonal matching pursuit algorithm. The simulation results show that the proposed limited feedback based on KL (Karhuner-Loeve) domain method can achieve full channel state feedback effect and decreases the overhead in the feedback link.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129956024","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-06-04DOI: 10.1109/ICCSN.2016.7586578
Lei Huang, Xiaoli Zhi, Q. Gao, Samina Kausar, Shengan Zheng
It is challenging to achieve network load balancing, simultaneously meeting the quality of service (QoS) demands of bandwidth and delays. In this paper we have designed and implemented a multicast routing system over Software Defined Networking (SDN) and sFlow. The system has been developed on the top of RYU controller. Our main contributions are: (1) compatibility of our system with traditional multicast applications which are based on the Internet Group Management Protocol (IGMP) v2 and multicast address; (2) choosing the optimum paths for multicast applications on the basis of currently available network bandwidth which is calculated accurately by sFlow; (3) reduction in unnecessary network traffic effectively and load balancing, thereby reducing the packet loss rate and delay in the multicast.
如何实现网络负载均衡，同时满足带宽和时延对服务质量(QoS)的要求是一个挑战。本文设计并实现了一个基于软件定义网络(SDN)和sFlow的组播路由系统。该系统是在RYU控制器的基础上开发的。我们的主要贡献有:(1)我们的系统兼容基于Internet Group Management Protocol (IGMP) v2和多播地址的传统多播应用;(2)根据sFlow精确计算的当前可用网络带宽，为组播应用选择最优路径;(3)有效减少不必要的网络流量并实现负载均衡，从而降低组播中的丢包率和时延。
{"title":"Design and implementation of multicast routing system over SDN and sFlow","authors":"Lei Huang, Xiaoli Zhi, Q. Gao, Samina Kausar, Shengan Zheng","doi":"10.1109/ICCSN.2016.7586578","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586578","url":null,"abstract":"It is challenging to achieve network load balancing, simultaneously meeting the quality of service (QoS) demands of bandwidth and delays. In this paper we have designed and implemented a multicast routing system over Software Defined Networking (SDN) and sFlow. The system has been developed on the top of RYU controller. Our main contributions are: (1) compatibility of our system with traditional multicast applications which are based on the Internet Group Management Protocol (IGMP) v2 and multicast address; (2) choosing the optimum paths for multicast applications on the basis of currently available network bandwidth which is calculated accurately by sFlow; (3) reduction in unnecessary network traffic effectively and load balancing, thereby reducing the packet loss rate and delay in the multicast.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363757","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-06-04DOI: 10.1109/ICCSN.2016.7586616
Jian Wang, Xinke Lv, Xiao Chen
Task Scheduling for parallel computing is a process to map the application to the multi-processors while minimize the execution time. Task scheduling is classified into static scheduling and dynamic scheduling. List scheduling is a class of static heuristic based scheduling algorithms with low complexity and good performance. Based on the principle of list scheduling algorithm with limited numbers of homogeneous multi-processors, this study analyzes the complexity and property of six typical kinds of list scheduling algorithms including HLFET, ISH, MCP, ETF, DLS and CPND. By using three types of task graphs including peer set graphs, traced graphs and random graphs, the schedule lengths of the six list scheduling algorithms are compared and analyzed. It can be concluded that the algorithms based on the critical path nodes (such as MCP, CPND) are generally better than other algorithms. The algorithms using dynamic properties (such as DLS, ETF) perform better than most of the algorithms adopting static properties.
{"title":"Comparative analysis of list scheduling algorithms on homogeneous multi-processors","authors":"Jian Wang, Xinke Lv, Xiao Chen","doi":"10.1109/ICCSN.2016.7586616","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586616","url":null,"abstract":"Task Scheduling for parallel computing is a process to map the application to the multi-processors while minimize the execution time. Task scheduling is classified into static scheduling and dynamic scheduling. List scheduling is a class of static heuristic based scheduling algorithms with low complexity and good performance. Based on the principle of list scheduling algorithm with limited numbers of homogeneous multi-processors, this study analyzes the complexity and property of six typical kinds of list scheduling algorithms including HLFET, ISH, MCP, ETF, DLS and CPND. By using three types of task graphs including peer set graphs, traced graphs and random graphs, the schedule lengths of the six list scheduling algorithms are compared and analyzed. It can be concluded that the algorithms based on the critical path nodes (such as MCP, CPND) are generally better than other algorithms. The algorithms using dynamic properties (such as DLS, ETF) perform better than most of the algorithms adopting static properties.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838079","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-06-04DOI: 10.1109/ICCSN.2016.7586673
Lan Wang, Yuhong Yang, Pengxu Li, Liangshan Li
A new algorithm for narrowband interference suppression in Direct Sequence Spread Spectrum (DSSS) system is presented. The algorithm combines the optimum frequency shift and the Undecimated Wavelet Packet Transform (UWPT) to locate the interference energy in as little sub-band as possible. In addition, the adaptive algorithm is used to reduce the harm to the signal caused by eliminating the disturbed sub-band. Simulation results show that the proposed algorithm has a better performance than the traditional Undecimated Wavelet Packet Transform with frequency shift (SUWPT) algorithm in the suppression of the Multi-Tone Interference (MTI).
{"title":"Multi-tone interference suppression in DSSS system based on the optimal frequency shift of undecimated wavelet packets","authors":"Lan Wang, Yuhong Yang, Pengxu Li, Liangshan Li","doi":"10.1109/ICCSN.2016.7586673","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586673","url":null,"abstract":"A new algorithm for narrowband interference suppression in Direct Sequence Spread Spectrum (DSSS) system is presented. The algorithm combines the optimum frequency shift and the Undecimated Wavelet Packet Transform (UWPT) to locate the interference energy in as little sub-band as possible. In addition, the adaptive algorithm is used to reduce the harm to the signal caused by eliminating the disturbed sub-band. Simulation results show that the proposed algorithm has a better performance than the traditional Undecimated Wavelet Packet Transform with frequency shift (SUWPT) algorithm in the suppression of the Multi-Tone Interference (MTI).","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116251","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-06-04DOI: 10.1109/ICCSN.2016.7586600
Ying Chen, Qiuhao Yu
The task of moving object segmentation is to partition an object into non-overlapping regions based on intensity or texture information. However, the conventional segmentation methods suffer from false object segmentation in complex backgrounds and slow convergence. In this paper, we propose an efficient segmentation algorithm for moving object with complicated structures in real video environment. Our novel approach, which integrates an adaptive single Gaussian model (SGM) with a generalized geodesic active contour (GGAC) model, is put forward to detect and segment moving objects in dynamic backgrounds. The proposed algorithm is implemented by level set method to reduce the expensive computational cost of re-initialization of the traditional level set function. By utilizing both spatial and temporal information, this integrated method is robust to complex environments. Experimental results demonstrate desirable segmentation improvement over widely used segmentation algorithms in terms of efficiency and accuracy.
{"title":"Efficient moving object segmentation algorithm based on the improvement of generalized geodesic active contour model","authors":"Ying Chen, Qiuhao Yu","doi":"10.1109/ICCSN.2016.7586600","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586600","url":null,"abstract":"The task of moving object segmentation is to partition an object into non-overlapping regions based on intensity or texture information. However, the conventional segmentation methods suffer from false object segmentation in complex backgrounds and slow convergence. In this paper, we propose an efficient segmentation algorithm for moving object with complicated structures in real video environment. Our novel approach, which integrates an adaptive single Gaussian model (SGM) with a generalized geodesic active contour (GGAC) model, is put forward to detect and segment moving objects in dynamic backgrounds. The proposed algorithm is implemented by level set method to reduce the expensive computational cost of re-initialization of the traditional level set function. By utilizing both spatial and temporal information, this integrated method is robust to complex environments. Experimental results demonstrate desirable segmentation improvement over widely used segmentation algorithms in terms of efficiency and accuracy.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118972","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-06-04DOI: 10.1109/ICCSN.2016.7586676
Changhsi Wu, Jianchang Zhou, B. Chen
This paper presents a new architecture of super regenerative On-Off keying receiver (SROOK RX) applying to the 5.8GHz Industrial Scientific Medical (ISM) band in TSMC 0.18 μm process. The proposed SROOK Rx uses a quenched oscillator to reduce the required gain of Low Noise Amplifier (LNA) and can achieve low power consumption. The technology of pulse width demodulator employs the Pulse-Width Expander (PWE) to convert the pulse into digitally binary level and achieves fine resolution, which allows the SROOK Rx to support OOK demodulation. To improve the sensitivity and reduce demodulation difficulty, a high-speed comparator is added between the Envelope Detector (ED) and PWE. From simulation results, the whole receiver consumes 7mW from 0.6V/1.2V supply voltages and achieves data rate of 6 Mbps and sensitivity of -115dBm (hence energy efficiency of 1.17nJ/bit). The core area is 1.2×0.8 mm2.
{"title":"Design of super regenerative on-off keying receiver for 5.8GHz ISM band short range applications","authors":"Changhsi Wu, Jianchang Zhou, B. Chen","doi":"10.1109/ICCSN.2016.7586676","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586676","url":null,"abstract":"This paper presents a new architecture of super regenerative On-Off keying receiver (SROOK RX) applying to the 5.8GHz Industrial Scientific Medical (ISM) band in TSMC 0.18 μm process. The proposed SROOK Rx uses a quenched oscillator to reduce the required gain of Low Noise Amplifier (LNA) and can achieve low power consumption. The technology of pulse width demodulator employs the Pulse-Width Expander (PWE) to convert the pulse into digitally binary level and achieves fine resolution, which allows the SROOK Rx to support OOK demodulation. To improve the sensitivity and reduce demodulation difficulty, a high-speed comparator is added between the Envelope Detector (ED) and PWE. From simulation results, the whole receiver consumes 7mW from 0.6V/1.2V supply voltages and achieves data rate of 6 Mbps and sensitivity of -115dBm (hence energy efficiency of 1.17nJ/bit). The core area is 1.2×0.8 mm2.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122873708","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-06-04DOI: 10.1109/ICCSN.2016.7586594
Miao Yu, Wu Yang, Wei Wang, G. Shen
In microblogging, information influence is very hard to be measured. Because there are a lot of spam messages, and these messages were retweeted and commented by a lot of spam users in microblogging. Early methods for a message influence measurement mainly use message retweet and comment times. But they don't consider the quality of user, who takes part in the information diffusion. In this paper, we propose a novel measurement method based on user quality and information attribute. Experimental results show that our method can measure the influence more accurately and reduce the spam message influence in the dataset more effectively.
{"title":"Information influence measurement based on user quality and information attribute in microblogging","authors":"Miao Yu, Wu Yang, Wei Wang, G. Shen","doi":"10.1109/ICCSN.2016.7586594","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586594","url":null,"abstract":"In microblogging, information influence is very hard to be measured. Because there are a lot of spam messages, and these messages were retweeted and commented by a lot of spam users in microblogging. Early methods for a message influence measurement mainly use message retweet and comment times. But they don't consider the quality of user, who takes part in the information diffusion. In this paper, we propose a novel measurement method based on user quality and information attribute. Experimental results show that our method can measure the influence more accurately and reduce the spam message influence in the dataset more effectively.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129045208","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}
Digital IF (Intermediate Frequency) is an indispensable key technology in modern communication, among which digital up converter (DUC) and digital down converter (DDC) are important parts between baseband and IF. In this paper, we give a general method and solution of designing digital IF to meet the demands of practical application. Firstly, we analyze the theories and technologies of digital IF including filter bank and DUC. Secondly, we set about analyzing how to design filter bank in key part and implement a superheterodyne. Finally, we put forward a specific design plan of DUC and develop a digital IF suitable for TDD-LTE (Time Division Long Term Evolution) system. The results of simulation show that our design method of DUC can satisfy the requirements of relevant indicators. It has been implemented on FPGA platform in a practical LTE based transmitter.
{"title":"Research and implementation of the digital intermediate frequency in LTE superheterodyne transmitter","authors":"Zhang Yuan, Yuan Xingmeng, Qin Jian, Xia Lei, Chen Chao, Bao Minghui","doi":"10.1109/ICCSN.2016.7586666","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586666","url":null,"abstract":"Digital IF (Intermediate Frequency) is an indispensable key technology in modern communication, among which digital up converter (DUC) and digital down converter (DDC) are important parts between baseband and IF. In this paper, we give a general method and solution of designing digital IF to meet the demands of practical application. Firstly, we analyze the theories and technologies of digital IF including filter bank and DUC. Secondly, we set about analyzing how to design filter bank in key part and implement a superheterodyne. Finally, we put forward a specific design plan of DUC and develop a digital IF suitable for TDD-LTE (Time Division Long Term Evolution) system. The results of simulation show that our design method of DUC can satisfy the requirements of relevant indicators. It has been implemented on FPGA platform in a practical LTE based transmitter.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128900610","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-06-04DOI: 10.1109/ICCSN.2016.7586692
Zhenghuan Zhang, Xiaofeng Jiang, H. Xi
The rapid progress of cloud technology has attracted a growing number of video providers to deploy their streaming services onto multiple distributed datacenters for more cost-effective performance. The emerging Software-Defined Networking (SDN) technology overcomes the limitation of the existing network and provides a promising solution to manage the underlying network. In this paper, we introduce an SDN-enabled cloud video distribution architecture and propose a joint resource allocation and traffic management mechanism to improve user experience and reduce the system operational cost. We use a delay utility function to represent user experience and formulate the joint optimization problem as a convex optimization problem. We conduct simulations to evaluate the performance of our algorithm and the results show that our strategy can effectively cut down the total cost and guarantee user experience.
{"title":"Joint resource allocation and traffic management for cloud video distribution over software-defined networks","authors":"Zhenghuan Zhang, Xiaofeng Jiang, H. Xi","doi":"10.1109/ICCSN.2016.7586692","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586692","url":null,"abstract":"The rapid progress of cloud technology has attracted a growing number of video providers to deploy their streaming services onto multiple distributed datacenters for more cost-effective performance. The emerging Software-Defined Networking (SDN) technology overcomes the limitation of the existing network and provides a promising solution to manage the underlying network. In this paper, we introduce an SDN-enabled cloud video distribution architecture and propose a joint resource allocation and traffic management mechanism to improve user experience and reduce the system operational cost. We use a delay utility function to represent user experience and formulate the joint optimization problem as a convex optimization problem. We conduct simulations to evaluate the performance of our algorithm and the results show that our strategy can effectively cut down the total cost and guarantee user experience.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115483003","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
扫码关注我们
求助内容：
应助结果提醒方式：