2022 International Conference on Networking and Network Applications (NaNA)最新文献

筛选
英文 中文
A Proposal of ClouEdge (Cloud-Edge) Architecture by Using JYAGUCHI Computing Framework 基于JYAGUCHI计算框架的ClouEdge(云边缘)架构方案
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00064
B. P. Gautam, Amit Batajoo, N. Shiratori
{"title":"A Proposal of ClouEdge (Cloud-Edge) Architecture by Using JYAGUCHI Computing Framework","authors":"B. P. Gautam, Amit Batajoo, N. Shiratori","doi":"10.1109/NaNA56854.2022.00064","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00064","url":null,"abstract":"Cloud computing is a widely researched area; however, it has some challenges such as lacking the dynamic service delivery feature that can support both edge and cloud computing environment. To address such kind of challenges, we proposed an enhanced JYAGUCHI architecture, a service delivery platform implemented in our previous work that guarantees the secured and dynamic service delivery in both cloud and edge computing environment. In this research, we enhanced JYAGUCHI platform by designing a new architectural component that augments the services as per the granularity of the applications and also ensure the access control for secured service delivery over the Internet. We evaluated our system by testing the performance of each component in terms of resource consumption, latency and network bandwidth metrics within and outside the edge.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127819156","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
Privacy risk estimation of online social networks 在线社交网络的隐私风险评估
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00032
Shitong Fu, Zhiqiang Yao
{"title":"Privacy risk estimation of online social networks","authors":"Shitong Fu, Zhiqiang Yao","doi":"10.1109/NaNA56854.2022.00032","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00032","url":null,"abstract":"With the growing risk of privacy breaches in online social networks, privacy protection has become a key issue. To increase users' privacy awareness and protect their data, there is a need for a simple and effective method of quantifying privacy risk. A user with a higher privacy risk score is more likely to face a serious privacy breach. In this paper, we propose an effective and reasonable privacy risk scoring method. Our method takes into account the granularity of the shared profile items, combines sensitivity and visibility, and generates a privacy risk score for each user. With the privacy risk score, users can acquire a more intuitive awareness of their privacy status and then defend it by altering privacy settings or lowering the granularity of shared data. In addition, our experiments analyzing real-world and synthetic datasets demonstrate that our method is capable of effectively assessing user privacy risks in online social networks.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063219","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
An Attributed Network Anomaly Detection Method Based on Dual Autoencoder Joint Embedding 基于双自编码器联合嵌入的属性网络异常检测方法
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00057
Jing Han, Yizhi Zhang, Kenan Qin
{"title":"An Attributed Network Anomaly Detection Method Based on Dual Autoencoder Joint Embedding","authors":"Jing Han, Yizhi Zhang, Kenan Qin","doi":"10.1109/NaNA56854.2022.00057","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00057","url":null,"abstract":"Anomaly detection in attributed networks has attracted a lot of attention in recent years. It is an important means to detect and find security anomalies in time and to take measures in advance to combat threats. Most existing methods ignore the complex interaction between network structure and node attributes, so it remains a challenging problem to better model the network structure information and the rich node attribute information to achieve the interaction between the two models. In this paper, we propose an attributed network anomaly detection method based on dual autoencoder joint embedding (DAJE). This method learns the embedding of both structural and attribute patterns separately by using structural and attribute autoencoders, and then reconstructs them while considering the consistency and complementarity of the structural and attribute information embedding. It takes into account the network structure and attribute interactions better than other methods, and its effectiveness is verified on three real-world datasets.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132741675","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
A Fair Federated Learning Framework based on Clustering 基于聚类的公平联邦学习框架
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00088
Jiaomei Zhang, Ayong Ye, Zhiqiang Yao, Minghui Sun
{"title":"A Fair Federated Learning Framework based on Clustering","authors":"Jiaomei Zhang, Ayong Ye, Zhiqiang Yao, Minghui Sun","doi":"10.1109/NaNA56854.2022.00088","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00088","url":null,"abstract":"Federated learning is a distributed learning with multiple participants, and the cooperation and competition among participating clients tend to raise the issue of collaborative fairness. If the collaboration among clients is not fair, resulting in resources being monopolized by some advantaged clients, depriving vulnerable clients of participation opportunities, and even causing a “Matthew effect” on client learning resources. To address the above issues, we propose a fair federated learning framework based on clustering. First, we align vulnerable participants into clusters and increase their chances of participating in the federation. The distribution of the global model in clustering is according to the principle of “allocate by work” to balance contributions and profits. We transform the clustering problem into a Liapunov online queue scheduling problem by establishing a bi-objective optimization function. Finally, through theoretical and experimental analysis, the scheme is proved to have good performance in accuracy and fairness.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133931470","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
Paris Subway Pricing-based Link Selection in Air-Space-Ground Networks 基于空-空-地网络定价的巴黎地铁线路选择
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00017
Yuanxin Yan, Yang Xu, L. xilinx Wang, Jianbo Shao, H. He, Shanshan Zhang
{"title":"Paris Subway Pricing-based Link Selection in Air-Space-Ground Networks","authors":"Yuanxin Yan, Yang Xu, L. xilinx Wang, Jianbo Shao, H. He, Shanshan Zhang","doi":"10.1109/NaNA56854.2022.00017","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00017","url":null,"abstract":"The space-air-ground integrated network (SAGIN) network is known as an integrated system with triply sub-networks, namely the satellites layer, aerial layer, and terrestrial layer. The base stations in the terrestrial layer and the unmanned aerial vehicles (UAVs) in the aerial layer act as relays to provide satellites connection for the terrestrial users. In this paper, considering the different connected services have different quality of service (QoS) and cost different prices, we design the function for both terrestrial users and relays. To deal with the transmission path selection from an economical perspective, we employ the Paris Metro Pricing (PMP) model to study usage-based pricing for connected services under market competition to maximize relays' revenue and meet the QoS requirement of users. The simulations show how terrestrial users' value on usage and sensitivity to QoS influence the optimal price, revenue, and competition of relays.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811457","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
OKV: Optimized Key-Value Data Collection with Local Differential Privacy OKV:具有本地差分隐私的优化键值数据收集
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00078
Bowen Deng, Lele Zheng, Ze Tong, Jing Gao, Tao Zhang, Qi Li
{"title":"OKV: Optimized Key-Value Data Collection with Local Differential Privacy","authors":"Bowen Deng, Lele Zheng, Ze Tong, Jing Gao, Tao Zhang, Qi Li","doi":"10.1109/NaNA56854.2022.00078","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00078","url":null,"abstract":"Local differential privacy (LDP), where each user obfuscates their data locally before sending it to an untrustworthy data collector, provides a strict privacy guarantee for users' sensitive data. However, the existing key-value data collection mechanisms based on the LDP assume that all keys are equally sensitive, which leads to excessive protection and thus loss of utility. To address the reduced utility caused by overprotection, we introduce the notion of key-value data utility-optimized LDP (KV-ULDP), which only offers a basic LDP-equivalent privacy guarantee for sensitive keys and all values. Subsequently, we design a new framework, named optimized key-value data collection (OKV) with LDP, which satisfies the KV-ULDP with high utility while keeping secret for each user. We instantiate the OKV framework by using OKV-UE (based on Unary Encoding) and OKV-GRR (based on Generalized Randomized Response) mechanisms. The OKV-UE is effective with a large number of key types, and OKV-GRR works well under high privacy budgets. The theoretical analysis and the experiments on two real datasets show that our mechanisms outperform the existing key-value mechanisms with LDP in terms of utility.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081775","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
A Study of Service Registration and Discovery Techniques in Microservice Architecture 微服务体系结构中的服务注册与发现技术研究
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00053
Xinghui Zhu, Yalong Lv, Jia Liu, Xuewen Dong, Lin Li, Jiandong Wang
{"title":"A Study of Service Registration and Discovery Techniques in Microservice Architecture","authors":"Xinghui Zhu, Yalong Lv, Jia Liu, Xuewen Dong, Lin Li, Jiandong Wang","doi":"10.1109/NaNA56854.2022.00053","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00053","url":null,"abstract":"The microservice architecture has become a key technology in the development of the Internet. It brings a revolutionary development to the software production relationship and effectively improves the scalability and stability of the system. However, as the system evolves and the microservice splitting granularity is wrefined, the scale of microservices explodes and problems such as extended service discovery time and high service maintenance costs arise. For these problems, this paper proposes a detection mesh scheme (DM) based on service mesh and service semantics, which is divided into two main parts: service registration and service discovery. In terms of the service registration, based on the idea of a service mesh, the microservice governance and microservice development are deeply decoupled. In terms of the service discovery, the local-remote algorithm is proposed by considering the path, semantics, and state of microservices. In addition, a hierarchical ontology model is builded to provide a solid foundation for service registration and service discovery. Through experimental verification, compared with the web service discovery based on the maximum weighted bipartite graphs scheme(WSDMWBG), the DM scheme improves 12.71% in first hit rate and 28.3% in total microservice call time, effectively reducing the service discovery latency.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534957","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
Visualizable Malware Detection based on Multi-dimension Dynamic Behaviors 基于多维动态行为的可视化恶意软件检测
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00049
Zhidong Ma, Zhiwei Zhang, Chengliang Liu, Tianzhu Hu, Hongjun Li, Baoquan Ren
{"title":"Visualizable Malware Detection based on Multi-dimension Dynamic Behaviors","authors":"Zhidong Ma, Zhiwei Zhang, Chengliang Liu, Tianzhu Hu, Hongjun Li, Baoquan Ren","doi":"10.1109/NaNA56854.2022.00049","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00049","url":null,"abstract":"For different motives and reasons, malicious software, or malware, has been frequently used to damage and destroy information systems in many various environments. Especially, with the widespread application of the Internet and the reemergence of artificial intelligence, security and privacy are significantly stressed by individuals and businesses, and the influence of malware is being more and more serious in recent years. Unfortunately, the previous traditional malware detection schemes are infeasible in the AI era, as they cannot effectively recognize and identify the unknown or new types of malware, which could be easily and quickly brought out by automatic combination and improvement. Although many AI-based malware detection schemes also have been proposed at the same time, they are suffering from heavy training and low accuracy problems. Therefore, in this paper, we propose a visual malware detection model and concrete scheme based on multi-dimensional dynamic behaviors including all API and network operation information. To train our model, we collected a malware behavior dataset containing over 700 malware-image pairs, where the images are grayscale and converted from the malware execution behaviors recorded in the Cuckoo sandbox. Compared with the existing visual detection schemes, we introduce and employ the malware's dynamic behaviors information to produce the visual images, and we avoid the manual feature extraction in constructing the training dataset. Moreover, our experimental result shows that our scheme can outperform the existing schemes in detection accuracy and efficiency as well as the ability of new malware recognition.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125747375","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
Covert Monitoring for D2D-enabled Cellular Networks 支持d2d的蜂窝网络的隐蔽监控
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00016
Wu Wang, Sibo Wang, Kaiguo Qian, Shaojun Yu, Bin Yang
{"title":"Covert Monitoring for D2D-enabled Cellular Networks","authors":"Wu Wang, Sibo Wang, Kaiguo Qian, Shaojun Yu, Bin Yang","doi":"10.1109/NaNA56854.2022.00016","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00016","url":null,"abstract":"This paper studies the covert monitoring performance for a device-to-device (D2D)-enabled cellular network, consisting of a cellular user Alice, a base station BS, a legal monitor and a suspicious D2D pair. In such a network, a suspicious D2D transmitter intends to transmit message to its receiver, while the legitimate monitor attempts to eavesdrop the messages of the D2D communication. The cellular user Alice assists the legitimate monitor to covertly send signal (AN) to interfere with the D2D suspicious receiver (Dr). To this end, we first study the effects of uncertain channel of suspicious link and interfering link when the suspicious receiver Dr detects whether Alice transmits AN to it or not. Then we derive false alarm probability, missed detection probability of Dr and expressions for optimal AN detection threshold and the average minimum detection error probability. Finally, we maximize the non-outage probability with the constraint of covert requirement by optimizing power of Alice.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128043680","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
Effective Secrecy Throughput Analysis for Communication Systems with a DF Satellite Relay DF卫星中继通信系统的有效保密吞吐量分析
2022 International Conference on Networking and Network Applications (NaNA) Pub Date : 2022-12-01 DOI: 10.1109/NaNA56854.2022.00028
Yeqiu Xiao, Yichuan Wang, Wenjiang Ji, Lei Zhu, Xinhong Hei
{"title":"Effective Secrecy Throughput Analysis for Communication Systems with a DF Satellite Relay","authors":"Yeqiu Xiao, Yichuan Wang, Wenjiang Ji, Lei Zhu, Xinhong Hei","doi":"10.1109/NaNA56854.2022.00028","DOIUrl":"https://doi.org/10.1109/NaNA56854.2022.00028","url":null,"abstract":"In this paper, we investigate a fundamental issue of power control to provide secrecy transmission for a dual-hop satellite communication system consisting of a terrestrial station as the source, a terrestrial station as the destination, a satellite relay in a decode-and-forward manner and two eavesdroppers, which one of the eavesdroppers is a satellite overhearing the source and the other one is surrounding the destination. We derive the closed-form of effective secrecy throughput to reflect an overall performance of security and reliability for the concerned system. Then, a power control scheme is proposed to maximize the effective secrecy throughput by designing the transmit power at the source and that at the relay. Further, the approximation of optimal transmit power above is analyzed and given by closed-form expressions. Finally, numerical results are provided to illustrate the effective secrecy throughput of the dual-hop satellite communication system.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125016539","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学术文献互助群
群 号:481959085
Book学术官方微信