Abstract: The fashion industry represents a significant portion of
the global gross domestic product, however, it is plagued by cheap
imitators that infringe on the trademarks which destroys the fashion
industry's hard work and investment. While eventually the copycats
would be found and stopped, the damage has already been done, sales
are missed and direct and indirect jobs are lost. The infringer thrives
on two main facts: the time it takes to discover them and the lack of
tracking technologies that can help the consumer distinguish them.
Blockchain technology is a new emerging technology that provides a
distributed encrypted immutable and fault resistant ledger. Blockchain
presents a ripe technology to resolve the infringement epidemic
facing the fashion industry. The significance of the study is that a
new approach leveraging the state of the art blockchain technology
coupled with artificial intelligence is used to create a framework
addressing the fashion infringement problem. It transforms the current
focus on legal enforcement, which is difficult at best, to consumer
awareness that is far more effective. The framework, Crypto CopyCat,
creates an immutable digital asset representing the actual product
to empower the customer with a near real time query system. This
combination emphasizes the consumer's awareness and appreciation
of the product's authenticity, while provides real time feedback to
the producer regarding the fake replicas. The main findings of this
study are that implementing this approach can delay the fake product
penetration of the original product market, thus allowing the original
product the time to take advantage of the market. The shift in the
fake adoption results in reduced returns, which impedes the copycat
market and moves the emphasis to the original product innovation.
Abstract: This paper proposes a cost-effective private grid using Object-based Grid Architecture (OGA). In OGA, the data process privacy and inter communication are increased through an object- oriented concept. The limitation of the existing grid is that the user can enter or leave the grid at any time without schedule and dedicated resource. To overcome these limitations, cost-effective private grid and appropriate algorithms are proposed. In this, each system contains two platforms such as grid and local platforms. The grid manager service running in local personal computer can act as grid resource. When the system is on, it is intimated to the Monitoring and Information System (MIS) and details are maintained in Resource Object Table (ROT). The MIS is responsible to select the resource where the file or the replica should be stored. The resource storage is done within virtual single private grid nodes using random object addressing to prevent stolen attack. If any grid resource goes down, then the resource ID will be removed from the ROT, and resource recovery is efficiently managed by the replicas. This random addressing technique makes the grid storage a single storage and the user views the entire grid network as a single system.
Abstract: Data Grid is a geographically distributed environment that deals with data intensive application in scientific and enterprise computing. Data replication is a common method used to achieve efficient and fault-tolerant data access in Grids. In this paper, a dynamic data replication strategy, called Enhanced Latest Access Largest Weight (ELALW) is proposed. This strategy is an enhanced version of Latest Access Largest Weight strategy. However, replication should be used wisely because the storage capacity of each Grid site is limited. Thus, it is important to design an effective strategy for the replication replacement task. ELALW replaces replicas based on the number of requests in future, the size of the replica, and the number of copies of the file. It also improves access latency by selecting the best replica when various sites hold replicas. The proposed replica selection selects the best replica location from among the many replicas based on response time that can be determined by considering the data transfer time, the storage access latency, the replica requests that waiting in the storage queue and the distance between nodes. Simulation results utilizing the OptorSim show our replication strategy achieve better performance overall than other strategies in terms of job execution time, effective network usage and storage resource usage.
Abstract: The current Hadoop block placement policy do not fairly and evenly distributes replicas of blocks written to datanodes in a Hadoop cluster.
This paper presents a new solution that helps to keep the cluster in a balanced state while an HDFS client is writing data to a file in Hadoop cluster. The solution had been implemented, and test had been conducted to evaluate its contribution to Hadoop distributed file system.
It has been found that, the solution has lowered global execution time taken by Hadoop balancer to 22 percent. It also has been found that, Hadoop balancer respectively over replicate 1.75 and 3.3 percent of all re-distributed blocks in the modified and original Hadoop clusters.
The feature that keeps the cluster in a balanced state works as a core part to Hadoop system and not just as a utility like traditional balancer. This is one of the significant achievements and uniqueness of the solution developed during the course of this research work.