Journal of Web Engineering最新文献_第4页

Collaborative Task Offloading in Edge Computing Enabled Web 3.0 支持边缘计算的 Web 3.0 中的协作任务卸载

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-07-01 DOI: 10.13052/jwe1540-9589.2354

Mohammed Alkhathami

{"title":"Collaborative Task Offloading in Edge Computing Enabled Web 3.0","authors":"Mohammed Alkhathami","doi":"10.13052/jwe1540-9589.2354","DOIUrl":"https://doi.org/10.13052/jwe1540-9589.2354","url":null,"abstract":"Web 3.0 is an evolved version of the Web that enables the integration of applications such as the Internet of Things (IoT) with the Web. It involves the storage of large data generated by different users and efficient computation of application and web-related tasks. With the help of edge nodes installed near the users, the computation load of Web 3.0 will be efficiently managed. Thus, efficient task offloading and computation become a key concern in edge computing-enabled Web 3.0. In this paper, a novel algorithm is proposed that solves the challenges of load imbalance at the edge nodes resulting in large queue sizes and increased task delays. The proposed technique identifies the edge nodes with a large network load and pairs them with a lightly loaded edge node that can handle some of their network load. The edge node pairing is based on the Gale-Shapley stable matching algorithm. The preference profile of edge nodes is developed based on factors such as task computation delay and task transmission delay. Once the pairing is done, the number of tasks is offloaded as per the computing capacity of the lightly loaded edge nodes. A detailed simulation-based performance evaluation of the proposed technique is presented showing a reduction in task delay by 20% and task deadline miss ratio by 68%.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 5","pages":"681-697"},"PeriodicalIF":0.7,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654717","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Web 3.0 Chord DHT Resource Clustering Web 3.0和弦DHT资源集群

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-07-01 DOI: 10.13052/jwe1540-9589.2355

KaiHsiang Chan;Young Yoon

{"title":"Web 3.0 Chord DHT Resource Clustering","authors":"KaiHsiang Chan;Young Yoon","doi":"10.13052/jwe1540-9589.2355","DOIUrl":"https://doi.org/10.13052/jwe1540-9589.2355","url":null,"abstract":"This study explores the impact and challenges of new user behaviors in the Web 3.0 environment on distributed networks. The traditional Chord algorithm allows nodes to freely join and leave the network by hashing their IP addresses, and publishing and storing resources through the same hash function. When the keys of the resources are unique, the resources will be evenly distributed across each node, thereby achieving load balancing. However, in cases where many identical resources are published, this method leads to specific nodes bearing too much load, causing performance bottlenecks and resource concentration issues. In Web 3.0, when the nodes use the resource's topic as the key to publish resources, as the topic's popularity increases, the number of nodes using the same key as the publishing node and the nodes with demand for the topic resources will also increase. In the traditional Chord algorithm, the same key will be managed by the same node. The node responsible for the key needs to save the routing information of all related nodes and cope with a large number of resource requests for it. To address these issues, this paper proposes a new variant of the Chord algorithm, which uses two different Chord rings for resource clustering: one based on the hash of resource names and the other based on the hash of IP addresses. This method allows us to allocate resources more effectively, ensuring each node bears a reasonable load share according to capacity. This paper will present the design principles of this method and validate its effectiveness in improving resource distribution and reducing the problem of single-point overload through experiments.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 5","pages":"699-716"},"PeriodicalIF":0.7,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654691","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142091047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Web 3.0 Applications Supported by Artificial Intelligence and Blockchain Technologies 人工智能和区块链技术支持的 Web 3.0 应用程序

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-07-01

Vijayan Sugumaran;Sooyong Park

{"title":"Web 3.0 Applications Supported by Artificial Intelligence and Blockchain Technologies","authors":"Vijayan Sugumaran;Sooyong Park","doi":"","DOIUrl":"https://doi.org/","url":null,"abstract":"Web 3.0 is a term used to describe the next generation of the internet that is being built on blockchain technology. It is expected to have a significant impact on society by decentralizing power and control over social media platforms and other mediums of cultural interaction. Web 3.0 gives power to the actual participants in the cultural economy - the creators and the community. With Web 3.0, communities can be more than just consumers of culture - they become active participants in the creator economy. They can become owners and decision-makers in that role instead of just being fans. While research on various aspects of Web 3.0 applications is progressing at a very fast pace, this is only the beginning. There are still a number of issues that have to be explored in terms of the design, implementation and deployment Web 3.0 applications and the enabling technologies. For example, various issues that need to be addressed include extendibility and interoperability of blockchain, NFT based authentication technology based on digital wallet, reward method-based consumer's efforts, Web 3.0 business model etc. This special issue focuses on these issues and present the state of the art in Web 3.0 with AI and its applications.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 5","pages":"v-vii"},"PeriodicalIF":0.7,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654700","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142091057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Self-Sovereign and Secure Data Sharing Through Docker Containers for Machine Learning on Remote Node 通过 Docker 容器在远程节点上进行机器学习的自主安全数据共享

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-07-01 DOI: 10.13052/jwe1540-9589.2352

