In consumer products market, supply chain management (SCM) is a complex and significant issue in the governance of organizations, people with their activities, technology, information and resources involved in transferring a product or service from a supplier to a final customer. To this aim, radio-frequency identification (RFID) is a promising wireless technology allowing to link an object with its “virtual counterpart”, i.e., its representation within information systems. In this context, a SCM system has to face a huge amount of RFID data, generated in the tracking of supply chain resources. In particular when RFID installations become larger and more physically distributed, efficient and scalable analysis of such data becomes a concern. Currently, state of the art approaches provide hard-coded solutions where the processing of RFID data occurs in a central location; as the amount and distribution of data grow, the workload requires significant consumption of resources, and quickly outpaces the capacity of a centralized processing server. In this paper, we consider the problem of distributing the RFID processing workload—possibly huge—proposing the physical design of a scalable and distributed system. Such system is built on top of a general framework for SCM, based on the first principles of linear algebra, in particular, on tensorial calculus. We consider challenges in instantiating such a system in large distributed settings, and design techniques for distributed real time query processing. Experimental results, using large traces, demonstrate the efficiency and scalability of our proposal with respect to competing approaches.
De Virgilio, R., & Milicchio, F. (2016). Physical design for distributed RFID-based supply chain management. DISTRIBUTED AND PARALLEL DATABASES, 34(1), 3-32.
|Titolo:||Physical design for distributed RFID-based supply chain management|
|Data di pubblicazione:||2016|
|Citazione:||De Virgilio, R., & Milicchio, F. (2016). Physical design for distributed RFID-based supply chain management. DISTRIBUTED AND PARALLEL DATABASES, 34(1), 3-32.|
|Appare nelle tipologie:||1.1 Articolo in rivista|