Pub Date : 2016-12-01DOI: 10.1109/ATNAC.2016.7878786
Jiaqi Zhang, Xiujuan Ma, Xin Zou, Lidong Wang
Flow-based inspection is playing an important role in network security monitoring systems such as intrusion detection, attacks detection and so on. Traditional flow scheduling strategies are usually based on calculated hash values of input flows which is fixed for a long time. As the bandwidth grows dramatically these years, it is observed that servers handling flow inspections may be crashed due to large flow rates. However, fixed flow scheduling may still assign flows to the busy or crashed server causing those flows unprocessed. Thus it is important to choose proper scheduling strategy to fully exploit the server groups. In this article, a dynamic flow scheduling technique is proposed, where the flows are scheduled in reciprocal proportion to the load of targeted servers, i.e. CPU utility, memory usage, etc‥ A demonstration system is built and the results show that the proposed scheduling technique effectively reduced the packet drop rate of servers by 15%.
{"title":"Load-based dynamic flow scheduling in network security monitoring systems","authors":"Jiaqi Zhang, Xiujuan Ma, Xin Zou, Lidong Wang","doi":"10.1109/ATNAC.2016.7878786","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878786","url":null,"abstract":"Flow-based inspection is playing an important role in network security monitoring systems such as intrusion detection, attacks detection and so on. Traditional flow scheduling strategies are usually based on calculated hash values of input flows which is fixed for a long time. As the bandwidth grows dramatically these years, it is observed that servers handling flow inspections may be crashed due to large flow rates. However, fixed flow scheduling may still assign flows to the busy or crashed server causing those flows unprocessed. Thus it is important to choose proper scheduling strategy to fully exploit the server groups. In this article, a dynamic flow scheduling technique is proposed, where the flows are scheduled in reciprocal proportion to the load of targeted servers, i.e. CPU utility, memory usage, etc‥ A demonstration system is built and the results show that the proposed scheduling technique effectively reduced the packet drop rate of servers by 15%.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127138850","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-12-01DOI: 10.1109/ATNAC.2016.7878823
M. Rana, R. Vesilo, I. Collings
Massive MIMO has the potential to offer high throughput in today's fast wireless communication systems, however, the large number of antennas and RF chains needed at the transmitter brings the challenge of high system complexity and hardware energy consumption. In this paper, two semi-heuristic techniques are proposed for practical antenna selection in a multi-user MIMO broadcast system using principal components analysis (PCA) to reduce signal correlations at users and remove antennas that contribute least to system sum capacity, thereby reducing the number of RF chains needed. Zero forcing precoding is used and users are equipped with a single antenna. Using analytic methods PCA eigenvalues are decomposed into two components: the mean channel gain component and the channel correlation component. Using simulation we show that the proposed antenna selection methods perform much better using mean channel gain selection and show how antenna selection depends on the channel matrix structure.
{"title":"Antenna selection in massive MIMO using non-central Principal Component Analysis","authors":"M. Rana, R. Vesilo, I. Collings","doi":"10.1109/ATNAC.2016.7878823","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878823","url":null,"abstract":"Massive MIMO has the potential to offer high throughput in today's fast wireless communication systems, however, the large number of antennas and RF chains needed at the transmitter brings the challenge of high system complexity and hardware energy consumption. In this paper, two semi-heuristic techniques are proposed for practical antenna selection in a multi-user MIMO broadcast system using principal components analysis (PCA) to reduce signal correlations at users and remove antennas that contribute least to system sum capacity, thereby reducing the number of RF chains needed. Zero forcing precoding is used and users are equipped with a single antenna. Using analytic methods PCA eigenvalues are decomposed into two components: the mean channel gain component and the channel correlation component. Using simulation we show that the proposed antenna selection methods perform much better using mean channel gain selection and show how antenna selection depends on the channel matrix structure.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128870749","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-12-01DOI: 10.1109/ATNAC.2016.7878797
Beomjun Kim, Sanghyun Son, Jaebong Lim, Yunju Baek
Exchange of image information is one of the main features of a camera network. In order to exchange a large amount of information, a platform with good communication speed is needed. In this study, we designed and implemented a specialized camera network platform using Wi-Fi Direct devices. This platform can provide various services to other devices within the same network. We designed the platform in 3 parts: a network, image processing and an embedded database. We modified the operation model of Wi-Fi Direct for adjustment. We designed a method to form a camera network using Wi-Fi Direct. In addition, we proposed two methods for minimizing delay in network formation. The performance of the proposed methods was evaluated using simulation. The feasibility of the proposed platform was also evaluated with experiments. Our results show that the proposed group formation methods outperformed the conventional method.
{"title":"Design and implementation of camera network platform for information exchange using dual wireless interface","authors":"Beomjun Kim, Sanghyun Son, Jaebong Lim, Yunju Baek","doi":"10.1109/ATNAC.2016.7878797","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878797","url":null,"abstract":"Exchange of image information is one of the main features of a camera network. In order to exchange a large amount of information, a platform with good communication speed is needed. In this study, we designed and implemented a specialized camera network platform using Wi-Fi Direct devices. This platform can provide various services to other devices within the same network. We designed the platform in 3 parts: a network, image processing and an embedded database. We modified the operation model of Wi-Fi Direct for adjustment. We designed a method to form a camera network using Wi-Fi Direct. In addition, we proposed two methods for minimizing delay in network formation. The performance of the proposed methods was evaluated using simulation. The feasibility of the proposed platform was also evaluated with experiments. Our results show that the proposed group formation methods outperformed the conventional method.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122695542","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-12-01DOI: 10.1109/ATNAC.2016.7878782
L. Ariyasinghe, Zhiyi Huang, Haibo Zhang, D. Eyers
When media is streamed over networks that only provide best-effort delivery, playback interruptions caused by variations of network throughput can be largely eliminated by using techniques such as client-side playback buffering. A larger buffer generally provides stronger protection against playback interruptions, since it accommodates a wider range of download rate variability. However, larger buffers also incur longer start-up delays, and longer delays in re-buffering, should a playback interruption occur. In this paper, we propose a scheme that enables the client-side player to dynamically calculate the minimum possible playback buffer that it needs given an estimation of network throughput, and may thus allow an earlier start to playback, while avoiding buffer under-runs. We have confirmed that a number of popular, real-world videos—encoded using Variable bitrate (VBR) schemes—contain bitrate patterns that allow them to safely start playback earlier than their average bitrate metadata would suggest. Our scheme augments each video stream so that client-side software can use a model of the network throughput to determine whether it can safely start playback early. We tested the proposed scheme against two popular media players using real video sequences. Among the tested videos, in the best case, our scheme could start playback with less than 1% of the delay incurred by one of the tested players, while still avoiding buffer under-runs.
{"title":"VPAP: VBR Pattern Aware Playback Buffering for video streaming","authors":"L. Ariyasinghe, Zhiyi Huang, Haibo Zhang, D. Eyers","doi":"10.1109/ATNAC.2016.7878782","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878782","url":null,"abstract":"When media is streamed over networks that only provide best-effort delivery, playback interruptions caused by variations of network throughput can be largely eliminated by using techniques such as client-side playback buffering. A larger buffer generally provides stronger protection against playback interruptions, since it accommodates a wider range of download rate variability. However, larger buffers also incur longer start-up delays, and longer delays in re-buffering, should a playback interruption occur. In this paper, we propose a scheme that enables the client-side player to dynamically calculate the minimum possible playback buffer that it needs given an estimation of network throughput, and may thus allow an earlier start to playback, while avoiding buffer under-runs. We have confirmed that a number of popular, real-world videos—encoded using Variable bitrate (VBR) schemes—contain bitrate patterns that allow them to safely start playback earlier than their average bitrate metadata would suggest. Our scheme augments each video stream so that client-side software can use a model of the network throughput to determine whether it can safely start playback early. We tested the proposed scheme against two popular media players using real video sequences. Among the tested videos, in the best case, our scheme could start playback with less than 1% of the delay incurred by one of the tested players, while still avoiding buffer under-runs.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115549025","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-12-01DOI: 10.1080/17445760.2018.1426761
Yen-Chung Chen, Jehn-Ruey Jiang
In Wireless Rechargeable Sensor Networks (WRSNs), wireless chargers can recharge batteries of sensor nodes so that they can operate sustainably. Since wireless chargers are costly and have limited charging distances and angles, how to apply as few as possible chargers to cover all sensor nodes and satisfy their energy requirements is thus an important and challenging problem. This paper proposes the PSCD (Particle Swarm Charger Deployment) algorithm using the Particle Swarm Optimization (PSO) concept to nearly optimize WRSN charger deployment. PSCD estimates charging efficiency according to the distance and angle between chargers and sensor nodes. It then, on the basis of PSO, utilizes the local optimal result and the global optimal result to adjust locations and antenna orientations of chargers to make WRSNs sustainable. We perform experiments using practical wireless chargers to obtain charging efficiency data. Based on the data, PSCD is simulated and compared with two related heuristic greedy algorithms to show its superiority.
{"title":"Particle Swarm Optimization for Charger Deployment in Wireless Rechargeable Sensor Networks","authors":"Yen-Chung Chen, Jehn-Ruey Jiang","doi":"10.1080/17445760.2018.1426761","DOIUrl":"https://doi.org/10.1080/17445760.2018.1426761","url":null,"abstract":"In Wireless Rechargeable Sensor Networks (WRSNs), wireless chargers can recharge batteries of sensor nodes so that they can operate sustainably. Since wireless chargers are costly and have limited charging distances and angles, how to apply as few as possible chargers to cover all sensor nodes and satisfy their energy requirements is thus an important and challenging problem. This paper proposes the PSCD (Particle Swarm Charger Deployment) algorithm using the Particle Swarm Optimization (PSO) concept to nearly optimize WRSN charger deployment. PSCD estimates charging efficiency according to the distance and angle between chargers and sensor nodes. It then, on the basis of PSO, utilizes the local optimal result and the global optimal result to adjust locations and antenna orientations of chargers to make WRSNs sustainable. We perform experiments using practical wireless chargers to obtain charging efficiency data. Based on the data, PSCD is simulated and compared with two related heuristic greedy algorithms to show its superiority.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"4999 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123587923","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-12-01DOI: 10.1109/ATNAC.2016.7878780
Shuraia Khan
Due to climate change, traditional fertilization and watering system become very hard to get success of growing plants in certain areas. On the other hand, humanity depends on water and Agriculture for survival. As a result optimal, profitable and sustainable use of water is critical. Several researchers continue their research on precision agriculture for easy implementation, continuous monitoring and control of water for the community. Wireless Sensor Network (WSN) is a very reliable and successful technology in precision agriculture. This research proposes a WSN based approach using some convenient instrument that able to monitor and control water level in well using remote devices from distance location. This paper gives an overall description of a WSN based model and implementation that includes introduction and relevant argument indicating the importance and validity of this research, methodology and implementation using Texas Instrument ZNP2530 kit, results and future recommendations.
{"title":"Wireless Sensor Network based Water Well Management System for precision agriculture","authors":"Shuraia Khan","doi":"10.1109/ATNAC.2016.7878780","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878780","url":null,"abstract":"Due to climate change, traditional fertilization and watering system become very hard to get success of growing plants in certain areas. On the other hand, humanity depends on water and Agriculture for survival. As a result optimal, profitable and sustainable use of water is critical. Several researchers continue their research on precision agriculture for easy implementation, continuous monitoring and control of water for the community. Wireless Sensor Network (WSN) is a very reliable and successful technology in precision agriculture. This research proposes a WSN based approach using some convenient instrument that able to monitor and control water level in well using remote devices from distance location. This paper gives an overall description of a WSN based model and implementation that includes introduction and relevant argument indicating the importance and validity of this research, methodology and implementation using Texas Instrument ZNP2530 kit, results and future recommendations.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124762776","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-12-01DOI: 10.1109/ATNAC.2016.7878811
N. Ahmed, M. A. Rashid, Monirul Islam
This paper introduces a hybrid optical Code division multiplexing (OCDMA) over wavelength division multiplexing (WDM) system with differential phase shift keying (DPSK) modulation using direct and complementary subtraction detection techniques. Two different technologies namely, OCDMA and WDM are combined together as a hybrid system to increase the transmission capacity, security and reliability of the network. Multiple access interference (MAI) is one of the main factors that degrade the performance of such hybrid system. The modified double weight (MDW) code is used as a signature address code for the system. The application of direct and complementary subtraction detection techniques at data bit rate of 1Gbps are compared. OptiSystem version 12 is used for simulation to investigate the proposed system. Simulation results reveal that the complementary subtraction technique provides better BER vs distance performance than the direct detection technique.
本文介绍了一种采用直接和互补减法检测技术，采用差分相移键控(DPSK)调制的混合光码分复用(OCDMA) /波分复用(WDM)系统。将OCDMA和WDM两种不同的技术结合在一起，形成一个混合系统，以增加网络的传输容量、安全性和可靠性。多址干扰是影响混合通信系统性能的主要因素之一。修改后的MDW码作为系统的签名地址码。比较了数据比特率为1Gbps时直接减法检测技术和互补减法检测技术的应用。使用OptiSystem version 12进行仿真以研究所提出的系统。仿真结果表明，互补减法技术比直接检测技术具有更好的误码率与距离性能。
{"title":"Hybrid OCDMA Over WDM system with DPSK modulation using direct and complementary subtraction detection techniques","authors":"N. Ahmed, M. A. Rashid, Monirul Islam","doi":"10.1109/ATNAC.2016.7878811","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878811","url":null,"abstract":"This paper introduces a hybrid optical Code division multiplexing (OCDMA) over wavelength division multiplexing (WDM) system with differential phase shift keying (DPSK) modulation using direct and complementary subtraction detection techniques. Two different technologies namely, OCDMA and WDM are combined together as a hybrid system to increase the transmission capacity, security and reliability of the network. Multiple access interference (MAI) is one of the main factors that degrade the performance of such hybrid system. The modified double weight (MDW) code is used as a signature address code for the system. The application of direct and complementary subtraction detection techniques at data bit rate of 1Gbps are compared. OptiSystem version 12 is used for simulation to investigate the proposed system. Simulation results reveal that the complementary subtraction technique provides better BER vs distance performance than the direct detection technique.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128591404","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-12-01DOI: 10.1109/ATNAC.2016.7878798
Z. Liu, Ruoyu Wang
labeled mobile network traffic traces are the foundation of mobile traffic research. However, traditional label method may be not suitable for mobile traffic. This paper devised a mobilegt to address this problem. It is composed by mobilegt client and mobilegt server. Mobilegt client includes a socket logger and a traffic manager. Mobilegt server includes a VPN server, a traffic logger and a traffic label model. Mobilegt associates apps with mobile traffic. Researchers can obtain labeled mobile traffic by it without network management privilege. Experimental results show that its completeness can achieve to 98% and 93% in terms of bytes and flows respectively.
{"title":"Mobilegt: A system to collect mobile traffic trace and build the ground truth","authors":"Z. Liu, Ruoyu Wang","doi":"10.1109/ATNAC.2016.7878798","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878798","url":null,"abstract":"labeled mobile network traffic traces are the foundation of mobile traffic research. However, traditional label method may be not suitable for mobile traffic. This paper devised a mobilegt to address this problem. It is composed by mobilegt client and mobilegt server. Mobilegt client includes a socket logger and a traffic manager. Mobilegt server includes a VPN server, a traffic logger and a traffic label model. Mobilegt associates apps with mobile traffic. Researchers can obtain labeled mobile traffic by it without network management privilege. Experimental results show that its completeness can achieve to 98% and 93% in terms of bytes and flows respectively.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128523147","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-12-01DOI: 10.1109/ATNAC.2016.7878805
Talal Alharbi, M. Portmann
Address Resolution Protocol (ARP) traffic typically makes up a very significant amount of broadcast traffic in a wide range of networks. A common approach to reduce the network overhead of ARP in the context of Software Defined Networks (SDN) is via Proxy ARP, where the SDN controller answers ARP requests on behalf of the hosts. In this paper, we present a significant improvement of this approach, by offloading the proxy ARP functionality from the controller to OpenFlow switches. As we will show via experiments, this has the benefit of significantly reducing the controller load as well as the ARP response time. In contrast to related works, our approach does not rely on any non-standard switch extensions, and is fully OpenFlow standard compliant.
{"title":"SProxy ARP - efficient ARP handling in SDN","authors":"Talal Alharbi, M. Portmann","doi":"10.1109/ATNAC.2016.7878805","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878805","url":null,"abstract":"Address Resolution Protocol (ARP) traffic typically makes up a very significant amount of broadcast traffic in a wide range of networks. A common approach to reduce the network overhead of ARP in the context of Software Defined Networks (SDN) is via Proxy ARP, where the SDN controller answers ARP requests on behalf of the hosts. In this paper, we present a significant improvement of this approach, by offloading the proxy ARP functionality from the controller to OpenFlow switches. As we will show via experiments, this has the benefit of significantly reducing the controller load as well as the ARP response time. In contrast to related works, our approach does not rely on any non-standard switch extensions, and is fully OpenFlow standard compliant.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133302347","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-12-01DOI: 10.1109/ATNAC.2016.7878821
Hiroaki Konoura, Masafumi Kinoshita, Takafumi Koike, K. Leibnitz, M. Murata
In the Internet of Things (IoT) era, message queue systems are highly required to control the large amount of message traffic between field devices, heterogeneous back-end applications, and services with high interoperability. In today's trend of rapid development cycle, the role and number of each back-end application system (BES) are frequently modified. In this case, the message queue systems receiving dequeue requests from BESs cannot maintain their preliminarily estimated maximum throughput, because the proportional increase of missed dequeues (i.e. no message is available) results in a waste of computational resources. Therefore, we propose the retry dequeue-request scheduling (RDS) method, which decreases the number of dequeue requests from BESs by delaying the replies to BESs when missed dequeues occur. Evaluation results show that the RDS method gives a 70% throughput improvement compared with the conventional method.
{"title":"Efficient dequeuing technique for distributed messaging systems processing massive message volumes","authors":"Hiroaki Konoura, Masafumi Kinoshita, Takafumi Koike, K. Leibnitz, M. Murata","doi":"10.1109/ATNAC.2016.7878821","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878821","url":null,"abstract":"In the Internet of Things (IoT) era, message queue systems are highly required to control the large amount of message traffic between field devices, heterogeneous back-end applications, and services with high interoperability. In today's trend of rapid development cycle, the role and number of each back-end application system (BES) are frequently modified. In this case, the message queue systems receiving dequeue requests from BESs cannot maintain their preliminarily estimated maximum throughput, because the proportional increase of missed dequeues (i.e. no message is available) results in a waste of computational resources. Therefore, we propose the retry dequeue-request scheduling (RDS) method, which decreases the number of dequeue requests from BESs by delaying the replies to BESs when missed dequeues occur. Evaluation results show that the RDS method gives a 70% throughput improvement compared with the conventional method.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839707","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
扫码关注我们
求助内容：
应助结果提醒方式：