Pub Date : 2014-09-01DOI: 10.1109/APNOMS.2014.6996585
Su-Kang Lee, Hyun-Min Ahn, Myung-Sup Kim
With the rapid growth of the Internet, the importance of application traffic analysis increases for efficient network management. The statistical information in traffic flows, can be efficiently utilized for application traffic identification. However, the packet out-of-order and retransmission generated at the traffic collection point reduce the performance of the statistics-based traffic analysis. In this paper, we propose a novel method to detect and resolve the packet out-of-order and retransmission problem in order to improve completeness and accuracy of the traffic identification. To prove the feasibility of the proposed method, we applied our method to a real traffic analysis system using statistical flow information, and compared the performance of the system with the selected 9 popular applications. The experiment showed maximum 4.9% of completeness growth in traffic bytes, which shows that the proposed method contributes to the analysis of heavy flow.
{"title":"Packet out-of-order and retransmission in statistics-based traffic analysis","authors":"Su-Kang Lee, Hyun-Min Ahn, Myung-Sup Kim","doi":"10.1109/APNOMS.2014.6996585","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996585","url":null,"abstract":"With the rapid growth of the Internet, the importance of application traffic analysis increases for efficient network management. The statistical information in traffic flows, can be efficiently utilized for application traffic identification. However, the packet out-of-order and retransmission generated at the traffic collection point reduce the performance of the statistics-based traffic analysis. In this paper, we propose a novel method to detect and resolve the packet out-of-order and retransmission problem in order to improve completeness and accuracy of the traffic identification. To prove the feasibility of the proposed method, we applied our method to a real traffic analysis system using statistical flow information, and compared the performance of the system with the selected 9 popular applications. The experiment showed maximum 4.9% of completeness growth in traffic bytes, which shows that the proposed method contributes to the analysis of heavy flow.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"48 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113973074","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996557
Xiaochun Jia, Xingyu Chen, Sujie Shao, F. Qi
Data collection communications system for electric power communication network is an important entity network in electric power system. It's significant to provide a reasonable routing mechanism for data collection system. The major risk of original routing mechanism is the burst congestion. In the data collection network of smart grid, that some nodes may suffer from more congestion than others even become the bottleneck of network become the new source of risk. In order to overcome these problems, this paper proposes a routing mechanism to realize data balance. This mechanism firstly abstracts a multigate network model of data collection system. Then, it proposes a routing measurement model to balance data traffic named data balance measurement model (DBMM). Subsequently it proposes a routing algorithm based on DBMM, named RA-DBMM. The RA-DBMM handles the data traffic to achieve data balance by modifying the routing decision measurement function. So the queue length of queuing data and buffer capacity of every nodes are taken into consideration. Simulation illustrates that the proposed RA-DBMM has biggish enhancement in minishing the congestion, reducing loss ratio, overcoming bottleneck and increasing throughput of network.
{"title":"Routing algorithm of smart grid data collection based on data balance measurement model","authors":"Xiaochun Jia, Xingyu Chen, Sujie Shao, F. Qi","doi":"10.1109/APNOMS.2014.6996557","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996557","url":null,"abstract":"Data collection communications system for electric power communication network is an important entity network in electric power system. It's significant to provide a reasonable routing mechanism for data collection system. The major risk of original routing mechanism is the burst congestion. In the data collection network of smart grid, that some nodes may suffer from more congestion than others even become the bottleneck of network become the new source of risk. In order to overcome these problems, this paper proposes a routing mechanism to realize data balance. This mechanism firstly abstracts a multigate network model of data collection system. Then, it proposes a routing measurement model to balance data traffic named data balance measurement model (DBMM). Subsequently it proposes a routing algorithm based on DBMM, named RA-DBMM. The RA-DBMM handles the data traffic to achieve data balance by modifying the routing decision measurement function. So the queue length of queuing data and buffer capacity of every nodes are taken into consideration. Simulation illustrates that the proposed RA-DBMM has biggish enhancement in minishing the congestion, reducing loss ratio, overcoming bottleneck and increasing throughput of network.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132832849","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996606
Yifan Ding, Yang Geng, Ruiyi Wang, Yang Yang, Wenjing Li
The user's Quality of Experience (QoE) is an assessment of the human experience. It's not only influenced by Quality of Service (QoS) parameters but also influenced by user's preference for video content. This article studies user's preference for video content and how user's QoE changes on account of their biases. Through two experiments, it is concluded that the higher the user's preference score is, the higher the user rate MOS and the less MOS reduces when the resolution of video decrease. That is, the more user likes the video content, the more tolerant they will be to quality reduction of videos. Then a network resource management strategy is proposed based on the conclusion, and a web site platform is established for the test. Eventually we get the result that 87.0% of the participants have their MOS value increased after using the strategy.
{"title":"QoE-oriented resource management strategy by considering user preference for video content","authors":"Yifan Ding, Yang Geng, Ruiyi Wang, Yang Yang, Wenjing Li","doi":"10.1109/APNOMS.2014.6996606","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996606","url":null,"abstract":"The user's Quality of Experience (QoE) is an assessment of the human experience. It's not only influenced by Quality of Service (QoS) parameters but also influenced by user's preference for video content. This article studies user's preference for video content and how user's QoE changes on account of their biases. Through two experiments, it is concluded that the higher the user's preference score is, the higher the user rate MOS and the less MOS reduces when the resolution of video decrease. That is, the more user likes the video content, the more tolerant they will be to quality reduction of videos. Then a network resource management strategy is proposed based on the conclusion, and a web site platform is established for the test. Eventually we get the result that 87.0% of the participants have their MOS value increased after using the strategy.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130236194","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996559
Tsozen Yeh, Liang-fan Chang
Companies and institutions often use Web proxy servers to service the multiple requests of the same Web pages (or Web objects) from users therein to save the network bandwidth and reduce the Internet latency. Web proxy servers usually are geographically close to their clients (users). If Web proxy serves have cached valid copies of requested Web objects, they can be directly delivered to users. Otherwise, users need to spend a long time on getting Web objects from their hosting Web servers. Both cases will require users to wait for their requests. This period of latency can be largely reduced if Web proxy servers could predict what Web objects users may need in the near future, and send those predicted Web objects to the client sites before their actual usage. Various predicting algorithms, such as those based on temporal locality and data mining, had been proposed to enable proxy servers to make prediction of what Web objects users may access. However, they often need to constantly update and maintain their models in realtime to make their schemes effective. As a result, for proxy servers servicing a large number of users, schemes demanding for complicated and realtime calculation will not be as useful as expected in practice. Based on Web sites and Web pages commonly visited by users, we proposed a new model with an offline learning algorithm to help Web proxy servers make prediction about upcoming requests of Web objects from users. Compared with the hit ratio achieved by the original environment without prediction, our model can improve the caching performance of users' Web browsers by up to 51.37%.
{"title":"Utilizing group prediction by users' interests to improve the performance of web proxy servers","authors":"Tsozen Yeh, Liang-fan Chang","doi":"10.1109/APNOMS.2014.6996559","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996559","url":null,"abstract":"Companies and institutions often use Web proxy servers to service the multiple requests of the same Web pages (or Web objects) from users therein to save the network bandwidth and reduce the Internet latency. Web proxy servers usually are geographically close to their clients (users). If Web proxy serves have cached valid copies of requested Web objects, they can be directly delivered to users. Otherwise, users need to spend a long time on getting Web objects from their hosting Web servers. Both cases will require users to wait for their requests. This period of latency can be largely reduced if Web proxy servers could predict what Web objects users may need in the near future, and send those predicted Web objects to the client sites before their actual usage. Various predicting algorithms, such as those based on temporal locality and data mining, had been proposed to enable proxy servers to make prediction of what Web objects users may access. However, they often need to constantly update and maintain their models in realtime to make their schemes effective. As a result, for proxy servers servicing a large number of users, schemes demanding for complicated and realtime calculation will not be as useful as expected in practice. Based on Web sites and Web pages commonly visited by users, we proposed a new model with an offline learning algorithm to help Web proxy servers make prediction about upcoming requests of Web objects from users. Compared with the hit ratio achieved by the original environment without prediction, our model can improve the caching performance of users' Web browsers by up to 51.37%.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122123532","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996107
L. Kao, Z. Tsai
Two commonly used methods for traffic information rely on Vehicle Detector (VD) and Global Positioning System-Based Vehicle Probe (GVP); however, they have some confinements, such as high cost for construction and maintenance, and limited coverage. For the sake of overcoming dilemmas happened on VD and GVP, Cellular-Based Vehicle Probe (CVP) comes into being. However, the current applications for CVP mainly focus on arteries or freeways, where traffic information for longer distance is derived from two Inter-Visitor Location Register Location Area Update (Inter-VLR LAU) events with various Location Area Code (LAC) borders, and the one for shorter distance is from two consecutive handover events. The perplexity of available CVP techniques comes about is that there are no two Inter-VLR LAU events with various LAC borders and few handover events in scenic spots. In order to expand the applications for CVP to scenic spots, a cost-effective and flexible method utilizing mobile network signalling called Enhanced CVP (ECVP) is proposed. The key concept for ECVP is that we adopt Inter-VLR LAU events at the origin and all kinds of communication events at the destination to retrieve traffic information. The inaccuracy of ECVP consists in the uncertainty of event occurred time at the destination. Therefore, with a view to acquiring more accurate traffic information, three novel Reinforced CVP (RCVP) algorithms, inclusive of Fixed r percent samples CVP (F-RCVP), Dynamic r percent samples (D-RCVP), and Dynamic r percent samples with Discarding former samples (DD-RCVP), are presented. Numerical results show that F-RCVP is suitable for scenic spots that the LAC border only contain samples resulting from cars. By contrast, if the samples consist of both cars and motorcycles, it is recommended that D-RCVP and DD-RCVP are introduced.
{"title":"A novel traffic information estimation method based on mobile network signaling","authors":"L. Kao, Z. Tsai","doi":"10.1109/APNOMS.2014.6996107","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996107","url":null,"abstract":"Two commonly used methods for traffic information rely on Vehicle Detector (VD) and Global Positioning System-Based Vehicle Probe (GVP); however, they have some confinements, such as high cost for construction and maintenance, and limited coverage. For the sake of overcoming dilemmas happened on VD and GVP, Cellular-Based Vehicle Probe (CVP) comes into being. However, the current applications for CVP mainly focus on arteries or freeways, where traffic information for longer distance is derived from two Inter-Visitor Location Register Location Area Update (Inter-VLR LAU) events with various Location Area Code (LAC) borders, and the one for shorter distance is from two consecutive handover events. The perplexity of available CVP techniques comes about is that there are no two Inter-VLR LAU events with various LAC borders and few handover events in scenic spots. In order to expand the applications for CVP to scenic spots, a cost-effective and flexible method utilizing mobile network signalling called Enhanced CVP (ECVP) is proposed. The key concept for ECVP is that we adopt Inter-VLR LAU events at the origin and all kinds of communication events at the destination to retrieve traffic information. The inaccuracy of ECVP consists in the uncertainty of event occurred time at the destination. Therefore, with a view to acquiring more accurate traffic information, three novel Reinforced CVP (RCVP) algorithms, inclusive of Fixed r percent samples CVP (F-RCVP), Dynamic r percent samples (D-RCVP), and Dynamic r percent samples with Discarding former samples (DD-RCVP), are presented. Numerical results show that F-RCVP is suitable for scenic spots that the LAC border only contain samples resulting from cars. By contrast, if the samples consist of both cars and motorcycles, it is recommended that D-RCVP and DD-RCVP are introduced.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122647586","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996581
Ardiansyah Musa Efendi, Sungmin Hwang, M. F. Muthohar, G. Bang, Deokjai Choi, Kyungbaek Kim, Wang-Cheol Song, Seung-Joon Seok, Seunghae Kim
Recently, OpenFlow and FlowVisor are the most promising architecture components of the software-defined networks (SDNs). The evolution of these components brought the revolution of utilizing network elements for the shared and virtual network infrastructure, however from the aspects of production networks, it still lacks of some key component. For example, policy-based services provisioning for user-defined requirement is an indispensable part. Hence, innovative aggregation management design for virtual network management system framework must be developed and tested. This paper describes an initial design to user-defined network infrastructure in order to make it capable of running policy-based engineering related experiments. We developed the framework regarding the real use cases upon the shared and virtual network in KREONET infrastructure. Moreover, we also presented perflow-user-defined specifications which include max rate limiter and dynamic priority assignment strategy to enhance the validation performance of our system for production networks.
{"title":"Aggregation management design for user-defined network infrastructure","authors":"Ardiansyah Musa Efendi, Sungmin Hwang, M. F. Muthohar, G. Bang, Deokjai Choi, Kyungbaek Kim, Wang-Cheol Song, Seung-Joon Seok, Seunghae Kim","doi":"10.1109/APNOMS.2014.6996581","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996581","url":null,"abstract":"Recently, OpenFlow and FlowVisor are the most promising architecture components of the software-defined networks (SDNs). The evolution of these components brought the revolution of utilizing network elements for the shared and virtual network infrastructure, however from the aspects of production networks, it still lacks of some key component. For example, policy-based services provisioning for user-defined requirement is an indispensable part. Hence, innovative aggregation management design for virtual network management system framework must be developed and tested. This paper describes an initial design to user-defined network infrastructure in order to make it capable of running policy-based engineering related experiments. We developed the framework regarding the real use cases upon the shared and virtual network in KREONET infrastructure. Moreover, we also presented perflow-user-defined specifications which include max rate limiter and dynamic priority assignment strategy to enhance the validation performance of our system for production networks.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121992775","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996562
Tomoki Kozu, Y. Akiyama, Saneyasu Yamaguchi
CUBIC TPC is a congestion control algorithm for TCP. It is the current default TCP algorithm in Linux. Because many Internet servers, such as web servers, are running on Linux operating system, keeping throughput obtained with this TCP algorithm enough is quite important. Then, many performance studies have been published. However, most of these studies were based on network simulators. Thus, evaluations using an actual TCP implementation and actual network elements are important in addition to these existing studies. In this paper, we focus on RTT (round trip time) fairness of CUBIC TCP, which is performance fairness among CUBIC TCP connections with different network delay times. Firstly, we present RTT fairness evaluation using actual TCP implementations and actual network elements and show that the RTT fairness is not enough. Secondly, we discuss the cause of the unfairness based on CUBIC TCP behavior. Thirdly, we propose a method for improving RTT fairness of CUBIC TCP, which is called SQUARE: FF (Feedback for Fairness based on square root of RTT). It has a mechanism with which an insufficient congestion window size is automatically increased. Finally, we present evaluation results and demonstrate that the proposed method provides better fairness than original CUBIC TCP implementation.
CUBIC TPC是TCP的拥塞控制算法。这是Linux当前默认的TCP算法。由于许多Internet服务器(如web服务器)都运行在Linux操作系统上，因此保持使用这种TCP算法获得的吞吐量非常重要。然后，发表了许多性能研究。然而，这些研究大多是基于网络模拟器。因此，除了这些现有的研究之外，使用实际的TCP实现和实际的网络元素进行评估也很重要。本文重点研究了CUBIC TCP的RTT(往返时间)公平性，即具有不同网络延迟时间的CUBIC TCP连接之间的性能公平性。首先，我们用实际的TCP实现和实际的网元对RTT公平性进行了评估，结果表明RTT公平性是不够的。其次，讨论了基于CUBIC TCP行为的不公平产生的原因。第三，我们提出了一种提高CUBIC TCP RTT公平性的方法，称为SQUARE: FF (Feedback for fairness based on SQUARE root of RTT)。它具有一种机制，可以自动增加不足的拥塞窗口大小。最后，我们给出了评估结果，并证明了该方法比原始的CUBIC TCP实现具有更好的公平性。
{"title":"SQUARE: FF on CUBIC TCP over Links with Different RTT","authors":"Tomoki Kozu, Y. Akiyama, Saneyasu Yamaguchi","doi":"10.1109/APNOMS.2014.6996562","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996562","url":null,"abstract":"CUBIC TPC is a congestion control algorithm for TCP. It is the current default TCP algorithm in Linux. Because many Internet servers, such as web servers, are running on Linux operating system, keeping throughput obtained with this TCP algorithm enough is quite important. Then, many performance studies have been published. However, most of these studies were based on network simulators. Thus, evaluations using an actual TCP implementation and actual network elements are important in addition to these existing studies. In this paper, we focus on RTT (round trip time) fairness of CUBIC TCP, which is performance fairness among CUBIC TCP connections with different network delay times. Firstly, we present RTT fairness evaluation using actual TCP implementations and actual network elements and show that the RTT fairness is not enough. Secondly, we discuss the cause of the unfairness based on CUBIC TCP behavior. Thirdly, we propose a method for improving RTT fairness of CUBIC TCP, which is called SQUARE: FF (Feedback for Fairness based on square root of RTT). It has a mechanism with which an insufficient congestion window size is automatically increased. Finally, we present evaluation results and demonstrate that the proposed method provides better fairness than original CUBIC TCP implementation.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124174924","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996110
Wei Liu, R. Shinkuma, Tatsuro Takahashi
Modern mobile devices (smart phones, wearable devices, and smart vehicles) have greater resources (communication, computation, and sensing) than before, and these resources are not always fully utilized by device users. Therefore, mobile devices, from time to time, encounter other devices that could provide resources to them. Because the amount of such resources has increased with the number of mobile devices, researchers have begun to consider making use of these resources, located at the “edge” of mobile networks, to increase the scalability of future information networks. This has led to a cooperation based architecture of mobile cloud computing (MCC). This paper reports the concept and design of a resource sharing mechanism that utilizes resources in mobile devices through opportunistic contacts between them. Theoretical models and formal definitions of problems are presented. The efficiency of the proposed mechanism is validated through simulation.
{"title":"Opportunistic resource sharing in mobile cloud computing: The single-copy case","authors":"Wei Liu, R. Shinkuma, Tatsuro Takahashi","doi":"10.1109/APNOMS.2014.6996110","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996110","url":null,"abstract":"Modern mobile devices (smart phones, wearable devices, and smart vehicles) have greater resources (communication, computation, and sensing) than before, and these resources are not always fully utilized by device users. Therefore, mobile devices, from time to time, encounter other devices that could provide resources to them. Because the amount of such resources has increased with the number of mobile devices, researchers have begun to consider making use of these resources, located at the “edge” of mobile networks, to increase the scalability of future information networks. This has led to a cooperation based architecture of mobile cloud computing (MCC). This paper reports the concept and design of a resource sharing mechanism that utilizes resources in mobile devices through opportunistic contacts between them. Theoretical models and formal definitions of problems are presented. The efficiency of the proposed mechanism is validated through simulation.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358560","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996514
Yu Cheng, Chih-Hsuan Chen
Beamforming is a well-known signal processing technique to increase the received signal strength to a chosen direction. Recently, the three dimensional (3D) beamforming technique has gained a growing interest due to its potential to enable various strategies like user specific elevation beam-forming and vertical sectorization. Compared with conventional horizontal beamforming, 3D beamforming exploits the channel's degrees of freedom in the elevation direction with the active antenna system (AAS). Currently, 3GPP is on the study phase of this advanced MIMO technique and is working on the 3D channel model specification. In this paper, we propose a new 3D beamforming algorithm which combines conventional horizontal beamforming and elevation beamforming. Simulations are used to evaluate our proposed beamforming algorithm in urban macro environment with different inter-site distance (ISD).
{"title":"A novel 3D beamforming scheme for LTE-Advanced system","authors":"Yu Cheng, Chih-Hsuan Chen","doi":"10.1109/APNOMS.2014.6996514","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996514","url":null,"abstract":"Beamforming is a well-known signal processing technique to increase the received signal strength to a chosen direction. Recently, the three dimensional (3D) beamforming technique has gained a growing interest due to its potential to enable various strategies like user specific elevation beam-forming and vertical sectorization. Compared with conventional horizontal beamforming, 3D beamforming exploits the channel's degrees of freedom in the elevation direction with the active antenna system (AAS). Currently, 3GPP is on the study phase of this advanced MIMO technique and is working on the 3D channel model specification. In this paper, we propose a new 3D beamforming algorithm which combines conventional horizontal beamforming and elevation beamforming. Simulations are used to evaluate our proposed beamforming algorithm in urban macro environment with different inter-site distance (ISD).","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128104106","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996537
Ziyu Wang, Jiahai Yang, Fuliang Li
Anomaly detection has been a hot topic in recent years due to its capability of detecting zero attacks. In this paper, we propose a new on-line anomaly detection method based on LMS algorithm. The basic idea of the LMS-based detector is to predict IGTE using IGFE, given the high linear correlation between them. Using the artificial synthetic data, it is shown that the LMS-based detector possesses strong detection capability, and its false positive rate is within acceptable scope.
{"title":"An on-line anomaly detection method based on LMS algorithm","authors":"Ziyu Wang, Jiahai Yang, Fuliang Li","doi":"10.1109/APNOMS.2014.6996537","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996537","url":null,"abstract":"Anomaly detection has been a hot topic in recent years due to its capability of detecting zero attacks. In this paper, we propose a new on-line anomaly detection method based on LMS algorithm. The basic idea of the LMS-based detector is to predict IGTE using IGFE, given the high linear correlation between them. Using the artificial synthetic data, it is shown that the LMS-based detector possesses strong detection capability, and its false positive rate is within acceptable scope.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126696324","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
扫码关注我们
求助内容：
应助结果提醒方式：