Jungchul Seo;Younggyo Lee;Young Yoon

{"title":"Self-Sovereign and Secure Data Sharing Through Docker Containers for Machine Learning on Remote Node","authors":"Jungchul Seo;Younggyo Lee;Young Yoon","doi":"10.13052/jwe1540-9589.2352","DOIUrl":"https://doi.org/10.13052/jwe1540-9589.2352","url":null,"abstract":"Collecting personal data from various sources and using it for machine learning (ML) is prevalent. However, there are increasing concerns about the monopolization and potential breach of private data by greedy and malicious organizations. Interest in Web 3.0 systems is on the rise as an alternative. These systems aim to guarantee the self-sovereignty of personal data in a decentralized setting. Users can share data with others directly for fair compensation. Nevertheless, malicious remote users can still violate the integrity and confidentiality of personal data. Therefore, this paper proposes a novel method of preventing unwanted leakage and counterfeiting of the private data lent on the premise of remote users. This paper focuses on the decentralized nature of Web 3.0 to leverage existing personal storage so that the burden of collecting secure data is relieved. Data owners create a lightweight Docker container to encapsulate their private data sources. The data owners generate another container to be deployed on a remote premise for taking and executing any ML algorithms remote users create. Between the containers forming a distributed trusted execution environment (TEE), data are read through a secure channel. Since the TEE is strictly controlled by the data owner, no malicious ML application can leak or breach the private information. This paper explains the engineering details of how this new method is realized.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 5","pages":"637-655"},"PeriodicalIF":0.7,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654693","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

How Are Web APIs Versioned in Practice? A Large-Scale Empirical Study 网络应用程序接口在实践中是如何版本化的？大规模实证研究

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-06-01 DOI: 10.13052/jwe1540-9589.2341

Souhaila Serbout;Cesare Pautasso

引用次数: 0

Client-Server Code Mobility at Runtime 运行时客户端与服务器代码的移动性

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-06-01 DOI: 10.13052/jwe1540-9589.2342

Sebastian Heil;Lucas Schröder;Martin Gaedke

{"title":"Client-Server Code Mobility at Runtime","authors":"Sebastian Heil;Lucas Schröder;Martin Gaedke","doi":"10.13052/jwe1540-9589.2342","DOIUrl":"10.13052/jwe1540-9589.2342","url":null,"abstract":"Application logic is inherently distributed between client and server due to the fundamental Client/Server architecture of the Web. The individual distribution is specified at design time and remains unchanged stable, preventing individual load distribution between clients and server at runtime. Dynamic code mobility at runtime, in contrast, allows to balance the needs of users, through increased responsiveness, and software providers, through better resource usage and cost reductions. Enabled by WebAssembly, the Web ecosystem recently provides the technological foundation for relocating code units during runtime. However, leveraging these capabilities to enhance web applications with dynamic code migration presents challenges for web engineers. In response, we propose an innovative distributed Client/Server software architecture for web applications. This architecture facilitates the dynamic migration of code at runtime, and addresses the technical challenges like dependency management, control and data flow distribution, communication, and interfaces. This novel software architecture serves as a reference for web engineers aiming to enrich their web applications with dynamic code mobility. Additionally, it contributes to the ongoing reevaluation of the Web ecosystem in light of the widespread adoption and standardization of WebAssembly across major browsers. Through experimentation in four scenarios, we demonstrate the feasibility of implementing this architecture, its negligible impact on performance and the optimization potential for individual code distributions across client and server.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 4","pages":"507-534"},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10634594","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141927448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integration of an Open Source Identity Management System in Educational Platforms 在教育平台中整合开源身份管理系统

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-06-01 DOI: 10.13052/jwe1540-9589.2345

Enrique Barra;Alejandro Pozo;Sonsoles López-Pernas;Alvaro Alonso;Aldo Gordillo

引用次数: 0

Classification of Firewall Log Files with Different Algorithms and Performance Analysis of These Algorithms 使用不同算法对防火墙日志文件进行分类，并对这些算法进行性能分析

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-06-01 DOI: 10.13052/jwe1540-9589.2344

Ebru Efeoğlu;Gurkan Tuna

