Pub Date : 2020-05-01DOI: 10.2991/ijndc.k.200515.007
Mohamed Elkawkagy, Heba Elbeh
A Distributed File System (DFS) is client/server software paradigm. It gives the client’s ability to access the server data. In general, DFS includes software exist on the servers and clients that connects files on different file servers into a single Namespace to improve the data availability. In case of a client retrieving a file from the server, the retrieved file will appear on the client machine as a normal file, so the client able to access the file as if it were stored locally on the client machine. After that, client stores the modified file to the server.
{"title":"High Performance Hadoop Distributed File System","authors":"Mohamed Elkawkagy, Heba Elbeh","doi":"10.2991/ijndc.k.200515.007","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.007","url":null,"abstract":"A Distributed File System (DFS) is client/server software paradigm. It gives the client’s ability to access the server data. In general, DFS includes software exist on the servers and clients that connects files on different file servers into a single Namespace to improve the data availability. In case of a client retrieving a file from the server, the retrieved file will appear on the client machine as a normal file, so the client able to access the file as if it were stored locally on the client machine. After that, client stores the modified file to the server.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925615","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}
Pub Date : 2020-05-01DOI: 10.2991/ijndc.k.200515.006
Sylvanus A. Ehikioya, Shenghong Lu
Many organizations now rely on the Web to conduct business. The increasing popularity of the Internet and e-commerce makes online merchants to constantly seek tools/mechanisms that would permit them to attract new and retain old customers. To achieve these two goals, a business should know, as much as possible, about its customers. Customers are the pivot of all businesses. When businesses lack knowledge of their customers, such businesses cannot efficiently develop their marketing activities.
{"title":"A Traffic Tracking Analysis Model for the Effective Management of E-commerce Transactions","authors":"Sylvanus A. Ehikioya, Shenghong Lu","doi":"10.2991/ijndc.k.200515.006","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.006","url":null,"abstract":"Many organizations now rely on the Web to conduct business. The increasing popularity of the Internet and e-commerce makes online merchants to constantly seek tools/mechanisms that would permit them to attract new and retain old customers. To achieve these two goals, a business should know, as much as possible, about its customers. Customers are the pivot of all businesses. When businesses lack knowledge of their customers, such businesses cannot efficiently develop their marketing activities.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253096","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}
Pub Date : 2020-05-01DOI: 10.2991/ijndc.k.200515.003
Muhammad Ibrahim, S. Nabi, A. Baz, Nasir Naveed, H. Alhakami
Cloud computing has been considered as one of the large-scale platforms that support various types of services including compute, storage, compute, and analytic to the users and organizations with high agility, scalability, and resiliency intact. The users of the Cloud are increasing at an enormous rate which also resulted in issues related to handling and scheduling the users’ requested workload effectively and efficiently on the available Cloud resources. The aim of the Cloud service providers is to maximize resource utilization and in turn increased revenue generation. In the last few years, Cloud Task scheduling has been considered as an important area of research for the researchers. As different scheduling heuristics are associated with different underlying assumptions; thus, performing a precise comparison cannot be guaranteed. This work empirically compares and provides an insight into the performance of some renown state-of-the-art task scheduling heuristics concerning the Makespan, average resource utilization ratio, Throughput. Those approaches include task-aware, resource-aware, and some hybrid approaches. The experiments were then extended by evaluating the performance using average response time for all the compared approaches. The simulation experiments are conducted by utilizing HCSP and GOCJ benchmark datasets using CloudSim a renowned simulation tool for Cloud. Based on the findings of the comparative analysis and results discussion, we have highlighted some important aspects of the underlying approaches and for future work we will propose a task-cum-resource aware task scheduling approach.
{"title":"Towards a Task and Resource Aware Task Scheduling in Cloud Computing: An Experimental Comparative Evaluation","authors":"Muhammad Ibrahim, S. Nabi, A. Baz, Nasir Naveed, H. Alhakami","doi":"10.2991/ijndc.k.200515.003","DOIUrl":"https://doi.org/10.2991/ijndc.k.200515.003","url":null,"abstract":"Cloud computing has been considered as one of the large-scale platforms that support various types of services including compute, storage, compute, and analytic to the users and organizations with high agility, scalability, and resiliency intact. The users of the Cloud are increasing at an enormous rate which also resulted in issues related to handling and scheduling the users’ requested workload effectively and efficiently on the available Cloud resources. The aim of the Cloud service providers is to maximize resource utilization and in turn increased revenue generation. In the last few years, Cloud Task scheduling has been considered as an important area of research for the researchers. As different scheduling heuristics are associated with different underlying assumptions; thus, performing a precise comparison cannot be guaranteed. This work empirically compares and provides an insight into the performance of some renown state-of-the-art task scheduling heuristics concerning the Makespan, average resource utilization ratio, Throughput. Those approaches include task-aware, resource-aware, and some hybrid approaches. The experiments were then extended by evaluating the performance using average response time for all the compared approaches. The simulation experiments are conducted by utilizing HCSP and GOCJ benchmark datasets using CloudSim a renowned simulation tool for Cloud. Based on the findings of the comparative analysis and results discussion, we have highlighted some important aspects of the underlying approaches and for future work we will propose a task-cum-resource aware task scheduling approach.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126976261","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}
Pub Date : 2020-03-01DOI: 10.2991/ijndc.k.200213.001
Thongchai Chuachan, K. Djemame, S. Puangpronpitag
Named Data Networking (NDN) [1,2] is one of the future internet architectures using the data centric network model. It is a proposal of the Information Centric Network (ICN) architecture, defined by the Internet Research Task Force (IRTF) [3]. NDN is expected to be more efficient for data distribution. For NDN deployment, it can be implemented on top of the current Transmission Control Protocol/ Internet Protocol (TCP/IP) stack, or deployed directly over a linklayer network without the TCP/IP protocol stack. NDN over the TCP/ IP stack would make NDN possible while the old internet is still running. However, NDN over the link-layer will cut off TCP/IP overhead.
命名数据网络(NDN)[1,2]是使用数据中心网络模型的未来互联网架构之一。它是由互联网研究任务组(IRTF)定义的信息中心网络(ICN)架构的一个提议[3]。预计NDN将更有效地进行数据分发。对于NDN的部署，它可以在当前的TCP/IP (Transmission Control Protocol/ Internet Protocol)协议栈之上实现，也可以直接部署在链路层网络上，而不需要TCP/IP协议栈。基于TCP/ IP栈的NDN将使NDN成为可能，而旧的互联网仍在运行。然而，链路层上的NDN将切断TCP/IP开销。
{"title":"Solving MTU Mismatch and Broadcast Overhead of NDN over Link-layer Networks","authors":"Thongchai Chuachan, K. Djemame, S. Puangpronpitag","doi":"10.2991/ijndc.k.200213.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200213.001","url":null,"abstract":"Named Data Networking (NDN) [1,2] is one of the future internet architectures using the data centric network model. It is a proposal of the Information Centric Network (ICN) architecture, defined by the Internet Research Task Force (IRTF) [3]. NDN is expected to be more efficient for data distribution. For NDN deployment, it can be implemented on top of the current Transmission Control Protocol/ Internet Protocol (TCP/IP) stack, or deployed directly over a linklayer network without the TCP/IP protocol stack. NDN over the TCP/ IP stack would make NDN possible while the old internet is still running. However, NDN over the link-layer will cut off TCP/IP overhead.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121796129","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}
Pub Date : 2020-03-01DOI: 10.2991/ijndc.k.200129.001
V. Faerman, V. S. Avramchuk
The problem of Time-Delay Estimation (TDE) is of great theoretical and practical importance and can be observed in various science and technology fields. The latter is connected with the fact that generally the delay is the time interval between the appearance of some event in one part of the system and its registration in another part of the system. Besides, it is an integral element of dynamic models of physical, chemical, biological, technical and economic systems [1]. However, TDE applications in radio engineering, hydroacoustics, seismology and, especially, in non-destructive testing [1,2] are in the scope of this paper.
{"title":"Comparative Study of Basic Time Domain Time-Delay Estimators for Locating Leaks in Pipelines","authors":"V. Faerman, V. S. Avramchuk","doi":"10.2991/ijndc.k.200129.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200129.001","url":null,"abstract":"The problem of Time-Delay Estimation (TDE) is of great theoretical and practical importance and can be observed in various science and technology fields. The latter is connected with the fact that generally the delay is the time interval between the appearance of some event in one part of the system and its registration in another part of the system. Besides, it is an integral element of dynamic models of physical, chemical, biological, technical and economic systems [1]. However, TDE applications in radio engineering, hydroacoustics, seismology and, especially, in non-destructive testing [1,2] are in the scope of this paper.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341478","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}
Many multimedia analysis algorithms rely on probability distributions that characterize audio or image features as generally high dimensions. For example, music analysis methods, such as automatic music transcription (AMT) [1] and music classification [2], in these applications, having sufficient similarity (or equivalent difference) between distributions becomes crucial. The classical distance or difference of probability density includes Kullback Leibler divergence, Kolmogorov distance, Bhattacharyya distance (also known as Hellinger distance), etc. Recently, the framework of optimal transportation and Wasserstein distance [3] are also called earth mover’s distance (EMD) [4], which has aroused great interest in computer vision [5], machine learning [6] and data fusion. Wasserstein distance calculates the best warped starter to map the measure m to the second n for a given input probability. Optimality corresponds to a loss function that measures the predicted value of the displacement in the warped starter. Generally, considering the accumulation of m and n, Wasserstein distance calculates the definition of the displacement of every particle from traces of its mass to the displacement of m to n.
{"title":"Multimedia Analysis and Fusion via Wasserstein Barycenter","authors":"Cong Jin, Junhao Wang, Jin Wei, Lifeng Tan, Shouxun Liu, Wei Zhao, Shan Liu, Xin Lv","doi":"10.2991/ijndc.k.200217.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.200217.001","url":null,"abstract":"Many multimedia analysis algorithms rely on probability distributions that characterize audio or image features as generally high dimensions. For example, music analysis methods, such as automatic music transcription (AMT) [1] and music classification [2], in these applications, having sufficient similarity (or equivalent difference) between distributions becomes crucial. The classical distance or difference of probability density includes Kullback Leibler divergence, Kolmogorov distance, Bhattacharyya distance (also known as Hellinger distance), etc. Recently, the framework of optimal transportation and Wasserstein distance [3] are also called earth mover’s distance (EMD) [4], which has aroused great interest in computer vision [5], machine learning [6] and data fusion. Wasserstein distance calculates the best warped starter to map the measure m to the second n for a given input probability. Optimality corresponds to a loss function that measures the predicted value of the displacement in the warped starter. Generally, considering the accumulation of m and n, Wasserstein distance calculates the definition of the displacement of every particle from traces of its mass to the displacement of m to n.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114973192","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}
Pub Date : 2020-02-01DOI: 10.2991/ijndc.k.200217.002
Xianhong Xu
The report to the 19th national congress mentioned the supply-side reform once again based on the achievements made, and emphasized that the modernization of the economy should focus more on improving the quality of the supply system, accelerating the building of a strong manufacturing country and the development of advanced manufacturing. During the transition period, China’s economy is undergoing periodic changes and systematic adjustments. This is a stage of adjustment in which China actively seeks for rebalancing after the equilibrium relationship between major variables in the stage of high-speed growth is broken.
{"title":"Empirical Research on the Growth Path of China's Industrial Economy under the Background of Supply-side Reform","authors":"Xianhong Xu","doi":"10.2991/ijndc.k.200217.002","DOIUrl":"https://doi.org/10.2991/ijndc.k.200217.002","url":null,"abstract":"The report to the 19th national congress mentioned the supply-side reform once again based on the achievements made, and emphasized that the modernization of the economy should focus more on improving the quality of the supply system, accelerating the building of a strong manufacturing country and the development of advanced manufacturing. During the transition period, China’s economy is undergoing periodic changes and systematic adjustments. This is a stage of adjustment in which China actively seeks for rebalancing after the equilibrium relationship between major variables in the stage of high-speed growth is broken.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129379857","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}
Pub Date : 2019-12-01DOI: 10.2991/ijndc.k.191118.002
Kazuto Nakanishi, T. Hochin, Hiroki Nomiya, Hiroaki Hirata
The development of information technology and personal computers enable us to get various multimedia data. In order to retrieve these data quickly, it is necessary to construct a multi-dimensional index including the R-tree family [1–3]. However, when the index becomes large, insertion time and retrieval time become long. The previous researches of the parallel multi-dimensional index have tried to improve the retrieval performance, although these does not consider the insertion performance [3–7]. When we must store multimedia data continuously, it is required to construct a multi-dimensional index within a limited time.
{"title":"Multi-Dimensional Indexing System Considering Distributions of Sub-indexes and Data","authors":"Kazuto Nakanishi, T. Hochin, Hiroki Nomiya, Hiroaki Hirata","doi":"10.2991/ijndc.k.191118.002","DOIUrl":"https://doi.org/10.2991/ijndc.k.191118.002","url":null,"abstract":"The development of information technology and personal computers enable us to get various multimedia data. In order to retrieve these data quickly, it is necessary to construct a multi-dimensional index including the R-tree family [1–3]. However, when the index becomes large, insertion time and retrieval time become long. The previous researches of the parallel multi-dimensional index have tried to improve the retrieval performance, although these does not consider the insertion performance [3–7]. When we must store multimedia data continuously, it is required to construct a multi-dimensional index within a limited time.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130362281","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}
Pub Date : 2019-12-01DOI: 10.2991/ijndc.k.191115.002
H. Lin, J. Hu, Chung-Hao Cheng
Copper wire is the most widely used conduction material to carry a variety of signals. Its applications include a large power transportation in power systems, or small signal communication in electronic devices or produces. The copper wire size can be as small as 0.01 mm, particularly in medical health equipments. Presently, many kinds of automatic wire drawing machines are being applied in industry. However, the copper wire needs heating, being drawn and then going through and drawing die mold by human hands when the automatic wire elongation process starts.
{"title":"Enhancement of Copper Wire Lengthening Automatic System using Contactless Heater","authors":"H. Lin, J. Hu, Chung-Hao Cheng","doi":"10.2991/ijndc.k.191115.002","DOIUrl":"https://doi.org/10.2991/ijndc.k.191115.002","url":null,"abstract":"Copper wire is the most widely used conduction material to carry a variety of signals. Its applications include a large power transportation in power systems, or small signal communication in electronic devices or produces. The copper wire size can be as small as 0.01 mm, particularly in medical health equipments. Presently, many kinds of automatic wire drawing machines are being applied in industry. However, the copper wire needs heating, being drawn and then going through and drawing die mold by human hands when the automatic wire elongation process starts.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128803463","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}
Pub Date : 2019-11-01DOI: 10.2991/ijndc.k.191115.001
Atsushi Nunome, Hiroaki Hirata
Recent years, even client nodes can easily have enough storage area owing to the spread of inexpensive storage devices. In many cases, the large amount of an unused storage area is left on storage devices over the network. It is important to utilize such fragmented unused storage area. Hence, we have for our object to build an environment which not only file servers but also client nodes can provide their surplus storage area as public storage. However, such computing environment has essentially heterogeneity. The heterogeneity of the system causes difficulty for properly allocating data blocks onto the storage devices. We consider that system heterogeneity is brought by even a dynamic aspect. It means that both a static aspect (e.g. differences of hardware configuration) and a dynamic aspect (e.g. imbalance of I/O workload) make such heterogeneity. This dynamic heterogeneity is not able to be solved statically. Therefore, data blocks should be located on a suitable storage device according to their access patterns at runtime. For example, frequently accessed data blocks are better to locate on high-performance storage, and it may cause no inconvenience when rarely accessed data blocks are located on low-performance storage. However, such location optimization in accordance with access patterns of data blocks makes the burden too heavy for system administrators.
{"title":"Performance Evaluation of Data Migration Policies for a Distributed Storage System with Dynamic Tiering","authors":"Atsushi Nunome, Hiroaki Hirata","doi":"10.2991/ijndc.k.191115.001","DOIUrl":"https://doi.org/10.2991/ijndc.k.191115.001","url":null,"abstract":"Recent years, even client nodes can easily have enough storage area owing to the spread of inexpensive storage devices. In many cases, the large amount of an unused storage area is left on storage devices over the network. It is important to utilize such fragmented unused storage area. Hence, we have for our object to build an environment which not only file servers but also client nodes can provide their surplus storage area as public storage. However, such computing environment has essentially heterogeneity. The heterogeneity of the system causes difficulty for properly allocating data blocks onto the storage devices. We consider that system heterogeneity is brought by even a dynamic aspect. It means that both a static aspect (e.g. differences of hardware configuration) and a dynamic aspect (e.g. imbalance of I/O workload) make such heterogeneity. This dynamic heterogeneity is not able to be solved statically. Therefore, data blocks should be located on a suitable storage device according to their access patterns at runtime. For example, frequently accessed data blocks are better to locate on high-performance storage, and it may cause no inconvenience when rarely accessed data blocks are located on low-performance storage. However, such location optimization in accordance with access patterns of data blocks makes the burden too heavy for system administrators.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962560","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
扫码关注我们
求助内容：
应助结果提醒方式：