Shinnosuke Nirasawa, Masaki Hara, Saneyasu Yamaguchi, M. Oguchi, A. Nakao, Shu Yamamoto
{"title":"Application performance improvement with application aware DPN switches","authors":"Shinnosuke Nirasawa, Masaki Hara, Saneyasu Yamaguchi, M. Oguchi, A. Nakao, Shu Yamamoto","doi":"10.1109/APNOMS.2016.7737290","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737290","url":null,"abstract":"Large scale applications in data centers are composed of computers connected with a network. Traditional network switches do not perform routing based on packet contents. Thus, packets cannot be transmitted to the optimal computer for the request which is written in the packet payload. On the other hand, Deeply Programmable Network (DPN) switches can completely analyze packet payloads and perform routing based on their contents. In this paper, we focus on packet routing based on Deep Packet Inspection (DPI), i.e. analyzing packet payload, using DPN switches, and discuss performance of applications on a network using application aware DPN switches. We introduce application aware network and propose a method for improving application performance with DPN switch support. We evaluate our method with the several applications and show that our method can increase application performance.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132226337","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}
{"title":"An HMM-based performance diagnosis approach for Hadoop clusters","authors":"Jiacong Li, Y. Wang, Jinke Yu, Shaoyong Guo","doi":"10.1109/APNOMS.2016.7737230","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737230","url":null,"abstract":"Hadoop has become a popular platform for the management of big data. To provide a healthy Hadoop platform for big data application, an HMM-based approach for performance diagnosis in Hadoop clusters is proposed. We use metrics which are collected under the normal situation to train HMM (Hidden Markov Model), then use this model to detect anomaly based on the probability, which is more accurate than other methods. Through evaluation in a controlled environment running Hadoop clusters, we find our approach can find out the real cause of performance problems in an average 84% precision and 83% recall, which is better than the method based on ARIMA and KNN (k-Nearest Neighbor).","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134244929","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}
{"title":"Packet cache network function for peer-to-peer traffic management with Bloom-filter based flow classification","authors":"Kengo Sasaki, A. Nakao","doi":"10.1109/APNOMS.2016.7737214","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737214","url":null,"abstract":"Following the emergence of peer-to-peer (P2P) applications, millions of computer users have used P2P systems to search for desired content. P2P traffic is known to be highly redundant because of its inherent self-scaling characteristics, which means that file sharing is performed more efficiently when more users exchange the same content. To remove redundant P2P traffic, we have proposed a method to control the P2P traffic through a packet-level data cache that acts as a network function at the edge of the Internet service provider (ISP) networks [1]. However, our previous method involves high levels of memory consumption. Software-defined networking (SON) and network functions virtualization (NFV) are representative trends in network soft-warization that may lower the barrier to deployment of network management functions that are considered to be useful but are difficult to actually implement and deploy. In this paper, we propose a new flow classification for P2P that uses a queue Bloom filter (QBF) to reduce the memory consumption of the P2P cache. The QBF is a time series queue that manages Bloom filters and it can remove inserted Bloom filter elements without generating false positives. If the router can confirm that P2P flows are carrying duplicate contents using QBF, it then begins to cache the duplicate content. Our analysis shows that the proposed method reduces memory consumption to 67% and improves the P2P cache hit ratio by 4% when compared with the previous approach, while its performance in removing redundancy from the P2P traffic is degraded by only 14% . In addition, we discuss the implementation and deployment of the proposed system at the edge routers of ISP networks by applying SON and NFV.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013667","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}
Saeed Ullah, K. Thar, Md. Golam Rabiul Alam, J. Son, J. Lee, C. Hong
{"title":"Delivering Scalable Video Streaming in ICN enabled Long Term Evolution networks","authors":"Saeed Ullah, K. Thar, Md. Golam Rabiul Alam, J. Son, J. Lee, C. Hong","doi":"10.1109/APNOMS.2016.7737268","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737268","url":null,"abstract":"Information Centric Networking (ICN) is envisioned to be the future Internet architecture and mobile access network e.g., Long Term Evolution (LTE), and 5G will be the major access networks. In this paper, we present a cache management and cooperative request forwarding schemes for Scalable Video Streaming (SVS) in Information Centric Networking (ICN) enabled mobile access networks. H.264/SVC encoded video is consisted a mandatory baselayer and multiple optional enhancement layers. Baselayer, which is enough to decode the video, though with the lowest quality, is needed by every user who want to watch the video while enhancement layers are used to improve the video quality. Only a subset of users download enhancement layers of the video. Therefore, caching the baselayer nearer to the users will increase their Quality of Experience. Furthermore, we introduce cooperative request forwarding for the baselayer of video to take more benefits from cache of neighboring base stations. We have intensively simulated our proposed schemes by extending chunk level simulator ccnsim which is developed over Omnet++. Our experimental results show that, cache hit rate can be improved significantly by adopting our proposed caching and Interest forwarding schemes.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316418","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}
{"title":"Dynamic application load balancing in distributed SDN controller","authors":"K. Hikichi, T. Soumiya, Akiko Yamada","doi":"10.1109/APNOMS.2016.7737208","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737208","url":null,"abstract":"To deploy Software-Defined Networking (SDN) in a large-scale network, cluster-based distributed SDN controllers were proposed, which enable performance scaling by simply adding a new server in the cluster. However, loads caused by many control messages from many kinds of SDN applications have not been widely studied so far. In this paper, we show an architecture of a distributed SDN controller where all kinds of applications are running on all of the servers to share the loads caused by the applications. We propose a dynamic application load balancing method which calculates the weight of round robin scheduling of an external load balancer to distribute requests submitted to the applications among the servers. Experimental results show the method increases the performance of the controller by reducing inter-server messages.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114959043","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}
Sung-Ho Lee, Young-Hoon Goo, Baraka D. Sija, Myung-Sup Kim
{"title":"Finding the highly efficient application signature through payload signature quality evaluation","authors":"Sung-Ho Lee, Young-Hoon Goo, Baraka D. Sija, Myung-Sup Kim","doi":"10.1109/APNOMS.2016.7737225","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737225","url":null,"abstract":"Internet traffic identification is an essential preliminary step for stable service provision and efficient network management. The payload signature-based-classification is considered as a reliable method for Internet traffic identification. But its performance is highly dependent on the number and the structure of signatures. If the numbers and structural complexity of signatures are not proper, the performance of payload signature-based-classification easily deteriorates. Therefore, in order to improve the performance of the identification system, it is necessary to regulate the numbers of the signature. In this paper, we propose a novel signature quality evaluation method to decide which signature is highly efficient for Internet traffic identification. We newly define the signature quality evaluation criteria and find the highly efficient signature through the method. Quality evaluation is performed in three different perspectives and the weight of each signature is computed through those perspectives values. And we construct the signature map(S-MAP) to find the highly efficient signature. The proposed method achieved an approximately fourfold increased efficiency in application traffic identification.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179947","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}
Shujuan Zhang, Y. Wang, Qichao He, Jinke Yu, Shaoyong Guo
{"title":"Backup-resource based failure recovery approach in SDN data plane","authors":"Shujuan Zhang, Y. Wang, Qichao He, Jinke Yu, Shaoyong Guo","doi":"10.1109/APNOMS.2016.7737211","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737211","url":null,"abstract":"Software Defined Networking (SDN) enables the underlying infrastructure to be abstracted from the network services and controlled by one or more controllers. If a link or a node fails, the switches that can detect the failure have to either inform controller to update flow tables or transform the data to pre-configured paths to recover the failure. However, existing failure recovery approaches mainly consider the recovery delay and packet loss, and ignore the storage resources consumption for backup paths in case of link or node failure. Moreover, the Ternary Content Addressable Memory (TCAM) that stores flow entries is expensive and limited with high-energy consumption. Thus in order to minimize the consumption of backup resources and meet the required failure recovery delay, a backup-resource based failure recovery approach is proposed. Two metrics are proposed to grade physical links, and three kinds of strategies for different graded links are provided, based on which the approach tries to use less flow entries to recover link failure and meets the required failure recovery delay, while guaranteeing the reliability of the network. Simulations show that backup-resource based approach can use as less flow entries as possible to ensure the performance of failure recovery and satisfy the required delay of important traffic at the same time. Moreover, the approach has good and steady performance in networks of different scales and connectivity.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477458","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}
{"title":"A crowdsourcing-based road anomaly classification system","authors":"R.Y. Wang, Yi-Ta Chuang, Chih-Wei Yi","doi":"10.1109/APNOMS.2016.7737244","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737244","url":null,"abstract":"Road networks are the most important facility to the public transportation in modern cities. Governments around the world allocate large amounts of budgets for the pavement maintenance every year. In this paper, we proposed a crowdsourcing solution to categorize road anomalies into safety related anomalies such as speed bumps and rumble strips, and dangerous anomalies such as bumps and potholes. The proposed system is composed of three parts: a smart probe car crowds (SPC-crowd) that serve as the anomaly data source; cloud servers that are the core for the anomaly classification; and application services that provide various innovative applications to facilitate the pavement maintenance. To support the crowdsourcing procedure, in the SPC-crowd side, we proposed cross-SPC techniques by adopting the underdamped oscillation model (UOM). In the cloud side, a supervised learning classification model was adopted on the anomaly data generated from the SPC-crowd. To validate the proposed system, extensive field trial was performed. The experimental results shown that our system can facilitate the pavement maintenance through the crowdsourcing solution.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117210622","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}
Tadahide Kunitachi, K. Kinoshita, Takashi Watanabe
{"title":"An experimental study of reliable wireless communications in vehicles","authors":"Tadahide Kunitachi, K. Kinoshita, Takashi Watanabe","doi":"10.1109/APNOMS.2016.7737277","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737277","url":null,"abstract":"Recent works on enhancing comfortability and convenience in vehicles reveal that information collections by various wireless sensor nodes have the potential due to their easiness of install and their small size. However, the conventional wireless network standards achieve insufficient reliability for practical in-vehicle communications. In this paper, through implementing 2.4GHz devices in an actual vehicle with crews in the cabin. Based on the results, we propose a method to provide reliable multi-hop communications in a vehicle using overhearing. In the proposed method, the neighbor nodes overhear a packet sent from a source node. If the destination node does not receive the packet, neighbor nodes send the overheard packet as proxies of the source node. We evaluate the performance of the proposed method by computer simulation and experimental implementation. One of the results shows that the proposed method achieves 99.9% packet arrival ratio within 20ms.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"159 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133391080","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}
{"title":"Equation-based Multicast Congestion control in Data Center networks","authors":"Junya Akamatsu, Kenta Matsushima, M. Yamamoto","doi":"10.1109/APNOMS.2016.7737220","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737220","url":null,"abstract":"Multicast communications in data center has gotten great attention with its requirement for social networking services and file distribution, such as OS update towards virtual machines. Multicast communications offer advantage of efficient network resource usage. To the best of authors' knowledge, only feasibility and scalability issues have been treated in published papers for multicast communications in data centers. Data center networks generally operate at high utilization, so congestion control is one of the most important technical issues. This is also the case for multicast communications, but there have not been published any papers related to multicast congestion control in data centers. In this paper, we propose a new multicast congestion control, DCMC (Data Center Multicast Congestion control). DCMC is an end-to-end multicast congestion control and adjusts the sending rate to the estimated throughput of the worst congested receiver. The worst congested receiver is selected by equation-based estimation of receiver's throughput. Our simulation results show that DCMC can achieve TCP friendliness, i.e. fairness, with DCTCP with keeping high link utilization.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133331148","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}