发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Anonyropy: An efficient anonymization scheme using entropy in smart mediator for mashup service 匿名:在混搭服务的智能中介中使用熵的高效匿名化方案
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737270
D. Lee, Youngkil Kim, C. Hong
{"title":"Anonyropy: An efficient anonymization scheme using entropy in smart mediator for mashup service","authors":"D. Lee, Youngkil Kim, C. Hong","doi":"10.1109/APNOMS.2016.7737270","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737270","url":null,"abstract":"Recently, the mashup services linking multiple separated platforms have appeared on the Internet. However, to communicate between different platforms, those services need the Smart Mediator as a common relaying platform. The Smart Mediator receives data from various platforms and provides a uniform OpenAPI to the mashup service developer to ease the development procedures. One of the most important task of a Smart Mediator is to safeguard the user's privacy. Thus, it needs to provide anonymized personal data to the mashup services. In this paper, we propose an efficient anonymization scheme using entropy in the Smart Mediator. And we evaluate this scheme in the Smart Mediator. As a result, this scheme is more efficient other k when we are comparing attack risk rate and data loss rate. Through this scheme, we expect to shelter user's privacy and provide enough personal information to the mashup services.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"82 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":"128638804","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
Efficient data collection for participatory sensing using smartphones 利用智能手机进行参与式传感的高效数据收集
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737255
Hiro Onishi, T. Asaka
{"title":"Efficient data collection for participatory sensing using smartphones","authors":"Hiro Onishi, T. Asaka","doi":"10.1109/APNOMS.2016.7737255","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737255","url":null,"abstract":"With the spread of high-performance mobile terminals that include sensors, participatory sensing is attracting attention for collecting sensor information using smartphones. Although there are two key advantages to this approach, its low cost and wide range of sensing, they come at the tradeoff of both the battery and storage. Therefore, efficient collection is required. There is also a challenge posed by how to collect data from environments in which the network infrastructure does not work. In this paper, we collect data using DTN and propose a new data collection method that reduces power consumption and the storage space required for nodes by spreading the location and time information of data in sinks. Simulation results show that the proposed method can achieve a high success rate with a small number of transmissions and storage compared with using Epidemic Routing of DTN.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"117 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":"116576179","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
Support path with time constraint in wireless sensor networks 无线传感器网络中带时间约束的支持路径
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737271
Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Cheng-Kuan Lin
{"title":"Support path with time constraint in wireless sensor networks","authors":"Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Cheng-Kuan Lin","doi":"10.1109/APNOMS.2016.7737271","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737271","url":null,"abstract":"Target traversing has been an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The support path is to find a path among sensors so that the target's support from the sensors is minimized, where support of the target from a sensor is defined as the inversely proportional to the distance of the target from the sensor. Most existing algorithms ensure the target to stay as close as possible from sensors or deploy sensors to enhance the coverage to the target. In this paper, we take into account the situation where the target must trave the sensor networks within time constraint. We propose some algorithms for the target to not only stay as close as possible from sensors, but also traverse the sensing field within time constraint. Simulations show that the proposed algorithms can solve the traversal path in wireless sensor networks.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"39 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":"131918999","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}
引用次数: 1
Delay-insensitive traffic detection and transfer on network edges 网络边缘的不延迟流量检测和传输
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737228
Q. Minh, Le Van An, T. K. Dang, N. Thoai, T. Kitahara, Yasuhiko Hiehata
{"title":"Delay-insensitive traffic detection and transfer on network edges","authors":"Q. Minh, Le Van An, T. K. Dang, N. Thoai, T. Kitahara, Yasuhiko Hiehata","doi":"10.1109/APNOMS.2016.7737228","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737228","url":null,"abstract":"Background (BG) traffic generated automatically by applications or the operating system on devices is delay-insensitive traffic as it does not immediately affect user experiences. However, this traffic may significantly contend network resources with foreground (FG) traffic which conveys data/content to users. This contention directly affects the QoS and QoE of network services, specifically at the peak times. This paper proposes an integration approach to which delay-insensitive traffic is quickly detected and effectively transferred in accordance with the network conditions hence the best resources are yielded to FG traffic. For the traffic transferring, we propose two methods namely the router centric (RC) and the SDN-based approaches. In the RC method, the edge routers analyze network conditions, compute the suggested sending rates for individual traffic flows and send these values back to clients where the adjustment mechanisms are implemented. In the SDN-based method the course of actions for each traffic flow is computed by a remote controller. Experimental results reveal the effectiveness and the feasibility of the proposed approaches.","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":"134126142","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}
引用次数: 2
Context-Aware Routing for hovering information in Vehicular Ad-Hoc Networks 车载Ad-Hoc网络中悬停信息的上下文感知路由
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737222
Zubair Amjad, Wang-Cheol Song, Khi-Jung Ahn
{"title":"Context-Aware Routing for hovering information in Vehicular Ad-Hoc Networks","authors":"Zubair Amjad, Wang-Cheol Song, Khi-Jung Ahn","doi":"10.1109/APNOMS.2016.7737222","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737222","url":null,"abstract":"Road traffic information is considered vital for drivers and passengers in a VANET. Recently many approaches have been proposed for sharing the road information among the vehicles on the roads. Applications that use hovering information for road safety consider TTL and a radial distance from a center point to disseminate the information in a geographically limited area. These approaches generally do not define any technique for the routing of content. In this paper, a context-aware routing mechanism is proposed for the content that hovers in a predefined geographic region. Road probability model is presented to calculate the probability of content to be disseminated on the roads. The vehicles use an efficient low overhead routing mechanism to forward the content/information towards the destination/anchor region. Proposed protocol is evaluated over a road network and the results show that it can be helpful in the design and deployment of VANETs.","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":"131996562","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
The effect of audiovisual cross-modality on QoE of Multi-View Video and Audio IP transmission 视听交叉模态对多视点视频和音频IP传输QoE的影响
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737243
Toshiro Nunome, K. Sako
{"title":"The effect of audiovisual cross-modality on QoE of Multi-View Video and Audio IP transmission","authors":"Toshiro Nunome, K. Sako","doi":"10.1109/APNOMS.2016.7737243","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737243","url":null,"abstract":"In this paper, we consider combinations of transmission schemes for each media in MVV-A (Multi-View Video and Audio) IP transmission when the total bitrate of transmitted audiovisual streams is regulated. We employ two types of transmission schemes: single stream transmission and all streams simultaneous transmission. We assess QoE of the four combinations of the transmission schemes by a subjective experiment. We then find that the cross-modal effect on QoE of MVV-A IP transmission exists; each media can affect the other media. In addition, QoE with the same transmission scheme for both audio and video is higher than that with the different transmission schemes for each media.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"83 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":"132260190","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
Failure detection service with low mistake rates for SDN controllers 故障检测服务，低错误率的SDN控制器
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737210
Tsai-Wei Yang, Kuochen Wang
{"title":"Failure detection service with low mistake rates for SDN controllers","authors":"Tsai-Wei Yang, Kuochen Wang","doi":"10.1109/APNOMS.2016.7737210","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737210","url":null,"abstract":"The Software Defined Networking (SDN), an efficient network technology, allows researchers to program their networks to meet different application needs. In this paper, we focus on failure detection services in multiple SDN controllers. We review some classical failure detection services and discuss how these services work. These classical failure detection services have the high mistake rate problem. To deal with this problem, we propose a failure detection service with low mistake rates (FDLM) mechanism. We use a modified gossip protocol to distribute heartbeat messages and have multiple controllers to make failure decisions in order to achieve low mistake rates. Experiment results show that the proposed FDLM has better performance in terms of average mistake rate, 95.5% (79.8%) lower, compared to Akka under message loss for the case of four (three) controllers. The significance of achieving low mistake rates in the proposed FDLM is decreasing unnecessary SDN controller failover, which causes overheads of reelecting a leader controller, restarting a controller and synchronizing the restarted controller with the leader controller.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"301 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":"122486999","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
Mobile bandwidth sharing: Pricing analysis under buffet plans 移动带宽共享:自助餐计划下的定价分析
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737276
Cheng-Ju Lin, Qin Wang, Che-An Lee, Yu-Lin Sheu, Min-Te Sun
{"title":"Mobile bandwidth sharing: Pricing analysis under buffet plans","authors":"Cheng-Ju Lin, Qin Wang, Che-An Lee, Yu-Lin Sheu, Min-Te Sun","doi":"10.1109/APNOMS.2016.7737276","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737276","url":null,"abstract":"Due to the fluctuation of the bandwidth consumption of mobile users, the availability of a more flexible bandwidth pricing structure becomes important. Unfortunately, most mobile service providers only offer long-term contracts. Hence, wireless bandwidth sharing has a potential to become a niche market. In this paper, we propose the pay-per-second model, in which the price is based on the mobile net speed. Our analysis also takes into account the buffet plan, which is available from service providers in several countries to offer mobile users unlimited bandwidth. First, a survey is conducted to collect the data from mobile users. The data are then used to obtain the parameters in our pricing model. The model is verified to be appropriate by Bayesian data analysis. In the experiments, our model is compared against the pay-per-byte model, and the results indicate that our model generates more profit for bandwidth sharing.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"54 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":"128354104","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}
引用次数: 1
A Multi-Applications Comprehensive Traffic Prediction model for the electric power data network 电力数据网多用途综合流量预测模型
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737256
Yu Zhou, Ningzhe Xing, Yutong Ji, Wenjing Li, Shao-Yong Guo
{"title":"A Multi-Applications Comprehensive Traffic Prediction model for the electric power data network","authors":"Yu Zhou, Ningzhe Xing, Yutong Ji, Wenjing Li, Shao-Yong Guo","doi":"10.1109/APNOMS.2016.7737256","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737256","url":null,"abstract":"Currently, the requirements of service quality in the electric power data network are getting higher and higher, and traffic prediction is an important premise to promote service quality. In order to accurately predict the total traffic of communication channels, a Multi-Applications Comprehensive Traffic Prediction (MACTP) model is proposed in this paper. Differing from F-ARIMA and S-ARIMA models which are used to predict the traffic of single application, the proposed MACTP model is used to predict the traffic of multi-applications conveyed in the channels. Simulation results show that MACTP model has higher accuracy and efficiency than classical prediction models, and it is suitable for electrical power data network.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"77 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":"126234421","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
DNS recursive server health evaluation model DNS递归服务器运行状况评估模型
2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) Pub Date : 2016-10-01 DOI: 10.1109/APNOMS.2016.7737281
Keyu Lu, Zhengmin Li, Zhaoxin Zhang, Jiantao Shi
{"title":"DNS recursive server health evaluation model","authors":"Keyu Lu, Zhengmin Li, Zhaoxin Zhang, Jiantao Shi","doi":"10.1109/APNOMS.2016.7737281","DOIUrl":"https://doi.org/10.1109/APNOMS.2016.7737281","url":null,"abstract":"The Domain Name System (DNS) is a critical infrastructure in the Internet. DNS recursive servers, as the name servers which interact with the client directly, the health status of them are directly related to integrity and accuracy of resolved data which the user access to. Therefore, how to evaluate the health status of DNS recursive servers has become an urgent problem to be resolved nowadays. In this paper, a DNS recursive server health evaluation model is proposed. We have proposed the metrics for DNS recursive server health, measured the metrics and computed the DNS recursive server health evaluation value based on the results of measuring metrics. In the end, we have evaluated the health of DNS recursive servers of Jiangsu province of China and concluded that the health status still remains to improve on the whole.","PeriodicalId":194123,"journal":{"name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"5 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":"126834299","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
首页 上一页 下一页 尾页
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学术官方微信