{"title":"Classification of Firewall Log Files with Different Algorithms and Performance Analysis of These Algorithms","authors":"Ebru Efeoğlu;Gurkan Tuna","doi":"10.13052/jwe1540-9589.2344","DOIUrl":"10.13052/jwe1540-9589.2344","url":null,"abstract":"Classifying firewall log files allows analysing potential threats and deciding on appropriate rules to prevent them. Therefore, in this study, firewall log files are classified using different classification algorithms and the performance of the algorithms are evaluated using performance metrics. The dataset was prepared using the log files of a firewall. It was filtered to make it free from any personal data and consisted of 12 attributes in total and from these attributes the action attribute was selected as the class. In the performance evaluation, Simple Cart and NB tree algorithms made the best predictions, achieving an accuracy rate of 99.84%. Decision Stump had the worst prediction performance, achieving an accuracy rate of 79.68%. As the total number of instances belonging to each of the classes in the dataset was not equal, the Matthews correlation coefficient was also used as a performance metric in the evaluations. The Simple Cart, BF tree, FT tree, J48 and NB Tree algorithms achieved the highest average values. However, although the reset-both class was not predicted successfully by the others, the Simple Cart algorithm made the best predictions for it. The values of other performance metrics used in this study also support this conclusion. Therefore, the Simple Cart algorithm is recommended for use in classifying firewall log files. However, there is a need to develop a prefiltering and parsing approach to process different log files as each firewall brand creates and maintains log files in its own format. Therefore, in this study, a novel prefiltering and parsing approach has been proposed to process log files with different structures and create structured datasets using them.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 4","pages":"561-593"},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10634590","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141928506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Risk Score Computation for Android Mobile Applications Using the Twin k-NN Approach 使用双 k-NN 方法计算安卓移动应用的风险得分

IF 0.7 4区计算机科学

Journal of Web Engineering Pub Date : 2024-06-01 DOI: 10.13052/jwe1540-9589.2343

Mahmood Deypir;Toktam Zoughi

{"title":"Risk Score Computation for Android Mobile Applications Using the Twin k-NN Approach","authors":"Mahmood Deypir;Toktam Zoughi","doi":"10.13052/jwe1540-9589.2343","DOIUrl":"10.13052/jwe1540-9589.2343","url":null,"abstract":"The Android operating system has a dominant market for use within a wide range of devices. Along with the widespread growth of the use of the Android system and the development of a huge number of apps for this operating system, new malicious apps are released daily by adversaries, which are difficult to identify and deal with. This is due to them using sophisticated techniques and strikes. Although there are a diverse range of classification models and risk estimation metrics for identifying malware in this operating system, there is still a requirement for more effective approaches in this context. In this paper, we present a new algorithm to calculate the security risk score of Android apps, which can be used to identify malicious apps from benign ones. This algorithm uses a novel technique named twin \u0000<tex>$k$</tex>\u0000-nearest neighbor. In this technique, to estimate the security risk of an unknown app, its nearest neighbors to malicious apps and its nearest neighbors to normal apps are computed separately using an appropriate distance formula. Then, the security risk of the input app can be computed using a simple formulation. In this formulation, the average distances of both \u0000<tex>$k$</tex>\u0000-nearest malicious apps and \u0000<tex>$k$</tex>\u0000-nearest non-malicious apps to the input app are used. In this way, the proposed method can calculate a high security risk for malware and a lower security risk for goodware. Experimental evaluations on real datasets show that the proposed algorithm has better performance over the previously proposed ones in terms of detection rate, precision, recall, and f1-score.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 4","pages":"535-559"},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10634593","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141928642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Transformative Technologies in the Evaluation of a Vocational Education System 职业教育系统评估中的变革技术

IF 0.8 4区计算机科学

Journal of Web Engineering Pub Date : 2024-03-01 DOI: 10.13052/jwe1540-9589.2324

Yanjun Zhang;Xiaoyu Sun;Jiangde Yu

{"title":"Transformative Technologies in the Evaluation of a Vocational Education System","authors":"Yanjun Zhang;Xiaoyu Sun;Jiangde Yu","doi":"10.13052/jwe1540-9589.2324","DOIUrl":"https://doi.org/10.13052/jwe1540-9589.2324","url":null,"abstract":"The increasing demand for vocational education has necessitated the presence of highly skilled teachers. This study presents a novel framework for the effective management of vocational college instructors' professional development through the utilization of advanced technologies. The system utilizes deep learning technology to analyze many data points, including academic achievements, teaching experience, student comments, and professional activities, in order to assess the performance and potential of teachers. The system evaluates both the positive and negative aspects, offers customized training programs, and enhances the delivery of instruction through the utilization of a generative language model. The effectiveness of the system is supported by a case study, which demonstrates enhancements in talent management, professional development, teaching quality, and student happiness. This proposed solution aims to improve vocational education by empowering educators and transforming the processes of evaluation, support, and guidance throughout their professional trajectories.","PeriodicalId":49952,"journal":{"name":"Journal of Web Engineering","volume":"23 2","pages":"275-298"},"PeriodicalIF":0.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10504111","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140606047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0