Paitoon Chetthamrongchai, Biju Theruvil Sayed, Elena Igorevna Artemova, Sandhir Sharma, Atheer Y. Oudah, Ahmed Kateb Jumaah Al-Nussairi, Bashar S. Bashar, A. Heri Iswanto
Abstract Locating facilities such as factories or warehouses is an important and strategic decision for any organization. Transportation costs, which often form a significant part of the price of goods offered, are a function of the location of the plans. To determine the optimal location of these designs, various methods have been proposed so far, which are generally definite (non-random). The main aim of the study, while introducing these specific algorithms, is to suggest a stochastic model of the location problem based on the existing models, in which random programming, as well as programming with random constraints are utilized. To do so, utilizing programming with random constraints, the stochastic model is transformed into a specific model that can be solved by using the latest algorithms or standard programming methods. Based on the results acquired, this proposed model permits us to attain more realistic solutions considering the random nature of demand. Furthermore, it helps attain this aim by considering other characteristics of the environment and the feedback between them.
{"title":"Designing a Mathematical Model to Solve the Uncertain Facility Location Problem Using C Stochastic Programming Method","authors":"Paitoon Chetthamrongchai, Biju Theruvil Sayed, Elena Igorevna Artemova, Sandhir Sharma, Atheer Y. Oudah, Ahmed Kateb Jumaah Al-Nussairi, Bashar S. Bashar, A. Heri Iswanto","doi":"10.2478/fcds-2023-0014","DOIUrl":"https://doi.org/10.2478/fcds-2023-0014","url":null,"abstract":"Abstract Locating facilities such as factories or warehouses is an important and strategic decision for any organization. Transportation costs, which often form a significant part of the price of goods offered, are a function of the location of the plans. To determine the optimal location of these designs, various methods have been proposed so far, which are generally definite (non-random). The main aim of the study, while introducing these specific algorithms, is to suggest a stochastic model of the location problem based on the existing models, in which random programming, as well as programming with random constraints are utilized. To do so, utilizing programming with random constraints, the stochastic model is transformed into a specific model that can be solved by using the latest algorithms or standard programming methods. Based on the results acquired, this proposed model permits us to attain more realistic solutions considering the random nature of demand. Furthermore, it helps attain this aim by considering other characteristics of the environment and the feedback between them.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135640628","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}
Abstract Differential evolution algorithm (DE) is a well-known population-based method for solving continuous optimization problems. It has a simple structure and is easy to adapt to a wide range of applications. However, with suitable population sizes, its performance depends on the two main control parameters: scaling factor (F ) and crossover rate (CR). The classical DE method can achieve high performance by a time-consuming tunning process or a sophisticated adaptive control implementation. We propose in this paper an adaptive differential evolution algorithm with a pheromone-based learning strategy (ADE-PS) inspired by ant colony optimization (ACO). The ADE-PS embeds a pheromone-based mechanism that manages the probabilities associated with the partition values of F and CR. It also introduces a resetting strategy to reset the pheromone at a specific time to unlearn and relearn the progressing search. The preliminary experiments find a suitable number of subintervals (ns) for partitioning the control parameter ranges and the reset period (rs) for resetting the pheromone. Then the comparison experiments evaluate ADE-PS using the suitable ns and rs against some adaptive DE methods in the literature. The results show that ADE-PS is more reliable and outperforms several well-known methods in the literature.
{"title":"Adaptive differential evolution algorithm with a pheromone-based learning strategy for global continuous optimization","authors":"Pirapong Singsathid, P. Puphasuk, J. Wetweerapong","doi":"10.2478/fcds-2023-0010","DOIUrl":"https://doi.org/10.2478/fcds-2023-0010","url":null,"abstract":"Abstract Differential evolution algorithm (DE) is a well-known population-based method for solving continuous optimization problems. It has a simple structure and is easy to adapt to a wide range of applications. However, with suitable population sizes, its performance depends on the two main control parameters: scaling factor (F ) and crossover rate (CR). The classical DE method can achieve high performance by a time-consuming tunning process or a sophisticated adaptive control implementation. We propose in this paper an adaptive differential evolution algorithm with a pheromone-based learning strategy (ADE-PS) inspired by ant colony optimization (ACO). The ADE-PS embeds a pheromone-based mechanism that manages the probabilities associated with the partition values of F and CR. It also introduces a resetting strategy to reset the pheromone at a specific time to unlearn and relearn the progressing search. The preliminary experiments find a suitable number of subintervals (ns) for partitioning the control parameter ranges and the reset period (rs) for resetting the pheromone. Then the comparison experiments evaluate ADE-PS using the suitable ns and rs against some adaptive DE methods in the literature. The results show that ADE-PS is more reliable and outperforms several well-known methods in the literature.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"243 - 266"},"PeriodicalIF":1.1,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42289244","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}
Abstract Criteria weighting is a widely used and also an important feature of multi criteria decision making problems specially in engineering, computer science and management investigations. In particular in many studies related to complex systems there would be usually two main groups of cause and effect criteria. In this research it is intended to make an hybrid objective model comprising DEMATEL and SWARA techniques to assign classified weights to the subgroup of cause and effect criteria. As a main goal, the proposed hybrid model in this presented paper can afford to assign greater values for criteria who belong to cause group. In this regard we apply the objective information which derived from the parameters of (R, equal to sum of direct and indirect influence of a criteria), (R/C, named as net influence power of a criteria) and (R-C, named as net effect of a criteria) related to the final total influence matrix T in DEMATEL methodology. The main contribution in this work lies in utilizing the SWARA methodology and making us of its revision where the relatively Comparative Importance Sj, applied in SWARA technique is reconfigured by some aggregation operators including max, Einstein and Hamacher operators for obtaining more uniformed weights of cause and effect criteria relatively to SWARA basic methodology. Finally results shows that the (R/C) and (R-C)would transfer more clear and refined data and numeric information achieving better and highly reliable weights of criteria categorized into two groups of cause and effect group.
{"title":"A Modified Hybrid Objective Model to Calculate the Weights of Cause and Effect Criteria in a System: DEMATEL and DEVELOPED SWARA (D-DS) Based Model","authors":"Seyed Hossain Ebrahimi","doi":"10.2478/fcds-2023-0006","DOIUrl":"https://doi.org/10.2478/fcds-2023-0006","url":null,"abstract":"Abstract Criteria weighting is a widely used and also an important feature of multi criteria decision making problems specially in engineering, computer science and management investigations. In particular in many studies related to complex systems there would be usually two main groups of cause and effect criteria. In this research it is intended to make an hybrid objective model comprising DEMATEL and SWARA techniques to assign classified weights to the subgroup of cause and effect criteria. As a main goal, the proposed hybrid model in this presented paper can afford to assign greater values for criteria who belong to cause group. In this regard we apply the objective information which derived from the parameters of (R, equal to sum of direct and indirect influence of a criteria), (R/C, named as net influence power of a criteria) and (R-C, named as net effect of a criteria) related to the final total influence matrix T in DEMATEL methodology. The main contribution in this work lies in utilizing the SWARA methodology and making us of its revision where the relatively Comparative Importance Sj, applied in SWARA technique is reconfigured by some aggregation operators including max, Einstein and Hamacher operators for obtaining more uniformed weights of cause and effect criteria relatively to SWARA basic methodology. Finally results shows that the (R/C) and (R-C)would transfer more clear and refined data and numeric information achieving better and highly reliable weights of criteria categorized into two groups of cause and effect group.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"101 - 152"},"PeriodicalIF":1.1,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44412268","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}
Abstract Social media are a rich source of user generated content where people express their views towards the products and services they encounter. However, sentiment analysis using machine learning models are not easy to implement in a time and cost effective manner due to the requirement of expert human annotators to label the training data. The proposed approach uses a novel method to remove the neutral statements using a combination of lexicon based approach and human effort. This is followed by using a deep active learning model to perform sentiment analysis to reduce annotation efforts. It is compared with the baseline approach representing the neutral tweets also as a part of the data. Considering brands require aspect based ratings towards their products or services, the proposed approach also categorizes predicting ratings of each aspect of mobile device.
{"title":"Sentiment Analysis Framework using Deep Active Learning for Smartphone Aspect Based Rating Prediction","authors":"Rathan Muralidhar, Vishwanath R. Hulipalled","doi":"10.2478/fcds-2023-0008","DOIUrl":"https://doi.org/10.2478/fcds-2023-0008","url":null,"abstract":"Abstract Social media are a rich source of user generated content where people express their views towards the products and services they encounter. However, sentiment analysis using machine learning models are not easy to implement in a time and cost effective manner due to the requirement of expert human annotators to label the training data. The proposed approach uses a novel method to remove the neutral statements using a combination of lexicon based approach and human effort. This is followed by using a deep active learning model to perform sentiment analysis to reduce annotation efforts. It is compared with the baseline approach representing the neutral tweets also as a part of the data. Considering brands require aspect based ratings towards their products or services, the proposed approach also categorizes predicting ratings of each aspect of mobile device.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"181 - 209"},"PeriodicalIF":1.1,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43264599","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}
H. Papadakis, A. Papagrigoriou, Eleftherios Kosmas, C. Panagiotakis, Smaragda Markaki, P. Fragopoulou
Abstract In the era of internet access, recommender systems try to alleviate the difficulty consumers face while trying to find items (e.g. services, products, or information) that better match their needs. To do so, a recommender system selects and proposes (possibly unknown) items that may be of interest to some candidate consumer, by predicting her/his preference for this item. Given the diversity of needs between consumers and the enormous variety of items to be recommended, a large set of approaches have been proposed by the research community. This paper provides a review of the approaches proposed in the entire research area of content-based recommender systems, and not only in one part of it. To facilitate understanding, we provide a categorization of each approach based on the tools and techniques employed, which results to the main contribution of this paper, a content-based recommender systems taxonomy. This way, the reader acquires a quick and complete understanding of this research area. Finally, we provide a comparison of content-based recommender systems according to their ability to efficiently handle well-known drawbacks.
{"title":"Content-Based Recommender Systems Taxonomy","authors":"H. Papadakis, A. Papagrigoriou, Eleftherios Kosmas, C. Panagiotakis, Smaragda Markaki, P. Fragopoulou","doi":"10.2478/fcds-2023-0009","DOIUrl":"https://doi.org/10.2478/fcds-2023-0009","url":null,"abstract":"Abstract In the era of internet access, recommender systems try to alleviate the difficulty consumers face while trying to find items (e.g. services, products, or information) that better match their needs. To do so, a recommender system selects and proposes (possibly unknown) items that may be of interest to some candidate consumer, by predicting her/his preference for this item. Given the diversity of needs between consumers and the enormous variety of items to be recommended, a large set of approaches have been proposed by the research community. This paper provides a review of the approaches proposed in the entire research area of content-based recommender systems, and not only in one part of it. To facilitate understanding, we provide a categorization of each approach based on the tools and techniques employed, which results to the main contribution of this paper, a content-based recommender systems taxonomy. This way, the reader acquires a quick and complete understanding of this research area. Finally, we provide a comparison of content-based recommender systems according to their ability to efficiently handle well-known drawbacks.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"211 - 241"},"PeriodicalIF":1.1,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42607209","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}
Abstract Smart cities are included in the literature as a technology-based concept that has been on the agenda in recent years and whose framework is constantly changing with the changes in technology. There are different frameworks and indexes to define the smartness of a city. Smart City Index 2021 published by Institute for Management Development (IMD) and Singapore University of Technology and Design (SUTD) is one of the accepted studies in the world. In the report of Smart City Index 2021, 118 cities are evaluated in five criteria namely health & safety, mobility, activities, opportunities (work & school) and governance. To re-evaluate the cities and compare the results, a Multi-Criteria Decision Making (MCDM) process including Entropy based Complex Proportional Assessment (COPRAS) and Addivite Ratio Assessment (ARAS) methodology is applied in this paper. To prioritize the criteria, entropy weight method is used. 118 cities are ranked both technologically and structurally using the COPRAS and ARAS method. As a result of the analyses, according to these methods, the rankings of the smart cities are the same. Also, when technologically smart cities are listed, it is determined that the first three countries are Zhuhai, Shenzhen, Nanjing, and at the same time, Abu Dhabi, Chongqing, Hangzhou in terms of structurally.
{"title":"Evaluation of the Smart Cities Listed in Smart City Index 2021 by Using Entropy Based Copras and Aras Methodology","authors":"Emel Gelmez, Eren Özceylan","doi":"10.2478/fcds-2023-0007","DOIUrl":"https://doi.org/10.2478/fcds-2023-0007","url":null,"abstract":"Abstract Smart cities are included in the literature as a technology-based concept that has been on the agenda in recent years and whose framework is constantly changing with the changes in technology. There are different frameworks and indexes to define the smartness of a city. Smart City Index 2021 published by Institute for Management Development (IMD) and Singapore University of Technology and Design (SUTD) is one of the accepted studies in the world. In the report of Smart City Index 2021, 118 cities are evaluated in five criteria namely health & safety, mobility, activities, opportunities (work & school) and governance. To re-evaluate the cities and compare the results, a Multi-Criteria Decision Making (MCDM) process including Entropy based Complex Proportional Assessment (COPRAS) and Addivite Ratio Assessment (ARAS) methodology is applied in this paper. To prioritize the criteria, entropy weight method is used. 118 cities are ranked both technologically and structurally using the COPRAS and ARAS method. As a result of the analyses, according to these methods, the rankings of the smart cities are the same. Also, when technologically smart cities are listed, it is determined that the first three countries are Zhuhai, Shenzhen, Nanjing, and at the same time, Abu Dhabi, Chongqing, Hangzhou in terms of structurally.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"153 - 180"},"PeriodicalIF":1.1,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48151964","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}
Abstract Since the collapse of the Soviet Bloc, Polish researchers in the software engineering area made a large e ort to close the gap developed during the times of the Iron Curtain and the ensuing limited access to Western technology. The question arises as to whether they eventually managed to attain – or maybe even to surpass the scientific output in this area of the developed Western countries. In this paper, we perform analysis on papers published in 16 high-quality software engineering journals within the last 30 years to measure the Polish contribution to the global scientific output in the area of software engineering. We observe how the Polish contribution changed in quantity in relation to the global scientific output in subsequent years. We also identify the journals that attracted the Polish authors the most, the institutions located in Poland that contributed the most, as well as the most productive Polish authors and the most acknowledged works (in terms of citation number) written by Polish authors. Moreover, we investigate the topics most often chosen by them.
{"title":"Polish Contribution to Software Engineering Research 1992–2021","authors":"J. Szydłowska, J. Swacha","doi":"10.2478/fcds-2023-0005","DOIUrl":"https://doi.org/10.2478/fcds-2023-0005","url":null,"abstract":"Abstract Since the collapse of the Soviet Bloc, Polish researchers in the software engineering area made a large e ort to close the gap developed during the times of the Iron Curtain and the ensuing limited access to Western technology. The question arises as to whether they eventually managed to attain – or maybe even to surpass the scientific output in this area of the developed Western countries. In this paper, we perform analysis on papers published in 16 high-quality software engineering journals within the last 30 years to measure the Polish contribution to the global scientific output in the area of software engineering. We observe how the Polish contribution changed in quantity in relation to the global scientific output in subsequent years. We also identify the journals that attracted the Polish authors the most, the institutions located in Poland that contributed the most, as well as the most productive Polish authors and the most acknowledged works (in terms of citation number) written by Polish authors. Moreover, we investigate the topics most often chosen by them.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"83 - 98"},"PeriodicalIF":1.1,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44570591","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}
Klara Borowa, Sebastian Kamoda, P. Ogrodnik, A. Zalewski
Abstract Cognitive biases influence every human being, including the individuals that take part in the software development process. Fixation is a cognitive bias that occurs when one focuses too much on certain items, events, obstacles or activities. In this study, we examine whether agile team members fixate on any particular agile practices. Through a set of semi-structured interviews, we investigated the source of these fixations, their consequences, and then propose possible countermeasures. We found that practitioners tend to fixate on practices that give them a sense of being in control over the project (such as meetings or Scrum events), while neglecting the Agile Principles of self-organising teams and working at a sustainable pace. This resulted in a series of problems, such as futile attempts to control team members, oversharing information with the client, meetings becoming a form of interrogation, and others.
{"title":"Fixations in Agile Software Development Teams","authors":"Klara Borowa, Sebastian Kamoda, P. Ogrodnik, A. Zalewski","doi":"10.2478/fcds-2023-0001","DOIUrl":"https://doi.org/10.2478/fcds-2023-0001","url":null,"abstract":"Abstract Cognitive biases influence every human being, including the individuals that take part in the software development process. Fixation is a cognitive bias that occurs when one focuses too much on certain items, events, obstacles or activities. In this study, we examine whether agile team members fixate on any particular agile practices. Through a set of semi-structured interviews, we investigated the source of these fixations, their consequences, and then propose possible countermeasures. We found that practitioners tend to fixate on practices that give them a sense of being in control over the project (such as meetings or Scrum events), while neglecting the Agile Principles of self-organising teams and working at a sustainable pace. This resulted in a series of problems, such as futile attempts to control team members, oversharing information with the client, meetings becoming a form of interrogation, and others.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"3 - 18"},"PeriodicalIF":1.1,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43994248","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}
Abstract Software requirements specification is an important foundation of the software development process. It documents the requirements, expectations, and restrictions for a system to be developed. It should describe what the produced system will offer in detail and unambiguously. It should also provide a realistic basis for estimating product costs, risks, and schedules. Still, it is difficult to prepare a useful specification effectively. We want to propose an approach to creating a good specification. We started the work from scratch by determining what the scope of the specification should be. We asked people who work on IT projects what information is and should be included in the specifications with which they work. This paper presents results from a survey conducted with 163 participants who have experience working on commercial software development projects. The main observation is that the content of requirements specification differs with respect to project characteristics, such as industry or financing method. We also noticed that the information about integration with external systems and functionalities most often appears in the SRS.
{"title":"What Should a Good Software Requirements Specification Include? Results of a Survey","authors":"Karolina Rączkowska-Gzowska, Anita Walkowiak-Gall","doi":"10.2478/fcds-2023-0004","DOIUrl":"https://doi.org/10.2478/fcds-2023-0004","url":null,"abstract":"Abstract Software requirements specification is an important foundation of the software development process. It documents the requirements, expectations, and restrictions for a system to be developed. It should describe what the produced system will offer in detail and unambiguously. It should also provide a realistic basis for estimating product costs, risks, and schedules. Still, it is difficult to prepare a useful specification effectively. We want to propose an approach to creating a good specification. We started the work from scratch by determining what the scope of the specification should be. We asked people who work on IT projects what information is and should be included in the specifications with which they work. This paper presents results from a survey conducted with 163 participants who have experience working on commercial software development projects. The main observation is that the content of requirements specification differs with respect to project characteristics, such as industry or financing method. We also noticed that the information about integration with external systems and functionalities most often appears in the SRS.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"48 1","pages":"57 - 81"},"PeriodicalIF":1.1,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42960151","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}
Lukasz Kamiński, Maciej Kozłowski, Daniel Sporysz, Katarzyna Wolska, Patryk Zaniewski, Radosław Roszczyk
Abstract With a large variety of communication methods and protocols, many software architects face the problem of choosing the best way for services to share information. For communication technology to be functional and practical, it should enable developers to define a complete set of CRUD methods for the processed data. The research team compared this paper’s most commonly used data transfer protocols and concepts: REST, WebSocket, gRPC GraphQL and SOAP. A set of web servers was implemented in Python, each using one of the examined technologies. Then, the team performed an automated benchmark measuring time and data transfer overhead for a set of defined operations: creating an entity, retrieving a list of 100 entities and fetching details of one entity. Tests were designed to avoid the results being interfered with by database connection or docker-compose environment characteristics. The research team has concluded that gRPC was the most efficient and reliable data transfer method. On the other hand, GraphQL turned out to be the slowest communication method of all. Moreover, its server and client libraries caused the most problems with proper usage in a web server. SOAP did not participate in benchmarking due to limited compatibility with Python and a lack of popularity in modern web solutions.
{"title":"Comparative Review of Selected Internet Communication Protocols","authors":"Lukasz Kamiński, Maciej Kozłowski, Daniel Sporysz, Katarzyna Wolska, Patryk Zaniewski, Radosław Roszczyk","doi":"10.2478/fcds-2023-0003","DOIUrl":"https://doi.org/10.2478/fcds-2023-0003","url":null,"abstract":"Abstract With a large variety of communication methods and protocols, many software architects face the problem of choosing the best way for services to share information. For communication technology to be functional and practical, it should enable developers to define a complete set of CRUD methods for the processed data. The research team compared this paper’s most commonly used data transfer protocols and concepts: REST, WebSocket, gRPC GraphQL and SOAP. A set of web servers was implemented in Python, each using one of the examined technologies. Then, the team performed an automated benchmark measuring time and data transfer overhead for a set of defined operations: creating an entity, retrieving a list of 100 entities and fetching details of one entity. Tests were designed to avoid the results being interfered with by database connection or docker-compose environment characteristics. The research team has concluded that gRPC was the most efficient and reliable data transfer method. On the other hand, GraphQL turned out to be the slowest communication method of all. Moreover, its server and client libraries caused the most problems with proper usage in a web server. SOAP did not participate in benchmarking due to limited compatibility with Python and a lack of popularity in modern web solutions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135131133","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：