2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)最新文献

筛选
英文 中文
SFS: A massive small file processing middleware in Hadoop SFS: Hadoop中的一个大型小文件处理中间件
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737234
Yonghua Huo, Zhihao Wang, XiaoXiao Zeng, Yang Yang, Wenjing Li, Cheng Zhong
{"title":"SFS: A massive small file processing middleware in Hadoop","authors":"Yonghua Huo, Zhihao Wang, XiaoXiao Zeng, Yang Yang, Wenjing Li, Cheng Zhong","doi":"10.1109/APNOMS.2016.7737234","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737234","url":null,"abstract":"HDFS is designed for storing large files, but it suffered performance penalty when storing large amount of small files such as the space occupied by the metadata cause high consumption of NameNode and low efficiency of file reading. Currently, there are many approaches implemented to solve the small file problem. In this paper we use additional hardware named SFS (Small File Server) between users and HDFS to solve the small file problem. The proposed approach includes a file merging algorithm based on temporal continuity, an index structure to retrieve small files and a prefetching mechanism to improve the performance of file reading and writing. The experimental results show that the proposed approach efficiently optimizes small files storing in HDFS with reducing the overload of NameNode and improving the performance of file accessing.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"217 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":"121311455","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}
引用次数: 8
An adaptive load monitoring solution for logically centralized SDN controller 逻辑集中式SDN控制器的自适应负载监控解决方案
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737207
Syed Asif Raza Shah, Sangwook Bae, A. Jaikar, S. Noh
{"title":"An adaptive load monitoring solution for logically centralized SDN controller","authors":"Syed Asif Raza Shah, Sangwook Bae, A. Jaikar, S. Noh","doi":"10.1109/APNOMS.2016.7737207","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737207","url":null,"abstract":"The recent emerging concept in the networking world is known as SDN (Software-Defined Network). SDN architecture introduced the new methods of network management and configuration. It makes underlying networking devices as simply just packet forwarding units and leaving the control logic on centralized software program to dictate the entire network behavior. In logically centralized SDN architecture the switches are statically assigned to controllers regardless of actual load of individual controllers. One of the key concern of network operators is to efficiently monitor the actual load of individual controllers in a logically centralized SDN environment. In this paper, we propose an adaptive solution to monitor the actual load of a SDN controller for efficient utilization in a logically centralized SDN architecture. We proposed a load monitoring solution which is combination of ONOS (Open Network Operating System) based collection manager and collectd based “onos write” plugin/module that act as an agent on SDN controllers. Our proposed solution helps to overcome the under-utilization and over-utilization of a controller implemented in logically centralized SDN environment. The results show that our proposed monitoring system gives a comprehensive statistical view of individual controller's load.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"15 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":"115434155","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}
引用次数: 9
Yang Data Model for SFC Control Plane SFC控制平面的Yang数据模型
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737231
Soo-Gil Choi, Mi-Jung Choi, M. Shin, Seungik Lee
{"title":"Yang Data Model for SFC Control Plane","authors":"Soo-Gil Choi, Mi-Jung Choi, M. Shin, Seungik Lee","doi":"10.1109/APNOMS.2016.7737231","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737231","url":null,"abstract":"Service Function Chaining (SFC) consists of SFC data plane and control plane from the aspect of architecture. The standard document of I-D.ietf-sfc-control-plane-00 describes requirements for delivering information between SFC control elements and SFC functional elements. This paper defines requirements of management of SFC control plane and defines Yang data model of management operations performed in a SFC control plane based on the standardization documents of the SFC architecture and SFC control plane components and requirements.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"98 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":"127555833","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}
引用次数: 0
Resources management in virtualized Information Centric Wireless Network 虚拟化信息中心无线网络中的资源管理
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737264
K. Thar, Nguyen H. Tran, J. Son, C. Hong
{"title":"Resources management in virtualized Information Centric Wireless Network","authors":"K. Thar, Nguyen H. Tran, J. Son, C. Hong","doi":"10.1109/APNOMS.2016.7737264","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737264","url":null,"abstract":"Information-Centric Networking (ICN) and Wireless Network Virtualization (WNV) are two emerging technologies for the next-generation network infrastructure. ICN provides the key technology to reduce the network traffic by caching the contents temporarily and aggregating the same content requests. WNV enables the resources sharing among Infrastructure Providers (InPs) and Mobile Virtual Network Operators (MVNOs), to reduce capital expenditures and operating expenses. Also, the network resource management becomes easier because of WNV. In this paper, we combine these two technologies to improve the performance of the network and the profit of the MVNOs. We formulate the optimization problem to solve the cache allocation problem and maximize the profit of MVNOs by controlling the usage of cache space, backhaul link, and radio resources. Finally, we validate our proposed scheme using a chunk-level simulator. The simulation results show that the proposed mechanism can improve the profit of MVNOs and user's QoS.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"30 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":"125161908","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}
引用次数: 3
Payload signature structure for accurate application traffic classification 有效负载签名结构,实现准确的应用流分类
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737287
Young-Hoon Goo, Kyu-Seok Shim, Su-Kang Lee, Myung-Sup Kim
{"title":"Payload signature structure for accurate application traffic classification","authors":"Young-Hoon Goo, Kyu-Seok Shim, Su-Kang Lee, Myung-Sup Kim","doi":"10.1109/APNOMS.2016.7737287","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737287","url":null,"abstract":"Emergence of high-speed Internet and various smart devices has led to a rapid increase of applications on the Internet. In order to provide reliable services and efficient management of network resources, accurate traffic classification of various applications is essential. Through various methods of extraction when payload signatures are extracted, most of these payload signature formats are just strings or hex values which appear frequently within payloads. Thus, it is difficult to extract unique signatures for a specific application, because redundant signatures extraction is in most cases unavoidable. In this paper, we propose a more elaborative payload signature structure for accurate classification of each specific application. The formats of this signature structure is composed of three level signatures. These are Content signature which is single contiguous substring in payloads, Packet signature which is the sequence of Content signatures that appear in the same packet, and the Flow signature which is a sequence of Packet signatures that appear in the same flow. By applying and comparing the existing signature format and proposed signature format to the actual application traffic classification, we demonstrate the effectiveness of the proposed signature structure.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"21 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":"121664447","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}
引用次数: 15
Charging models for M2M communications M2M通信的收费模式
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737197
F. Lin, Wan-Du Tsai, Bo-Ting Lin, Wan-Hsun Hu
{"title":"Charging models for M2M communications","authors":"F. Lin, Wan-Du Tsai, Bo-Ting Lin, Wan-Hsun Hu","doi":"10.1109/APNOMS.2016.7737197","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737197","url":null,"abstract":"The emerging of M2M communications enables many new applications such as smart grid, connected vehicle, eHealth and smart city. The telecom network is an ideal environment to support the implementation of these applications. However, the property of M2M communications is very different from that of traditional telecomm. Consequently, charging models designed for traditional telecomm such as pricing by amount of data transfer are no longer adequate for M2M communications. More general charging models are needed to accommodate new charging factors identified for M2M communications. With appropriate charging models, the amount of resources consumed by M2M communications can be assessed fairly and charged accordingly. This paper proposes general charging models for M2M communications based on two innovative ingredients: charging factors and pricing parameters.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"27 15 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":"131769697","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}
引用次数: 5
Network-aware service function chaining placement in a data center 数据中心的网络感知业务功能链布局
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737217
Cheng-Husan Hsieh, Je-Wei Chang, Chien Chen, Ssu-Hsuan Lu
{"title":"Network-aware service function chaining placement in a data center","authors":"Cheng-Husan Hsieh, Je-Wei Chang, Chien Chen, Ssu-Hsuan Lu","doi":"10.1109/APNOMS.2016.7737217","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737217","url":null,"abstract":"Network function virtualization (NFV) has drawn much attention in recent years, where some network functions that used to be deployed on specific hardware have become virtualized instances on general servers to achieve more scalability and flexibility. In a data center, service function chaining (SFC) makes a workflow traverse different network functions in a specific order to provide different levels of service for its customer. Because the distance between any adjacent network functions in a service chain will decide the total bandwidth consumption for that chain, the placement of the virtualized network functions in a data center becomes an important problem. In this study, this placement problem is treated as a multi-layer bin packing problem. Two greedy algorithms are proposed for the tree-like network topology: Multi-layer Worst-Fit (MWF) and Multilayer Best Fit (MBF). Furthermore, the placement problem is formulated as an integer linear programming. The experimental results show that MWF can reduce bandwidth consumption by 15% while only increasing the number of used servers by 1% compared to the traditional Best-fit algorithm.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"20 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":"133982708","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}
引用次数: 17
A Shapley value-based forwarding strategy in Information-Centric Networking 基于Shapley值的信息中心网络转发策略
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737266
Ruichang Shi, Lanlan Rui, Haoqiu Huang, Xue-song Qiu, Hui Guo, Pan Zhang
{"title":"A Shapley value-based forwarding strategy in Information-Centric Networking","authors":"Ruichang Shi, Lanlan Rui, Haoqiu Huang, Xue-song Qiu, Hui Guo, Pan Zhang","doi":"10.1109/APNOMS.2016.7737266","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737266","url":null,"abstract":"Information Centric Networking (ICN) is a new kind of network architecture centered on content data. The ICN improves the efficiency of data transmission by the longest matching routing mechanism based on the content name prefix of the request interest packets, however, the multipath forwarding performance also resulted in the redundancy of the network content. The existing ICN forwarding strategy does not take into account the selection problem of routings when a content hit multiple Faces. This paper proposes a routing forwarding strategy based on Shapley value. We add a forwarding value table, which is used to calculate the number of content routing and the number of face to forwarding. The table stores the request delay of content routing and the busy degree of the next hop nodes. The content routing number and forwarding nodes of the next hop forwarding are decided by the alliance game. Simulations show that our strategy can improve the cache hit ratio, reduce server load and reduce the average request delay compared with full forwarding strategy, it improves the network performance in total.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"33 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":"114825542","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}
引用次数: 3
Propose of the dynamic routing methods using available bandwidth and degree for congestion avoidance 提出了利用可用带宽和拥塞避免度的动态路由方法
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737285
Yuuki Udagawa, O. Mizuno
{"title":"Propose of the dynamic routing methods using available bandwidth and degree for congestion avoidance","authors":"Yuuki Udagawa, O. Mizuno","doi":"10.1109/APNOMS.2016.7737285","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737285","url":null,"abstract":"Open Shortest Path First (OSPF) is a popular routing protocol for the Internet services. OSPF causes network congestion if specific path becomes bottle neck links. However, OSPF can't avoid this congestion dynamically. In this paper, we propose the routing method using available bandwidth and degree. It is confirmed that the proposed method shows lower packet loss rate, shorter transmission time and higher throughput than those of OSPF.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"26 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":"121990670","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}
引用次数: 3
Volume and irregularity effects on massively multicore packet processors 体积和不规则性对大规模多核包处理器的影响
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737261
M. Zhanikeev
{"title":"Volume and irregularity effects on massively multicore packet processors","authors":"M. Zhanikeev","doi":"10.1109/APNOMS.2016.7737261","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737261","url":null,"abstract":"Irregularity is a recognized problem on many- and multi-core platforms but its effect remains to be studied. This paper focuses on multicore processors and assumes that packet traffic is processed by a large number of parallel jobs in realtime, while each job is implemented as a streaming algorithm. Analysis is performed using a real-life measurement dataset collected especially for this study while irregular traffic is modeled using a hotspot distribution. Results show that massively multicore processors are affected by both the total input volume and the irregularity.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"76 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":"122386863","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信