Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2005. / Two leaves of folded plates inserted in pocket on p. [3] of cover. / Includes bibliographical references (p. 51-52). / Inter-enterprise communication of RFID event data requires rules and consistency. To create those rules and consistency one has to understand the requirements for the event architecture. I identified fifty-one stakeholders and thirty touch points in a textile supply chain from manufacturer in China to retail in The United States. Each of the stakeholders has different requirements for accuracy of the read data. After calculating a rough estimate of data quantity, I reduced data by setting some standards for aggregation and creating a mathematical model for inference and communication of read accuracy. I discovered that by dividing data requirements into two types, summarized event data and detailed exception data and business forms, I could meet all the stakeholders' needs. The solution was to implement a hybrid publish/subscribe architecture and service oriented architecture. / by Maximilian Greer Locher. / M.Eng.in Logistics
Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/33323 |
Date | January 2005 |
Creators | Locher, Maximilian Greer |
Contributors | David L. Brock., Massachusetts Institute of Technology. Engineering Systems Division., Massachusetts Institute of Technology. Engineering Systems Division. |
Publisher | Massachusetts Institute of Technology |
Source Sets | M.I.T. Theses and Dissertation |
Language | English |
Detected Language | English |
Type | Thesis |
Format | 52 p., [2] leaves of folded plates, 2325659 bytes, 2327735 bytes, application/pdf, application/pdf, application/pdf |
Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0017 seconds